| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > axlowdimlem11 | Structured version Visualization version GIF version | ||
| Description: Lemma for axlowdim 29348. 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 6889 | . 2 ⊢ (𝑄‘(𝐼 + 1)) = (({〈(𝐼 + 1), 1〉} ∪ (((1...𝑁) ∖ {(𝐼 + 1)}) × {0}))‘(𝐼 + 1)) |
| 3 | ovex 7456 | . . . 4 ⊢ (𝐼 + 1) ∈ V | |
| 4 | 1ex 11221 | . . . 4 ⊢ 1 ∈ V | |
| 5 | 3, 4 | fnsn 6601 | . . 3 ⊢ {〈(𝐼 + 1), 1〉} Fn {(𝐼 + 1)} |
| 6 | c0ex 11218 | . . . . 5 ⊢ 0 ∈ V | |
| 7 | 6 | fconst 6771 | . . . 4 ⊢ (((1...𝑁) ∖ {(𝐼 + 1)}) × {0}):((1...𝑁) ∖ {(𝐼 + 1)})⟶{0} |
| 8 | ffn 6712 | . . . 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 4436 | . . . 4 ⊢ ({(𝐼 + 1)} ∩ ((1...𝑁) ∖ {(𝐼 + 1)})) = ∅ | |
| 11 | 3 | snid 4633 | . . . 4 ⊢ (𝐼 + 1) ∈ {(𝐼 + 1)} |
| 12 | 10, 11 | pm3.2i 476 | . . 3 ⊢ (({(𝐼 + 1)} ∩ ((1...𝑁) ∖ {(𝐼 + 1)})) = ∅ ∧ (𝐼 + 1) ∈ {(𝐼 + 1)}) |
| 13 | fvun1 6979 | . . 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 1490 | . 2 ⊢ (({〈(𝐼 + 1), 1〉} ∪ (((1...𝑁) ∖ {(𝐼 + 1)}) × {0}))‘(𝐼 + 1)) = ({〈(𝐼 + 1), 1〉}‘(𝐼 + 1)) |
| 15 | 3, 4 | fvsn 7186 | . 2 ⊢ ({〈(𝐼 + 1), 1〉}‘(𝐼 + 1)) = 1 |
| 16 | 2, 14, 15 | 3eqtri 2793 | 1 ⊢ (𝑄‘(𝐼 + 1)) = 1 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ∧ wa 401 = wceq 1570 ∈ wcel 2146 ∖ cdif 3905 ∪ cun 3906 ∩ cin 3907 ∅c0 4289 {csn 4594 〈cop 4600 × cxp 5664 Fn wfn 6538 ⟶wf 6539 ‘cfv 6543 (class class class)co 7423 0cc0 11118 1c1 11119 + caddc 11121 ...cfz 13553 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2738 ax-sep 5262 ax-nul 5274 ax-pr 5409 ax-1cn 11176 ax-icn 11177 ax-addcl 11178 ax-mulcl 11180 ax-i2m1 11186 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2841 df-nfc 2915 df-ne 2962 df-ral 3083 df-rex 3093 df-rab 3420 df-v 3460 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-nul 4290 df-if 4493 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-br 5115 df-opab 5179 df-mpt 5198 df-id 5561 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 df-iota 6499 df-fun 6545 df-fn 6546 df-f 6547 df-fv 6551 df-ov 7426 |
| This theorem is used by: axlowdimlem14 29342 axlowdimlem16 29344 |
| Copyright terms: Public domain | W3C validator |