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

Theorem istgp 24243
Description: The predicate "is a topological group". Definition 1 of [BourbakiTop1] p. III.1. (Contributed by FL, 18-Apr-2010.) (Revised by Mario Carneiro, 13-Aug-2015.)
Hypotheses
Ref Expression
istgp.1 𝐽 = (TopOpen‘𝐺)
istgp.2 𝐼 = (invg𝐺)
Assertion
Ref Expression
istgp (𝐺 ∈ TopGrp ↔ (𝐺 ∈ Grp ∧ 𝐺 ∈ TopMnd ∧ 𝐼 ∈ (𝐽 Cn 𝐽)))

Proof of Theorem istgp
Dummy variables 𝑓 𝑗 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elin 3921 . . 3 (𝐺 ∈ (Grp ∩ TopMnd) ↔ (𝐺 ∈ Grp ∧ 𝐺 ∈ TopMnd))
21anbi1i 635 . 2 ((𝐺 ∈ (Grp ∩ TopMnd) ∧ 𝐼 ∈ (𝐽 Cn 𝐽)) ↔ ((𝐺 ∈ Grp ∧ 𝐺 ∈ TopMnd) ∧ 𝐼 ∈ (𝐽 Cn 𝐽)))
3 fvexd 6896 . . . 4 (𝑓 = 𝐺 → (TopOpen‘𝑓) ∈ V)
4 simpl 487 . . . . . . 7 ((𝑓 = 𝐺𝑗 = (TopOpen‘𝑓)) → 𝑓 = 𝐺)
54fveq2d 6885 . . . . . 6 ((𝑓 = 𝐺𝑗 = (TopOpen‘𝑓)) → (invg𝑓) = (invg𝐺))
6 istgp.2 . . . . . 6 𝐼 = (invg𝐺)
75, 6eqtr4di 2816 . . . . 5 ((𝑓 = 𝐺𝑗 = (TopOpen‘𝑓)) → (invg𝑓) = 𝐼)
8 id 23 . . . . . . 7 (𝑗 = (TopOpen‘𝑓) → 𝑗 = (TopOpen‘𝑓))
9 fveq2 6881 . . . . . . . 8 (𝑓 = 𝐺 → (TopOpen‘𝑓) = (TopOpen‘𝐺))
10 istgp.1 . . . . . . . 8 𝐽 = (TopOpen‘𝐺)
119, 10eqtr4di 2816 . . . . . . 7 (𝑓 = 𝐺 → (TopOpen‘𝑓) = 𝐽)
128, 11sylan9eqr 2820 . . . . . 6 ((𝑓 = 𝐺𝑗 = (TopOpen‘𝑓)) → 𝑗 = 𝐽)
1312, 12oveq12d 7428 . . . . 5 ((𝑓 = 𝐺𝑗 = (TopOpen‘𝑓)) → (𝑗 Cn 𝑗) = (𝐽 Cn 𝐽))
147, 13eleq12d 2857 . . . 4 ((𝑓 = 𝐺𝑗 = (TopOpen‘𝑓)) → ((invg𝑓) ∈ (𝑗 Cn 𝑗) ↔ 𝐼 ∈ (𝐽 Cn 𝐽)))
153, 14sbcied 3787 . . 3 (𝑓 = 𝐺 → ([(TopOpen‘𝑓) / 𝑗](invg𝑓) ∈ (𝑗 Cn 𝑗) ↔ 𝐼 ∈ (𝐽 Cn 𝐽)))
16 df-tgp 24239 . . 3 TopGrp = {𝑓 ∈ (Grp ∩ TopMnd) ∣ [(TopOpen‘𝑓) / 𝑗](invg𝑓) ∈ (𝑗 Cn 𝑗)}
1715, 16elrab2 3654 . 2 (𝐺 ∈ TopGrp ↔ (𝐺 ∈ (Grp ∩ TopMnd) ∧ 𝐼 ∈ (𝐽 Cn 𝐽)))
18 df-3an 1105 . 2 ((𝐺 ∈ Grp ∧ 𝐺 ∈ TopMnd ∧ 𝐼 ∈ (𝐽 Cn 𝐽)) ↔ ((𝐺 ∈ Grp ∧ 𝐺 ∈ TopMnd) ∧ 𝐼 ∈ (𝐽 Cn 𝐽)))
192, 17, 183bitr4i 306 1 (𝐺 ∈ TopGrp ↔ (𝐺 ∈ Grp ∧ 𝐺 ∈ TopMnd ∧ 𝐼 ∈ (𝐽 Cn 𝐽)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wb 209  wa 400  w3a 1103   = wceq 1570  wcel 2143  Vcvv 3455  [wsbc 3744  cin 3904  cfv 6536  (class class class)co 7410  TopOpenctopn 17478  Grpcgrp 19004  invgcminusg 19005   Cn ccn 23390  TopMndctmd 24236  TopGrpctgp 24237
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735  ax-nul 5269
This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-ne 2959  df-rab 3417  df-v 3457  df-sbc 3745  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-br 5110  df-iota 6492  df-fv 6544  df-ov 7413  df-tgp 24239
This theorem is used by:  tgpgrp  24244  tgptmd  24245  tgpinv  24251  istgp2  24257  oppgtgp  24264  subgtgp  24271  symgtgp  24272  prdstgpd  24291  tlmtgp  24362  nrgtdrg  24859
  Copyright terms: Public domain W3C validator