Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > axlowdimlem11 | Structured version Visualization version GIF version |
Description: Lemma for axlowdim 25641. Calculate the value of 𝑄 at its distinguished point. (Contributed by Scott Fenton, 21-Apr-2013.) |
Ref | Expression |
---|---|
axlowdimlem10.1 | ⊢ 𝑄 = ({〈(𝐼 + 1), 1〉} ∪ (((1...𝑁) ∖ {(𝐼 + 1)}) × {0})) |
Ref | Expression |
---|---|
axlowdimlem11 | ⊢ (𝑄‘(𝐼 + 1)) = 1 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | axlowdimlem10.1 | . . 3 ⊢ 𝑄 = ({〈(𝐼 + 1), 1〉} ∪ (((1...𝑁) ∖ {(𝐼 + 1)}) × {0})) | |
2 | 1 | fveq1i 6104 | . 2 ⊢ (𝑄‘(𝐼 + 1)) = (({〈(𝐼 + 1), 1〉} ∪ (((1...𝑁) ∖ {(𝐼 + 1)}) × {0}))‘(𝐼 + 1)) |
3 | ovex 6577 | . . . 4 ⊢ (𝐼 + 1) ∈ V | |
4 | 1ex 9914 | . . . 4 ⊢ 1 ∈ V | |
5 | 3, 4 | fnsn 5860 | . . 3 ⊢ {〈(𝐼 + 1), 1〉} Fn {(𝐼 + 1)} |
6 | c0ex 9913 | . . . . 5 ⊢ 0 ∈ V | |
7 | 6 | fconst 6004 | . . . 4 ⊢ (((1...𝑁) ∖ {(𝐼 + 1)}) × {0}):((1...𝑁) ∖ {(𝐼 + 1)})⟶{0} |
8 | ffn 5958 | . . . 4 ⊢ ((((1...𝑁) ∖ {(𝐼 + 1)}) × {0}):((1...𝑁) ∖ {(𝐼 + 1)})⟶{0} → (((1...𝑁) ∖ {(𝐼 + 1)}) × {0}) Fn ((1...𝑁) ∖ {(𝐼 + 1)})) | |
9 | 7, 8 | ax-mp 5 | . . 3 ⊢ (((1...𝑁) ∖ {(𝐼 + 1)}) × {0}) Fn ((1...𝑁) ∖ {(𝐼 + 1)}) |
10 | disjdif 3992 | . . . 4 ⊢ ({(𝐼 + 1)} ∩ ((1...𝑁) ∖ {(𝐼 + 1)})) = ∅ | |
11 | 3 | snid 4155 | . . . 4 ⊢ (𝐼 + 1) ∈ {(𝐼 + 1)} |
12 | 10, 11 | pm3.2i 470 | . . 3 ⊢ (({(𝐼 + 1)} ∩ ((1...𝑁) ∖ {(𝐼 + 1)})) = ∅ ∧ (𝐼 + 1) ∈ {(𝐼 + 1)}) |
13 | fvun1 6179 | . . 3 ⊢ (({〈(𝐼 + 1), 1〉} Fn {(𝐼 + 1)} ∧ (((1...𝑁) ∖ {(𝐼 + 1)}) × {0}) Fn ((1...𝑁) ∖ {(𝐼 + 1)}) ∧ (({(𝐼 + 1)} ∩ ((1...𝑁) ∖ {(𝐼 + 1)})) = ∅ ∧ (𝐼 + 1) ∈ {(𝐼 + 1)})) → (({〈(𝐼 + 1), 1〉} ∪ (((1...𝑁) ∖ {(𝐼 + 1)}) × {0}))‘(𝐼 + 1)) = ({〈(𝐼 + 1), 1〉}‘(𝐼 + 1))) | |
14 | 5, 9, 12, 13 | mp3an 1416 | . 2 ⊢ (({〈(𝐼 + 1), 1〉} ∪ (((1...𝑁) ∖ {(𝐼 + 1)}) × {0}))‘(𝐼 + 1)) = ({〈(𝐼 + 1), 1〉}‘(𝐼 + 1)) |
15 | 3, 4 | fvsn 6351 | . 2 ⊢ ({〈(𝐼 + 1), 1〉}‘(𝐼 + 1)) = 1 |
16 | 2, 14, 15 | 3eqtri 2636 | 1 ⊢ (𝑄‘(𝐼 + 1)) = 1 |
Colors of variables: wff setvar class |
Syntax hints: ∧ wa 383 = wceq 1475 ∈ wcel 1977 ∖ cdif 3537 ∪ cun 3538 ∩ cin 3539 ∅c0 3874 {csn 4125 〈cop 4131 × cxp 5036 Fn wfn 5799 ⟶wf 5800 ‘cfv 5804 (class class class)co 6549 0cc0 9815 1c1 9816 + caddc 9818 ...cfz 12197 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-1cn 9873 ax-icn 9874 ax-addcl 9875 ax-mulcl 9877 ax-i2m1 9883 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-ral 2901 df-rex 2902 df-rab 2905 df-v 3175 df-sbc 3403 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-nul 3875 df-if 4037 df-sn 4126 df-pr 4128 df-op 4132 df-uni 4373 df-br 4584 df-opab 4644 df-mpt 4645 df-id 4953 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-fv 5812 df-ov 6552 |
This theorem is referenced by: axlowdimlem14 25635 axlowdimlem16 25637 |
Copyright terms: Public domain | W3C validator |