| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > om1bas | Structured version Visualization version GIF version | ||
| Description: The base set of the loop space. (Contributed by Mario Carneiro, 10-Jul-2015.) |
| Ref | Expression |
|---|---|
| om1bas.o | ⊢ 𝑂 = (𝐽 Ω1 𝑌) |
| om1bas.j | ⊢ (𝜑 → 𝐽 ∈ (TopOn‘𝑋)) |
| om1bas.y | ⊢ (𝜑 → 𝑌 ∈ 𝑋) |
| om1bas.b | ⊢ (𝜑 → 𝐵 = (Base‘𝑂)) |
| Ref | Expression |
|---|---|
| om1bas | ⊢ (𝜑 → 𝐵 = {𝑓 ∈ (II Cn 𝐽) ∣ ((𝑓‘0) = 𝑌 ∧ (𝑓‘1) = 𝑌)}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | om1bas.b | . . 3 ⊢ (𝜑 → 𝐵 = (Base‘𝑂)) | |
| 2 | om1bas.o | . . . . 5 ⊢ 𝑂 = (𝐽 Ω1 𝑌) | |
| 3 | eqidd 2738 | . . . . 5 ⊢ (𝜑 → {𝑓 ∈ (II Cn 𝐽) ∣ ((𝑓‘0) = 𝑌 ∧ (𝑓‘1) = 𝑌)} = {𝑓 ∈ (II Cn 𝐽) ∣ ((𝑓‘0) = 𝑌 ∧ (𝑓‘1) = 𝑌)}) | |
| 4 | eqidd 2738 | . . . . 5 ⊢ (𝜑 → (*𝑝‘𝐽) = (*𝑝‘𝐽)) | |
| 5 | eqidd 2738 | . . . . 5 ⊢ (𝜑 → (𝐽 ↑ko II) = (𝐽 ↑ko II)) | |
| 6 | om1bas.j | . . . . 5 ⊢ (𝜑 → 𝐽 ∈ (TopOn‘𝑋)) | |
| 7 | om1bas.y | . . . . 5 ⊢ (𝜑 → 𝑌 ∈ 𝑋) | |
| 8 | 2, 3, 4, 5, 6, 7 | om1val 25007 | . . . 4 ⊢ (𝜑 → 𝑂 = {〈(Base‘ndx), {𝑓 ∈ (II Cn 𝐽) ∣ ((𝑓‘0) = 𝑌 ∧ (𝑓‘1) = 𝑌)}〉, 〈(+g‘ndx), (*𝑝‘𝐽)〉, 〈(TopSet‘ndx), (𝐽 ↑ko II)〉}) |
| 9 | 8 | fveq2d 6838 | . . 3 ⊢ (𝜑 → (Base‘𝑂) = (Base‘{〈(Base‘ndx), {𝑓 ∈ (II Cn 𝐽) ∣ ((𝑓‘0) = 𝑌 ∧ (𝑓‘1) = 𝑌)}〉, 〈(+g‘ndx), (*𝑝‘𝐽)〉, 〈(TopSet‘ndx), (𝐽 ↑ko II)〉})) |
| 10 | 1, 9 | eqtrd 2772 | . 2 ⊢ (𝜑 → 𝐵 = (Base‘{〈(Base‘ndx), {𝑓 ∈ (II Cn 𝐽) ∣ ((𝑓‘0) = 𝑌 ∧ (𝑓‘1) = 𝑌)}〉, 〈(+g‘ndx), (*𝑝‘𝐽)〉, 〈(TopSet‘ndx), (𝐽 ↑ko II)〉})) |
| 11 | ovex 7393 | . . . 4 ⊢ (II Cn 𝐽) ∈ V | |
| 12 | 11 | rabex 5276 | . . 3 ⊢ {𝑓 ∈ (II Cn 𝐽) ∣ ((𝑓‘0) = 𝑌 ∧ (𝑓‘1) = 𝑌)} ∈ V |
| 13 | eqid 2737 | . . . 4 ⊢ {〈(Base‘ndx), {𝑓 ∈ (II Cn 𝐽) ∣ ((𝑓‘0) = 𝑌 ∧ (𝑓‘1) = 𝑌)}〉, 〈(+g‘ndx), (*𝑝‘𝐽)〉, 〈(TopSet‘ndx), (𝐽 ↑ko II)〉} = {〈(Base‘ndx), {𝑓 ∈ (II Cn 𝐽) ∣ ((𝑓‘0) = 𝑌 ∧ (𝑓‘1) = 𝑌)}〉, 〈(+g‘ndx), (*𝑝‘𝐽)〉, 〈(TopSet‘ndx), (𝐽 ↑ko II)〉} | |
| 14 | 13 | topgrpbas 17316 | . . 3 ⊢ ({𝑓 ∈ (II Cn 𝐽) ∣ ((𝑓‘0) = 𝑌 ∧ (𝑓‘1) = 𝑌)} ∈ V → {𝑓 ∈ (II Cn 𝐽) ∣ ((𝑓‘0) = 𝑌 ∧ (𝑓‘1) = 𝑌)} = (Base‘{〈(Base‘ndx), {𝑓 ∈ (II Cn 𝐽) ∣ ((𝑓‘0) = 𝑌 ∧ (𝑓‘1) = 𝑌)}〉, 〈(+g‘ndx), (*𝑝‘𝐽)〉, 〈(TopSet‘ndx), (𝐽 ↑ko II)〉})) |
| 15 | 12, 14 | ax-mp 5 | . 2 ⊢ {𝑓 ∈ (II Cn 𝐽) ∣ ((𝑓‘0) = 𝑌 ∧ (𝑓‘1) = 𝑌)} = (Base‘{〈(Base‘ndx), {𝑓 ∈ (II Cn 𝐽) ∣ ((𝑓‘0) = 𝑌 ∧ (𝑓‘1) = 𝑌)}〉, 〈(+g‘ndx), (*𝑝‘𝐽)〉, 〈(TopSet‘ndx), (𝐽 ↑ko II)〉}) |
| 16 | 10, 15 | eqtr4di 2790 | 1 ⊢ (𝜑 → 𝐵 = {𝑓 ∈ (II Cn 𝐽) ∣ ((𝑓‘0) = 𝑌 ∧ (𝑓‘1) = 𝑌)}) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 {crab 3390 Vcvv 3430 {ctp 4572 〈cop 4574 ‘cfv 6492 (class class class)co 7360 0cc0 11029 1c1 11030 ndxcnx 17154 Basecbs 17170 +gcplusg 17211 TopSetcts 17217 TopOnctopon 22885 Cn ccn 23199 ↑ko cxko 23536 IIcii 24852 *𝑝cpco 24977 Ω1 comi 24978 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5231 ax-nul 5241 ax-pow 5302 ax-pr 5370 ax-un 7682 ax-cnex 11085 ax-resscn 11086 ax-1cn 11087 ax-icn 11088 ax-addcl 11089 ax-addrcl 11090 ax-mulcl 11091 ax-mulrcl 11092 ax-mulcom 11093 ax-addass 11094 ax-mulass 11095 ax-distr 11096 ax-i2m1 11097 ax-1ne0 11098 ax-1rid 11099 ax-rnegex 11100 ax-rrecex 11101 ax-cnre 11102 ax-pre-lttri 11103 ax-pre-lttrn 11104 ax-pre-ltadd 11105 ax-pre-mulgt0 11106 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-tp 4573 df-op 4575 df-uni 4852 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-om 7811 df-1st 7935 df-2nd 7936 df-frecs 8224 df-wrecs 8255 df-recs 8304 df-rdg 8342 df-1o 8398 df-er 8636 df-en 8887 df-dom 8888 df-sdom 8889 df-fin 8890 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-nn 12166 df-2 12235 df-3 12236 df-4 12237 df-5 12238 df-6 12239 df-7 12240 df-8 12241 df-9 12242 df-n0 12429 df-z 12516 df-uz 12780 df-fz 13453 df-struct 17108 df-slot 17143 df-ndx 17155 df-base 17171 df-plusg 17224 df-tset 17230 df-topon 22886 df-om1 24983 |
| This theorem is referenced by: om1elbas 25009 om1plusg 25011 om1tset 25012 |
| Copyright terms: Public domain | W3C validator |