| 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 36376 | . . . 4 ⊢ ∼ Er V |
| 3 | errel 8733 | . . . 4 ⊢ ( ∼ Er V → Rel ∼ ) | |
| 4 | 2, 3 | ax-mp 5 | . . 3 ⊢ Rel ∼ |
| 5 | relelec 8771 | . . 3 ⊢ (Rel ∼ → (𝐴 ∈ [𝐽] ∼ ↔ 𝐽 ∼ 𝐴)) | |
| 6 | 4, 5 | ax-mp 5 | . 2 ⊢ (𝐴 ∈ [𝐽] ∼ ↔ 𝐽 ∼ 𝐴) |
| 7 | 4 | brrelex2i 5716 | . . . 4 ⊢ (𝐽 ∼ 𝐴 → 𝐴 ∈ V) |
| 8 | 7 | a1i 11 | . . 3 ⊢ (𝐽 ∈ Top → (𝐽 ∼ 𝐴 → 𝐴 ∈ V)) |
| 9 | eleq1 2823 | . . . . . . 7 ⊢ ((topGen‘𝐴) = 𝐽 → ((topGen‘𝐴) ∈ Top ↔ 𝐽 ∈ Top)) | |
| 10 | 9 | biimparc 479 | . . . . . 6 ⊢ ((𝐽 ∈ Top ∧ (topGen‘𝐴) = 𝐽) → (topGen‘𝐴) ∈ Top) |
| 11 | tgclb 22913 | . . . . . 6 ⊢ (𝐴 ∈ TopBases ↔ (topGen‘𝐴) ∈ Top) | |
| 12 | 10, 11 | sylibr 234 | . . . . 5 ⊢ ((𝐽 ∈ Top ∧ (topGen‘𝐴) = 𝐽) → 𝐴 ∈ TopBases) |
| 13 | elex 3485 | . . . . 5 ⊢ (𝐴 ∈ TopBases → 𝐴 ∈ V) | |
| 14 | 12, 13 | syl 17 | . . . 4 ⊢ ((𝐽 ∈ Top ∧ (topGen‘𝐴) = 𝐽) → 𝐴 ∈ V) |
| 15 | 14 | ex 412 | . . 3 ⊢ (𝐽 ∈ Top → ((topGen‘𝐴) = 𝐽 → 𝐴 ∈ V)) |
| 16 | 1 | fneval 36375 | . . . . 5 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ∈ V) → (𝐽 ∼ 𝐴 ↔ (topGen‘𝐽) = (topGen‘𝐴))) |
| 17 | tgtop 22916 | . . . . . . . 8 ⊢ (𝐽 ∈ Top → (topGen‘𝐽) = 𝐽) | |
| 18 | 17 | eqeq1d 2738 | . . . . . . 7 ⊢ (𝐽 ∈ Top → ((topGen‘𝐽) = (topGen‘𝐴) ↔ 𝐽 = (topGen‘𝐴))) |
| 19 | eqcom 2743 | . . . . . . 7 ⊢ (𝐽 = (topGen‘𝐴) ↔ (topGen‘𝐴) = 𝐽) | |
| 20 | 18, 19 | bitrdi 287 | . . . . . 6 ⊢ (𝐽 ∈ Top → ((topGen‘𝐽) = (topGen‘𝐴) ↔ (topGen‘𝐴) = 𝐽)) |
| 21 | 20 | adantr 480 | . . . . 5 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ∈ V) → ((topGen‘𝐽) = (topGen‘𝐴) ↔ (topGen‘𝐴) = 𝐽)) |
| 22 | 16, 21 | bitrd 279 | . . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ∈ V) → (𝐽 ∼ 𝐴 ↔ (topGen‘𝐴) = 𝐽)) |
| 23 | 22 | ex 412 | . . 3 ⊢ (𝐽 ∈ Top → (𝐴 ∈ V → (𝐽 ∼ 𝐴 ↔ (topGen‘𝐴) = 𝐽))) |
| 24 | 8, 15, 23 | pm5.21ndd 379 | . 2 ⊢ (𝐽 ∈ Top → (𝐽 ∼ 𝐴 ↔ (topGen‘𝐴) = 𝐽)) |
| 25 | 6, 24 | bitrid 283 | 1 ⊢ (𝐽 ∈ Top → (𝐴 ∈ [𝐽] ∼ ↔ (topGen‘𝐴) = 𝐽)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1540 ∈ wcel 2109 Vcvv 3464 ∩ cin 3930 class class class wbr 5124 ◡ccnv 5658 Rel wrel 5664 ‘cfv 6536 Er wer 8721 [cec 8722 topGenctg 17456 Topctop 22836 TopBasesctb 22888 Fnecfne 36359 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2708 ax-sep 5271 ax-nul 5281 ax-pow 5340 ax-pr 5407 ax-un 7734 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2810 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3062 df-rab 3421 df-v 3466 df-sbc 3771 df-csb 3880 df-dif 3934 df-un 3936 df-in 3938 df-ss 3948 df-nul 4314 df-if 4506 df-pw 4582 df-sn 4607 df-pr 4609 df-op 4613 df-uni 4889 df-iun 4974 df-br 5125 df-opab 5187 df-mpt 5207 df-id 5553 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-iota 6489 df-fun 6538 df-fv 6544 df-er 8724 df-ec 8726 df-topgen 17462 df-top 22837 df-bases 22889 df-fne 36360 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |