| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > istopon | Structured version Visualization version GIF version | ||
| Description: Property of being a topology with a given base set. (Contributed by Stefan O'Rear, 31-Jan-2015.) (Revised by Mario Carneiro, 13-Aug-2015.) |
| Ref | Expression |
|---|---|
| istopon | ⊢ (𝐽 ∈ (TopOn‘𝐵) ↔ (𝐽 ∈ Top ∧ 𝐵 = ∪ 𝐽)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elfvex 6920 | . 2 ⊢ (𝐽 ∈ (TopOn‘𝐵) → 𝐵 ∈ V) | |
| 2 | uniexg 7757 | . . . 4 ⊢ (𝐽 ∈ Top → ∪ 𝐽 ∈ V) | |
| 3 | eleq1 2848 | . . . 4 ⊢ (𝐵 = ∪ 𝐽 → (𝐵 ∈ V ↔ ∪ 𝐽 ∈ V)) | |
| 4 | 2, 3 | syl5ibrcom 250 | . . 3 ⊢ (𝐽 ∈ Top → (𝐵 = ∪ 𝐽 → 𝐵 ∈ V)) |
| 5 | 4 | imp 412 | . 2 ⊢ ((𝐽 ∈ Top ∧ 𝐵 = ∪ 𝐽) → 𝐵 ∈ V) |
| 6 | eqeq1 2764 | . . . . . 6 ⊢ (𝑏 = 𝐵 → (𝑏 = ∪ 𝑗 ↔ 𝐵 = ∪ 𝑗)) | |
| 7 | 6 | rabbidv 3419 | . . . . 5 ⊢ (𝑏 = 𝐵 → {𝑗 ∈ Top ∣ 𝑏 = ∪ 𝑗} = {𝑗 ∈ Top ∣ 𝐵 = ∪ 𝑗}) |
| 8 | df-topon 23234 | . . . . 5 ⊢ TopOn = (𝑏 ∈ V ↦ {𝑗 ∈ Top ∣ 𝑏 = ∪ 𝑗}) | |
| 9 | vpwex 5338 | . . . . . . 7 ⊢ 𝒫 𝑏 ∈ V | |
| 10 | 9 | pwex 5341 | . . . . . 6 ⊢ 𝒫 𝒫 𝑏 ∈ V |
| 11 | rabss 3995 | . . . . . . 7 ⊢ ({𝑗 ∈ Top ∣ 𝑏 = ∪ 𝑗} ⊆ 𝒫 𝒫 𝑏 ↔ ∀𝑗 ∈ Top (𝑏 = ∪ 𝑗 → 𝑗 ∈ 𝒫 𝒫 𝑏)) | |
| 12 | pwuni 4905 | . . . . . . . . . 10 ⊢ 𝑗 ⊆ 𝒫 ∪ 𝑗 | |
| 13 | pweq 4570 | . . . . . . . . . 10 ⊢ (𝑏 = ∪ 𝑗 → 𝒫 𝑏 = 𝒫 ∪ 𝑗) | |
| 14 | 12, 13 | sseqtrrid 3951 | . . . . . . . . 9 ⊢ (𝑏 = ∪ 𝑗 → 𝑗 ⊆ 𝒫 𝑏) |
| 15 | velpw 4561 | . . . . . . . . 9 ⊢ (𝑗 ∈ 𝒫 𝒫 𝑏 ↔ 𝑗 ⊆ 𝒫 𝑏) | |
| 16 | 14, 15 | sylibr 237 | . . . . . . . 8 ⊢ (𝑏 = ∪ 𝑗 → 𝑗 ∈ 𝒫 𝒫 𝑏) |
| 17 | 16 | a1i 11 | . . . . . . 7 ⊢ (𝑗 ∈ Top → (𝑏 = ∪ 𝑗 → 𝑗 ∈ 𝒫 𝒫 𝑏)) |
| 18 | 11, 17 | mprgbir 3083 | . . . . . 6 ⊢ {𝑗 ∈ Top ∣ 𝑏 = ∪ 𝑗} ⊆ 𝒫 𝒫 𝑏 |
| 19 | 10, 18 | ssexi 5283 | . . . . 5 ⊢ {𝑗 ∈ Top ∣ 𝑏 = ∪ 𝑗} ∈ V |
| 20 | 7, 8, 19 | fvmpt3i 6999 | . . . 4 ⊢ (𝐵 ∈ V → (TopOn‘𝐵) = {𝑗 ∈ Top ∣ 𝐵 = ∪ 𝑗}) |
| 21 | 20 | eleq2d 2846 | . . 3 ⊢ (𝐵 ∈ V → (𝐽 ∈ (TopOn‘𝐵) ↔ 𝐽 ∈ {𝑗 ∈ Top ∣ 𝐵 = ∪ 𝑗})) |
| 22 | unieq 4877 | . . . . 5 ⊢ (𝑗 = 𝐽 → ∪ 𝑗 = ∪ 𝐽) | |
| 23 | 22 | eqeq2d 2771 | . . . 4 ⊢ (𝑗 = 𝐽 → (𝐵 = ∪ 𝑗 ↔ 𝐵 = ∪ 𝐽)) |
| 24 | 23 | elrab 3644 | . . 3 ⊢ (𝐽 ∈ {𝑗 ∈ Top ∣ 𝐵 = ∪ 𝑗} ↔ (𝐽 ∈ Top ∧ 𝐵 = ∪ 𝐽)) |
| 25 | 21, 24 | bitrdi 290 | . 2 ⊢ (𝐵 ∈ V → (𝐽 ∈ (TopOn‘𝐵) ↔ (𝐽 ∈ Top ∧ 𝐵 = ∪ 𝐽))) |
| 26 | 1, 5, 25 | pm5.21nii 381 | 1 ⊢ (𝐽 ∈ (TopOn‘𝐵) ↔ (𝐽 ∈ Top ∧ 𝐵 = ∪ 𝐽)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1569 ∈ wcel 2144 {crab 3412 Vcvv 3450 ⊆ wss 3895 𝒫 cpw 4556 ∪ cuni 4866 ‘cfv 6538 Topctop 23216 TopOnctopon 23233 |
| 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 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 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-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-ss 3896 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-br 5103 df-opab 5167 df-mpt 5186 df-id 5545 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-iota 6494 df-fun 6540 df-fv 6546 df-topon 23234 |
| This theorem is used by: topontop 23236 toponuni 23237 toptopon 23240 toponcom 23251 istps2 23258 tgtopon 23294 distopon 23320 indistopon 23324 fctop 23327 cctop 23329 ppttop 23330 epttop 23332 mretopd 23415 toponmre 23416 resttopon 23484 resttopon2 23491 kgentopon 23862 txtopon 23915 pttopon 23920 xkotopon 23924 qtoptopon 24028 flimtopon 24294 fclstopon 24336 fclsfnflim 24351 utoptopon 24560 qtopt1 34513 neibastop1 37239 onsuctopon 37314 rfcnpre1 46129 cnfex 46138 icccncfext 46990 stoweidlem47 47150 |
| Copyright terms: Public domain | W3C validator |