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

Theorem snclseqg 24091
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 6017 . . 3 ((𝑥𝑋 ↦ (𝐴(+g𝐺)𝑥)) “ 𝑆) = ((𝑥𝑋 ↦ (𝐴(+g𝐺)𝑥)) “ ((cls‘𝐽)‘{ 0 }))
3 tgpgrp 24053 . . . . 5 (𝐺 ∈ TopGrp → 𝐺 ∈ Grp)
43adantr 480 . . . 4 ((𝐺 ∈ TopGrp ∧ 𝐴𝑋) → 𝐺 ∈ Grp)
5 snclseqg.j . . . . . . . . . 10 𝐽 = (TopOpen‘𝐺)
6 snclseqg.x . . . . . . . . . 10 𝑋 = (Base‘𝐺)
75, 6tgptopon 24057 . . . . . . . . 9 (𝐺 ∈ TopGrp → 𝐽 ∈ (TopOn‘𝑋))
87adantr 480 . . . . . . . 8 ((𝐺 ∈ TopGrp ∧ 𝐴𝑋) → 𝐽 ∈ (TopOn‘𝑋))
9 topontop 22888 . . . . . . . 8 (𝐽 ∈ (TopOn‘𝑋) → 𝐽 ∈ Top)
108, 9syl 17 . . . . . . 7 ((𝐺 ∈ TopGrp ∧ 𝐴𝑋) → 𝐽 ∈ Top)
11 snclseqg.z . . . . . . . . . . 11 0 = (0g𝐺)
126, 11grpidcl 18932 . . . . . . . . . 10 (𝐺 ∈ Grp → 0𝑋)
134, 12syl 17 . . . . . . . . 9 ((𝐺 ∈ TopGrp ∧ 𝐴𝑋) → 0𝑋)
1413snssd 4753 . . . . . . . 8 ((𝐺 ∈ TopGrp ∧ 𝐴𝑋) → { 0 } ⊆ 𝑋)
15 toponuni 22889 . . . . . . . . 9 (𝐽 ∈ (TopOn‘𝑋) → 𝑋 = 𝐽)
168, 15syl 17 . . . . . . . 8 ((𝐺 ∈ TopGrp ∧ 𝐴𝑋) → 𝑋 = 𝐽)
1714, 16sseqtrd 3959 . . . . . . 7 ((𝐺 ∈ TopGrp ∧ 𝐴𝑋) → { 0 } ⊆ 𝐽)
18 eqid 2737 . . . . . . . 8 𝐽 = 𝐽
1918clsss3 23034 . . . . . . 7 ((𝐽 ∈ Top ∧ { 0 } ⊆ 𝐽) → ((cls‘𝐽)‘{ 0 }) ⊆ 𝐽)
2010, 17, 19syl2anc 585 . . . . . 6 ((𝐺 ∈ TopGrp ∧ 𝐴𝑋) → ((cls‘𝐽)‘{ 0 }) ⊆ 𝐽)
2120, 16sseqtrrd 3960 . . . . 5 ((𝐺 ∈ TopGrp ∧ 𝐴𝑋) → ((cls‘𝐽)‘{ 0 }) ⊆ 𝑋)
221, 21eqsstrid 3961 . . . 4 ((𝐺 ∈ TopGrp ∧ 𝐴𝑋) → 𝑆𝑋)
23 simpr 484 . . . 4 ((𝐺 ∈ TopGrp ∧ 𝐴𝑋) → 𝐴𝑋)
24 snclseqg.r . . . . 5 = (𝐺 ~QG 𝑆)
25 eqid 2737 . . . . 5 (+g𝐺) = (+g𝐺)
266, 24, 25eqglact 19145 . . . 4 ((𝐺 ∈ Grp ∧ 𝑆𝑋𝐴𝑋) → [𝐴] = ((𝑥𝑋 ↦ (𝐴(+g𝐺)𝑥)) “ 𝑆))
274, 22, 23, 26syl3anc 1374 . . 3 ((𝐺 ∈ TopGrp ∧ 𝐴𝑋) → [𝐴] = ((𝑥𝑋 ↦ (𝐴(+g𝐺)𝑥)) “ 𝑆))
28 eqid 2737 . . . . 5 (𝑥𝑋 ↦ (𝐴(+g𝐺)𝑥)) = (𝑥𝑋 ↦ (𝐴(+g𝐺)𝑥))
2928, 6, 25, 5tgplacthmeo 24078 . . . 4 ((𝐺 ∈ TopGrp ∧ 𝐴𝑋) → (𝑥𝑋 ↦ (𝐴(+g𝐺)𝑥)) ∈ (𝐽Homeo𝐽))
3018hmeocls 23743 . . . 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 2798 . 2 ((𝐺 ∈ TopGrp ∧ 𝐴𝑋) → [𝐴] = ((cls‘𝐽)‘((𝑥𝑋 ↦ (𝐴(+g𝐺)𝑥)) “ { 0 })))
33 df-ima 5637 . . . . 5 ((𝑥𝑋 ↦ (𝐴(+g𝐺)𝑥)) “ { 0 }) = ran ((𝑥𝑋 ↦ (𝐴(+g𝐺)𝑥)) ↾ { 0 })
3414resmptd 5999 . . . . . 6 ((𝐺 ∈ TopGrp ∧ 𝐴𝑋) → ((𝑥𝑋 ↦ (𝐴(+g𝐺)𝑥)) ↾ { 0 }) = (𝑥 ∈ { 0 } ↦ (𝐴(+g𝐺)𝑥)))
3534rneqd 5887 . . . . 5 ((𝐺 ∈ TopGrp ∧ 𝐴𝑋) → ran ((𝑥𝑋 ↦ (𝐴(+g𝐺)𝑥)) ↾ { 0 }) = ran (𝑥 ∈ { 0 } ↦ (𝐴(+g𝐺)𝑥)))
3633, 35eqtrid 2784 . . . 4 ((𝐺 ∈ TopGrp ∧ 𝐴𝑋) → ((𝑥𝑋 ↦ (𝐴(+g𝐺)𝑥)) “ { 0 }) = ran (𝑥 ∈ { 0 } ↦ (𝐴(+g𝐺)𝑥)))
3711fvexi 6848 . . . . . . . 8 0 ∈ V
38 oveq2 7368 . . . . . . . . 9 (𝑥 = 0 → (𝐴(+g𝐺)𝑥) = (𝐴(+g𝐺) 0 ))
3938eqeq2d 2748 . . . . . . . 8 (𝑥 = 0 → (𝑦 = (𝐴(+g𝐺)𝑥) ↔ 𝑦 = (𝐴(+g𝐺) 0 )))
4037, 39rexsn 4627 . . . . . . 7 (∃𝑥 ∈ { 0 }𝑦 = (𝐴(+g𝐺)𝑥) ↔ 𝑦 = (𝐴(+g𝐺) 0 ))
416, 25, 11grprid 18935 . . . . . . . . 9 ((𝐺 ∈ Grp ∧ 𝐴𝑋) → (𝐴(+g𝐺) 0 ) = 𝐴)
423, 41sylan 581 . . . . . . . 8 ((𝐺 ∈ TopGrp ∧ 𝐴𝑋) → (𝐴(+g𝐺) 0 ) = 𝐴)
4342eqeq2d 2748 . . . . . . 7 ((𝐺 ∈ TopGrp ∧ 𝐴𝑋) → (𝑦 = (𝐴(+g𝐺) 0 ) ↔ 𝑦 = 𝐴))
4440, 43bitrid 283 . . . . . 6 ((𝐺 ∈ TopGrp ∧ 𝐴𝑋) → (∃𝑥 ∈ { 0 }𝑦 = (𝐴(+g𝐺)𝑥) ↔ 𝑦 = 𝐴))
4544abbidv 2803 . . . . 5 ((𝐺 ∈ TopGrp ∧ 𝐴𝑋) → {𝑦 ∣ ∃𝑥 ∈ { 0 }𝑦 = (𝐴(+g𝐺)𝑥)} = {𝑦𝑦 = 𝐴})
46 eqid 2737 . . . . . 6 (𝑥 ∈ { 0 } ↦ (𝐴(+g𝐺)𝑥)) = (𝑥 ∈ { 0 } ↦ (𝐴(+g𝐺)𝑥))
4746rnmpt 5906 . . . . 5 ran (𝑥 ∈ { 0 } ↦ (𝐴(+g𝐺)𝑥)) = {𝑦 ∣ ∃𝑥 ∈ { 0 }𝑦 = (𝐴(+g𝐺)𝑥)}
48 df-sn 4569 . . . . 5 {𝐴} = {𝑦𝑦 = 𝐴}
4945, 47, 483eqtr4g 2797 . . . 4 ((𝐺 ∈ TopGrp ∧ 𝐴𝑋) → ran (𝑥 ∈ { 0 } ↦ (𝐴(+g𝐺)𝑥)) = {𝐴})
5036, 49eqtrd 2772 . . 3 ((𝐺 ∈ TopGrp ∧ 𝐴𝑋) → ((𝑥𝑋 ↦ (𝐴(+g𝐺)𝑥)) “ { 0 }) = {𝐴})
5150fveq2d 6838 . 2 ((𝐺 ∈ TopGrp ∧ 𝐴𝑋) → ((cls‘𝐽)‘((𝑥𝑋 ↦ (𝐴(+g𝐺)𝑥)) “ { 0 })) = ((cls‘𝐽)‘{𝐴}))
5232, 51eqtrd 2772 1 ((𝐺 ∈ TopGrp ∧ 𝐴𝑋) → [𝐴] = ((cls‘𝐽)‘{𝐴}))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1542  wcel 2114  {cab 2715  wrex 3062  wss 3890  {csn 4568   cuni 4851  cmpt 5167  ran crn 5625  cres 5626  cima 5627  cfv 6492  (class class class)co 7360  [cec 8634  Basecbs 17170  +gcplusg 17211  TopOpenctopn 17375  0gc0g 17393  Grpcgrp 18900   ~QG cqg 19089  Topctop 22868  TopOnctopon 22885  clsccl 22993  Homeochmeo 23728  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-rep 5212  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-int 4891  df-iun 4936  df-iin 4937  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-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-riota 7317  df-ov 7363  df-oprab 7364  df-mpo 7365  df-1st 7935  df-2nd 7936  df-ec 8638  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-eqg 19092  df-top 22869  df-topon 22886  df-topsp 22908  df-bases 22921  df-cld 22994  df-cls 22996  df-cn 23202  df-cnp 23203  df-tx 23537  df-hmeo 23730  df-tmd 24047  df-tgp 24048
This theorem is referenced by:  tgptsmscls  24125
  Copyright terms: Public domain W3C validator