ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  isnsg4 Unicode version

Theorem isnsg4 14015
Description: A subgroup is normal iff its normalizer is the entire group. (Contributed by Mario Carneiro, 18-Jan-2015.)
Hypotheses
Ref Expression
elnmz.1  |-  N  =  { x  e.  X  |  A. y  e.  X  ( ( x  .+  y )  e.  S  <->  ( y  .+  x )  e.  S ) }
nmzsubg.2  |-  X  =  ( Base `  G
)
nmzsubg.3  |-  .+  =  ( +g  `  G )
Assertion
Ref Expression
isnsg4  |-  ( S  e.  (NrmSGrp `  G
)  <->  ( S  e.  (SubGrp `  G )  /\  N  =  X
) )
Distinct variable groups:    x, y, G   
x, S, y    x,  .+ , y    x, X, y
Allowed substitution hints:    N( x,  y)

Proof of Theorem isnsg4
StepHypRef Expression
1 nmzsubg.2 . . 3  |-  X  =  ( Base `  G
)
2 nmzsubg.3 . . 3  |-  .+  =  ( +g  `  G )
31, 2isnsg 14005 . 2  |-  ( S  e.  (NrmSGrp `  G
)  <->  ( S  e.  (SubGrp `  G )  /\  A. x  e.  X  A. y  e.  X  ( ( x  .+  y )  e.  S  <->  ( y  .+  x )  e.  S ) ) )
4 eqcom 2240 . . . 4  |-  ( N  =  X  <->  X  =  N )
5 elnmz.1 . . . . 5  |-  N  =  { x  e.  X  |  A. y  e.  X  ( ( x  .+  y )  e.  S  <->  ( y  .+  x )  e.  S ) }
65eqeq2i 2249 . . . 4  |-  ( X  =  N  <->  X  =  { x  e.  X  |  A. y  e.  X  ( ( x  .+  y )  e.  S  <->  ( y  .+  x )  e.  S ) } )
7 rabid2 2729 . . . 4  |-  ( X  =  { x  e.  X  |  A. y  e.  X  ( (
x  .+  y )  e.  S  <->  ( y  .+  x )  e.  S
) }  <->  A. x  e.  X  A. y  e.  X  ( (
x  .+  y )  e.  S  <->  ( y  .+  x )  e.  S
) )
84, 6, 73bitri 206 . . 3  |-  ( N  =  X  <->  A. x  e.  X  A. y  e.  X  ( (
x  .+  y )  e.  S  <->  ( y  .+  x )  e.  S
) )
98anbi2i 461 . 2  |-  ( ( S  e.  (SubGrp `  G )  /\  N  =  X )  <->  ( S  e.  (SubGrp `  G )  /\  A. x  e.  X  A. y  e.  X  ( ( x  .+  y )  e.  S  <->  ( y  .+  x )  e.  S ) ) )
103, 9bitr4i 187 1  |-  ( S  e.  (NrmSGrp `  G
)  <->  ( S  e.  (SubGrp `  G )  /\  N  =  X
) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    /\ wa 104    <-> wb 105    = wceq 1402    e. wcel 2209   A.wral 2528   {crab 2532   ` cfv 5377  (class class class)co 6085   Basecbs 13352   +g cplusg 13431  SubGrpcsubg 13970  NrmSGrpcnsg 13971
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-cnex 8270  ax-resscn 8271  ax-1re 8273  ax-addrcl 8276
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-fv 5385  df-ov 6088  df-inn 9305  df-2 9363  df-ndx 13355  df-slot 13356  df-base 13358  df-plusg 13444  df-subg 13973  df-nsg 13974
This theorem is used by:  conjnsg  14084
  Copyright terms: Public domain W3C validator