| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > axlowdimlem9 | Structured version Visualization version GIF version | ||
| Description: Lemma for axlowdim 29220. 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 6872 | . 2 ⊢ (𝑃‘𝐾) = (({〈3, -1〉} ∪ (((1...𝑁) ∖ {3}) × {0}))‘𝐾) |
| 3 | eldifsn 4749 | . . 3 ⊢ (𝐾 ∈ ((1...𝑁) ∖ {3}) ↔ (𝐾 ∈ (1...𝑁) ∧ 𝐾 ≠ 3)) | |
| 4 | disjdif 4429 | . . . . 5 ⊢ ({3} ∩ ((1...𝑁) ∖ {3})) = ∅ | |
| 5 | 3ex 12314 | . . . . . . 7 ⊢ 3 ∈ V | |
| 6 | negex 11443 | . . . . . . 7 ⊢ -1 ∈ V | |
| 7 | 5, 6 | fnsn 6583 | . . . . . 6 ⊢ {〈3, -1〉} Fn {3} |
| 8 | c0ex 11188 | . . . . . . . 8 ⊢ 0 ∈ V | |
| 9 | 8 | fconst 6754 | . . . . . . 7 ⊢ (((1...𝑁) ∖ {3}) × {0}):((1...𝑁) ∖ {3})⟶{0} |
| 10 | ffn 6695 | . . . . . . 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 6963 | . . . . . 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 1475 | . . . . 5 ⊢ ((({3} ∩ ((1...𝑁) ∖ {3})) = ∅ ∧ 𝐾 ∈ ((1...𝑁) ∖ {3})) → (({〈3, -1〉} ∪ (((1...𝑁) ∖ {3}) × {0}))‘𝐾) = ((((1...𝑁) ∖ {3}) × {0})‘𝐾)) |
| 14 | 4, 13 | mpan 702 | . . . 4 ⊢ (𝐾 ∈ ((1...𝑁) ∖ {3}) → (({〈3, -1〉} ∪ (((1...𝑁) ∖ {3}) × {0}))‘𝐾) = ((((1...𝑁) ∖ {3}) × {0})‘𝐾)) |
| 15 | 8 | fvconst2 7192 | . . . 4 ⊢ (𝐾 ∈ ((1...𝑁) ∖ {3}) → ((((1...𝑁) ∖ {3}) × {0})‘𝐾) = 0) |
| 16 | 14, 15 | eqtrd 2800 | . . 3 ⊢ (𝐾 ∈ ((1...𝑁) ∖ {3}) → (({〈3, -1〉} ∪ (((1...𝑁) ∖ {3}) × {0}))‘𝐾) = 0) |
| 17 | 3, 16 | sylbir 238 | . 2 ⊢ ((𝐾 ∈ (1...𝑁) ∧ 𝐾 ≠ 3) → (({〈3, -1〉} ∪ (((1...𝑁) ∖ {3}) × {0}))‘𝐾) = 0) |
| 18 | 2, 17 | eqtrid 2812 | 1 ⊢ ((𝐾 ∈ (1...𝑁) ∧ 𝐾 ≠ 3) → (𝑃‘𝐾) = 0) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1563 ∈ wcel 2145 ≠ wne 2960 ∖ cdif 3904 ∪ cun 3905 ∩ cin 3906 ∅c0 4288 {csn 4585 〈cop 4591 × cxp 5650 Fn wfn 6520 ⟶wf 6521 ‘cfv 6525 (class class class)co 7400 0cc0 11088 1c1 11089 -cneg 11430 3c3 12287 ...cfz 13526 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-sep 5251 ax-nul 5261 ax-pr 5395 ax-1cn 11146 ax-icn 11147 ax-addcl 11148 ax-mulcl 11150 ax-i2m1 11156 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3080 df-rex 3090 df-rab 3418 df-v 3459 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-nul 4289 df-if 4484 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4869 df-br 5106 df-opab 5168 df-mpt 5187 df-id 5547 df-xp 5658 df-rel 5659 df-cnv 5660 df-co 5661 df-dm 5662 df-rn 5663 df-res 5664 df-ima 5665 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-fv 6533 df-ov 7403 df-neg 11432 df-2 12294 df-3 12295 |
| This theorem is referenced by: axlowdimlem16 29216 axlowdimlem17 29217 |
| Copyright terms: Public domain | W3C validator |