| 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 23561 | . 2 ⊢ (𝐽 ∈ Haus → 𝐽 ∈ Fre) | |
| 2 | tgpgrp 24288 | . . . . . 6 ⊢ (𝐺 ∈ TopGrp → 𝐺 ∈ Grp) | |
| 3 | eqid 2765 | . . . . . . 7 ⊢ (Base‘𝐺) = (Base‘𝐺) | |
| 4 | eqid 2765 | . . . . . . 7 ⊢ (0g‘𝐺) = (0g‘𝐺) | |
| 5 | 3, 4 | grpidcl 19078 | . . . . . 6 ⊢ (𝐺 ∈ Grp → (0g‘𝐺) ∈ (Base‘𝐺)) |
| 6 | 2, 5 | syl 18 | . . . . 5 ⊢ (𝐺 ∈ TopGrp → (0g‘𝐺) ∈ (Base‘𝐺)) |
| 7 | tgpt1.j | . . . . . . 7 ⊢ 𝐽 = (TopOpen‘𝐺) | |
| 8 | 7, 3 | tgptopon 24292 | . . . . . 6 ⊢ (𝐺 ∈ TopGrp → 𝐽 ∈ (TopOn‘(Base‘𝐺))) |
| 9 | toponuni 23123 | . . . . . 6 ⊢ (𝐽 ∈ (TopOn‘(Base‘𝐺)) → (Base‘𝐺) = ∪ 𝐽) | |
| 10 | 8, 9 | syl 18 | . . . . 5 ⊢ (𝐺 ∈ TopGrp → (Base‘𝐺) = ∪ 𝐽) |
| 11 | 6, 10 | eleqtrd 2867 | . . . 4 ⊢ (𝐺 ∈ TopGrp → (0g‘𝐺) ∈ ∪ 𝐽) |
| 12 | eqid 2765 | . . . . . 6 ⊢ ∪ 𝐽 = ∪ 𝐽 | |
| 13 | 12 | t1sncld 23535 | . . . . 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 24327 | . . 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 2146 {csn 4591 ∪ cuni 4874 ‘cfv 6540 Basecbs 17293 TopOpenctopn 17498 0gc0g 17516 Grpcgrp 19046 TopOnctopon 23119 Clsdccld 23225 Frect1 23516 Hauscha 23517 TopGrpctgp 24281 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7742 |
| 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 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3082 df-rex 3092 df-rmo 3371 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-fo 6546 df-fv 6548 df-riota 7376 df-ov 7422 df-oprab 7423 df-mpo 7424 df-1st 7992 df-2nd 7993 df-map 8832 df-0g 17518 df-topgen 17520 df-plusf 18721 df-mgm 18722 df-sgrp 18811 df-mnd 18827 df-grp 19049 df-minusg 19050 df-sbg 19051 df-top 23103 df-topon 23120 df-topsp 23142 df-bases 23155 df-cld 23228 df-cn 23436 df-t1 23523 df-haus 23524 df-tx 23772 df-tmd 24282 df-tgp 24283 |
| This theorem is used by: tgpt0 24329 |
| Copyright terms: Public domain | W3C validator |