![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > axlowdimlem9 | Structured version Visualization version GIF version |
Description: Lemma for axlowdim 26465. 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 6505 | . 2 ⊢ (𝑃‘𝐾) = (({〈3, -1〉} ∪ (((1...𝑁) ∖ {3}) × {0}))‘𝐾) |
3 | eldifsn 4598 | . . 3 ⊢ (𝐾 ∈ ((1...𝑁) ∖ {3}) ↔ (𝐾 ∈ (1...𝑁) ∧ 𝐾 ≠ 3)) | |
4 | disjdif 4307 | . . . . 5 ⊢ ({3} ∩ ((1...𝑁) ∖ {3})) = ∅ | |
5 | 3ex 11529 | . . . . . . 7 ⊢ 3 ∈ V | |
6 | negex 10690 | . . . . . . 7 ⊢ -1 ∈ V | |
7 | 5, 6 | fnsn 6250 | . . . . . 6 ⊢ {〈3, -1〉} Fn {3} |
8 | c0ex 10439 | . . . . . . . 8 ⊢ 0 ∈ V | |
9 | 8 | fconst 6399 | . . . . . . 7 ⊢ (((1...𝑁) ∖ {3}) × {0}):((1...𝑁) ∖ {3})⟶{0} |
10 | ffn 6349 | . . . . . . 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 6589 | . . . . . 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 1431 | . . . . 5 ⊢ ((({3} ∩ ((1...𝑁) ∖ {3})) = ∅ ∧ 𝐾 ∈ ((1...𝑁) ∖ {3})) → (({〈3, -1〉} ∪ (((1...𝑁) ∖ {3}) × {0}))‘𝐾) = ((((1...𝑁) ∖ {3}) × {0})‘𝐾)) |
14 | 4, 13 | mpan 678 | . . . 4 ⊢ (𝐾 ∈ ((1...𝑁) ∖ {3}) → (({〈3, -1〉} ∪ (((1...𝑁) ∖ {3}) × {0}))‘𝐾) = ((((1...𝑁) ∖ {3}) × {0})‘𝐾)) |
15 | 8 | fvconst2 6799 | . . . 4 ⊢ (𝐾 ∈ ((1...𝑁) ∖ {3}) → ((((1...𝑁) ∖ {3}) × {0})‘𝐾) = 0) |
16 | 14, 15 | eqtrd 2816 | . . 3 ⊢ (𝐾 ∈ ((1...𝑁) ∖ {3}) → (({〈3, -1〉} ∪ (((1...𝑁) ∖ {3}) × {0}))‘𝐾) = 0) |
17 | 3, 16 | sylbir 227 | . 2 ⊢ ((𝐾 ∈ (1...𝑁) ∧ 𝐾 ≠ 3) → (({〈3, -1〉} ∪ (((1...𝑁) ∖ {3}) × {0}))‘𝐾) = 0) |
18 | 2, 17 | syl5eq 2828 | 1 ⊢ ((𝐾 ∈ (1...𝑁) ∧ 𝐾 ≠ 3) → (𝑃‘𝐾) = 0) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 387 = wceq 1508 ∈ wcel 2051 ≠ wne 2969 ∖ cdif 3828 ∪ cun 3829 ∩ cin 3830 ∅c0 4181 {csn 4444 〈cop 4450 × cxp 5409 Fn wfn 6188 ⟶wf 6189 ‘cfv 6193 (class class class)co 6982 0cc0 10341 1c1 10342 -cneg 10677 3c3 11502 ...cfz 12714 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1759 ax-4 1773 ax-5 1870 ax-6 1929 ax-7 1966 ax-8 2053 ax-9 2060 ax-10 2080 ax-11 2094 ax-12 2107 ax-13 2302 ax-ext 2752 ax-sep 5064 ax-nul 5071 ax-pow 5123 ax-pr 5190 ax-1cn 10399 ax-icn 10400 ax-addcl 10401 ax-mulcl 10403 ax-i2m1 10409 |
This theorem depends on definitions: df-bi 199 df-an 388 df-or 835 df-3an 1071 df-tru 1511 df-ex 1744 df-nf 1748 df-sb 2017 df-mo 2551 df-eu 2589 df-clab 2761 df-cleq 2773 df-clel 2848 df-nfc 2920 df-ne 2970 df-ral 3095 df-rex 3096 df-rab 3099 df-v 3419 df-sbc 3684 df-dif 3834 df-un 3836 df-in 3838 df-ss 3845 df-nul 4182 df-if 4354 df-sn 4445 df-pr 4447 df-op 4451 df-uni 4718 df-br 4935 df-opab 4997 df-mpt 5014 df-id 5316 df-xp 5417 df-rel 5418 df-cnv 5419 df-co 5420 df-dm 5421 df-rn 5422 df-res 5423 df-ima 5424 df-iota 6157 df-fun 6195 df-fn 6196 df-f 6197 df-fv 6201 df-ov 6985 df-neg 10679 df-2 11509 df-3 11510 |
This theorem is referenced by: axlowdimlem16 26461 axlowdimlem17 26462 |
Copyright terms: Public domain | W3C validator |