| Mathbox for Jeff Hankins |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > topfneec | Structured version Visualization version GIF version | ||
| Description: A cover is equivalent to a topology iff it is a base for that topology. (Contributed by Jeff Hankins, 8-Oct-2009.) (Proof shortened by Mario Carneiro, 11-Sep-2015.) |
| Ref | Expression |
|---|---|
| topfneec.1 | ⊢ ∼ = (Fne ∩ ◡Fne) |
| Ref | Expression |
|---|---|
| topfneec | ⊢ (𝐽 ∈ Top → (𝐴 ∈ [𝐽] ∼ ↔ (topGen‘𝐴) = 𝐽)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | topfneec.1 | . . . . 5 ⊢ ∼ = (Fne ∩ ◡Fne) | |
| 2 | 1 | fneer 37268 | . . . 4 ⊢ ∼ Er V |
| 3 | errel 8738 | . . . 4 ⊢ ( ∼ Er V → Rel ∼ ) | |
| 4 | 2, 3 | ax-mp 5 | . . 3 ⊢ Rel ∼ |
| 5 | relelec 8776 | . . 3 ⊢ (Rel ∼ → (𝐴 ∈ [𝐽] ∼ ↔ 𝐽 ∼ 𝐴)) | |
| 6 | 4, 5 | ax-mp 5 | . 2 ⊢ (𝐴 ∈ [𝐽] ∼ ↔ 𝐽 ∼ 𝐴) |
| 7 | 4 | brrelex2i 5711 | . . . 4 ⊢ (𝐽 ∼ 𝐴 → 𝐴 ∈ V) |
| 8 | 7 | a1i 11 | . . 3 ⊢ (𝐽 ∈ Top → (𝐽 ∼ 𝐴 → 𝐴 ∈ V)) |
| 9 | eleq1 2851 | . . . . . . 7 ⊢ ((topGen‘𝐴) = 𝐽 → ((topGen‘𝐴) ∈ Top ↔ 𝐽 ∈ Top)) | |
| 10 | 9 | biimparc 485 | . . . . . 6 ⊢ ((𝐽 ∈ Top ∧ (topGen‘𝐴) = 𝐽) → (topGen‘𝐴) ∈ Top) |
| 11 | tgclb 23300 | . . . . . 6 ⊢ (𝐴 ∈ TopBases ↔ (topGen‘𝐴) ∈ Top) | |
| 12 | 10, 11 | sylibr 237 | . . . . 5 ⊢ ((𝐽 ∈ Top ∧ (topGen‘𝐴) = 𝐽) → 𝐴 ∈ TopBases) |
| 13 | elex 3474 | . . . . 5 ⊢ (𝐴 ∈ TopBases → 𝐴 ∈ V) | |
| 14 | 12, 13 | syl 18 | . . . 4 ⊢ ((𝐽 ∈ Top ∧ (topGen‘𝐴) = 𝐽) → 𝐴 ∈ V) |
| 15 | 14 | ex 418 | . . 3 ⊢ (𝐽 ∈ Top → ((topGen‘𝐴) = 𝐽 → 𝐴 ∈ V)) |
| 16 | 1 | fneval 37267 | . . . . 5 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ∈ V) → (𝐽 ∼ 𝐴 ↔ (topGen‘𝐽) = (topGen‘𝐴))) |
| 17 | tgtop 23303 | . . . . . . . 8 ⊢ (𝐽 ∈ Top → (topGen‘𝐽) = 𝐽) | |
| 18 | 17 | eqeq1d 2765 | . . . . . . 7 ⊢ (𝐽 ∈ Top → ((topGen‘𝐽) = (topGen‘𝐴) ↔ 𝐽 = (topGen‘𝐴))) |
| 19 | eqcom 2770 | . . . . . . 7 ⊢ (𝐽 = (topGen‘𝐴) ↔ (topGen‘𝐴) = 𝐽) | |
| 20 | 18, 19 | bitrdi 290 | . . . . . 6 ⊢ (𝐽 ∈ Top → ((topGen‘𝐽) = (topGen‘𝐴) ↔ (topGen‘𝐴) = 𝐽)) |
| 21 | 20 | adantr 486 | . . . . 5 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ∈ V) → ((topGen‘𝐽) = (topGen‘𝐴) ↔ (topGen‘𝐴) = 𝐽)) |
| 22 | 16, 21 | bitrd 282 | . . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ∈ V) → (𝐽 ∼ 𝐴 ↔ (topGen‘𝐴) = 𝐽)) |
| 23 | 22 | ex 418 | . . 3 ⊢ (𝐽 ∈ Top → (𝐴 ∈ V → (𝐽 ∼ 𝐴 ↔ (topGen‘𝐴) = 𝐽))) |
| 24 | 8, 15, 23 | pm5.21ndd 382 | . 2 ⊢ (𝐽 ∈ Top → (𝐽 ∼ 𝐴 ↔ (topGen‘𝐴) = 𝐽)) |
| 25 | 6, 24 | bitrid 286 | 1 ⊢ (𝐽 ∈ Top → (𝐴 ∈ [𝐽] ∼ ↔ (topGen‘𝐴) = 𝐽)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1569 ∈ wcel 2146 Vcvv 3453 ∩ cin 4091 class class class wbr 5105 ◡ccnv 5653 Rel wrel 5659 ‘cfv 6546 Er wer 8725 [cec 8726 topGenctg 17620 Topctop 23223 TopBasesctb 23275 Fnecfne 37251 |
| 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 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2196 ax-12 2215 ax-ext 2735 ax-sep 5251 ax-nul 5262 ax-pow 5330 ax-pr 5394 ax-un 7758 |
| 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 2101 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-op 4838 df-uni 4870 df-iun 4955 df-br 5106 df-opab 5170 df-mpt 5189 df-id 5549 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-rn 5665 df-res 5666 df-ima 5667 df-iota 6500 df-fun 6548 df-fv 6554 df-er 8728 df-ec 8730 df-topgen 17626 df-top 23224 df-bases 23276 df-fne 37252 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |