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

Theorem elnmz 17633
Description: Elementhood in the normalizer. (Contributed by Mario Carneiro, 18-Jan-2015.)
Hypothesis
Ref Expression
elnmz.1  |-  N  =  { x  e.  X  |  A. y  e.  X  ( ( x  .+  y )  e.  S  <->  ( y  .+  x )  e.  S ) }
Assertion
Ref Expression
elnmz  |-  ( A  e.  N  <->  ( A  e.  X  /\  A. z  e.  X  ( ( A  .+  z )  e.  S  <->  ( z  .+  A )  e.  S
) ) )
Distinct variable groups:    x, z, A    x, y, z    z, N    x, S, y, z   
x,  .+ , y, z    x, X, y, z
Allowed substitution hints:    A( y)    N( x, y)

Proof of Theorem elnmz
StepHypRef Expression
1 oveq2 6658 . . . . . 6  |-  ( y  =  z  ->  (
x  .+  y )  =  ( x  .+  z ) )
21eleq1d 2686 . . . . 5  |-  ( y  =  z  ->  (
( x  .+  y
)  e.  S  <->  ( x  .+  z )  e.  S
) )
3 oveq1 6657 . . . . . 6  |-  ( y  =  z  ->  (
y  .+  x )  =  ( z  .+  x ) )
43eleq1d 2686 . . . . 5  |-  ( y  =  z  ->  (
( y  .+  x
)  e.  S  <->  ( z  .+  x )  e.  S
) )
52, 4bibi12d 335 . . . 4  |-  ( y  =  z  ->  (
( ( x  .+  y )  e.  S  <->  ( y  .+  x )  e.  S )  <->  ( (
x  .+  z )  e.  S  <->  ( z  .+  x )  e.  S
) ) )
65cbvralv 3171 . . 3  |-  ( A. y  e.  X  (
( x  .+  y
)  e.  S  <->  ( y  .+  x )  e.  S
)  <->  A. z  e.  X  ( ( x  .+  z )  e.  S  <->  ( z  .+  x )  e.  S ) )
7 oveq1 6657 . . . . . 6  |-  ( x  =  A  ->  (
x  .+  z )  =  ( A  .+  z ) )
87eleq1d 2686 . . . . 5  |-  ( x  =  A  ->  (
( x  .+  z
)  e.  S  <->  ( A  .+  z )  e.  S
) )
9 oveq2 6658 . . . . . 6  |-  ( x  =  A  ->  (
z  .+  x )  =  ( z  .+  A ) )
109eleq1d 2686 . . . . 5  |-  ( x  =  A  ->  (
( z  .+  x
)  e.  S  <->  ( z  .+  A )  e.  S
) )
118, 10bibi12d 335 . . . 4  |-  ( x  =  A  ->  (
( ( x  .+  z )  e.  S  <->  ( z  .+  x )  e.  S )  <->  ( ( A  .+  z )  e.  S  <->  ( z  .+  A )  e.  S
) ) )
1211ralbidv 2986 . . 3  |-  ( x  =  A  ->  ( A. z  e.  X  ( ( x  .+  z )  e.  S  <->  ( z  .+  x )  e.  S )  <->  A. z  e.  X  ( ( A  .+  z )  e.  S  <->  ( z  .+  A )  e.  S
) ) )
136, 12syl5bb 272 . 2  |-  ( x  =  A  ->  ( A. y  e.  X  ( ( x  .+  y )  e.  S  <->  ( y  .+  x )  e.  S )  <->  A. z  e.  X  ( ( A  .+  z )  e.  S  <->  ( z  .+  A )  e.  S
) ) )
14 elnmz.1 . 2  |-  N  =  { x  e.  X  |  A. y  e.  X  ( ( x  .+  y )  e.  S  <->  ( y  .+  x )  e.  S ) }
1513, 14elrab2 3366 1  |-  ( A  e.  N  <->  ( A  e.  X  /\  A. z  e.  X  ( ( A  .+  z )  e.  S  <->  ( z  .+  A )  e.  S
) ) )
Colors of variables: wff setvar class
Syntax hints:    <-> wb 196    /\ wa 384    = wceq 1483    e. wcel 1990   A.wral 2912   {crab 2916  (class class class)co 6650
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-iota 5851  df-fv 5896  df-ov 6653
This theorem is referenced by:  nmzbi  17634  nmzsubg  17635  ssnmz  17636  conjnmzb  17695  sylow3lem2  18043
  Copyright terms: Public domain W3C validator