| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > axlowdimlem7 | Structured version Visualization version GIF version | ||
| Description: Lemma for axlowdim 29544. Set up a point in Euclidean space. (Contributed by Scott Fenton, 29-Jun-2013.) |
| Ref | Expression |
|---|---|
| axlowdimlem7.1 | ⊢ 𝑃 = ({〈3, -1〉} ∪ (((1...𝑁) ∖ {3}) × {0})) |
| Ref | Expression |
|---|---|
| axlowdimlem7 | ⊢ (𝑁 ∈ (ℤ≥‘3) → 𝑃 ∈ (𝔼‘𝑁)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | axlowdimlem7.1 | . 2 ⊢ 𝑃 = ({〈3, -1〉} ∪ (((1...𝑁) ∖ {3}) × {0})) | |
| 2 | eqid 2760 | . . . . . . . 8 ⊢ {〈3, -1〉} = {〈3, -1〉} | |
| 3 | 3ex 12428 | . . . . . . . . 9 ⊢ 3 ∈ V | |
| 4 | negex 11558 | . . . . . . . . 9 ⊢ -1 ∈ V | |
| 5 | 3, 4 | fsn 7136 | . . . . . . . 8 ⊢ ({〈3, -1〉}:{3}⟶{ -1} ↔ {〈3, -1〉} = {〈3, -1〉}) |
| 6 | 2, 5 | mpbir 234 | . . . . . . 7 ⊢ {〈3, -1〉}:{3}⟶{ -1} |
| 7 | neg1rr 12309 | . . . . . . . 8 ⊢ -1 ∈ ℝ | |
| 8 | snssi 4742 | . . . . . . . 8 ⊢ ( -1 ∈ ℝ → { -1} ⊆ ℝ) | |
| 9 | 7, 8 | ax-mp 5 | . . . . . . 7 ⊢ { -1} ⊆ ℝ |
| 10 | fss 6726 | . . . . . . 7 ⊢ (({〈3, -1〉}:{3}⟶{ -1} ∧ { -1} ⊆ ℝ) → {〈3, -1〉}:{3}⟶ℝ) | |
| 11 | 6, 9, 10 | mp2an 705 | . . . . . 6 ⊢ {〈3, -1〉}:{3}⟶ℝ |
| 12 | 0re 11313 | . . . . . . 7 ⊢ 0 ∈ ℝ | |
| 13 | 12 | fconst6 6772 | . . . . . 6 ⊢ (((1...𝑁) ∖ {3}) × {0}):((1...𝑁) ∖ {3})⟶ℝ |
| 14 | 11, 13 | pm3.2i 476 | . . . . 5 ⊢ ({〈3, -1〉}:{3}⟶ℝ ∧ (((1...𝑁) ∖ {3}) × {0}):((1...𝑁) ∖ {3})⟶ℝ) |
| 15 | disjdif 4425 | . . . . 5 ⊢ ({3} ∩ ((1...𝑁) ∖ {3})) = ∅ | |
| 16 | fun2 6745 | . . . . 5 ⊢ ((({〈3, -1〉}:{3}⟶ℝ ∧ (((1...𝑁) ∖ {3}) × {0}):((1...𝑁) ∖ {3})⟶ℝ) ∧ ({3} ∩ ((1...𝑁) ∖ {3})) = ∅) → ({〈3, -1〉} ∪ (((1...𝑁) ∖ {3}) × {0})):({3} ∪ ((1...𝑁) ∖ {3}))⟶ℝ) | |
| 17 | 14, 15, 16 | mp2an 705 | . . . 4 ⊢ ({〈3, -1〉} ∪ (((1...𝑁) ∖ {3}) × {0})):({3} ∪ ((1...𝑁) ∖ {3}))⟶ℝ |
| 18 | eluzle 12981 | . . . . . . . . 9 ⊢ (𝑁 ∈ (ℤ≥‘3) → 3 ≤ 𝑁) | |
| 19 | 1le3 12560 | . . . . . . . . 9 ⊢ 1 ≤ 3 | |
| 20 | 18, 19 | jctil 529 | . . . . . . . 8 ⊢ (𝑁 ∈ (ℤ≥‘3) → (1 ≤ 3 ∧ 3 ≤ 𝑁)) |
| 21 | 3z 12732 | . . . . . . . . 9 ⊢ 3 ∈ ℤ | |
| 22 | 1z 12729 | . . . . . . . . 9 ⊢ 1 ∈ ℤ | |
| 23 | eluzelz 12978 | . . . . . . . . 9 ⊢ (𝑁 ∈ (ℤ≥‘3) → 𝑁 ∈ ℤ) | |
| 24 | elfz 13648 | . . . . . . . . 9 ⊢ ((3 ∈ ℤ ∧ 1 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (3 ∈ (1...𝑁) ↔ (1 ≤ 3 ∧ 3 ≤ 𝑁))) | |
| 25 | 21, 22, 23, 24 | mp3an12i 1494 | . . . . . . . 8 ⊢ (𝑁 ∈ (ℤ≥‘3) → (3 ∈ (1...𝑁) ↔ (1 ≤ 3 ∧ 3 ≤ 𝑁))) |
| 26 | 20, 25 | mpbird 260 | . . . . . . 7 ⊢ (𝑁 ∈ (ℤ≥‘3) → 3 ∈ (1...𝑁)) |
| 27 | 26 | snssd 4743 | . . . . . 6 ⊢ (𝑁 ∈ (ℤ≥‘3) → {3} ⊆ (1...𝑁)) |
| 28 | undif 4437 | . . . . . 6 ⊢ ({3} ⊆ (1...𝑁) ↔ ({3} ∪ ((1...𝑁) ∖ {3})) = (1...𝑁)) | |
| 29 | 27, 28 | sylib 221 | . . . . 5 ⊢ (𝑁 ∈ (ℤ≥‘3) → ({3} ∪ ((1...𝑁) ∖ {3})) = (1...𝑁)) |
| 30 | 29 | feq2d 6693 | . . . 4 ⊢ (𝑁 ∈ (ℤ≥‘3) → (({〈3, -1〉} ∪ (((1...𝑁) ∖ {3}) × {0})):({3} ∪ ((1...𝑁) ∖ {3}))⟶ℝ ↔ ({〈3, -1〉} ∪ (((1...𝑁) ∖ {3}) × {0})):(1...𝑁)⟶ℝ)) |
| 31 | 17, 30 | mpbii 236 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘3) → ({〈3, -1〉} ∪ (((1...𝑁) ∖ {3}) × {0})):(1...𝑁)⟶ℝ) |
| 32 | eluz3nn 13019 | . . . 4 ⊢ (𝑁 ∈ (ℤ≥‘3) → 𝑁 ∈ ℕ) | |
| 33 | elee 29476 | . . . 4 ⊢ (𝑁 ∈ ℕ → (({〈3, -1〉} ∪ (((1...𝑁) ∖ {3}) × {0})) ∈ (𝔼‘𝑁) ↔ ({〈3, -1〉} ∪ (((1...𝑁) ∖ {3}) × {0})):(1...𝑁)⟶ℝ)) | |
| 34 | 32, 33 | syl 18 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘3) → (({〈3, -1〉} ∪ (((1...𝑁) ∖ {3}) × {0})) ∈ (𝔼‘𝑁) ↔ ({〈3, -1〉} ∪ (((1...𝑁) ∖ {3}) × {0})):(1...𝑁)⟶ℝ)) |
| 35 | 31, 34 | mpbird 260 | . 2 ⊢ (𝑁 ∈ (ℤ≥‘3) → ({〈3, -1〉} ∪ (((1...𝑁) ∖ {3}) × {0})) ∈ (𝔼‘𝑁)) |
| 36 | 1, 35 | eqeltrid 2864 | 1 ⊢ (𝑁 ∈ (ℤ≥‘3) → 𝑃 ∈ (𝔼‘𝑁)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1569 ∈ wcel 2144 ⊆ wss 3895 ∖ cdif 4045 ∩ cin 4089 ∪ cun 4149 ∅c0 4278 {csn 4584 〈cop 4834 class class class wbr 5102 × cxp 5648 ⟶wf 6534 ‘cfv 6538 (class class class)co 7420 ℝcr 11202 0cc0 11203 1c1 11204 ≤ cle 11347 -cneg 11545 ℕcn 12338 3c3 12401 ℤcz 12696 ℤ≥cuz 12968 ...cfz 13642 𝔼cee 29470 |
| 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-pow 5326 ax-pr 5390 ax-un 7751 ax-cnex 11259 ax-resscn 11260 ax-1cn 11261 ax-icn 11262 ax-addcl 11263 ax-addrcl 11264 ax-mulcl 11265 ax-mulrcl 11266 ax-mulcom 11267 ax-addass 11268 ax-mulass 11269 ax-distr 11270 ax-i2m1 11271 ax-1ne0 11272 ax-1rid 11273 ax-rnegex 11274 ax-rrecex 11275 ax-cnre 11276 ax-pre-lttri 11277 ax-pre-lttrn 11278 ax-pre-ltadd 11279 ax-pre-mulgt0 11280 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 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-nel 3062 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-we 5605 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-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7878 df-2nd 8002 df-frecs 8302 df-wrecs 8333 df-recs 8382 df-rdg 8421 df-er 8720 df-map 8852 df-en 8977 df-dom 8978 df-sdom 8979 df-pnf 11348 df-mnf 11349 df-xr 11350 df-ltxr 11351 df-le 11352 df-sub 11546 df-neg 11547 df-nn 12339 df-2 12408 df-3 12409 df-z 12697 df-uz 12969 df-fz 13643 df-ee 29473 |
| This theorem is used by: axlowdimlem15 29539 axlowdimlem16 29540 axlowdimlem17 29541 |
| Copyright terms: Public domain | W3C validator |