| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > axlowdimlem10 | Structured version Visualization version GIF version | ||
| Description: Lemma for axlowdim 29544. Set up a family of points in Euclidean space. (Contributed by Scott Fenton, 21-Apr-2013.) |
| Ref | Expression |
|---|---|
| axlowdimlem10.1 | ⊢ 𝑄 = ({〈(𝐼 + 1), 1〉} ∪ (((1...𝑁) ∖ {(𝐼 + 1)}) × {0})) |
| Ref | Expression |
|---|---|
| axlowdimlem10 | ⊢ ((𝑁 ∈ ℕ ∧ 𝐼 ∈ (1...(𝑁 − 1))) → 𝑄 ∈ (𝔼‘𝑁)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ovex 7453 | . . . . . . . . 9 ⊢ (𝐼 + 1) ∈ V | |
| 2 | 1ex 11306 | . . . . . . . . 9 ⊢ 1 ∈ V | |
| 3 | 1, 2 | f1osn 6866 | . . . . . . . 8 ⊢ {〈(𝐼 + 1), 1〉}:{(𝐼 + 1)}–1-1-onto→{1} |
| 4 | f1of 6824 | . . . . . . . 8 ⊢ ({〈(𝐼 + 1), 1〉}:{(𝐼 + 1)}–1-1-onto→{1} → {〈(𝐼 + 1), 1〉}:{(𝐼 + 1)}⟶{1}) | |
| 5 | 3, 4 | ax-mp 5 | . . . . . . 7 ⊢ {〈(𝐼 + 1), 1〉}:{(𝐼 + 1)}⟶{1} |
| 6 | c0ex 11303 | . . . . . . . 8 ⊢ 0 ∈ V | |
| 7 | 6 | fconst 6768 | . . . . . . 7 ⊢ (((1...𝑁) ∖ {(𝐼 + 1)}) × {0}):((1...𝑁) ∖ {(𝐼 + 1)})⟶{0} |
| 8 | 5, 7 | pm3.2i 476 | . . . . . 6 ⊢ ({〈(𝐼 + 1), 1〉}:{(𝐼 + 1)}⟶{1} ∧ (((1...𝑁) ∖ {(𝐼 + 1)}) × {0}):((1...𝑁) ∖ {(𝐼 + 1)})⟶{0}) |
| 9 | disjdif 4425 | . . . . . 6 ⊢ ({(𝐼 + 1)} ∩ ((1...𝑁) ∖ {(𝐼 + 1)})) = ∅ | |
| 10 | fun 6744 | . . . . . 6 ⊢ ((({〈(𝐼 + 1), 1〉}:{(𝐼 + 1)}⟶{1} ∧ (((1...𝑁) ∖ {(𝐼 + 1)}) × {0}):((1...𝑁) ∖ {(𝐼 + 1)})⟶{0}) ∧ ({(𝐼 + 1)} ∩ ((1...𝑁) ∖ {(𝐼 + 1)})) = ∅) → ({〈(𝐼 + 1), 1〉} ∪ (((1...𝑁) ∖ {(𝐼 + 1)}) × {0})):({(𝐼 + 1)} ∪ ((1...𝑁) ∖ {(𝐼 + 1)}))⟶({1} ∪ {0})) | |
| 11 | 8, 9, 10 | mp2an 705 | . . . . 5 ⊢ ({〈(𝐼 + 1), 1〉} ∪ (((1...𝑁) ∖ {(𝐼 + 1)}) × {0})):({(𝐼 + 1)} ∪ ((1...𝑁) ∖ {(𝐼 + 1)}))⟶({1} ∪ {0}) |
| 12 | axlowdimlem10.1 | . . . . . 6 ⊢ 𝑄 = ({〈(𝐼 + 1), 1〉} ∪ (((1...𝑁) ∖ {(𝐼 + 1)}) × {0})) | |
| 13 | 12 | feq1i 6700 | . . . . 5 ⊢ (𝑄:({(𝐼 + 1)} ∪ ((1...𝑁) ∖ {(𝐼 + 1)}))⟶({1} ∪ {0}) ↔ ({〈(𝐼 + 1), 1〉} ∪ (((1...𝑁) ∖ {(𝐼 + 1)}) × {0})):({(𝐼 + 1)} ∪ ((1...𝑁) ∖ {(𝐼 + 1)}))⟶({1} ∪ {0})) |
| 14 | 11, 13 | mpbir 234 | . . . 4 ⊢ 𝑄:({(𝐼 + 1)} ∪ ((1...𝑁) ∖ {(𝐼 + 1)}))⟶({1} ∪ {0}) |
| 15 | 1re 11311 | . . . . . 6 ⊢ 1 ∈ ℝ | |
| 16 | snssi 4742 | . . . . . 6 ⊢ (1 ∈ ℝ → {1} ⊆ ℝ) | |
| 17 | 15, 16 | ax-mp 5 | . . . . 5 ⊢ {1} ⊆ ℝ |
| 18 | 0re 11313 | . . . . . 6 ⊢ 0 ∈ ℝ | |
| 19 | snssi 4742 | . . . . . 6 ⊢ (0 ∈ ℝ → {0} ⊆ ℝ) | |
| 20 | 18, 19 | ax-mp 5 | . . . . 5 ⊢ {0} ⊆ ℝ |
| 21 | 17, 20 | unssi 4189 | . . . 4 ⊢ ({1} ∪ {0}) ⊆ ℝ |
| 22 | fss 6726 | . . . 4 ⊢ ((𝑄:({(𝐼 + 1)} ∪ ((1...𝑁) ∖ {(𝐼 + 1)}))⟶({1} ∪ {0}) ∧ ({1} ∪ {0}) ⊆ ℝ) → 𝑄:({(𝐼 + 1)} ∪ ((1...𝑁) ∖ {(𝐼 + 1)}))⟶ℝ) | |
| 23 | 14, 21, 22 | mp2an 705 | . . 3 ⊢ 𝑄:({(𝐼 + 1)} ∪ ((1...𝑁) ∖ {(𝐼 + 1)}))⟶ℝ |
| 24 | fznatpl1 13715 | . . . . . 6 ⊢ ((𝑁 ∈ ℕ ∧ 𝐼 ∈ (1...(𝑁 − 1))) → (𝐼 + 1) ∈ (1...𝑁)) | |
| 25 | 24 | snssd 4743 | . . . . 5 ⊢ ((𝑁 ∈ ℕ ∧ 𝐼 ∈ (1...(𝑁 − 1))) → {(𝐼 + 1)} ⊆ (1...𝑁)) |
| 26 | undif 4437 | . . . . 5 ⊢ ({(𝐼 + 1)} ⊆ (1...𝑁) ↔ ({(𝐼 + 1)} ∪ ((1...𝑁) ∖ {(𝐼 + 1)})) = (1...𝑁)) | |
| 27 | 25, 26 | sylib 221 | . . . 4 ⊢ ((𝑁 ∈ ℕ ∧ 𝐼 ∈ (1...(𝑁 − 1))) → ({(𝐼 + 1)} ∪ ((1...𝑁) ∖ {(𝐼 + 1)})) = (1...𝑁)) |
| 28 | 27 | feq2d 6693 | . . 3 ⊢ ((𝑁 ∈ ℕ ∧ 𝐼 ∈ (1...(𝑁 − 1))) → (𝑄:({(𝐼 + 1)} ∪ ((1...𝑁) ∖ {(𝐼 + 1)}))⟶ℝ ↔ 𝑄:(1...𝑁)⟶ℝ)) |
| 29 | 23, 28 | mpbii 236 | . 2 ⊢ ((𝑁 ∈ ℕ ∧ 𝐼 ∈ (1...(𝑁 − 1))) → 𝑄:(1...𝑁)⟶ℝ) |
| 30 | elee 29476 | . . 3 ⊢ (𝑁 ∈ ℕ → (𝑄 ∈ (𝔼‘𝑁) ↔ 𝑄:(1...𝑁)⟶ℝ)) | |
| 31 | 30 | adantr 486 | . 2 ⊢ ((𝑁 ∈ ℕ ∧ 𝐼 ∈ (1...(𝑁 − 1))) → (𝑄 ∈ (𝔼‘𝑁) ↔ 𝑄:(1...𝑁)⟶ℝ)) |
| 32 | 29, 31 | mpbird 260 | 1 ⊢ ((𝑁 ∈ ℕ ∧ 𝐼 ∈ (1...(𝑁 − 1))) → 𝑄 ∈ (𝔼‘𝑁)) |
| 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 × cxp 5648 ⟶wf 6534 –1-1-onto→wf1o 6537 ‘cfv 6538 (class class class)co 7420 ℝcr 11202 0cc0 11203 1c1 11204 + caddc 11206 − cmin 11544 ℕcn 12338 ...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-1st 8001 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-n0 12610 df-z 12697 df-uz 12969 df-fz 13643 df-ee 29473 |
| This theorem is used by: axlowdimlem14 29538 axlowdimlem15 29539 axlowdimlem16 29540 axlowdimlem17 29541 |
| Copyright terms: Public domain | W3C validator |