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

Theorem istgp 24453
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 4095 . . 3 (𝐺 ∈ (Grp ∩ TopMnd) ↔ (𝐺 ∈ Grp ∧ 𝐺 ∈ TopMnd))
21anbi1i 636 . 2 ((𝐺 ∈ (Grp ∩ TopMnd) ∧ 𝐼 ∈ (𝐽 Cn 𝐽)) ↔ ((𝐺 ∈ Grp ∧ 𝐺 ∈ TopMnd) ∧ 𝐼 ∈ (𝐽 Cn 𝐽)))
3 fvexd 6930 . . . 4 (𝑓 = 𝐺 → (TopOpen‘𝑓) ∈ V)
4 simpl 488 . . . . . . 7 ((𝑓 = 𝐺 ∧ 𝑗 = (TopOpen‘𝑓)) → 𝑓 = 𝐺)
54fveq2d 6919 . . . . . 6 ((𝑓 = 𝐺 ∧ 𝑗 = (TopOpen‘𝑓)) → (invg‘𝑓) = (invg‘𝐺))
6 istgp.2 . . . . . 6 𝐼 = (invg‘𝐺)
75, 6eqtr4di 2819 . . . . 5 ((𝑓 = 𝐺 ∧ 𝑗 = (TopOpen‘𝑓)) → (invg‘𝑓) = 𝐼)
8 id 23 . . . . . . 7 (𝑗 = (TopOpen‘𝑓) → 𝑗 = (TopOpen‘𝑓))
9 fveq2 6915 . . . . . . . 8 (𝑓 = 𝐺 → (TopOpen‘𝑓) = (TopOpen‘𝐺))
10 istgp.1 . . . . . . . 8 𝐽 = (TopOpen‘𝐺)
119, 10eqtr4di 2819 . . . . . . 7 (𝑓 = 𝐺 → (TopOpen‘𝑓) = 𝐽)
128, 11sylan9eqr 2823 . . . . . 6 ((𝑓 = 𝐺 ∧ 𝑗 = (TopOpen‘𝑓)) → 𝑗 = 𝐽)
1312, 12oveq12d 7468 . . . . 5 ((𝑓 = 𝐺 ∧ 𝑗 = (TopOpen‘𝑓)) → (𝑗 Cn 𝑗) = (𝐽 Cn 𝐽))
147, 13eleq12d 2861 . . . 4 ((𝑓 = 𝐺 ∧ 𝑗 = (TopOpen‘𝑓)) → ((invg‘𝑓) ∈ (𝑗 Cn 𝑗) ↔ 𝐼 ∈ (𝐽 Cn 𝐽)))
153, 14sbcied 3784 . . 3 (𝑓 = 𝐺 → ([(TopOpen‘𝑓) / 𝑗](invg‘𝑓) ∈ (𝑗 Cn 𝑗) ↔ 𝐼 ∈ (𝐽 Cn 𝐽)))
16 df-tgp 24449 . . 3 TopGrp = {𝑓 ∈ (Grp ∩ TopMnd) ∣ [(TopOpen‘𝑓) / 𝑗](invg‘𝑓) ∈ (𝑗 Cn 𝑗)}
1715, 16elrab2 3651 . 2 (𝐺 ∈ TopGrp ↔ (𝐺 ∈ (Grp ∩ TopMnd) ∧ 𝐼 ∈ (𝐽 Cn 𝐽)))
18 df-3an 1106 . 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 1104   = wceq 1572   ∈ wcel 2150  Vcvv 3453  [wsbc 3741   ∩ cin 4091  ‘cfv 6565  (class class class)co 7450  TopOpenctopn 17644  Grpcgrp 19196  invgcminusg 19197   Cn ccn 23599  TopMndctmd 24446  TopGrpctgp 24447
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-ext 2738  ax-nul 5265
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-sb 2104  df-clab 2745  df-cleq 2758  df-clel 2842  df-ne 2963  df-rab 3416  df-v 3455  df-sbc 3742  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-br 5108  df-iota 6519  df-fv 6573  df-ov 7453  df-tgp 24449
This theorem is used by:  tgpgrp  24454  tgptmd  24455  tgpinv  24461  istgp2  24467  oppgtgp  24474  subgtgp  24481  symgtgp  24482  prdstgpd  24501  tlmtgp  24572  nrgtdrg  25069
  Copyright terms: Public domain W3C validator