MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  tgphaus Structured version   Visualization version   GIF version

Theorem tgphaus 24092
Description: A topological group is Hausdorff iff the identity subgroup is closed. (Contributed by Mario Carneiro, 18-Sep-2015.)
Hypotheses
Ref Expression
tgphaus.1 0 = (0g𝐺)
tgphaus.j 𝐽 = (TopOpen‘𝐺)
Assertion
Ref Expression
tgphaus (𝐺 ∈ TopGrp → (𝐽 ∈ Haus ↔ { 0 } ∈ (Clsd‘𝐽)))

Proof of Theorem tgphaus
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 tgpgrp 24053 . . . . 5 (𝐺 ∈ TopGrp → 𝐺 ∈ Grp)
2 eqid 2737 . . . . . 6 (Base‘𝐺) = (Base‘𝐺)
3 tgphaus.1 . . . . . 6 0 = (0g𝐺)
42, 3grpidcl 18932 . . . . 5 (𝐺 ∈ Grp → 0 ∈ (Base‘𝐺))
51, 4syl 17 . . . 4 (𝐺 ∈ TopGrp → 0 ∈ (Base‘𝐺))
6 tgphaus.j . . . . . 6 𝐽 = (TopOpen‘𝐺)
76, 2tgptopon 24057 . . . . 5 (𝐺 ∈ TopGrp → 𝐽 ∈ (TopOn‘(Base‘𝐺)))
8 toponuni 22889 . . . . 5 (𝐽 ∈ (TopOn‘(Base‘𝐺)) → (Base‘𝐺) = 𝐽)
97, 8syl 17 . . . 4 (𝐺 ∈ TopGrp → (Base‘𝐺) = 𝐽)
105, 9eleqtrd 2839 . . 3 (𝐺 ∈ TopGrp → 0 𝐽)
11 eqid 2737 . . . . 5 𝐽 = 𝐽
1211sncld 23346 . . . 4 ((𝐽 ∈ Haus ∧ 0 𝐽) → { 0 } ∈ (Clsd‘𝐽))
1312expcom 413 . . 3 ( 0 𝐽 → (𝐽 ∈ Haus → { 0 } ∈ (Clsd‘𝐽)))
1410, 13syl 17 . 2 (𝐺 ∈ TopGrp → (𝐽 ∈ Haus → { 0 } ∈ (Clsd‘𝐽)))
15 eqid 2737 . . . . . 6 (-g𝐺) = (-g𝐺)
166, 15tgpsubcn 24065 . . . . 5 (𝐺 ∈ TopGrp → (-g𝐺) ∈ ((𝐽 ×t 𝐽) Cn 𝐽))
17 cnclima 23243 . . . . . 6 (((-g𝐺) ∈ ((𝐽 ×t 𝐽) Cn 𝐽) ∧ { 0 } ∈ (Clsd‘𝐽)) → ((-g𝐺) “ { 0 }) ∈ (Clsd‘(𝐽 ×t 𝐽)))
1817ex 412 . . . . 5 ((-g𝐺) ∈ ((𝐽 ×t 𝐽) Cn 𝐽) → ({ 0 } ∈ (Clsd‘𝐽) → ((-g𝐺) “ { 0 }) ∈ (Clsd‘(𝐽 ×t 𝐽))))
1916, 18syl 17 . . . 4 (𝐺 ∈ TopGrp → ({ 0 } ∈ (Clsd‘𝐽) → ((-g𝐺) “ { 0 }) ∈ (Clsd‘(𝐽 ×t 𝐽))))
20 cnvimass 6041 . . . . . . . . 9 ((-g𝐺) “ { 0 }) ⊆ dom (-g𝐺)
212, 15grpsubf 18986 . . . . . . . . . 10 (𝐺 ∈ Grp → (-g𝐺):((Base‘𝐺) × (Base‘𝐺))⟶(Base‘𝐺))
221, 21syl 17 . . . . . . . . 9 (𝐺 ∈ TopGrp → (-g𝐺):((Base‘𝐺) × (Base‘𝐺))⟶(Base‘𝐺))
2320, 22fssdm 6681 . . . . . . . 8 (𝐺 ∈ TopGrp → ((-g𝐺) “ { 0 }) ⊆ ((Base‘𝐺) × (Base‘𝐺)))
24 relxp 5642 . . . . . . . 8 Rel ((Base‘𝐺) × (Base‘𝐺))
25 relss 5731 . . . . . . . 8 (((-g𝐺) “ { 0 }) ⊆ ((Base‘𝐺) × (Base‘𝐺)) → (Rel ((Base‘𝐺) × (Base‘𝐺)) → Rel ((-g𝐺) “ { 0 })))
2623, 24, 25mpisyl 21 . . . . . . 7 (𝐺 ∈ TopGrp → Rel ((-g𝐺) “ { 0 }))
27 dfrel4v 6148 . . . . . . 7 (Rel ((-g𝐺) “ { 0 }) ↔ ((-g𝐺) “ { 0 }) = {⟨𝑥, 𝑦⟩ ∣ 𝑥((-g𝐺) “ { 0 })𝑦})
2826, 27sylib 218 . . . . . 6 (𝐺 ∈ TopGrp → ((-g𝐺) “ { 0 }) = {⟨𝑥, 𝑦⟩ ∣ 𝑥((-g𝐺) “ { 0 })𝑦})
2922ffnd 6663 . . . . . . . . . . 11 (𝐺 ∈ TopGrp → (-g𝐺) Fn ((Base‘𝐺) × (Base‘𝐺)))
30 elpreima 7004 . . . . . . . . . . 11 ((-g𝐺) Fn ((Base‘𝐺) × (Base‘𝐺)) → (⟨𝑥, 𝑦⟩ ∈ ((-g𝐺) “ { 0 }) ↔ (⟨𝑥, 𝑦⟩ ∈ ((Base‘𝐺) × (Base‘𝐺)) ∧ ((-g𝐺)‘⟨𝑥, 𝑦⟩) ∈ { 0 })))
3129, 30syl 17 . . . . . . . . . 10 (𝐺 ∈ TopGrp → (⟨𝑥, 𝑦⟩ ∈ ((-g𝐺) “ { 0 }) ↔ (⟨𝑥, 𝑦⟩ ∈ ((Base‘𝐺) × (Base‘𝐺)) ∧ ((-g𝐺)‘⟨𝑥, 𝑦⟩) ∈ { 0 })))
32 opelxp 5660 . . . . . . . . . . . 12 (⟨𝑥, 𝑦⟩ ∈ ((Base‘𝐺) × (Base‘𝐺)) ↔ (𝑥 ∈ (Base‘𝐺) ∧ 𝑦 ∈ (Base‘𝐺)))
3332anbi1i 625 . . . . . . . . . . 11 ((⟨𝑥, 𝑦⟩ ∈ ((Base‘𝐺) × (Base‘𝐺)) ∧ ((-g𝐺)‘⟨𝑥, 𝑦⟩) ∈ { 0 }) ↔ ((𝑥 ∈ (Base‘𝐺) ∧ 𝑦 ∈ (Base‘𝐺)) ∧ ((-g𝐺)‘⟨𝑥, 𝑦⟩) ∈ { 0 }))
342, 3, 15grpsubeq0 18993 . . . . . . . . . . . . . . 15 ((𝐺 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐺) ∧ 𝑦 ∈ (Base‘𝐺)) → ((𝑥(-g𝐺)𝑦) = 0𝑥 = 𝑦))
35343expb 1121 . . . . . . . . . . . . . 14 ((𝐺 ∈ Grp ∧ (𝑥 ∈ (Base‘𝐺) ∧ 𝑦 ∈ (Base‘𝐺))) → ((𝑥(-g𝐺)𝑦) = 0𝑥 = 𝑦))
361, 35sylan 581 . . . . . . . . . . . . 13 ((𝐺 ∈ TopGrp ∧ (𝑥 ∈ (Base‘𝐺) ∧ 𝑦 ∈ (Base‘𝐺))) → ((𝑥(-g𝐺)𝑦) = 0𝑥 = 𝑦))
37 df-ov 7363 . . . . . . . . . . . . . . 15 (𝑥(-g𝐺)𝑦) = ((-g𝐺)‘⟨𝑥, 𝑦⟩)
3837eleq1i 2828 . . . . . . . . . . . . . 14 ((𝑥(-g𝐺)𝑦) ∈ { 0 } ↔ ((-g𝐺)‘⟨𝑥, 𝑦⟩) ∈ { 0 })
39 ovex 7393 . . . . . . . . . . . . . . 15 (𝑥(-g𝐺)𝑦) ∈ V
4039elsn 4583 . . . . . . . . . . . . . 14 ((𝑥(-g𝐺)𝑦) ∈ { 0 } ↔ (𝑥(-g𝐺)𝑦) = 0 )
4138, 40bitr3i 277 . . . . . . . . . . . . 13 (((-g𝐺)‘⟨𝑥, 𝑦⟩) ∈ { 0 } ↔ (𝑥(-g𝐺)𝑦) = 0 )
42 equcom 2020 . . . . . . . . . . . . 13 (𝑦 = 𝑥𝑥 = 𝑦)
4336, 41, 423bitr4g 314 . . . . . . . . . . . 12 ((𝐺 ∈ TopGrp ∧ (𝑥 ∈ (Base‘𝐺) ∧ 𝑦 ∈ (Base‘𝐺))) → (((-g𝐺)‘⟨𝑥, 𝑦⟩) ∈ { 0 } ↔ 𝑦 = 𝑥))
4443pm5.32da 579 . . . . . . . . . . 11 (𝐺 ∈ TopGrp → (((𝑥 ∈ (Base‘𝐺) ∧ 𝑦 ∈ (Base‘𝐺)) ∧ ((-g𝐺)‘⟨𝑥, 𝑦⟩) ∈ { 0 }) ↔ ((𝑥 ∈ (Base‘𝐺) ∧ 𝑦 ∈ (Base‘𝐺)) ∧ 𝑦 = 𝑥)))
4533, 44bitrid 283 . . . . . . . . . 10 (𝐺 ∈ TopGrp → ((⟨𝑥, 𝑦⟩ ∈ ((Base‘𝐺) × (Base‘𝐺)) ∧ ((-g𝐺)‘⟨𝑥, 𝑦⟩) ∈ { 0 }) ↔ ((𝑥 ∈ (Base‘𝐺) ∧ 𝑦 ∈ (Base‘𝐺)) ∧ 𝑦 = 𝑥)))
4631, 45bitrd 279 . . . . . . . . 9 (𝐺 ∈ TopGrp → (⟨𝑥, 𝑦⟩ ∈ ((-g𝐺) “ { 0 }) ↔ ((𝑥 ∈ (Base‘𝐺) ∧ 𝑦 ∈ (Base‘𝐺)) ∧ 𝑦 = 𝑥)))
47 df-br 5087 . . . . . . . . 9 (𝑥((-g𝐺) “ { 0 })𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ ((-g𝐺) “ { 0 }))
48 eleq1w 2820 . . . . . . . . . . . 12 (𝑦 = 𝑥 → (𝑦 ∈ (Base‘𝐺) ↔ 𝑥 ∈ (Base‘𝐺)))
4948biimparc 479 . . . . . . . . . . 11 ((𝑥 ∈ (Base‘𝐺) ∧ 𝑦 = 𝑥) → 𝑦 ∈ (Base‘𝐺))
5049pm4.71i 559 . . . . . . . . . 10 ((𝑥 ∈ (Base‘𝐺) ∧ 𝑦 = 𝑥) ↔ ((𝑥 ∈ (Base‘𝐺) ∧ 𝑦 = 𝑥) ∧ 𝑦 ∈ (Base‘𝐺)))
51 an32 647 . . . . . . . . . 10 (((𝑥 ∈ (Base‘𝐺) ∧ 𝑦 ∈ (Base‘𝐺)) ∧ 𝑦 = 𝑥) ↔ ((𝑥 ∈ (Base‘𝐺) ∧ 𝑦 = 𝑥) ∧ 𝑦 ∈ (Base‘𝐺)))
5250, 51bitr4i 278 . . . . . . . . 9 ((𝑥 ∈ (Base‘𝐺) ∧ 𝑦 = 𝑥) ↔ ((𝑥 ∈ (Base‘𝐺) ∧ 𝑦 ∈ (Base‘𝐺)) ∧ 𝑦 = 𝑥))
5346, 47, 523bitr4g 314 . . . . . . . 8 (𝐺 ∈ TopGrp → (𝑥((-g𝐺) “ { 0 })𝑦 ↔ (𝑥 ∈ (Base‘𝐺) ∧ 𝑦 = 𝑥)))
5453opabbidv 5152 . . . . . . 7 (𝐺 ∈ TopGrp → {⟨𝑥, 𝑦⟩ ∣ 𝑥((-g𝐺) “ { 0 })𝑦} = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (Base‘𝐺) ∧ 𝑦 = 𝑥)})
55 opabresid 6009 . . . . . . 7 ( I ↾ (Base‘𝐺)) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (Base‘𝐺) ∧ 𝑦 = 𝑥)}
5654, 55eqtr4di 2790 . . . . . 6 (𝐺 ∈ TopGrp → {⟨𝑥, 𝑦⟩ ∣ 𝑥((-g𝐺) “ { 0 })𝑦} = ( I ↾ (Base‘𝐺)))
579reseq2d 5938 . . . . . 6 (𝐺 ∈ TopGrp → ( I ↾ (Base‘𝐺)) = ( I ↾ 𝐽))
5828, 56, 573eqtrd 2776 . . . . 5 (𝐺 ∈ TopGrp → ((-g𝐺) “ { 0 }) = ( I ↾ 𝐽))
5958eleq1d 2822 . . . 4 (𝐺 ∈ TopGrp → (((-g𝐺) “ { 0 }) ∈ (Clsd‘(𝐽 ×t 𝐽)) ↔ ( I ↾ 𝐽) ∈ (Clsd‘(𝐽 ×t 𝐽))))
6019, 59sylibd 239 . . 3 (𝐺 ∈ TopGrp → ({ 0 } ∈ (Clsd‘𝐽) → ( I ↾ 𝐽) ∈ (Clsd‘(𝐽 ×t 𝐽))))
61 topontop 22888 . . . . 5 (𝐽 ∈ (TopOn‘(Base‘𝐺)) → 𝐽 ∈ Top)
627, 61syl 17 . . . 4 (𝐺 ∈ TopGrp → 𝐽 ∈ Top)
6311hausdiag 23620 . . . . 5 (𝐽 ∈ Haus ↔ (𝐽 ∈ Top ∧ ( I ↾ 𝐽) ∈ (Clsd‘(𝐽 ×t 𝐽))))
6463baib 535 . . . 4 (𝐽 ∈ Top → (𝐽 ∈ Haus ↔ ( I ↾ 𝐽) ∈ (Clsd‘(𝐽 ×t 𝐽))))
6562, 64syl 17 . . 3 (𝐺 ∈ TopGrp → (𝐽 ∈ Haus ↔ ( I ↾ 𝐽) ∈ (Clsd‘(𝐽 ×t 𝐽))))
6660, 65sylibrd 259 . 2 (𝐺 ∈ TopGrp → ({ 0 } ∈ (Clsd‘𝐽) → 𝐽 ∈ Haus))
6714, 66impbid 212 1 (𝐺 ∈ TopGrp → (𝐽 ∈ Haus ↔ { 0 } ∈ (Clsd‘𝐽)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1542  wcel 2114  wss 3890  {csn 4568  cop 4574   cuni 4851   class class class wbr 5086  {copab 5148   I cid 5518   × cxp 5622  ccnv 5623  cres 5626  cima 5627  Rel wrel 5629   Fn wfn 6487  wf 6488  cfv 6492  (class class class)co 7360  Basecbs 17170  TopOpenctopn 17375  0gc0g 17393  Grpcgrp 18900  -gcsg 18902  Topctop 22868  TopOnctopon 22885  Clsdccld 22991   Cn ccn 23199  Hauscha 23283   ×t ctx 23535  TopGrpctgp 24046
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 5231  ax-nul 5241  ax-pow 5302  ax-pr 5370  ax-un 7682
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-rmo 3343  df-reu 3344  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 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-fo 6498  df-fv 6500  df-riota 7317  df-ov 7363  df-oprab 7364  df-mpo 7365  df-1st 7935  df-2nd 7936  df-map 8768  df-0g 17395  df-topgen 17397  df-plusf 18598  df-mgm 18599  df-sgrp 18678  df-mnd 18694  df-grp 18903  df-minusg 18904  df-sbg 18905  df-top 22869  df-topon 22886  df-topsp 22908  df-bases 22921  df-cld 22994  df-cn 23202  df-t1 23289  df-haus 23290  df-tx 23537  df-tmd 24047  df-tgp 24048
This theorem is referenced by:  tgpt1  24093  qustgphaus  24098
  Copyright terms: Public domain W3C validator