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

Theorem tgphaus 24061
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 24022 . . . . 5 (𝐺 ∈ TopGrp → 𝐺 ∈ Grp)
2 eqid 2736 . . . . . 6 (Base‘𝐺) = (Base‘𝐺)
3 tgphaus.1 . . . . . 6 0 = (0g𝐺)
42, 3grpidcl 18895 . . . . 5 (𝐺 ∈ Grp → 0 ∈ (Base‘𝐺))
51, 4syl 17 . . . 4 (𝐺 ∈ TopGrp → 0 ∈ (Base‘𝐺))
6 tgphaus.j . . . . . 6 𝐽 = (TopOpen‘𝐺)
76, 2tgptopon 24026 . . . . 5 (𝐺 ∈ TopGrp → 𝐽 ∈ (TopOn‘(Base‘𝐺)))
8 toponuni 22858 . . . . 5 (𝐽 ∈ (TopOn‘(Base‘𝐺)) → (Base‘𝐺) = 𝐽)
97, 8syl 17 . . . 4 (𝐺 ∈ TopGrp → (Base‘𝐺) = 𝐽)
105, 9eleqtrd 2838 . . 3 (𝐺 ∈ TopGrp → 0 𝐽)
11 eqid 2736 . . . . 5 𝐽 = 𝐽
1211sncld 23315 . . . 4 ((𝐽 ∈ Haus ∧ 0 𝐽) → { 0 } ∈ (Clsd‘𝐽))
1312expcom 413 . . 3 ( 0 𝐽 → (𝐽 ∈ Haus → { 0 } ∈ (Clsd‘𝐽)))
1410, 13syl 17 . 2 (𝐺 ∈ TopGrp → (𝐽 ∈ Haus → { 0 } ∈ (Clsd‘𝐽)))
15 eqid 2736 . . . . . 6 (-g𝐺) = (-g𝐺)
166, 15tgpsubcn 24034 . . . . 5 (𝐺 ∈ TopGrp → (-g𝐺) ∈ ((𝐽 ×t 𝐽) Cn 𝐽))
17 cnclima 23212 . . . . . 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 18949 . . . . . . . . . 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 7003 . . . . . . . . . . 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 624 . . . . . . . . . . 11 ((⟨𝑥, 𝑦⟩ ∈ ((Base‘𝐺) × (Base‘𝐺)) ∧ ((-g𝐺)‘⟨𝑥, 𝑦⟩) ∈ { 0 }) ↔ ((𝑥 ∈ (Base‘𝐺) ∧ 𝑦 ∈ (Base‘𝐺)) ∧ ((-g𝐺)‘⟨𝑥, 𝑦⟩) ∈ { 0 }))
342, 3, 15grpsubeq0 18956 . . . . . . . . . . . . . . 15 ((𝐺 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐺) ∧ 𝑦 ∈ (Base‘𝐺)) → ((𝑥(-g𝐺)𝑦) = 0𝑥 = 𝑦))
35343expb 1120 . . . . . . . . . . . . . 14 ((𝐺 ∈ Grp ∧ (𝑥 ∈ (Base‘𝐺) ∧ 𝑦 ∈ (Base‘𝐺))) → ((𝑥(-g𝐺)𝑦) = 0𝑥 = 𝑦))
361, 35sylan 580 . . . . . . . . . . . . 13 ((𝐺 ∈ TopGrp ∧ (𝑥 ∈ (Base‘𝐺) ∧ 𝑦 ∈ (Base‘𝐺))) → ((𝑥(-g𝐺)𝑦) = 0𝑥 = 𝑦))
37 df-ov 7361 . . . . . . . . . . . . . . 15 (𝑥(-g𝐺)𝑦) = ((-g𝐺)‘⟨𝑥, 𝑦⟩)
3837eleq1i 2827 . . . . . . . . . . . . . 14 ((𝑥(-g𝐺)𝑦) ∈ { 0 } ↔ ((-g𝐺)‘⟨𝑥, 𝑦⟩) ∈ { 0 })
39 ovex 7391 . . . . . . . . . . . . . . 15 (𝑥(-g𝐺)𝑦) ∈ V
4039elsn 4595 . . . . . . . . . . . . . 14 ((𝑥(-g𝐺)𝑦) ∈ { 0 } ↔ (𝑥(-g𝐺)𝑦) = 0 )
4138, 40bitr3i 277 . . . . . . . . . . . . 13 (((-g𝐺)‘⟨𝑥, 𝑦⟩) ∈ { 0 } ↔ (𝑥(-g𝐺)𝑦) = 0 )
42 equcom 2019 . . . . . . . . . . . . 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 5099 . . . . . . . . 9 (𝑥((-g𝐺) “ { 0 })𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ ((-g𝐺) “ { 0 }))
48 eleq1w 2819 . . . . . . . . . . . 12 (𝑦 = 𝑥 → (𝑦 ∈ (Base‘𝐺) ↔ 𝑥 ∈ (Base‘𝐺)))
4948biimparc 479 . . . . . . . . . . 11 ((𝑥 ∈ (Base‘𝐺) ∧ 𝑦 = 𝑥) → 𝑦 ∈ (Base‘𝐺))
5049pm4.71i 559 . . . . . . . . . 10 ((𝑥 ∈ (Base‘𝐺) ∧ 𝑦 = 𝑥) ↔ ((𝑥 ∈ (Base‘𝐺) ∧ 𝑦 = 𝑥) ∧ 𝑦 ∈ (Base‘𝐺)))
51 an32 646 . . . . . . . . . 10 (((𝑥 ∈ (Base‘𝐺) ∧ 𝑦 ∈ (Base‘𝐺)) ∧ 𝑦 = 𝑥) ↔ ((𝑥 ∈ (Base‘𝐺) ∧ 𝑦 = 𝑥) ∧ 𝑦 ∈ (Base‘𝐺)))
5250, 51bitr4i 278 . . . . . . . . 9 ((𝑥 ∈ (Base‘𝐺) ∧ 𝑦 = 𝑥) ↔ ((𝑥 ∈ (Base‘𝐺) ∧ 𝑦 ∈ (Base‘𝐺)) ∧ 𝑦 = 𝑥))
5346, 47, 523bitr4g 314 . . . . . . . 8 (𝐺 ∈ TopGrp → (𝑥((-g𝐺) “ { 0 })𝑦 ↔ (𝑥 ∈ (Base‘𝐺) ∧ 𝑦 = 𝑥)))
5453opabbidv 5164 . . . . . . 7 (𝐺 ∈ TopGrp → {⟨𝑥, 𝑦⟩ ∣ 𝑥((-g𝐺) “ { 0 })𝑦} = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (Base‘𝐺) ∧ 𝑦 = 𝑥)})
55 opabresid 6009 . . . . . . 7 ( I ↾ (Base‘𝐺)) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (Base‘𝐺) ∧ 𝑦 = 𝑥)}
5654, 55eqtr4di 2789 . . . . . 6 (𝐺 ∈ TopGrp → {⟨𝑥, 𝑦⟩ ∣ 𝑥((-g𝐺) “ { 0 })𝑦} = ( I ↾ (Base‘𝐺)))
579reseq2d 5938 . . . . . 6 (𝐺 ∈ TopGrp → ( I ↾ (Base‘𝐺)) = ( I ↾ 𝐽))
5828, 56, 573eqtrd 2775 . . . . 5 (𝐺 ∈ TopGrp → ((-g𝐺) “ { 0 }) = ( I ↾ 𝐽))
5958eleq1d 2821 . . . 4 (𝐺 ∈ TopGrp → (((-g𝐺) “ { 0 }) ∈ (Clsd‘(𝐽 ×t 𝐽)) ↔ ( I ↾ 𝐽) ∈ (Clsd‘(𝐽 ×t 𝐽))))
6019, 59sylibd 239 . . 3 (𝐺 ∈ TopGrp → ({ 0 } ∈ (Clsd‘𝐽) → ( I ↾ 𝐽) ∈ (Clsd‘(𝐽 ×t 𝐽))))
61 topontop 22857 . . . . 5 (𝐽 ∈ (TopOn‘(Base‘𝐺)) → 𝐽 ∈ Top)
627, 61syl 17 . . . 4 (𝐺 ∈ TopGrp → 𝐽 ∈ Top)
6311hausdiag 23589 . . . . 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 1541  wcel 2113  wss 3901  {csn 4580  cop 4586   cuni 4863   class class class wbr 5098  {copab 5160   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 7358  Basecbs 17136  TopOpenctopn 17341  0gc0g 17359  Grpcgrp 18863  -gcsg 18865  Topctop 22837  TopOnctopon 22854  Clsdccld 22960   Cn ccn 23168  Hauscha 23252   ×t ctx 23504  TopGrpctgp 24015
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2184  ax-ext 2708  ax-sep 5241  ax-nul 5251  ax-pow 5310  ax-pr 5377  ax-un 7680
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-rmo 3350  df-reu 3351  df-rab 3400  df-v 3442  df-sbc 3741  df-csb 3850  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-iun 4948  df-br 5099  df-opab 5161  df-mpt 5180  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 7315  df-ov 7361  df-oprab 7362  df-mpo 7363  df-1st 7933  df-2nd 7934  df-map 8765  df-0g 17361  df-topgen 17363  df-plusf 18564  df-mgm 18565  df-sgrp 18644  df-mnd 18660  df-grp 18866  df-minusg 18867  df-sbg 18868  df-top 22838  df-topon 22855  df-topsp 22877  df-bases 22890  df-cld 22963  df-cn 23171  df-t1 23258  df-haus 23259  df-tx 23506  df-tmd 24016  df-tgp 24017
This theorem is referenced by:  tgpt1  24062  qustgphaus  24067
  Copyright terms: Public domain W3C validator