| 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 6943 | . 2 ⊢ (𝐽 ∈ (TopOn‘𝐵) → 𝐵 ∈ V) | |
| 2 | uniexg 7781 | . . . 4 ⊢ (𝐽 ∈ Top → ∪ 𝐽 ∈ V) | |
| 3 | eleq1 2852 | . . . 4 ⊢ (𝐵 = ∪ 𝐽 → (𝐵 ∈ V ↔ ∪ 𝐽 ∈ V)) | |
| 4 | 2, 3 | syl5ibrcom 250 | . . 3 ⊢ (𝐽 ∈ Top → (𝐵 = ∪ 𝐽 → 𝐵 ∈ V)) |
| 5 | 4 | imp 412 | . 2 ⊢ ((𝐽 ∈ Top ∧ 𝐵 = ∪ 𝐽) → 𝐵 ∈ V) |
| 6 | eqeq1 2767 | . . . . . 6 ⊢ (𝑏 = 𝐵 → (𝑏 = ∪ 𝑗 ↔ 𝐵 = ∪ 𝑗)) | |
| 7 | 6 | rabbidv 3423 | . . . . 5 ⊢ (𝑏 = 𝐵 → {𝑗 ∈ Top ∣ 𝑏 = ∪ 𝑗} = {𝑗 ∈ Top ∣ 𝐵 = ∪ 𝑗}) |
| 8 | df-topon 23259 | . . . . 5 ⊢ TopOn = (𝑏 ∈ V ↦ {𝑗 ∈ Top ∣ 𝑏 = ∪ 𝑗}) | |
| 9 | vpwex 5343 | . . . . . . 7 ⊢ 𝒫 𝑏 ∈ V | |
| 10 | 9 | pwex 5346 | . . . . . 6 ⊢ 𝒫 𝒫 𝑏 ∈ V |
| 11 | rabss 3998 | . . . . . . 7 ⊢ ({𝑗 ∈ Top ∣ 𝑏 = ∪ 𝑗} ⊆ 𝒫 𝒫 𝑏 ↔ ∀𝑗 ∈ Top (𝑏 = ∪ 𝑗 → 𝑗 ∈ 𝒫 𝒫 𝑏)) | |
| 12 | pwuni 4909 | . . . . . . . . . 10 ⊢ 𝑗 ⊆ 𝒫 ∪ 𝑗 | |
| 13 | pweq 4574 | . . . . . . . . . 10 ⊢ (𝑏 = ∪ 𝑗 → 𝒫 𝑏 = 𝒫 ∪ 𝑗) | |
| 14 | 12, 13 | sseqtrrid 3956 | . . . . . . . . 9 ⊢ (𝑏 = ∪ 𝑗 → 𝑗 ⊆ 𝒫 𝑏) |
| 15 | velpw 4565 | . . . . . . . . 9 ⊢ (𝑗 ∈ 𝒫 𝒫 𝑏 ↔ 𝑗 ⊆ 𝒫 𝑏) | |
| 16 | 14, 15 | sylibr 237 | . . . . . . . 8 ⊢ (𝑏 = ∪ 𝑗 → 𝑗 ∈ 𝒫 𝒫 𝑏) |
| 17 | 16 | a1i 11 | . . . . . . 7 ⊢ (𝑗 ∈ Top → (𝑏 = ∪ 𝑗 → 𝑗 ∈ 𝒫 𝒫 𝑏)) |
| 18 | 11, 17 | mprgbir 3087 | . . . . . 6 ⊢ {𝑗 ∈ Top ∣ 𝑏 = ∪ 𝑗} ⊆ 𝒫 𝒫 𝑏 |
| 19 | 10, 18 | ssexi 5288 | . . . . 5 ⊢ {𝑗 ∈ Top ∣ 𝑏 = ∪ 𝑗} ∈ V |
| 20 | 7, 8, 19 | fvmpt3i 7022 | . . . 4 ⊢ (𝐵 ∈ V → (TopOn‘𝐵) = {𝑗 ∈ Top ∣ 𝐵 = ∪ 𝑗}) |
| 21 | 20 | eleq2d 2850 | . . 3 ⊢ (𝐵 ∈ V → (𝐽 ∈ (TopOn‘𝐵) ↔ 𝐽 ∈ {𝑗 ∈ Top ∣ 𝐵 = ∪ 𝑗})) |
| 22 | unieq 4881 | . . . . 5 ⊢ (𝑗 = 𝐽 → ∪ 𝑗 = ∪ 𝐽) | |
| 23 | 22 | eqeq2d 2774 | . . . 4 ⊢ (𝑗 = 𝐽 → (𝐵 = ∪ 𝑗 ↔ 𝐵 = ∪ 𝐽)) |
| 24 | 23 | elrab 3648 | . . 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 1570 ∈ wcel 2147 {crab 3416 Vcvv 3454 ⊆ wss 3900 𝒫 cpw 4560 ∪ cuni 4870 ‘cfv 6558 Topctop 23241 TopOnctopon 23258 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7775 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-br 5107 df-opab 5171 df-mpt 5190 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-iota 6512 df-fun 6560 df-fv 6566 df-topon 23259 |
| This theorem is used by: topontop 23261 toponuni 23262 toptopon 23265 toponcom 23276 istps2 23283 tgtopon 23319 distopon 23345 indistopon 23349 fctop 23352 cctop 23354 ppttop 23355 epttop 23357 mretopd 23440 toponmre 23441 resttopon 23509 resttopon2 23516 kgentopon 23887 txtopon 23940 pttopon 23945 xkotopon 23949 qtoptopon 24053 flimtopon 24319 fclstopon 24361 fclsfnflim 24376 utoptopon 24585 qtopt1 34537 neibastop1 37325 onsuctopon 37400 rfcnpre1 46241 cnfex 46250 icccncfext 47102 stoweidlem47 47262 |
| Copyright terms: Public domain | W3C validator |