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

Theorem snclseqg 24081
Description: The coset of the closure of the identity is the closure of a point. (Contributed by Mario Carneiro, 22-Sep-2015.)
Hypotheses
Ref Expression
snclseqg.x 𝑋 = (Base‘𝐺)
snclseqg.j 𝐽 = (TopOpen‘𝐺)
snclseqg.z 0 = (0g𝐺)
snclseqg.r = (𝐺 ~QG 𝑆)
snclseqg.s 𝑆 = ((cls‘𝐽)‘{ 0 })
Assertion
Ref Expression
snclseqg ((𝐺 ∈ TopGrp ∧ 𝐴𝑋) → [𝐴] = ((cls‘𝐽)‘{𝐴}))

Proof of Theorem snclseqg
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 snclseqg.s . . . 4 𝑆 = ((cls‘𝐽)‘{ 0 })
21imaeq2i 6023 . . 3 ((𝑥𝑋 ↦ (𝐴(+g𝐺)𝑥)) “ 𝑆) = ((𝑥𝑋 ↦ (𝐴(+g𝐺)𝑥)) “ ((cls‘𝐽)‘{ 0 }))
3 tgpgrp 24043 . . . . 5 (𝐺 ∈ TopGrp → 𝐺 ∈ Grp)
43adantr 480 . . . 4 ((𝐺 ∈ TopGrp ∧ 𝐴𝑋) → 𝐺 ∈ Grp)
5 snclseqg.j . . . . . . . . . 10 𝐽 = (TopOpen‘𝐺)
6 snclseqg.x . . . . . . . . . 10 𝑋 = (Base‘𝐺)
75, 6tgptopon 24047 . . . . . . . . 9 (𝐺 ∈ TopGrp → 𝐽 ∈ (TopOn‘𝑋))
87adantr 480 . . . . . . . 8 ((𝐺 ∈ TopGrp ∧ 𝐴𝑋) → 𝐽 ∈ (TopOn‘𝑋))
9 topontop 22878 . . . . . . . 8 (𝐽 ∈ (TopOn‘𝑋) → 𝐽 ∈ Top)
108, 9syl 17 . . . . . . 7 ((𝐺 ∈ TopGrp ∧ 𝐴𝑋) → 𝐽 ∈ Top)
11 snclseqg.z . . . . . . . . . . 11 0 = (0g𝐺)
126, 11grpidcl 18941 . . . . . . . . . 10 (𝐺 ∈ Grp → 0𝑋)
134, 12syl 17 . . . . . . . . 9 ((𝐺 ∈ TopGrp ∧ 𝐴𝑋) → 0𝑋)
1413snssd 4730 . . . . . . . 8 ((𝐺 ∈ TopGrp ∧ 𝐴𝑋) → { 0 } ⊆ 𝑋)
15 toponuni 22879 . . . . . . . . 9 (𝐽 ∈ (TopOn‘𝑋) → 𝑋 = 𝐽)
168, 15syl 17 . . . . . . . 8 ((𝐺 ∈ TopGrp ∧ 𝐴𝑋) → 𝑋 = 𝐽)
1714, 16sseqtrd 3958 . . . . . . 7 ((𝐺 ∈ TopGrp ∧ 𝐴𝑋) → { 0 } ⊆ 𝐽)
18 eqid 2736 . . . . . . . 8 𝐽 = 𝐽
1918clsss3 23024 . . . . . . 7 ((𝐽 ∈ Top ∧ { 0 } ⊆ 𝐽) → ((cls‘𝐽)‘{ 0 }) ⊆ 𝐽)
2010, 17, 19syl2anc 585 . . . . . 6 ((𝐺 ∈ TopGrp ∧ 𝐴𝑋) → ((cls‘𝐽)‘{ 0 }) ⊆ 𝐽)
2120, 16sseqtrrd 3959 . . . . 5 ((𝐺 ∈ TopGrp ∧ 𝐴𝑋) → ((cls‘𝐽)‘{ 0 }) ⊆ 𝑋)
221, 21eqsstrid 3960 . . . 4 ((𝐺 ∈ TopGrp ∧ 𝐴𝑋) → 𝑆𝑋)
23 simpr 484 . . . 4 ((𝐺 ∈ TopGrp ∧ 𝐴𝑋) → 𝐴𝑋)
24 snclseqg.r . . . . 5 = (𝐺 ~QG 𝑆)
25 eqid 2736 . . . . 5 (+g𝐺) = (+g𝐺)
266, 24, 25eqglact 19154 . . . 4 ((𝐺 ∈ Grp ∧ 𝑆𝑋𝐴𝑋) → [𝐴] = ((𝑥𝑋 ↦ (𝐴(+g𝐺)𝑥)) “ 𝑆))
274, 22, 23, 26syl3anc 1374 . . 3 ((𝐺 ∈ TopGrp ∧ 𝐴𝑋) → [𝐴] = ((𝑥𝑋 ↦ (𝐴(+g𝐺)𝑥)) “ 𝑆))
28 eqid 2736 . . . . 5 (𝑥𝑋 ↦ (𝐴(+g𝐺)𝑥)) = (𝑥𝑋 ↦ (𝐴(+g𝐺)𝑥))
2928, 6, 25, 5tgplacthmeo 24068 . . . 4 ((𝐺 ∈ TopGrp ∧ 𝐴𝑋) → (𝑥𝑋 ↦ (𝐴(+g𝐺)𝑥)) ∈ (𝐽Homeo𝐽))
3018hmeocls 23733 . . . 4 (((𝑥𝑋 ↦ (𝐴(+g𝐺)𝑥)) ∈ (𝐽Homeo𝐽) ∧ { 0 } ⊆ 𝐽) → ((cls‘𝐽)‘((𝑥𝑋 ↦ (𝐴(+g𝐺)𝑥)) “ { 0 })) = ((𝑥𝑋 ↦ (𝐴(+g𝐺)𝑥)) “ ((cls‘𝐽)‘{ 0 })))
3129, 17, 30syl2anc 585 . . 3 ((𝐺 ∈ TopGrp ∧ 𝐴𝑋) → ((cls‘𝐽)‘((𝑥𝑋 ↦ (𝐴(+g𝐺)𝑥)) “ { 0 })) = ((𝑥𝑋 ↦ (𝐴(+g𝐺)𝑥)) “ ((cls‘𝐽)‘{ 0 })))
322, 27, 313eqtr4a 2797 . 2 ((𝐺 ∈ TopGrp ∧ 𝐴𝑋) → [𝐴] = ((cls‘𝐽)‘((𝑥𝑋 ↦ (𝐴(+g𝐺)𝑥)) “ { 0 })))
33 df-ima 5644 . . . . 5 ((𝑥𝑋 ↦ (𝐴(+g𝐺)𝑥)) “ { 0 }) = ran ((𝑥𝑋 ↦ (𝐴(+g𝐺)𝑥)) ↾ { 0 })
3414resmptd 6005 . . . . . 6 ((𝐺 ∈ TopGrp ∧ 𝐴𝑋) → ((𝑥𝑋 ↦ (𝐴(+g𝐺)𝑥)) ↾ { 0 }) = (𝑥 ∈ { 0 } ↦ (𝐴(+g𝐺)𝑥)))
3534rneqd 5893 . . . . 5 ((𝐺 ∈ TopGrp ∧ 𝐴𝑋) → ran ((𝑥𝑋 ↦ (𝐴(+g𝐺)𝑥)) ↾ { 0 }) = ran (𝑥 ∈ { 0 } ↦ (𝐴(+g𝐺)𝑥)))
3633, 35eqtrid 2783 . . . 4 ((𝐺 ∈ TopGrp ∧ 𝐴𝑋) → ((𝑥𝑋 ↦ (𝐴(+g𝐺)𝑥)) “ { 0 }) = ran (𝑥 ∈ { 0 } ↦ (𝐴(+g𝐺)𝑥)))
3711fvexi 6854 . . . . . . . 8 0 ∈ V
38 oveq2 7375 . . . . . . . . 9 (𝑥 = 0 → (𝐴(+g𝐺)𝑥) = (𝐴(+g𝐺) 0 ))
3938eqeq2d 2747 . . . . . . . 8 (𝑥 = 0 → (𝑦 = (𝐴(+g𝐺)𝑥) ↔ 𝑦 = (𝐴(+g𝐺) 0 )))
4037, 39rexsn 4626 . . . . . . 7 (∃𝑥 ∈ { 0 }𝑦 = (𝐴(+g𝐺)𝑥) ↔ 𝑦 = (𝐴(+g𝐺) 0 ))
416, 25, 11grprid 18944 . . . . . . . . 9 ((𝐺 ∈ Grp ∧ 𝐴𝑋) → (𝐴(+g𝐺) 0 ) = 𝐴)
423, 41sylan 581 . . . . . . . 8 ((𝐺 ∈ TopGrp ∧ 𝐴𝑋) → (𝐴(+g𝐺) 0 ) = 𝐴)
4342eqeq2d 2747 . . . . . . 7 ((𝐺 ∈ TopGrp ∧ 𝐴𝑋) → (𝑦 = (𝐴(+g𝐺) 0 ) ↔ 𝑦 = 𝐴))
4440, 43bitrid 283 . . . . . 6 ((𝐺 ∈ TopGrp ∧ 𝐴𝑋) → (∃𝑥 ∈ { 0 }𝑦 = (𝐴(+g𝐺)𝑥) ↔ 𝑦 = 𝐴))
4544abbidv 2802 . . . . 5 ((𝐺 ∈ TopGrp ∧ 𝐴𝑋) → {𝑦 ∣ ∃𝑥 ∈ { 0 }𝑦 = (𝐴(+g𝐺)𝑥)} = {𝑦𝑦 = 𝐴})
46 eqid 2736 . . . . . 6 (𝑥 ∈ { 0 } ↦ (𝐴(+g𝐺)𝑥)) = (𝑥 ∈ { 0 } ↦ (𝐴(+g𝐺)𝑥))
4746rnmpt 5912 . . . . 5 ran (𝑥 ∈ { 0 } ↦ (𝐴(+g𝐺)𝑥)) = {𝑦 ∣ ∃𝑥 ∈ { 0 }𝑦 = (𝐴(+g𝐺)𝑥)}
48 df-sn 4568 . . . . 5 {𝐴} = {𝑦𝑦 = 𝐴}
4945, 47, 483eqtr4g 2796 . . . 4 ((𝐺 ∈ TopGrp ∧ 𝐴𝑋) → ran (𝑥 ∈ { 0 } ↦ (𝐴(+g𝐺)𝑥)) = {𝐴})
5036, 49eqtrd 2771 . . 3 ((𝐺 ∈ TopGrp ∧ 𝐴𝑋) → ((𝑥𝑋 ↦ (𝐴(+g𝐺)𝑥)) “ { 0 }) = {𝐴})
5150fveq2d 6844 . 2 ((𝐺 ∈ TopGrp ∧ 𝐴𝑋) → ((cls‘𝐽)‘((𝑥𝑋 ↦ (𝐴(+g𝐺)𝑥)) “ { 0 })) = ((cls‘𝐽)‘{𝐴}))
5232, 51eqtrd 2771 1 ((𝐺 ∈ TopGrp ∧ 𝐴𝑋) → [𝐴] = ((cls‘𝐽)‘{𝐴}))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1542  wcel 2114  {cab 2714  wrex 3061  wss 3889  {csn 4567   cuni 4850  cmpt 5166  ran crn 5632  cres 5633  cima 5634  cfv 6498  (class class class)co 7367  [cec 8641  Basecbs 17179  +gcplusg 17220  TopOpenctopn 17384  0gc0g 17402  Grpcgrp 18909   ~QG cqg 19098  Topctop 22858  TopOnctopon 22875  clsccl 22983  Homeochmeo 23718  TopGrpctgp 24036
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 2708  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689
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 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-rmo 3342  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-int 4890  df-iun 4935  df-iin 4936  df-br 5086  df-opab 5148  df-mpt 5167  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-riota 7324  df-ov 7370  df-oprab 7371  df-mpo 7372  df-1st 7942  df-2nd 7943  df-ec 8645  df-map 8775  df-0g 17404  df-topgen 17406  df-plusf 18607  df-mgm 18608  df-sgrp 18687  df-mnd 18703  df-grp 18912  df-minusg 18913  df-eqg 19101  df-top 22859  df-topon 22876  df-topsp 22898  df-bases 22911  df-cld 22984  df-cls 22986  df-cn 23192  df-cnp 23193  df-tx 23527  df-hmeo 23720  df-tmd 24037  df-tgp 24038
This theorem is referenced by:  tgptsmscls  24115
  Copyright terms: Public domain W3C validator