| 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 36554 | . . . 4 ⊢ ∼ Er V |
| 3 | errel 8647 | . . . 4 ⊢ ( ∼ Er V → Rel ∼ ) | |
| 4 | 2, 3 | ax-mp 5 | . . 3 ⊢ Rel ∼ |
| 5 | relelec 8685 | . . 3 ⊢ (Rel ∼ → (𝐴 ∈ [𝐽] ∼ ↔ 𝐽 ∼ 𝐴)) | |
| 6 | 4, 5 | ax-mp 5 | . 2 ⊢ (𝐴 ∈ [𝐽] ∼ ↔ 𝐽 ∼ 𝐴) |
| 7 | 4 | brrelex2i 5682 | . . . 4 ⊢ (𝐽 ∼ 𝐴 → 𝐴 ∈ V) |
| 8 | 7 | a1i 11 | . . 3 ⊢ (𝐽 ∈ Top → (𝐽 ∼ 𝐴 → 𝐴 ∈ V)) |
| 9 | eleq1 2825 | . . . . . . 7 ⊢ ((topGen‘𝐴) = 𝐽 → ((topGen‘𝐴) ∈ Top ↔ 𝐽 ∈ Top)) | |
| 10 | 9 | biimparc 479 | . . . . . 6 ⊢ ((𝐽 ∈ Top ∧ (topGen‘𝐴) = 𝐽) → (topGen‘𝐴) ∈ Top) |
| 11 | tgclb 22948 | . . . . . 6 ⊢ (𝐴 ∈ TopBases ↔ (topGen‘𝐴) ∈ Top) | |
| 12 | 10, 11 | sylibr 234 | . . . . 5 ⊢ ((𝐽 ∈ Top ∧ (topGen‘𝐴) = 𝐽) → 𝐴 ∈ TopBases) |
| 13 | elex 3451 | . . . . 5 ⊢ (𝐴 ∈ TopBases → 𝐴 ∈ V) | |
| 14 | 12, 13 | syl 17 | . . . 4 ⊢ ((𝐽 ∈ Top ∧ (topGen‘𝐴) = 𝐽) → 𝐴 ∈ V) |
| 15 | 14 | ex 412 | . . 3 ⊢ (𝐽 ∈ Top → ((topGen‘𝐴) = 𝐽 → 𝐴 ∈ V)) |
| 16 | 1 | fneval 36553 | . . . . 5 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ∈ V) → (𝐽 ∼ 𝐴 ↔ (topGen‘𝐽) = (topGen‘𝐴))) |
| 17 | tgtop 22951 | . . . . . . . 8 ⊢ (𝐽 ∈ Top → (topGen‘𝐽) = 𝐽) | |
| 18 | 17 | eqeq1d 2739 | . . . . . . 7 ⊢ (𝐽 ∈ Top → ((topGen‘𝐽) = (topGen‘𝐴) ↔ 𝐽 = (topGen‘𝐴))) |
| 19 | eqcom 2744 | . . . . . . 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 1542 ∈ wcel 2114 Vcvv 3430 ∩ cin 3889 class class class wbr 5086 ◡ccnv 5624 Rel wrel 5630 ‘cfv 6493 Er wer 8634 [cec 8635 topGenctg 17394 Topctop 22871 TopBasesctb 22923 Fnecfne 36537 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5232 ax-nul 5242 ax-pow 5303 ax-pr 5371 ax-un 7683 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-id 5520 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-iota 6449 df-fun 6495 df-fv 6501 df-er 8637 df-ec 8639 df-topgen 17400 df-top 22872 df-bases 22924 df-fne 36538 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |