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

Theorem istgp2 24390
Description: A group with a topology is a topological group iff the subtraction operation is continuous. (Contributed by Mario Carneiro, 2-Sep-2015.)
Hypotheses
Ref Expression
tgpsubcn.2 𝐽 = (TopOpen‘𝐺)
tgpsubcn.3 − = (-g‘𝐺)
Assertion
Ref Expression
istgp2 (𝐺 ∈ TopGrp ↔ (𝐺 ∈ Grp ∧ 𝐺 ∈ TopSp ∧ − ∈ ((𝐽 ×t 𝐽) Cn 𝐽)))

Proof of Theorem istgp2
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 tgpgrp 24377 . . 3 (𝐺 ∈ TopGrp → 𝐺 ∈ Grp)
2 tgptps 24379 . . 3 (𝐺 ∈ TopGrp → 𝐺 ∈ TopSp)
3 tgpsubcn.2 . . . 4 𝐽 = (TopOpen‘𝐺)
4 tgpsubcn.3 . . . 4 − = (-g‘𝐺)
53, 4tgpsubcn 24389 . . 3 (𝐺 ∈ TopGrp → − ∈ ((𝐽 ×t 𝐽) Cn 𝐽))
61, 2, 53jca 1146 . 2 (𝐺 ∈ TopGrp → (𝐺 ∈ Grp ∧ 𝐺 ∈ TopSp ∧ − ∈ ((𝐽 ×t 𝐽) Cn 𝐽)))
7 simp1 1154 . . 3 ((𝐺 ∈ Grp ∧ 𝐺 ∈ TopSp ∧ − ∈ ((𝐽 ×t 𝐽) Cn 𝐽)) → 𝐺 ∈ Grp)
8 grpmnd 19131 . . . . 5 (𝐺 ∈ Grp → 𝐺 ∈ Mnd)
983ad2ant1 1151 . . . 4 ((𝐺 ∈ Grp ∧ 𝐺 ∈ TopSp ∧ − ∈ ((𝐽 ×t 𝐽) Cn 𝐽)) → 𝐺 ∈ Mnd)
10 simp2 1155 . . . 4 ((𝐺 ∈ Grp ∧ 𝐺 ∈ TopSp ∧ − ∈ ((𝐽 ×t 𝐽) Cn 𝐽)) → 𝐺 ∈ TopSp)
11 eqid 2761 . . . . . . . 8 (Base‘𝐺) = (Base‘𝐺)
12 eqid 2761 . . . . . . . 8 (+g‘𝐺) = (+g‘𝐺)
13 eqid 2761 . . . . . . . 8 (invg‘𝐺) = (invg‘𝐺)
1473ad2ant1 1151 . . . . . . . 8 (((𝐺 ∈ Grp ∧ 𝐺 ∈ TopSp ∧ − ∈ ((𝐽 ×t 𝐽) Cn 𝐽)) ∧ 𝑥 ∈ (Base‘𝐺) ∧ 𝑦 ∈ (Base‘𝐺)) → 𝐺 ∈ Grp)
15 simp2 1155 . . . . . . . 8 (((𝐺 ∈ Grp ∧ 𝐺 ∈ TopSp ∧ − ∈ ((𝐽 ×t 𝐽) Cn 𝐽)) ∧ 𝑥 ∈ (Base‘𝐺) ∧ 𝑦 ∈ (Base‘𝐺)) → 𝑥 ∈ (Base‘𝐺))
16 simp3 1156 . . . . . . . 8 (((𝐺 ∈ Grp ∧ 𝐺 ∈ TopSp ∧ − ∈ ((𝐽 ×t 𝐽) Cn 𝐽)) ∧ 𝑥 ∈ (Base‘𝐺) ∧ 𝑦 ∈ (Base‘𝐺)) → 𝑦 ∈ (Base‘𝐺))
1711, 12, 4, 13, 14, 15, 16grpsubinv 19202 . . . . . . 7 (((𝐺 ∈ Grp ∧ 𝐺 ∈ TopSp ∧ − ∈ ((𝐽 ×t 𝐽) Cn 𝐽)) ∧ 𝑥 ∈ (Base‘𝐺) ∧ 𝑦 ∈ (Base‘𝐺)) → (𝑥 − ((invg‘𝐺)‘𝑦)) = (𝑥(+g‘𝐺)𝑦))
1817mpoeq3dva 7489 . . . . . 6 ((𝐺 ∈ Grp ∧ 𝐺 ∈ TopSp ∧ − ∈ ((𝐽 ×t 𝐽) Cn 𝐽)) → (𝑥 ∈ (Base‘𝐺), 𝑦 ∈ (Base‘𝐺) ↦ (𝑥 − ((invg‘𝐺)‘𝑦))) = (𝑥 ∈ (Base‘𝐺), 𝑦 ∈ (Base‘𝐺) ↦ (𝑥(+g‘𝐺)𝑦)))
19 eqid 2761 . . . . . . 7 (+𝑓‘𝐺) = (+𝑓‘𝐺)
2011, 12, 19plusffval 18802 . . . . . 6 (+𝑓‘𝐺) = (𝑥 ∈ (Base‘𝐺), 𝑦 ∈ (Base‘𝐺) ↦ (𝑥(+g‘𝐺)𝑦))
2118, 20eqtr4di 2814 . . . . 5 ((𝐺 ∈ Grp ∧ 𝐺 ∈ TopSp ∧ − ∈ ((𝐽 ×t 𝐽) Cn 𝐽)) → (𝑥 ∈ (Base‘𝐺), 𝑦 ∈ (Base‘𝐺) ↦ (𝑥 − ((invg‘𝐺)‘𝑦))) = (+𝑓‘𝐺))
2211, 3istps 23232 . . . . . . 7 (𝐺 ∈ TopSp ↔ 𝐽 ∈ (TopOn‘(Base‘𝐺)))
2310, 22sylib 221 . . . . . 6 ((𝐺 ∈ Grp ∧ 𝐺 ∈ TopSp ∧ − ∈ ((𝐽 ×t 𝐽) Cn 𝐽)) → 𝐽 ∈ (TopOn‘(Base‘𝐺)))
2423, 23cnmpt1st 23967 . . . . . 6 ((𝐺 ∈ Grp ∧ 𝐺 ∈ TopSp ∧ − ∈ ((𝐽 ×t 𝐽) Cn 𝐽)) → (𝑥 ∈ (Base‘𝐺), 𝑦 ∈ (Base‘𝐺) ↦ 𝑥) ∈ ((𝐽 ×t 𝐽) Cn 𝐽))
2523, 23cnmpt2nd 23968 . . . . . . 7 ((𝐺 ∈ Grp ∧ 𝐺 ∈ TopSp ∧ − ∈ ((𝐽 ×t 𝐽) Cn 𝐽)) → (𝑥 ∈ (Base‘𝐺), 𝑦 ∈ (Base‘𝐺) ↦ 𝑦) ∈ ((𝐽 ×t 𝐽) Cn 𝐽))
2611, 13grpinvf 19177 . . . . . . . . . . 11 (𝐺 ∈ Grp → (invg‘𝐺):(Base‘𝐺)⟶(Base‘𝐺))
27263ad2ant1 1151 . . . . . . . . . 10 ((𝐺 ∈ Grp ∧ 𝐺 ∈ TopSp ∧ − ∈ ((𝐽 ×t 𝐽) Cn 𝐽)) → (invg‘𝐺):(Base‘𝐺)⟶(Base‘𝐺))
2827feqmptd 6945 . . . . . . . . 9 ((𝐺 ∈ Grp ∧ 𝐺 ∈ TopSp ∧ − ∈ ((𝐽 ×t 𝐽) Cn 𝐽)) → (invg‘𝐺) = (𝑥 ∈ (Base‘𝐺) ↦ ((invg‘𝐺)‘𝑥)))
29 eqid 2761 . . . . . . . . . . . 12 (0g‘𝐺) = (0g‘𝐺)
3011, 4, 13, 29grpinvval2 19213 . . . . . . . . . . 11 ((𝐺 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐺)) → ((invg‘𝐺)‘𝑥) = ((0g‘𝐺) − 𝑥))
317, 30sylan 592 . . . . . . . . . 10 (((𝐺 ∈ Grp ∧ 𝐺 ∈ TopSp ∧ − ∈ ((𝐽 ×t 𝐽) Cn 𝐽)) ∧ 𝑥 ∈ (Base‘𝐺)) → ((invg‘𝐺)‘𝑥) = ((0g‘𝐺) − 𝑥))
3231mpteq2dva 5198 . . . . . . . . 9 ((𝐺 ∈ Grp ∧ 𝐺 ∈ TopSp ∧ − ∈ ((𝐽 ×t 𝐽) Cn 𝐽)) → (𝑥 ∈ (Base‘𝐺) ↦ ((invg‘𝐺)‘𝑥)) = (𝑥 ∈ (Base‘𝐺) ↦ ((0g‘𝐺) − 𝑥)))
3328, 32eqtrd 2796 . . . . . . . 8 ((𝐺 ∈ Grp ∧ 𝐺 ∈ TopSp ∧ − ∈ ((𝐽 ×t 𝐽) Cn 𝐽)) → (invg‘𝐺) = (𝑥 ∈ (Base‘𝐺) ↦ ((0g‘𝐺) − 𝑥)))
3411, 29grpidcl 19156 . . . . . . . . . . 11 (𝐺 ∈ Grp → (0g‘𝐺) ∈ (Base‘𝐺))
35343ad2ant1 1151 . . . . . . . . . 10 ((𝐺 ∈ Grp ∧ 𝐺 ∈ TopSp ∧ − ∈ ((𝐽 ×t 𝐽) Cn 𝐽)) → (0g‘𝐺) ∈ (Base‘𝐺))
3623, 23, 35cnmptc 23961 . . . . . . . . 9 ((𝐺 ∈ Grp ∧ 𝐺 ∈ TopSp ∧ − ∈ ((𝐽 ×t 𝐽) Cn 𝐽)) → (𝑥 ∈ (Base‘𝐺) ↦ (0g‘𝐺)) ∈ (𝐽 Cn 𝐽))
3723cnmptid 23960 . . . . . . . . 9 ((𝐺 ∈ Grp ∧ 𝐺 ∈ TopSp ∧ − ∈ ((𝐽 ×t 𝐽) Cn 𝐽)) → (𝑥 ∈ (Base‘𝐺) ↦ 𝑥) ∈ (𝐽 Cn 𝐽))
38 simp3 1156 . . . . . . . . 9 ((𝐺 ∈ Grp ∧ 𝐺 ∈ TopSp ∧ − ∈ ((𝐽 ×t 𝐽) Cn 𝐽)) → − ∈ ((𝐽 ×t 𝐽) Cn 𝐽))
3923, 36, 37, 38cnmpt12f 23965 . . . . . . . 8 ((𝐺 ∈ Grp ∧ 𝐺 ∈ TopSp ∧ − ∈ ((𝐽 ×t 𝐽) Cn 𝐽)) → (𝑥 ∈ (Base‘𝐺) ↦ ((0g‘𝐺) − 𝑥)) ∈ (𝐽 Cn 𝐽))
4033, 39eqeltrd 2861 . . . . . . 7 ((𝐺 ∈ Grp ∧ 𝐺 ∈ TopSp ∧ − ∈ ((𝐽 ×t 𝐽) Cn 𝐽)) → (invg‘𝐺) ∈ (𝐽 Cn 𝐽))
4123, 23, 25, 40cnmpt21f 23971 . . . . . 6 ((𝐺 ∈ Grp ∧ 𝐺 ∈ TopSp ∧ − ∈ ((𝐽 ×t 𝐽) Cn 𝐽)) → (𝑥 ∈ (Base‘𝐺), 𝑦 ∈ (Base‘𝐺) ↦ ((invg‘𝐺)‘𝑦)) ∈ ((𝐽 ×t 𝐽) Cn 𝐽))
4223, 23, 24, 41, 38cnmpt22f 23974 . . . . 5 ((𝐺 ∈ Grp ∧ 𝐺 ∈ TopSp ∧ − ∈ ((𝐽 ×t 𝐽) Cn 𝐽)) → (𝑥 ∈ (Base‘𝐺), 𝑦 ∈ (Base‘𝐺) ↦ (𝑥 − ((invg‘𝐺)‘𝑦))) ∈ ((𝐽 ×t 𝐽) Cn 𝐽))
4321, 42eqeltrrd 2862 . . . 4 ((𝐺 ∈ Grp ∧ 𝐺 ∈ TopSp ∧ − ∈ ((𝐽 ×t 𝐽) Cn 𝐽)) → (+𝑓‘𝐺) ∈ ((𝐽 ×t 𝐽) Cn 𝐽))
4419, 3istmd 24373 . . . 4 (𝐺 ∈ TopMnd ↔ (𝐺 ∈ Mnd ∧ 𝐺 ∈ TopSp ∧ (+𝑓‘𝐺) ∈ ((𝐽 ×t 𝐽) Cn 𝐽)))
459, 10, 43, 44syl3anbrc 1362 . . 3 ((𝐺 ∈ Grp ∧ 𝐺 ∈ TopSp ∧ − ∈ ((𝐽 ×t 𝐽) Cn 𝐽)) → 𝐺 ∈ TopMnd)
463, 13istgp 24376 . . 3 (𝐺 ∈ TopGrp ↔ (𝐺 ∈ Grp ∧ 𝐺 ∈ TopMnd ∧ (invg‘𝐺) ∈ (𝐽 Cn 𝐽)))
477, 45, 40, 46syl3anbrc 1362 . 2 ((𝐺 ∈ Grp ∧ 𝐺 ∈ TopSp ∧ − ∈ ((𝐽 ×t 𝐽) Cn 𝐽)) → 𝐺 ∈ TopGrp)
486, 47impbii 212 1 (𝐺 ∈ TopGrp ↔ (𝐺 ∈ Grp ∧ 𝐺 ∈ TopSp ∧ − ∈ ((𝐽 ×t 𝐽) Cn 𝐽)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145   ↦ cmpt 5186  ⟶wf 6527  ‘cfv 6531  (class class class)co 7412   ∈ cmpo 7414  Basecbs 17367  +gcplusg 17408  TopOpenctopn 17572  0gc0g 17590  +𝑓cplusf 18793  Mndcmnd 18903  Grpcgrp 19124  invgcminusg 19125  -gcsg 19126  TopOnctopon 23208  TopSpctps 23230   Cn ccn 23522   ×t ctx 23859  TopMndctmd 24369  TopGrpctgp 24370
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7740
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-riota 7369  df-ov 7415  df-oprab 7416  df-mpo 7417  df-1st 7990  df-2nd 7991  df-map 8833  df-0g 17592  df-topgen 17594  df-plusf 18795  df-mgm 18796  df-sgrp 18888  df-mnd 18904  df-grp 19127  df-minusg 19128  df-sbg 19129  df-top 23192  df-topon 23209  df-topsp 23231  df-bases 23244  df-cn 23525  df-cnp 23526  df-tx 23861  df-tmd 24371  df-tgp 24372
This theorem is used by:  distgp  24398  indistgp  24399  qustgplem  24420  ngptgp  24935  cnfldtgp  25170
  Copyright terms: Public domain W3C validator