| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > axlowdimlem9 | Structured version Visualization version GIF version | ||
| Description: Lemma for axlowdim 29044. Calculate the value of 𝑃 away from three. (Contributed by Scott Fenton, 21-Apr-2013.) |
| Ref | Expression |
|---|---|
| axlowdimlem7.1 | ⊢ 𝑃 = ({〈3, -1〉} ∪ (((1...𝑁) ∖ {3}) × {0})) |
| Ref | Expression |
|---|---|
| axlowdimlem9 | ⊢ ((𝐾 ∈ (1...𝑁) ∧ 𝐾 ≠ 3) → (𝑃‘𝐾) = 0) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | axlowdimlem7.1 | . . 3 ⊢ 𝑃 = ({〈3, -1〉} ∪ (((1...𝑁) ∖ {3}) × {0})) | |
| 2 | 1 | fveq1i 6835 | . 2 ⊢ (𝑃‘𝐾) = (({〈3, -1〉} ∪ (((1...𝑁) ∖ {3}) × {0}))‘𝐾) |
| 3 | eldifsn 4730 | . . 3 ⊢ (𝐾 ∈ ((1...𝑁) ∖ {3}) ↔ (𝐾 ∈ (1...𝑁) ∧ 𝐾 ≠ 3)) | |
| 4 | disjdif 4413 | . . . . 5 ⊢ ({3} ∩ ((1...𝑁) ∖ {3})) = ∅ | |
| 5 | 3ex 12254 | . . . . . . 7 ⊢ 3 ∈ V | |
| 6 | negex 11382 | . . . . . . 7 ⊢ -1 ∈ V | |
| 7 | 5, 6 | fnsn 6550 | . . . . . 6 ⊢ {〈3, -1〉} Fn {3} |
| 8 | c0ex 11129 | . . . . . . . 8 ⊢ 0 ∈ V | |
| 9 | 8 | fconst 6720 | . . . . . . 7 ⊢ (((1...𝑁) ∖ {3}) × {0}):((1...𝑁) ∖ {3})⟶{0} |
| 10 | ffn 6662 | . . . . . . 7 ⊢ ((((1...𝑁) ∖ {3}) × {0}):((1...𝑁) ∖ {3})⟶{0} → (((1...𝑁) ∖ {3}) × {0}) Fn ((1...𝑁) ∖ {3})) | |
| 11 | 9, 10 | ax-mp 5 | . . . . . 6 ⊢ (((1...𝑁) ∖ {3}) × {0}) Fn ((1...𝑁) ∖ {3}) |
| 12 | fvun2 6926 | . . . . . 6 ⊢ (({〈3, -1〉} Fn {3} ∧ (((1...𝑁) ∖ {3}) × {0}) Fn ((1...𝑁) ∖ {3}) ∧ (({3} ∩ ((1...𝑁) ∖ {3})) = ∅ ∧ 𝐾 ∈ ((1...𝑁) ∖ {3}))) → (({〈3, -1〉} ∪ (((1...𝑁) ∖ {3}) × {0}))‘𝐾) = ((((1...𝑁) ∖ {3}) × {0})‘𝐾)) | |
| 13 | 7, 11, 12 | mp3an12 1454 | . . . . 5 ⊢ ((({3} ∩ ((1...𝑁) ∖ {3})) = ∅ ∧ 𝐾 ∈ ((1...𝑁) ∖ {3})) → (({〈3, -1〉} ∪ (((1...𝑁) ∖ {3}) × {0}))‘𝐾) = ((((1...𝑁) ∖ {3}) × {0})‘𝐾)) |
| 14 | 4, 13 | mpan 691 | . . . 4 ⊢ (𝐾 ∈ ((1...𝑁) ∖ {3}) → (({〈3, -1〉} ∪ (((1...𝑁) ∖ {3}) × {0}))‘𝐾) = ((((1...𝑁) ∖ {3}) × {0})‘𝐾)) |
| 15 | 8 | fvconst2 7152 | . . . 4 ⊢ (𝐾 ∈ ((1...𝑁) ∖ {3}) → ((((1...𝑁) ∖ {3}) × {0})‘𝐾) = 0) |
| 16 | 14, 15 | eqtrd 2772 | . . 3 ⊢ (𝐾 ∈ ((1...𝑁) ∖ {3}) → (({〈3, -1〉} ∪ (((1...𝑁) ∖ {3}) × {0}))‘𝐾) = 0) |
| 17 | 3, 16 | sylbir 235 | . 2 ⊢ ((𝐾 ∈ (1...𝑁) ∧ 𝐾 ≠ 3) → (({〈3, -1〉} ∪ (((1...𝑁) ∖ {3}) × {0}))‘𝐾) = 0) |
| 18 | 2, 17 | eqtrid 2784 | 1 ⊢ ((𝐾 ∈ (1...𝑁) ∧ 𝐾 ≠ 3) → (𝑃‘𝐾) = 0) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ≠ wne 2933 ∖ cdif 3887 ∪ cun 3888 ∩ cin 3889 ∅c0 4274 {csn 4568 〈cop 4574 × cxp 5622 Fn wfn 6487 ⟶wf 6488 ‘cfv 6492 (class class class)co 7360 0cc0 11029 1c1 11030 -cneg 11369 3c3 12228 ...cfz 13452 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5231 ax-nul 5241 ax-pr 5370 ax-1cn 11087 ax-icn 11088 ax-addcl 11089 ax-mulcl 11091 ax-i2m1 11097 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-rab 3391 df-v 3432 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-br 5087 df-opab 5149 df-mpt 5168 df-id 5519 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-fv 6500 df-ov 7363 df-neg 11371 df-2 12235 df-3 12236 |
| This theorem is referenced by: axlowdimlem16 29040 axlowdimlem17 29041 |
| Copyright terms: Public domain | W3C validator |