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

Theorem istgp 20304
Description: The predicate "is a topological group". Definition of [BourbakiTop1] p. III.1 (Contributed by FL, 18-Apr-2010.) (Revised by Mario Carneiro, 13-Aug-2015.)
Hypotheses
Ref Expression
istgp.1  |-  J  =  ( TopOpen `  G )
istgp.2  |-  I  =  ( invg `  G )
Assertion
Ref Expression
istgp  |-  ( G  e.  TopGrp 
<->  ( G  e.  Grp  /\  G  e. TopMnd  /\  I  e.  ( J  Cn  J
) ) )

Proof of Theorem istgp
Dummy variables  f 
j are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elin 3680 . . 3  |-  ( G  e.  ( Grp  i^i TopMnd )  <-> 
( G  e.  Grp  /\  G  e. TopMnd ) )
21anbi1i 695 . 2  |-  ( ( G  e.  ( Grp 
i^i TopMnd )  /\  I  e.  ( J  Cn  J
) )  <->  ( ( G  e.  Grp  /\  G  e. TopMnd )  /\  I  e.  ( J  Cn  J
) ) )
3 fvex 5867 . . . . 5  |-  ( TopOpen `  f )  e.  _V
43a1i 11 . . . 4  |-  ( f  =  G  ->  ( TopOpen
`  f )  e. 
_V )
5 simpl 457 . . . . . . 7  |-  ( ( f  =  G  /\  j  =  ( TopOpen `  f ) )  -> 
f  =  G )
65fveq2d 5861 . . . . . 6  |-  ( ( f  =  G  /\  j  =  ( TopOpen `  f ) )  -> 
( invg `  f )  =  ( invg `  G
) )
7 istgp.2 . . . . . 6  |-  I  =  ( invg `  G )
86, 7syl6eqr 2519 . . . . 5  |-  ( ( f  =  G  /\  j  =  ( TopOpen `  f ) )  -> 
( invg `  f )  =  I )
9 id 22 . . . . . . 7  |-  ( j  =  ( TopOpen `  f
)  ->  j  =  ( TopOpen `  f )
)
10 fveq2 5857 . . . . . . . 8  |-  ( f  =  G  ->  ( TopOpen
`  f )  =  ( TopOpen `  G )
)
11 istgp.1 . . . . . . . 8  |-  J  =  ( TopOpen `  G )
1210, 11syl6eqr 2519 . . . . . . 7  |-  ( f  =  G  ->  ( TopOpen
`  f )  =  J )
139, 12sylan9eqr 2523 . . . . . 6  |-  ( ( f  =  G  /\  j  =  ( TopOpen `  f ) )  -> 
j  =  J )
1413, 13oveq12d 6293 . . . . 5  |-  ( ( f  =  G  /\  j  =  ( TopOpen `  f ) )  -> 
( j  Cn  j
)  =  ( J  Cn  J ) )
158, 14eleq12d 2542 . . . 4  |-  ( ( f  =  G  /\  j  =  ( TopOpen `  f ) )  -> 
( ( invg `  f )  e.  ( j  Cn  j )  <-> 
I  e.  ( J  Cn  J ) ) )
164, 15sbcied 3361 . . 3  |-  ( f  =  G  ->  ( [. ( TopOpen `  f )  /  j ]. ( invg `  f )  e.  ( j  Cn  j )  <->  I  e.  ( J  Cn  J
) ) )
17 df-tgp 20300 . . 3  |-  TopGrp  =  {
f  e.  ( Grp 
i^i TopMnd )  |  [. ( TopOpen
`  f )  / 
j ]. ( invg `  f )  e.  ( j  Cn  j ) }
1816, 17elrab2 3256 . 2  |-  ( G  e.  TopGrp 
<->  ( G  e.  ( Grp  i^i TopMnd )  /\  I  e.  ( J  Cn  J
) ) )
19 df-3an 970 . 2  |-  ( ( G  e.  Grp  /\  G  e. TopMnd  /\  I  e.  ( J  Cn  J
) )  <->  ( ( G  e.  Grp  /\  G  e. TopMnd )  /\  I  e.  ( J  Cn  J
) ) )
202, 18, 193bitr4i 277 1  |-  ( G  e.  TopGrp 
<->  ( G  e.  Grp  /\  G  e. TopMnd  /\  I  e.  ( J  Cn  J
) ) )
Colors of variables: wff setvar class
Syntax hints:    <-> wb 184    /\ wa 369    /\ w3a 968    = wceq 1374    e. wcel 1762   _Vcvv 3106   [.wsbc 3324    i^i cin 3468   ` cfv 5579  (class class class)co 6275   TopOpenctopn 14666   Grpcgrp 15716   invgcminusg 15717    Cn ccn 19484  TopMndctmd 20297   TopGrpctgp 20298
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1596  ax-4 1607  ax-5 1675  ax-6 1714  ax-7 1734  ax-10 1781  ax-11 1786  ax-12 1798  ax-13 1961  ax-ext 2438  ax-nul 4569
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 970  df-tru 1377  df-ex 1592  df-nf 1595  df-sb 1707  df-eu 2272  df-clab 2446  df-cleq 2452  df-clel 2455  df-nfc 2610  df-ne 2657  df-ral 2812  df-rex 2813  df-rab 2816  df-v 3108  df-sbc 3325  df-dif 3472  df-un 3474  df-in 3476  df-ss 3483  df-nul 3779  df-if 3933  df-sn 4021  df-pr 4023  df-op 4027  df-uni 4239  df-br 4441  df-iota 5542  df-fv 5587  df-ov 6278  df-tgp 20300
This theorem is referenced by:  tgpgrp  20305  tgptmd  20306  tgpinv  20312  istgp2  20318  oppgtgp  20325  symgtgp  20328  subgtgp  20332  prdstgpd  20351  tlmtgp  20426  nrgtdrg  20929
  Copyright terms: Public domain W3C validator