| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > axlowdimlem7 | Structured version Visualization version GIF version | ||
| Description: Lemma for axlowdim 29569. 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 2763 | . . . . . . . 8 ⊢ {〈3, -1〉} = {〈3, -1〉} | |
| 3 | 3ex 12452 | . . . . . . . . 9 ⊢ 3 ∈ V | |
| 4 | negex 11582 | . . . . . . . . 9 ⊢ -1 ∈ V | |
| 5 | 3, 4 | fsn 7160 | . . . . . . . 8 ⊢ ({〈3, -1〉}:{3}⟶{ -1} ↔ {〈3, -1〉} = {〈3, -1〉}) |
| 6 | 2, 5 | mpbir 234 | . . . . . . 7 ⊢ {〈3, -1〉}:{3}⟶{ -1} |
| 7 | neg1rr 12333 | . . . . . . . 8 ⊢ -1 ∈ ℝ | |
| 8 | snssi 4746 | . . . . . . . 8 ⊢ ( -1 ∈ ℝ → { -1} ⊆ ℝ) | |
| 9 | 7, 8 | ax-mp 5 | . . . . . . 7 ⊢ { -1} ⊆ ℝ |
| 10 | fss 6748 | . . . . . . 7 ⊢ (({〈3, -1〉}:{3}⟶{ -1} ∧ { -1} ⊆ ℝ) → {〈3, -1〉}:{3}⟶ℝ) | |
| 11 | 6, 9, 10 | mp2an 705 | . . . . . 6 ⊢ {〈3, -1〉}:{3}⟶ℝ |
| 12 | 0re 11337 | . . . . . . 7 ⊢ 0 ∈ ℝ | |
| 13 | 12 | fconst6 6794 | . . . . . 6 ⊢ (((1...𝑁) ∖ {3}) × {0}):((1...𝑁) ∖ {3})⟶ℝ |
| 14 | 11, 13 | pm3.2i 476 | . . . . 5 ⊢ ({〈3, -1〉}:{3}⟶ℝ ∧ (((1...𝑁) ∖ {3}) × {0}):((1...𝑁) ∖ {3})⟶ℝ) |
| 15 | disjdif 4429 | . . . . 5 ⊢ ({3} ∩ ((1...𝑁) ∖ {3})) = ∅ | |
| 16 | fun2 6767 | . . . . 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 13005 | . . . . . . . . 9 ⊢ (𝑁 ∈ (ℤ≥‘3) → 3 ≤ 𝑁) | |
| 19 | 1le3 12584 | . . . . . . . . 9 ⊢ 1 ≤ 3 | |
| 20 | 18, 19 | jctil 529 | . . . . . . . 8 ⊢ (𝑁 ∈ (ℤ≥‘3) → (1 ≤ 3 ∧ 3 ≤ 𝑁)) |
| 21 | 3z 12756 | . . . . . . . . 9 ⊢ 3 ∈ ℤ | |
| 22 | 1z 12753 | . . . . . . . . 9 ⊢ 1 ∈ ℤ | |
| 23 | eluzelz 13002 | . . . . . . . . 9 ⊢ (𝑁 ∈ (ℤ≥‘3) → 𝑁 ∈ ℤ) | |
| 24 | elfz 13672 | . . . . . . . . 9 ⊢ ((3 ∈ ℤ ∧ 1 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (3 ∈ (1...𝑁) ↔ (1 ≤ 3 ∧ 3 ≤ 𝑁))) | |
| 25 | 21, 22, 23, 24 | mp3an12i 1495 | . . . . . . . 8 ⊢ (𝑁 ∈ (ℤ≥‘3) → (3 ∈ (1...𝑁) ↔ (1 ≤ 3 ∧ 3 ≤ 𝑁))) |
| 26 | 20, 25 | mpbird 260 | . . . . . . 7 ⊢ (𝑁 ∈ (ℤ≥‘3) → 3 ∈ (1...𝑁)) |
| 27 | 26 | snssd 4747 | . . . . . 6 ⊢ (𝑁 ∈ (ℤ≥‘3) → {3} ⊆ (1...𝑁)) |
| 28 | undif 4441 | . . . . . 6 ⊢ ({3} ⊆ (1...𝑁) ↔ ({3} ∪ ((1...𝑁) ∖ {3})) = (1...𝑁)) | |
| 29 | 27, 28 | sylib 221 | . . . . 5 ⊢ (𝑁 ∈ (ℤ≥‘3) → ({3} ∪ ((1...𝑁) ∖ {3})) = (1...𝑁)) |
| 30 | 29 | feq2d 6715 | . . . 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 13043 | . . . 4 ⊢ (𝑁 ∈ (ℤ≥‘3) → 𝑁 ∈ ℕ) | |
| 33 | elee 29501 | . . . 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 2868 | 1 ⊢ (𝑁 ∈ (ℤ≥‘3) → 𝑃 ∈ (𝔼‘𝑁)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2147 ⊆ wss 3900 ∖ cdif 4048 ∩ cin 4092 ∪ cun 4152 ∅c0 4281 {csn 4588 〈cop 4838 class class class wbr 5106 × cxp 5653 ⟶wf 6554 ‘cfv 6558 (class class class)co 7443 ℝcr 11226 0cc0 11227 1c1 11228 ≤ cle 11371 -cneg 11569 ℕcn 12362 3c3 12425 ℤcz 12720 ℤ≥cuz 12992 ...cfz 13666 𝔼cee 29495 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7775 ax-cnex 11283 ax-resscn 11284 ax-1cn 11285 ax-icn 11286 ax-addcl 11287 ax-addrcl 11288 ax-mulcl 11289 ax-mulrcl 11290 ax-mulcom 11291 ax-addass 11292 ax-mulass 11293 ax-distr 11294 ax-i2m1 11295 ax-1ne0 11296 ax-1rid 11297 ax-rnegex 11298 ax-rrecex 11299 ax-cnre 11300 ax-pre-lttri 11301 ax-pre-lttrn 11302 ax-pre-ltadd 11303 ax-pre-mulgt0 11304 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-iun 4956 df-br 5107 df-opab 5171 df-mpt 5190 df-tr 5216 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6322 df-ord 6383 df-on 6384 df-lim 6385 df-suc 6386 df-iota 6512 df-fun 6560 df-fn 6561 df-f 6562 df-f1 6563 df-fo 6564 df-f1o 6565 df-fv 6566 df-riota 7400 df-ov 7446 df-oprab 7447 df-mpo 7448 df-om 7902 df-2nd 8026 df-frecs 8327 df-wrecs 8358 df-recs 8407 df-rdg 8446 df-er 8745 df-map 8877 df-en 9002 df-dom 9003 df-sdom 9004 df-pnf 11372 df-mnf 11373 df-xr 11374 df-ltxr 11375 df-le 11376 df-sub 11570 df-neg 11571 df-nn 12363 df-2 12432 df-3 12433 df-z 12721 df-uz 12993 df-fz 13667 df-ee 29498 |
| This theorem is used by: axlowdimlem15 29564 axlowdimlem16 29565 axlowdimlem17 29566 |
| Copyright terms: Public domain | W3C validator |