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

Theorem distgp 24019
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 6854 . . . . 5 𝐵 ∈ V
5 distopon 22917 . . . . 5 (𝐵 ∈ V → 𝒫 𝐵 ∈ (TopOn‘𝐵))
64, 5ax-mp 5 . . . 4 𝒫 𝐵 ∈ (TopOn‘𝐵)
72, 6eqeltrdi 2836 . . 3 ((𝐺 ∈ Grp ∧ 𝐽 = 𝒫 𝐵) → 𝐽 ∈ (TopOn‘𝐵))
8 distgp.2 . . . 4 𝐽 = (TopOpen‘𝐺)
93, 8istps 22854 . . 3 (𝐺 ∈ TopSp ↔ 𝐽 ∈ (TopOn‘𝐵))
107, 9sylibr 234 . 2 ((𝐺 ∈ Grp ∧ 𝐽 = 𝒫 𝐵) → 𝐺 ∈ TopSp)
11 eqid 2729 . . . . . 6 (-g𝐺) = (-g𝐺)
123, 11grpsubf 18933 . . . . 5 (𝐺 ∈ Grp → (-g𝐺):(𝐵 × 𝐵)⟶𝐵)
1312adantr 480 . . . 4 ((𝐺 ∈ Grp ∧ 𝐽 = 𝒫 𝐵) → (-g𝐺):(𝐵 × 𝐵)⟶𝐵)
144, 4xpex 7709 . . . . 5 (𝐵 × 𝐵) ∈ V
154, 14elmap 8821 . . . 4 ((-g𝐺) ∈ (𝐵m (𝐵 × 𝐵)) ↔ (-g𝐺):(𝐵 × 𝐵)⟶𝐵)
1613, 15sylibr 234 . . 3 ((𝐺 ∈ Grp ∧ 𝐽 = 𝒫 𝐵) → (-g𝐺) ∈ (𝐵m (𝐵 × 𝐵)))
172, 2oveq12d 7387 . . . . . 6 ((𝐺 ∈ Grp ∧ 𝐽 = 𝒫 𝐵) → (𝐽 ×t 𝐽) = (𝒫 𝐵 ×t 𝒫 𝐵))
18 txdis 23552 . . . . . . 7 ((𝐵 ∈ V ∧ 𝐵 ∈ V) → (𝒫 𝐵 ×t 𝒫 𝐵) = 𝒫 (𝐵 × 𝐵))
194, 4, 18mp2an 692 . . . . . 6 (𝒫 𝐵 ×t 𝒫 𝐵) = 𝒫 (𝐵 × 𝐵)
2017, 19eqtrdi 2780 . . . . 5 ((𝐺 ∈ Grp ∧ 𝐽 = 𝒫 𝐵) → (𝐽 ×t 𝐽) = 𝒫 (𝐵 × 𝐵))
2120oveq1d 7384 . . . 4 ((𝐺 ∈ Grp ∧ 𝐽 = 𝒫 𝐵) → ((𝐽 ×t 𝐽) Cn 𝐽) = (𝒫 (𝐵 × 𝐵) Cn 𝐽))
22 cndis 23211 . . . . 5 (((𝐵 × 𝐵) ∈ V ∧ 𝐽 ∈ (TopOn‘𝐵)) → (𝒫 (𝐵 × 𝐵) Cn 𝐽) = (𝐵m (𝐵 × 𝐵)))
2314, 7, 22sylancr 587 . . . 4 ((𝐺 ∈ Grp ∧ 𝐽 = 𝒫 𝐵) → (𝒫 (𝐵 × 𝐵) Cn 𝐽) = (𝐵m (𝐵 × 𝐵)))
2421, 23eqtrd 2764 . . 3 ((𝐺 ∈ Grp ∧ 𝐽 = 𝒫 𝐵) → ((𝐽 ×t 𝐽) Cn 𝐽) = (𝐵m (𝐵 × 𝐵)))
2516, 24eleqtrrd 2831 . 2 ((𝐺 ∈ Grp ∧ 𝐽 = 𝒫 𝐵) → (-g𝐺) ∈ ((𝐽 ×t 𝐽) Cn 𝐽))
268, 11istgp2 24011 . 2 (𝐺 ∈ TopGrp ↔ (𝐺 ∈ Grp ∧ 𝐺 ∈ TopSp ∧ (-g𝐺) ∈ ((𝐽 ×t 𝐽) Cn 𝐽)))
271, 10, 25, 26syl3anbrc 1344 1 ((𝐺 ∈ Grp ∧ 𝐽 = 𝒫 𝐵) → 𝐺 ∈ TopGrp)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1540  wcel 2109  Vcvv 3444  𝒫 cpw 4559   × cxp 5629  wf 6495  cfv 6499  (class class class)co 7369  m cmap 8776  Basecbs 17155  TopOpenctopn 17360  Grpcgrp 18847  -gcsg 18849  TopOnctopon 22830  TopSpctps 22852   Cn ccn 23144   ×t ctx 23480  TopGrpctgp 23991
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5246  ax-nul 5256  ax-pow 5315  ax-pr 5382  ax-un 7691
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rmo 3351  df-reu 3352  df-rab 3403  df-v 3446  df-sbc 3751  df-csb 3860  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-nul 4293  df-if 4485  df-pw 4561  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4868  df-iun 4953  df-br 5103  df-opab 5165  df-mpt 5184  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 6452  df-fun 6501  df-fn 6502  df-f 6503  df-f1 6504  df-fo 6505  df-f1o 6506  df-fv 6507  df-riota 7326  df-ov 7372  df-oprab 7373  df-mpo 7374  df-1st 7947  df-2nd 7948  df-map 8778  df-0g 17380  df-topgen 17382  df-plusf 18548  df-mgm 18549  df-sgrp 18628  df-mnd 18644  df-grp 18850  df-minusg 18851  df-sbg 18852  df-top 22814  df-topon 22831  df-topsp 22853  df-bases 22866  df-cn 23147  df-cnp 23148  df-tx 23482  df-tmd 23992  df-tgp 23993
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator