| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > axlowdimlem11 | Structured version Visualization version GIF version | ||
| Description: Lemma for axlowdim 29544. 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 6886 | . 2 ⊢ (𝑄‘(𝐼 + 1)) = (({〈(𝐼 + 1), 1〉} ∪ (((1...𝑁) ∖ {(𝐼 + 1)}) × {0}))‘(𝐼 + 1)) |
| 3 | ovex 7453 | . . . 4 ⊢ (𝐼 + 1) ∈ V | |
| 4 | 1ex 11306 | . . . 4 ⊢ 1 ∈ V | |
| 5 | 3, 4 | fnsn 6598 | . . 3 ⊢ {〈(𝐼 + 1), 1〉} Fn {(𝐼 + 1)} |
| 6 | c0ex 11303 | . . . . 5 ⊢ 0 ∈ V | |
| 7 | 6 | fconst 6768 | . . . 4 ⊢ (((1...𝑁) ∖ {(𝐼 + 1)}) × {0}):((1...𝑁) ∖ {(𝐼 + 1)})⟶{0} |
| 8 | ffn 6709 | . . . 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 4425 | . . . 4 ⊢ ({(𝐼 + 1)} ∩ ((1...𝑁) ∖ {(𝐼 + 1)})) = ∅ | |
| 11 | 3 | snid 4619 | . . . 4 ⊢ (𝐼 + 1) ∈ {(𝐼 + 1)} |
| 12 | 10, 11 | pm3.2i 476 | . . 3 ⊢ (({(𝐼 + 1)} ∩ ((1...𝑁) ∖ {(𝐼 + 1)})) = ∅ ∧ (𝐼 + 1) ∈ {(𝐼 + 1)}) |
| 13 | fvun1 6976 | . . 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 2787 | 1 ⊢ (𝑄‘(𝐼 + 1)) = 1 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ∧ wa 401 = wceq 1569 ∈ wcel 2144 ∖ cdif 4045 ∩ cin 4089 ∪ cun 4149 ∅c0 4278 {csn 4584 〈cop 4834 × cxp 5648 Fn wfn 6533 ⟶wf 6534 ‘cfv 6538 (class class class)co 7420 0cc0 11203 1c1 11204 + caddc 11206 ...cfz 13642 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pr 5390 ax-1cn 11261 ax-icn 11262 ax-addcl 11263 ax-mulcl 11265 ax-i2m1 11271 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5545 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-fv 6546 df-ov 7423 |
| This theorem is used by: axlowdimlem14 29538 axlowdimlem16 29540 |
| Copyright terms: Public domain | W3C validator |