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

Theorem distgp 24045
Description: Any group equipped with the discrete topology is a topological group. (Contributed by Mario Carneiro, 14-Aug-2015.)
Hypotheses
Ref Expression
distgp.1 𝐵 = (Base‘𝐺)
distgp.2 𝐽 = (TopOpen‘𝐺)
Assertion
Ref Expression
distgp ((𝐺 ∈ Grp ∧ 𝐽 = 𝒫 𝐵) → 𝐺 ∈ TopGrp)

Proof of Theorem distgp
StepHypRef Expression
1 simpl 482 . 2 ((𝐺 ∈ Grp ∧ 𝐽 = 𝒫 𝐵) → 𝐺 ∈ Grp)
2 simpr 484 . . . 4 ((𝐺 ∈ Grp ∧ 𝐽 = 𝒫 𝐵) → 𝐽 = 𝒫 𝐵)
3 distgp.1 . . . . . 6 𝐵 = (Base‘𝐺)
43fvexi 6847 . . . . 5 𝐵 ∈ V
5 distopon 22943 . . . . 5 (𝐵 ∈ V → 𝒫 𝐵 ∈ (TopOn‘𝐵))
64, 5ax-mp 5 . . . 4 𝒫 𝐵 ∈ (TopOn‘𝐵)
72, 6eqeltrdi 2843 . . 3 ((𝐺 ∈ Grp ∧ 𝐽 = 𝒫 𝐵) → 𝐽 ∈ (TopOn‘𝐵))
8 distgp.2 . . . 4 𝐽 = (TopOpen‘𝐺)
93, 8istps 22880 . . 3 (𝐺 ∈ TopSp ↔ 𝐽 ∈ (TopOn‘𝐵))
107, 9sylibr 234 . 2 ((𝐺 ∈ Grp ∧ 𝐽 = 𝒫 𝐵) → 𝐺 ∈ TopSp)
11 eqid 2735 . . . . . 6 (-g𝐺) = (-g𝐺)
123, 11grpsubf 18951 . . . . 5 (𝐺 ∈ Grp → (-g𝐺):(𝐵 × 𝐵)⟶𝐵)
1312adantr 480 . . . 4 ((𝐺 ∈ Grp ∧ 𝐽 = 𝒫 𝐵) → (-g𝐺):(𝐵 × 𝐵)⟶𝐵)
144, 4xpex 7698 . . . . 5 (𝐵 × 𝐵) ∈ V
154, 14elmap 8811 . . . 4 ((-g𝐺) ∈ (𝐵m (𝐵 × 𝐵)) ↔ (-g𝐺):(𝐵 × 𝐵)⟶𝐵)
1613, 15sylibr 234 . . 3 ((𝐺 ∈ Grp ∧ 𝐽 = 𝒫 𝐵) → (-g𝐺) ∈ (𝐵m (𝐵 × 𝐵)))
172, 2oveq12d 7376 . . . . . 6 ((𝐺 ∈ Grp ∧ 𝐽 = 𝒫 𝐵) → (𝐽 ×t 𝐽) = (𝒫 𝐵 ×t 𝒫 𝐵))
18 txdis 23578 . . . . . . 7 ((𝐵 ∈ V ∧ 𝐵 ∈ V) → (𝒫 𝐵 ×t 𝒫 𝐵) = 𝒫 (𝐵 × 𝐵))
194, 4, 18mp2an 693 . . . . . 6 (𝒫 𝐵 ×t 𝒫 𝐵) = 𝒫 (𝐵 × 𝐵)
2017, 19eqtrdi 2786 . . . . 5 ((𝐺 ∈ Grp ∧ 𝐽 = 𝒫 𝐵) → (𝐽 ×t 𝐽) = 𝒫 (𝐵 × 𝐵))
2120oveq1d 7373 . . . 4 ((𝐺 ∈ Grp ∧ 𝐽 = 𝒫 𝐵) → ((𝐽 ×t 𝐽) Cn 𝐽) = (𝒫 (𝐵 × 𝐵) Cn 𝐽))
22 cndis 23237 . . . . 5 (((𝐵 × 𝐵) ∈ V ∧ 𝐽 ∈ (TopOn‘𝐵)) → (𝒫 (𝐵 × 𝐵) Cn 𝐽) = (𝐵m (𝐵 × 𝐵)))
2314, 7, 22sylancr 588 . . . 4 ((𝐺 ∈ Grp ∧ 𝐽 = 𝒫 𝐵) → (𝒫 (𝐵 × 𝐵) Cn 𝐽) = (𝐵m (𝐵 × 𝐵)))
2421, 23eqtrd 2770 . . 3 ((𝐺 ∈ Grp ∧ 𝐽 = 𝒫 𝐵) → ((𝐽 ×t 𝐽) Cn 𝐽) = (𝐵m (𝐵 × 𝐵)))
2516, 24eleqtrrd 2838 . 2 ((𝐺 ∈ Grp ∧ 𝐽 = 𝒫 𝐵) → (-g𝐺) ∈ ((𝐽 ×t 𝐽) Cn 𝐽))
268, 11istgp2 24037 . 2 (𝐺 ∈ TopGrp ↔ (𝐺 ∈ Grp ∧ 𝐺 ∈ TopSp ∧ (-g𝐺) ∈ ((𝐽 ×t 𝐽) Cn 𝐽)))
271, 10, 25, 26syl3anbrc 1345 1 ((𝐺 ∈ Grp ∧ 𝐽 = 𝒫 𝐵) → 𝐺 ∈ TopGrp)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1542  wcel 2114  Vcvv 3439  𝒫 cpw 4553   × cxp 5621  wf 6487  cfv 6491  (class class class)co 7358  m cmap 8765  Basecbs 17138  TopOpenctopn 17343  Grpcgrp 18865  -gcsg 18867  TopOnctopon 22856  TopSpctps 22878   Cn ccn 23170   ×t ctx 23506  TopGrpctgp 24017
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 2183  ax-ext 2707  ax-sep 5240  ax-nul 5250  ax-pow 5309  ax-pr 5376  ax-un 7680
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 2538  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2810  df-nfc 2884  df-ne 2932  df-ral 3051  df-rex 3060  df-rmo 3349  df-reu 3350  df-rab 3399  df-v 3441  df-sbc 3740  df-csb 3849  df-dif 3903  df-un 3905  df-in 3907  df-ss 3917  df-nul 4285  df-if 4479  df-pw 4555  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4863  df-iun 4947  df-br 5098  df-opab 5160  df-mpt 5179  df-id 5518  df-xp 5629  df-rel 5630  df-cnv 5631  df-co 5632  df-dm 5633  df-rn 5634  df-res 5635  df-ima 5636  df-iota 6447  df-fun 6493  df-fn 6494  df-f 6495  df-f1 6496  df-fo 6497  df-f1o 6498  df-fv 6499  df-riota 7315  df-ov 7361  df-oprab 7362  df-mpo 7363  df-1st 7933  df-2nd 7934  df-map 8767  df-0g 17363  df-topgen 17365  df-plusf 18566  df-mgm 18567  df-sgrp 18646  df-mnd 18662  df-grp 18868  df-minusg 18869  df-sbg 18870  df-top 22840  df-topon 22857  df-topsp 22879  df-bases 22892  df-cn 23173  df-cnp 23174  df-tx 23508  df-tmd 24018  df-tgp 24019
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator