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

Theorem istgp 24423
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 4096 . . 3 (𝐺 ∈ (Grp ∩ TopMnd) ↔ (𝐺 ∈ Grp ∧ 𝐺 ∈ TopMnd))
21anbi1i 636 . 2 ((𝐺 ∈ (Grp ∩ TopMnd) ∧ 𝐼 ∈ (𝐽 Cn 𝐽)) ↔ ((𝐺 ∈ Grp ∧ 𝐺 ∈ TopMnd) ∧ 𝐼 ∈ (𝐽 Cn 𝐽)))
3 fvexd 6920 . . . 4 (𝑓 = 𝐺 → (TopOpen‘𝑓) ∈ V)
4 simpl 488 . . . . . . 7 ((𝑓 = 𝐺 ∧ 𝑗 = (TopOpen‘𝑓)) → 𝑓 = 𝐺)
54fveq2d 6909 . . . . . 6 ((𝑓 = 𝐺 ∧ 𝑗 = (TopOpen‘𝑓)) → (invg‘𝑓) = (invg‘𝐺))
6 istgp.2 . . . . . 6 𝐼 = (invg‘𝐺)
75, 6eqtr4di 2816 . . . . 5 ((𝑓 = 𝐺 ∧ 𝑗 = (TopOpen‘𝑓)) → (invg‘𝑓) = 𝐼)
8 id 23 . . . . . . 7 (𝑗 = (TopOpen‘𝑓) → 𝑗 = (TopOpen‘𝑓))
9 fveq2 6905 . . . . . . . 8 (𝑓 = 𝐺 → (TopOpen‘𝑓) = (TopOpen‘𝐺))
10 istgp.1 . . . . . . . 8 𝐽 = (TopOpen‘𝐺)
119, 10eqtr4di 2816 . . . . . . 7 (𝑓 = 𝐺 → (TopOpen‘𝑓) = 𝐽)
128, 11sylan9eqr 2820 . . . . . 6 ((𝑓 = 𝐺 ∧ 𝑗 = (TopOpen‘𝑓)) → 𝑗 = 𝐽)
1312, 12oveq12d 7458 . . . . 5 ((𝑓 = 𝐺 ∧ 𝑗 = (TopOpen‘𝑓)) → (𝑗 Cn 𝑗) = (𝐽 Cn 𝐽))
147, 13eleq12d 2858 . . . 4 ((𝑓 = 𝐺 ∧ 𝑗 = (TopOpen‘𝑓)) → ((invg‘𝑓) ∈ (𝑗 Cn 𝑗) ↔ 𝐼 ∈ (𝐽 Cn 𝐽)))
153, 14sbcied 3785 . . 3 (𝑓 = 𝐺 → ([(TopOpen‘𝑓) / 𝑗](invg‘𝑓) ∈ (𝑗 Cn 𝑗) ↔ 𝐼 ∈ (𝐽 Cn 𝐽)))
16 df-tgp 24419 . . 3 TopGrp = {𝑓 ∈ (Grp ∩ TopMnd) ∣ [(TopOpen‘𝑓) / 𝑗](invg‘𝑓) ∈ (𝑗 Cn 𝑗)}
1715, 16elrab2 3652 . 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 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  Vcvv 3454  [wsbc 3742   ∩ cin 4092  ‘cfv 6555  (class class class)co 7440  TopOpenctopn 17618  Grpcgrp 19170  invgcminusg 19171   Cn ccn 23569  TopMndctmd 24416  TopGrpctgp 24417
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-nul 5263
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-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-iota 6509  df-fv 6563  df-ov 7443  df-tgp 24419
This theorem is used by:  tgpgrp  24424  tgptmd  24425  tgpinv  24431  istgp2  24437  oppgtgp  24444  subgtgp  24451  symgtgp  24452  prdstgpd  24471  tlmtgp  24542  nrgtdrg  25039
  Copyright terms: Public domain W3C validator