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

Theorem istgp 24302
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 3918 . . 3 (𝐺 ∈ (Grp ∩ TopMnd) ↔ (𝐺 ∈ Grp ∧ 𝐺 ∈ TopMnd))
21anbi1i 636 . 2 ((𝐺 ∈ (Grp ∩ TopMnd) ∧ 𝐼 ∈ (𝐽 Cn 𝐽)) ↔ ((𝐺 ∈ Grp ∧ 𝐺 ∈ TopMnd) ∧ 𝐼 ∈ (𝐽 Cn 𝐽)))
3 fvexd 6897 . . . 4 (𝑓 = 𝐺 → (TopOpen‘𝑓) ∈ V)
4 simpl 488 . . . . . . 7 ((𝑓 = 𝐺𝑗 = (TopOpen‘𝑓)) → 𝑓 = 𝐺)
54fveq2d 6886 . . . . . 6 ((𝑓 = 𝐺𝑗 = (TopOpen‘𝑓)) → (invg𝑓) = (invg𝐺))
6 istgp.2 . . . . . 6 𝐼 = (invg𝐺)
75, 6eqtr4di 2815 . . . . 5 ((𝑓 = 𝐺𝑗 = (TopOpen‘𝑓)) → (invg𝑓) = 𝐼)
8 id 23 . . . . . . 7 (𝑗 = (TopOpen‘𝑓) → 𝑗 = (TopOpen‘𝑓))
9 fveq2 6882 . . . . . . . 8 (𝑓 = 𝐺 → (TopOpen‘𝑓) = (TopOpen‘𝐺))
10 istgp.1 . . . . . . . 8 𝐽 = (TopOpen‘𝐺)
119, 10eqtr4di 2815 . . . . . . 7 (𝑓 = 𝐺 → (TopOpen‘𝑓) = 𝐽)
128, 11sylan9eqr 2819 . . . . . 6 ((𝑓 = 𝐺𝑗 = (TopOpen‘𝑓)) → 𝑗 = 𝐽)
1312, 12oveq12d 7434 . . . . 5 ((𝑓 = 𝐺𝑗 = (TopOpen‘𝑓)) → (𝑗 Cn 𝑗) = (𝐽 Cn 𝐽))
147, 13eleq12d 2856 . . . 4 ((𝑓 = 𝐺𝑗 = (TopOpen‘𝑓)) → ((invg𝑓) ∈ (𝑗 Cn 𝑗) ↔ 𝐼 ∈ (𝐽 Cn 𝐽)))
153, 14sbcied 3785 . . 3 (𝑓 = 𝐺 → ([(TopOpen‘𝑓) / 𝑗](invg𝑓) ∈ (𝑗 Cn 𝑗) ↔ 𝐼 ∈ (𝐽 Cn 𝐽)))
16 df-tgp 24298 . . 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 2145  Vcvv 3453  [wsbc 3742  cin 3901  cfv 6537  (class class class)co 7416  TopOpenctopn 17508  Grpcgrp 19056  invgcminusg 19057   Cn ccn 23448  TopMndctmd 24295  TopGrpctgp 24296
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-ext 2734  ax-nul 5267
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 2100  df-clab 2741  df-cleq 2754  df-clel 2837  df-ne 2958  df-rab 3415  df-v 3455  df-sbc 3743  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-iota 6493  df-fv 6545  df-ov 7419  df-tgp 24298
This theorem is used by:  tgpgrp  24303  tgptmd  24304  tgpinv  24310  istgp2  24316  oppgtgp  24323  subgtgp  24330  symgtgp  24331  prdstgpd  24350  tlmtgp  24421  nrgtdrg  24918
  Copyright terms: Public domain W3C validator