| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > axlowdimlem11 | Structured version Visualization version GIF version | ||
| Description: Lemma for axlowdim 29055. 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 6835 | . 2 ⊢ (𝑄‘(𝐼 + 1)) = (({〈(𝐼 + 1), 1〉} ∪ (((1...𝑁) ∖ {(𝐼 + 1)}) × {0}))‘(𝐼 + 1)) |
| 3 | ovex 7396 | . . . 4 ⊢ (𝐼 + 1) ∈ V | |
| 4 | 1ex 11138 | . . . 4 ⊢ 1 ∈ V | |
| 5 | 3, 4 | fnsn 6550 | . . 3 ⊢ {〈(𝐼 + 1), 1〉} Fn {(𝐼 + 1)} |
| 6 | c0ex 11136 | . . . . 5 ⊢ 0 ∈ V | |
| 7 | 6 | fconst 6720 | . . . 4 ⊢ (((1...𝑁) ∖ {(𝐼 + 1)}) × {0}):((1...𝑁) ∖ {(𝐼 + 1)})⟶{0} |
| 8 | ffn 6662 | . . . 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 4407 | . . . 4 ⊢ ({(𝐼 + 1)} ∩ ((1...𝑁) ∖ {(𝐼 + 1)})) = ∅ | |
| 11 | 3 | snid 4601 | . . . 4 ⊢ (𝐼 + 1) ∈ {(𝐼 + 1)} |
| 12 | 10, 11 | pm3.2i 471 | . . 3 ⊢ (({(𝐼 + 1)} ∩ ((1...𝑁) ∖ {(𝐼 + 1)})) = ∅ ∧ (𝐼 + 1) ∈ {(𝐼 + 1)}) |
| 13 | fvun1 6925 | . . 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 1469 | . 2 ⊢ (({〈(𝐼 + 1), 1〉} ∪ (((1...𝑁) ∖ {(𝐼 + 1)}) × {0}))‘(𝐼 + 1)) = ({〈(𝐼 + 1), 1〉}‘(𝐼 + 1)) |
| 15 | 3, 4 | fvsn 7132 | . 2 ⊢ ({〈(𝐼 + 1), 1〉}‘(𝐼 + 1)) = 1 |
| 16 | 2, 14, 15 | 3eqtri 2767 | 1 ⊢ (𝑄‘(𝐼 + 1)) = 1 |
| Colors of variables: wff setvar class |
| Syntax hints: ∧ wa 396 = wceq 1547 ∈ wcel 2119 ∖ cdif 3887 ∪ cun 3888 ∩ cin 3889 ∅c0 4268 {csn 4562 〈cop 4568 × cxp 5623 Fn wfn 6487 ⟶wf 6488 ‘cfv 6492 (class class class)co 7363 0cc0 11036 1c1 11037 + caddc 11039 ...cfz 13459 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2712 ax-sep 5225 ax-nul 5235 ax-pr 5369 ax-1cn 11094 ax-icn 11095 ax-addcl 11096 ax-mulcl 11098 ax-i2m1 11104 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2719 df-cleq 2732 df-clel 2815 df-nfc 2889 df-ne 2936 df-ral 3055 df-rex 3065 df-rab 3393 df-v 3434 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4269 df-if 4462 df-sn 4563 df-pr 4565 df-op 4569 df-uni 4846 df-br 5080 df-opab 5142 df-mpt 5161 df-id 5520 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-fv 6500 df-ov 7366 |
| This theorem is referenced by: axlowdimlem14 29049 axlowdimlem16 29051 |
| Copyright terms: Public domain | W3C validator |