| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > tgpt1 | Structured version Visualization version GIF version | ||
| Description: Hausdorff and T1 are equivalent for topological groups. (Contributed by Mario Carneiro, 18-Sep-2015.) |
| Ref | Expression |
|---|---|
| tgpt1.j | ⊢ 𝐽 = (TopOpen‘𝐺) |
| Ref | Expression |
|---|---|
| tgpt1 | ⊢ (𝐺 ∈ TopGrp → (𝐽 ∈ Haus ↔ 𝐽 ∈ Fre)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | haust1 23725 | . 2 ⊢ (𝐽 ∈ Haus → 𝐽 ∈ Fre) | |
| 2 | tgpgrp 24452 | . . . . . 6 ⊢ (𝐺 ∈ TopGrp → 𝐺 ∈ Grp) | |
| 3 | eqid 2763 | . . . . . . 7 ⊢ (Base‘𝐺) = (Base‘𝐺) | |
| 4 | eqid 2763 | . . . . . . 7 ⊢ (0g‘𝐺) = (0g‘𝐺) | |
| 5 | 3, 4 | grpidcl 19226 | . . . . . 6 ⊢ (𝐺 ∈ Grp → (0g‘𝐺) ∈ (Base‘𝐺)) |
| 6 | 2, 5 | syl 18 | . . . . 5 ⊢ (𝐺 ∈ TopGrp → (0g‘𝐺) ∈ (Base‘𝐺)) |
| 7 | tgpt1.j | . . . . . . 7 ⊢ 𝐽 = (TopOpen‘𝐺) | |
| 8 | 7, 3 | tgptopon 24456 | . . . . . 6 ⊢ (𝐺 ∈ TopGrp → 𝐽 ∈ (TopOn‘(Base‘𝐺))) |
| 9 | toponuni 23287 | . . . . . 6 ⊢ (𝐽 ∈ (TopOn‘(Base‘𝐺)) → (Base‘𝐺) = ∪ 𝐽) | |
| 10 | 8, 9 | syl 18 | . . . . 5 ⊢ (𝐺 ∈ TopGrp → (Base‘𝐺) = ∪ 𝐽) |
| 11 | 6, 10 | eleqtrd 2866 | . . . 4 ⊢ (𝐺 ∈ TopGrp → (0g‘𝐺) ∈ ∪ 𝐽) |
| 12 | eqid 2763 | . . . . . 6 ⊢ ∪ 𝐽 = ∪ 𝐽 | |
| 13 | 12 | t1sncld 23699 | . . . . 5 ⊢ ((𝐽 ∈ Fre ∧ (0g‘𝐺) ∈ ∪ 𝐽) → {(0g‘𝐺)} ∈ (Clsd‘𝐽)) |
| 14 | 13 | expcom 419 | . . . 4 ⊢ ((0g‘𝐺) ∈ ∪ 𝐽 → (𝐽 ∈ Fre → {(0g‘𝐺)} ∈ (Clsd‘𝐽))) |
| 15 | 11, 14 | syl 18 | . . 3 ⊢ (𝐺 ∈ TopGrp → (𝐽 ∈ Fre → {(0g‘𝐺)} ∈ (Clsd‘𝐽))) |
| 16 | 4, 7 | tgphaus 24491 | . . 3 ⊢ (𝐺 ∈ TopGrp → (𝐽 ∈ Haus ↔ {(0g‘𝐺)} ∈ (Clsd‘𝐽))) |
| 17 | 15, 16 | sylibrd 262 | . 2 ⊢ (𝐺 ∈ TopGrp → (𝐽 ∈ Fre → 𝐽 ∈ Haus)) |
| 18 | 1, 17 | impbid2 229 | 1 ⊢ (𝐺 ∈ TopGrp → (𝐽 ∈ Haus ↔ 𝐽 ∈ Fre)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 = wceq 1570 ∈ wcel 2147 {csn 4588 ∪ cuni 4872 ‘cfv 6566 Basecbs 17431 TopOpenctopn 17642 0gc0g 17660 Grpcgrp 19194 TopOnctopon 23283 Clsdccld 23389 Frect1 23680 Hauscha 23681 TopGrpctgp 24445 |
| 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 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 |
| 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-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 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 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-id 5553 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-fo 6572 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-1st 8035 df-2nd 8036 df-map 8887 df-0g 17662 df-topgen 17664 df-plusf 18865 df-mgm 18866 df-sgrp 18958 df-mnd 18974 df-grp 19197 df-minusg 19198 df-sbg 19199 df-top 23267 df-topon 23284 df-topsp 23306 df-bases 23319 df-cld 23392 df-cn 23600 df-t1 23687 df-haus 23688 df-tx 23936 df-tmd 24446 df-tgp 24447 |
| This theorem is used by: tgpt0 24493 |
| Copyright terms: Public domain | W3C validator |