Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > axlowdimlem10 | Structured version Visualization version GIF version |
Description: Lemma for axlowdim 26746. 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 7188 | . . . . . . . . 9 ⊢ (𝐼 + 1) ∈ V | |
2 | 1ex 10636 | . . . . . . . . 9 ⊢ 1 ∈ V | |
3 | 1, 2 | f1osn 6653 | . . . . . . . 8 ⊢ {〈(𝐼 + 1), 1〉}:{(𝐼 + 1)}–1-1-onto→{1} |
4 | f1of 6614 | . . . . . . . 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 10634 | . . . . . . . 8 ⊢ 0 ∈ V | |
7 | 6 | fconst 6564 | . . . . . . 7 ⊢ (((1...𝑁) ∖ {(𝐼 + 1)}) × {0}):((1...𝑁) ∖ {(𝐼 + 1)})⟶{0} |
8 | 5, 7 | pm3.2i 473 | . . . . . 6 ⊢ ({〈(𝐼 + 1), 1〉}:{(𝐼 + 1)}⟶{1} ∧ (((1...𝑁) ∖ {(𝐼 + 1)}) × {0}):((1...𝑁) ∖ {(𝐼 + 1)})⟶{0}) |
9 | disjdif 4420 | . . . . . 6 ⊢ ({(𝐼 + 1)} ∩ ((1...𝑁) ∖ {(𝐼 + 1)})) = ∅ | |
10 | fun 6539 | . . . . . 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 690 | . . . . 5 ⊢ ({〈(𝐼 + 1), 1〉} ∪ (((1...𝑁) ∖ {(𝐼 + 1)}) × {0})):({(𝐼 + 1)} ∪ ((1...𝑁) ∖ {(𝐼 + 1)}))⟶({1} ∪ {0}) |
12 | axlowdimlem10.1 | . . . . . 6 ⊢ 𝑄 = ({〈(𝐼 + 1), 1〉} ∪ (((1...𝑁) ∖ {(𝐼 + 1)}) × {0})) | |
13 | 12 | feq1i 6504 | . . . . 5 ⊢ (𝑄:({(𝐼 + 1)} ∪ ((1...𝑁) ∖ {(𝐼 + 1)}))⟶({1} ∪ {0}) ↔ ({〈(𝐼 + 1), 1〉} ∪ (((1...𝑁) ∖ {(𝐼 + 1)}) × {0})):({(𝐼 + 1)} ∪ ((1...𝑁) ∖ {(𝐼 + 1)}))⟶({1} ∪ {0})) |
14 | 11, 13 | mpbir 233 | . . . 4 ⊢ 𝑄:({(𝐼 + 1)} ∪ ((1...𝑁) ∖ {(𝐼 + 1)}))⟶({1} ∪ {0}) |
15 | 1re 10640 | . . . . . 6 ⊢ 1 ∈ ℝ | |
16 | snssi 4740 | . . . . . 6 ⊢ (1 ∈ ℝ → {1} ⊆ ℝ) | |
17 | 15, 16 | ax-mp 5 | . . . . 5 ⊢ {1} ⊆ ℝ |
18 | 0re 10642 | . . . . . 6 ⊢ 0 ∈ ℝ | |
19 | snssi 4740 | . . . . . 6 ⊢ (0 ∈ ℝ → {0} ⊆ ℝ) | |
20 | 18, 19 | ax-mp 5 | . . . . 5 ⊢ {0} ⊆ ℝ |
21 | 17, 20 | unssi 4160 | . . . 4 ⊢ ({1} ∪ {0}) ⊆ ℝ |
22 | fss 6526 | . . . 4 ⊢ ((𝑄:({(𝐼 + 1)} ∪ ((1...𝑁) ∖ {(𝐼 + 1)}))⟶({1} ∪ {0}) ∧ ({1} ∪ {0}) ⊆ ℝ) → 𝑄:({(𝐼 + 1)} ∪ ((1...𝑁) ∖ {(𝐼 + 1)}))⟶ℝ) | |
23 | 14, 21, 22 | mp2an 690 | . . 3 ⊢ 𝑄:({(𝐼 + 1)} ∪ ((1...𝑁) ∖ {(𝐼 + 1)}))⟶ℝ |
24 | fznatpl1 12960 | . . . . . 6 ⊢ ((𝑁 ∈ ℕ ∧ 𝐼 ∈ (1...(𝑁 − 1))) → (𝐼 + 1) ∈ (1...𝑁)) | |
25 | 24 | snssd 4741 | . . . . 5 ⊢ ((𝑁 ∈ ℕ ∧ 𝐼 ∈ (1...(𝑁 − 1))) → {(𝐼 + 1)} ⊆ (1...𝑁)) |
26 | undif 4429 | . . . . 5 ⊢ ({(𝐼 + 1)} ⊆ (1...𝑁) ↔ ({(𝐼 + 1)} ∪ ((1...𝑁) ∖ {(𝐼 + 1)})) = (1...𝑁)) | |
27 | 25, 26 | sylib 220 | . . . 4 ⊢ ((𝑁 ∈ ℕ ∧ 𝐼 ∈ (1...(𝑁 − 1))) → ({(𝐼 + 1)} ∪ ((1...𝑁) ∖ {(𝐼 + 1)})) = (1...𝑁)) |
28 | 27 | feq2d 6499 | . . 3 ⊢ ((𝑁 ∈ ℕ ∧ 𝐼 ∈ (1...(𝑁 − 1))) → (𝑄:({(𝐼 + 1)} ∪ ((1...𝑁) ∖ {(𝐼 + 1)}))⟶ℝ ↔ 𝑄:(1...𝑁)⟶ℝ)) |
29 | 23, 28 | mpbii 235 | . 2 ⊢ ((𝑁 ∈ ℕ ∧ 𝐼 ∈ (1...(𝑁 − 1))) → 𝑄:(1...𝑁)⟶ℝ) |
30 | elee 26679 | . . 3 ⊢ (𝑁 ∈ ℕ → (𝑄 ∈ (𝔼‘𝑁) ↔ 𝑄:(1...𝑁)⟶ℝ)) | |
31 | 30 | adantr 483 | . 2 ⊢ ((𝑁 ∈ ℕ ∧ 𝐼 ∈ (1...(𝑁 − 1))) → (𝑄 ∈ (𝔼‘𝑁) ↔ 𝑄:(1...𝑁)⟶ℝ)) |
32 | 29, 31 | mpbird 259 | 1 ⊢ ((𝑁 ∈ ℕ ∧ 𝐼 ∈ (1...(𝑁 − 1))) → 𝑄 ∈ (𝔼‘𝑁)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1533 ∈ wcel 2110 ∖ cdif 3932 ∪ cun 3933 ∩ cin 3934 ⊆ wss 3935 ∅c0 4290 {csn 4566 〈cop 4572 × cxp 5552 ⟶wf 6350 –1-1-onto→wf1o 6353 ‘cfv 6354 (class class class)co 7155 ℝcr 10535 0cc0 10536 1c1 10537 + caddc 10539 − cmin 10869 ℕcn 11637 ...cfz 12891 𝔼cee 26673 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-sep 5202 ax-nul 5209 ax-pow 5265 ax-pr 5329 ax-un 7460 ax-cnex 10592 ax-resscn 10593 ax-1cn 10594 ax-icn 10595 ax-addcl 10596 ax-addrcl 10597 ax-mulcl 10598 ax-mulrcl 10599 ax-mulcom 10600 ax-addass 10601 ax-mulass 10602 ax-distr 10603 ax-i2m1 10604 ax-1ne0 10605 ax-1rid 10606 ax-rnegex 10607 ax-rrecex 10608 ax-cnre 10609 ax-pre-lttri 10610 ax-pre-lttrn 10611 ax-pre-ltadd 10612 ax-pre-mulgt0 10613 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rab 3147 df-v 3496 df-sbc 3772 df-csb 3883 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-pss 3953 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4567 df-pr 4569 df-tp 4571 df-op 4573 df-uni 4838 df-iun 4920 df-br 5066 df-opab 5128 df-mpt 5146 df-tr 5172 df-id 5459 df-eprel 5464 df-po 5473 df-so 5474 df-fr 5513 df-we 5515 df-xp 5560 df-rel 5561 df-cnv 5562 df-co 5563 df-dm 5564 df-rn 5565 df-res 5566 df-ima 5567 df-pred 6147 df-ord 6193 df-on 6194 df-lim 6195 df-suc 6196 df-iota 6313 df-fun 6356 df-fn 6357 df-f 6358 df-f1 6359 df-fo 6360 df-f1o 6361 df-fv 6362 df-riota 7113 df-ov 7158 df-oprab 7159 df-mpo 7160 df-om 7580 df-1st 7688 df-2nd 7689 df-wrecs 7946 df-recs 8007 df-rdg 8045 df-er 8288 df-map 8407 df-en 8509 df-dom 8510 df-sdom 8511 df-pnf 10676 df-mnf 10677 df-xr 10678 df-ltxr 10679 df-le 10680 df-sub 10871 df-neg 10872 df-nn 11638 df-n0 11897 df-z 11981 df-uz 12243 df-fz 12892 df-ee 26676 |
This theorem is referenced by: axlowdimlem14 26740 axlowdimlem15 26741 axlowdimlem16 26742 axlowdimlem17 26743 |
Copyright terms: Public domain | W3C validator |