| 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 6917 | . 2 ⊢ (𝐽 ∈ (TopOn‘𝐵) → 𝐵 ∈ V) | |
| 2 | uniexg 7738 | . . . 4 ⊢ (𝐽 ∈ Top → ∪ 𝐽 ∈ V) | |
| 3 | eleq1 2857 | . . . 4 ⊢ (𝐵 = ∪ 𝐽 → (𝐵 ∈ V ↔ ∪ 𝐽 ∈ V)) | |
| 4 | 2, 3 | syl5ibrcom 250 | . . 3 ⊢ (𝐽 ∈ Top → (𝐵 = ∪ 𝐽 → 𝐵 ∈ V)) |
| 5 | 4 | imp 411 | . 2 ⊢ ((𝐽 ∈ Top ∧ 𝐵 = ∪ 𝐽) → 𝐵 ∈ V) |
| 6 | eqeq1 2773 | . . . . . 6 ⊢ (𝑏 = 𝐵 → (𝑏 = ∪ 𝑗 ↔ 𝐵 = ∪ 𝑗)) | |
| 7 | 6 | rabbidv 3430 | . . . . 5 ⊢ (𝑏 = 𝐵 → {𝑗 ∈ Top ∣ 𝑏 = ∪ 𝑗} = {𝑗 ∈ Top ∣ 𝐵 = ∪ 𝑗}) |
| 8 | df-topon 23036 | . . . . 5 ⊢ TopOn = (𝑏 ∈ V ↦ {𝑗 ∈ Top ∣ 𝑏 = ∪ 𝑗}) | |
| 9 | vpwex 5349 | . . . . . . 7 ⊢ 𝒫 𝑏 ∈ V | |
| 10 | 9 | pwex 5352 | . . . . . 6 ⊢ 𝒫 𝒫 𝑏 ∈ V |
| 11 | rabss 4032 | . . . . . . 7 ⊢ ({𝑗 ∈ Top ∣ 𝑏 = ∪ 𝑗} ⊆ 𝒫 𝒫 𝑏 ↔ ∀𝑗 ∈ Top (𝑏 = ∪ 𝑗 → 𝑗 ∈ 𝒫 𝒫 𝑏)) | |
| 12 | pwuni 4915 | . . . . . . . . . 10 ⊢ 𝑗 ⊆ 𝒫 ∪ 𝑗 | |
| 13 | pweq 4581 | . . . . . . . . . 10 ⊢ (𝑏 = ∪ 𝑗 → 𝒫 𝑏 = 𝒫 ∪ 𝑗) | |
| 14 | 12, 13 | sseqtrrid 3988 | . . . . . . . . 9 ⊢ (𝑏 = ∪ 𝑗 → 𝑗 ⊆ 𝒫 𝑏) |
| 15 | velpw 4572 | . . . . . . . . 9 ⊢ (𝑗 ∈ 𝒫 𝒫 𝑏 ↔ 𝑗 ⊆ 𝒫 𝑏) | |
| 16 | 14, 15 | sylibr 237 | . . . . . . . 8 ⊢ (𝑏 = ∪ 𝑗 → 𝑗 ∈ 𝒫 𝒫 𝑏) |
| 17 | 16 | a1i 11 | . . . . . . 7 ⊢ (𝑗 ∈ Top → (𝑏 = ∪ 𝑗 → 𝑗 ∈ 𝒫 𝒫 𝑏)) |
| 18 | 11, 17 | mprgbir 3092 | . . . . . 6 ⊢ {𝑗 ∈ Top ∣ 𝑏 = ∪ 𝑗} ⊆ 𝒫 𝒫 𝑏 |
| 19 | 10, 18 | ssexi 5293 | . . . . 5 ⊢ {𝑗 ∈ Top ∣ 𝑏 = ∪ 𝑗} ∈ V |
| 20 | 7, 8, 19 | fvmpt3i 6996 | . . . 4 ⊢ (𝐵 ∈ V → (TopOn‘𝐵) = {𝑗 ∈ Top ∣ 𝐵 = ∪ 𝑗}) |
| 21 | 20 | eleq2d 2855 | . . 3 ⊢ (𝐵 ∈ V → (𝐽 ∈ (TopOn‘𝐵) ↔ 𝐽 ∈ {𝑗 ∈ Top ∣ 𝐵 = ∪ 𝑗})) |
| 22 | unieq 4887 | . . . . 5 ⊢ (𝑗 = 𝐽 → ∪ 𝑗 = ∪ 𝐽) | |
| 23 | 22 | eqeq2d 2780 | . . . 4 ⊢ (𝑗 = 𝐽 → (𝐵 = ∪ 𝑗 ↔ 𝐵 = ∪ 𝐽)) |
| 24 | 23 | elrab 3659 | . . 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 |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1567 ∈ wcel 2149 {crab 3423 Vcvv 3463 ⊆ wss 3913 𝒫 cpw 4567 ∪ cuni 4876 ‘cfv 6537 Topctop 23018 TopOnctopon 23035 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5261 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-ral 3086 df-rex 3096 df-rab 3424 df-v 3465 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-br 5114 df-opab 5178 df-mpt 5197 df-id 5557 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-iota 6493 df-fun 6539 df-fv 6545 df-topon 23036 |
| This theorem is referenced by: topontop 23038 toponuni 23039 toptopon 23042 toponcom 23053 istps2 23060 tgtopon 23096 distopon 23122 indistopon 23126 fctop 23129 cctop 23131 ppttop 23132 epttop 23134 mretopd 23217 toponmre 23218 resttopon 23286 resttopon2 23293 kgentopon 23663 txtopon 23716 pttopon 23721 xkotopon 23725 qtoptopon 23829 flimtopon 24095 fclstopon 24137 fclsfnflim 24152 utoptopon 24361 qtopt1 34169 neibastop1 36758 onsuctopon 36833 rfcnpre1 45630 cnfex 45639 icccncfext 46492 stoweidlem47 46652 |
| Copyright terms: Public domain | W3C validator |