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

Theorem conjnmzb 16428
Description: Alternative condition for elementhood in the normalizer. (Contributed by Mario Carneiro, 18-Jan-2015.)
Hypotheses
Ref Expression
conjghm.x  |-  X  =  ( Base `  G
)
conjghm.p  |-  .+  =  ( +g  `  G )
conjghm.m  |-  .-  =  ( -g `  G )
conjsubg.f  |-  F  =  ( x  e.  S  |->  ( ( A  .+  x )  .-  A
) )
conjnmz.1  |-  N  =  { y  e.  X  |  A. z  e.  X  ( ( y  .+  z )  e.  S  <->  ( z  .+  y )  e.  S ) }
Assertion
Ref Expression
conjnmzb  |-  ( S  e.  (SubGrp `  G
)  ->  ( A  e.  N  <->  ( A  e.  X  /\  S  =  ran  F ) ) )
Distinct variable groups:    x, y,  .-    x, z,  .+ , y    x, A, y, z    y, F, z    x, N    x, G, y, z    x, S, y, z    x, X, y, z
Allowed substitution hints:    F( x)    .- ( z)    N( y, z)

Proof of Theorem conjnmzb
Dummy variable  w is distinct from all other variables.
StepHypRef Expression
1 conjnmz.1 . . . . 5  |-  N  =  { y  e.  X  |  A. z  e.  X  ( ( y  .+  z )  e.  S  <->  ( z  .+  y )  e.  S ) }
2 ssrab2 3581 . . . . 5  |-  { y  e.  X  |  A. z  e.  X  (
( y  .+  z
)  e.  S  <->  ( z  .+  y )  e.  S
) }  C_  X
31, 2eqsstri 3529 . . . 4  |-  N  C_  X
4 simpr 461 . . . 4  |-  ( ( S  e.  (SubGrp `  G )  /\  A  e.  N )  ->  A  e.  N )
53, 4sseldi 3497 . . 3  |-  ( ( S  e.  (SubGrp `  G )  /\  A  e.  N )  ->  A  e.  X )
6 conjghm.x . . . 4  |-  X  =  ( Base `  G
)
7 conjghm.p . . . 4  |-  .+  =  ( +g  `  G )
8 conjghm.m . . . 4  |-  .-  =  ( -g `  G )
9 conjsubg.f . . . 4  |-  F  =  ( x  e.  S  |->  ( ( A  .+  x )  .-  A
) )
106, 7, 8, 9, 1conjnmz 16427 . . 3  |-  ( ( S  e.  (SubGrp `  G )  /\  A  e.  N )  ->  S  =  ran  F )
115, 10jca 532 . 2  |-  ( ( S  e.  (SubGrp `  G )  /\  A  e.  N )  ->  ( A  e.  X  /\  S  =  ran  F ) )
12 simprl 756 . . 3  |-  ( ( S  e.  (SubGrp `  G )  /\  ( A  e.  X  /\  S  =  ran  F ) )  ->  A  e.  X )
13 simplrr 762 . . . . . 6  |-  ( ( ( S  e.  (SubGrp `  G )  /\  ( A  e.  X  /\  S  =  ran  F ) )  /\  w  e.  X )  ->  S  =  ran  F )
1413eleq2d 2527 . . . . 5  |-  ( ( ( S  e.  (SubGrp `  G )  /\  ( A  e.  X  /\  S  =  ran  F ) )  /\  w  e.  X )  ->  (
( A  .+  w
)  e.  S  <->  ( A  .+  w )  e.  ran  F ) )
15 subgrcl 16333 . . . . . . . . . . . . 13  |-  ( S  e.  (SubGrp `  G
)  ->  G  e.  Grp )
1615ad3antrrr 729 . . . . . . . . . . . 12  |-  ( ( ( ( S  e.  (SubGrp `  G )  /\  A  e.  X
)  /\  w  e.  X )  /\  x  e.  S )  ->  G  e.  Grp )
17 simpllr 760 . . . . . . . . . . . 12  |-  ( ( ( ( S  e.  (SubGrp `  G )  /\  A  e.  X
)  /\  w  e.  X )  /\  x  e.  S )  ->  A  e.  X )
186subgss 16329 . . . . . . . . . . . . . 14  |-  ( S  e.  (SubGrp `  G
)  ->  S  C_  X
)
1918ad2antrr 725 . . . . . . . . . . . . 13  |-  ( ( ( S  e.  (SubGrp `  G )  /\  A  e.  X )  /\  w  e.  X )  ->  S  C_  X )
2019sselda 3499 . . . . . . . . . . . 12  |-  ( ( ( ( S  e.  (SubGrp `  G )  /\  A  e.  X
)  /\  w  e.  X )  /\  x  e.  S )  ->  x  e.  X )
216, 7, 8grpaddsubass 16255 . . . . . . . . . . . 12  |-  ( ( G  e.  Grp  /\  ( A  e.  X  /\  x  e.  X  /\  A  e.  X
) )  ->  (
( A  .+  x
)  .-  A )  =  ( A  .+  ( x  .-  A ) ) )
2216, 17, 20, 17, 21syl13anc 1230 . . . . . . . . . . 11  |-  ( ( ( ( S  e.  (SubGrp `  G )  /\  A  e.  X
)  /\  w  e.  X )  /\  x  e.  S )  ->  (
( A  .+  x
)  .-  A )  =  ( A  .+  ( x  .-  A ) ) )
2322eqeq1d 2459 . . . . . . . . . 10  |-  ( ( ( ( S  e.  (SubGrp `  G )  /\  A  e.  X
)  /\  w  e.  X )  /\  x  e.  S )  ->  (
( ( A  .+  x )  .-  A
)  =  ( A 
.+  w )  <->  ( A  .+  ( x  .-  A
) )  =  ( A  .+  w ) ) )
246, 8grpsubcl 16245 . . . . . . . . . . . 12  |-  ( ( G  e.  Grp  /\  x  e.  X  /\  A  e.  X )  ->  ( x  .-  A
)  e.  X )
2516, 20, 17, 24syl3anc 1228 . . . . . . . . . . 11  |-  ( ( ( ( S  e.  (SubGrp `  G )  /\  A  e.  X
)  /\  w  e.  X )  /\  x  e.  S )  ->  (
x  .-  A )  e.  X )
26 simplr 755 . . . . . . . . . . 11  |-  ( ( ( ( S  e.  (SubGrp `  G )  /\  A  e.  X
)  /\  w  e.  X )  /\  x  e.  S )  ->  w  e.  X )
276, 7grplcan 16229 . . . . . . . . . . 11  |-  ( ( G  e.  Grp  /\  ( ( x  .-  A )  e.  X  /\  w  e.  X  /\  A  e.  X
) )  ->  (
( A  .+  (
x  .-  A )
)  =  ( A 
.+  w )  <->  ( x  .-  A )  =  w ) )
2816, 25, 26, 17, 27syl13anc 1230 . . . . . . . . . 10  |-  ( ( ( ( S  e.  (SubGrp `  G )  /\  A  e.  X
)  /\  w  e.  X )  /\  x  e.  S )  ->  (
( A  .+  (
x  .-  A )
)  =  ( A 
.+  w )  <->  ( x  .-  A )  =  w ) )
296, 7, 8grpsubadd 16253 . . . . . . . . . . 11  |-  ( ( G  e.  Grp  /\  ( x  e.  X  /\  A  e.  X  /\  w  e.  X
) )  ->  (
( x  .-  A
)  =  w  <->  ( w  .+  A )  =  x ) )
3016, 20, 17, 26, 29syl13anc 1230 . . . . . . . . . 10  |-  ( ( ( ( S  e.  (SubGrp `  G )  /\  A  e.  X
)  /\  w  e.  X )  /\  x  e.  S )  ->  (
( x  .-  A
)  =  w  <->  ( w  .+  A )  =  x ) )
3123, 28, 303bitrd 279 . . . . . . . . 9  |-  ( ( ( ( S  e.  (SubGrp `  G )  /\  A  e.  X
)  /\  w  e.  X )  /\  x  e.  S )  ->  (
( ( A  .+  x )  .-  A
)  =  ( A 
.+  w )  <->  ( w  .+  A )  =  x ) )
32 eqcom 2466 . . . . . . . . 9  |-  ( ( A  .+  w )  =  ( ( A 
.+  x )  .-  A )  <->  ( ( A  .+  x )  .-  A )  =  ( A  .+  w ) )
33 eqcom 2466 . . . . . . . . 9  |-  ( x  =  ( w  .+  A )  <->  ( w  .+  A )  =  x )
3431, 32, 333bitr4g 288 . . . . . . . 8  |-  ( ( ( ( S  e.  (SubGrp `  G )  /\  A  e.  X
)  /\  w  e.  X )  /\  x  e.  S )  ->  (
( A  .+  w
)  =  ( ( A  .+  x ) 
.-  A )  <->  x  =  ( w  .+  A ) ) )
3534rexbidva 2965 . . . . . . 7  |-  ( ( ( S  e.  (SubGrp `  G )  /\  A  e.  X )  /\  w  e.  X )  ->  ( E. x  e.  S  ( A  .+  w )  =  ( ( A 
.+  x )  .-  A )  <->  E. x  e.  S  x  =  ( w  .+  A ) ) )
3635adantlrr 720 . . . . . 6  |-  ( ( ( S  e.  (SubGrp `  G )  /\  ( A  e.  X  /\  S  =  ran  F ) )  /\  w  e.  X )  ->  ( E. x  e.  S  ( A  .+  w )  =  ( ( A 
.+  x )  .-  A )  <->  E. x  e.  S  x  =  ( w  .+  A ) ) )
37 ovex 6324 . . . . . . 7  |-  ( A 
.+  w )  e. 
_V
38 eqeq1 2461 . . . . . . . 8  |-  ( y  =  ( A  .+  w )  ->  (
y  =  ( ( A  .+  x ) 
.-  A )  <->  ( A  .+  w )  =  ( ( A  .+  x
)  .-  A )
) )
3938rexbidv 2968 . . . . . . 7  |-  ( y  =  ( A  .+  w )  ->  ( E. x  e.  S  y  =  ( ( A  .+  x )  .-  A )  <->  E. x  e.  S  ( A  .+  w )  =  ( ( A  .+  x
)  .-  A )
) )
409rnmpt 5258 . . . . . . 7  |-  ran  F  =  { y  |  E. x  e.  S  y  =  ( ( A 
.+  x )  .-  A ) }
4137, 39, 40elab2 3249 . . . . . 6  |-  ( ( A  .+  w )  e.  ran  F  <->  E. x  e.  S  ( A  .+  w )  =  ( ( A  .+  x
)  .-  A )
)
42 risset 2982 . . . . . 6  |-  ( ( w  .+  A )  e.  S  <->  E. x  e.  S  x  =  ( w  .+  A ) )
4336, 41, 423bitr4g 288 . . . . 5  |-  ( ( ( S  e.  (SubGrp `  G )  /\  ( A  e.  X  /\  S  =  ran  F ) )  /\  w  e.  X )  ->  (
( A  .+  w
)  e.  ran  F  <->  ( w  .+  A )  e.  S ) )
4414, 43bitrd 253 . . . 4  |-  ( ( ( S  e.  (SubGrp `  G )  /\  ( A  e.  X  /\  S  =  ran  F ) )  /\  w  e.  X )  ->  (
( A  .+  w
)  e.  S  <->  ( w  .+  A )  e.  S
) )
4544ralrimiva 2871 . . 3  |-  ( ( S  e.  (SubGrp `  G )  /\  ( A  e.  X  /\  S  =  ran  F ) )  ->  A. w  e.  X  ( ( A  .+  w )  e.  S  <->  ( w  .+  A )  e.  S
) )
461elnmz 16367 . . 3  |-  ( A  e.  N  <->  ( A  e.  X  /\  A. w  e.  X  ( ( A  .+  w )  e.  S  <->  ( w  .+  A )  e.  S
) ) )
4712, 45, 46sylanbrc 664 . 2  |-  ( ( S  e.  (SubGrp `  G )  /\  ( A  e.  X  /\  S  =  ran  F ) )  ->  A  e.  N )
4811, 47impbida 832 1  |-  ( S  e.  (SubGrp `  G
)  ->  ( A  e.  N  <->  ( A  e.  X  /\  S  =  ran  F ) ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 184    /\ wa 369    = wceq 1395    e. wcel 1819   A.wral 2807   E.wrex 2808   {crab 2811    C_ wss 3471    |-> cmpt 4515   ran crn 5009   ` cfv 5594  (class class class)co 6296   Basecbs 14644   +g cplusg 14712   Grpcgrp 16180   -gcsg 16182  SubGrpcsubg 16322
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1619  ax-4 1632  ax-5 1705  ax-6 1748  ax-7 1791  ax-8 1821  ax-9 1823  ax-10 1838  ax-11 1843  ax-12 1855  ax-13 2000  ax-ext 2435  ax-rep 4568  ax-sep 4578  ax-nul 4586  ax-pow 4634  ax-pr 4695  ax-un 6591
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 975  df-tru 1398  df-ex 1614  df-nf 1618  df-sb 1741  df-eu 2287  df-mo 2288  df-clab 2443  df-cleq 2449  df-clel 2452  df-nfc 2607  df-ne 2654  df-ral 2812  df-rex 2813  df-reu 2814  df-rmo 2815  df-rab 2816  df-v 3111  df-sbc 3328  df-csb 3431  df-dif 3474  df-un 3476  df-in 3478  df-ss 3485  df-nul 3794  df-if 3945  df-pw 4017  df-sn 4033  df-pr 4035  df-op 4039  df-uni 4252  df-iun 4334  df-br 4457  df-opab 4516  df-mpt 4517  df-id 4804  df-xp 5014  df-rel 5015  df-cnv 5016  df-co 5017  df-dm 5018  df-rn 5019  df-res 5020  df-ima 5021  df-iota 5557  df-fun 5596  df-fn 5597  df-f 5598  df-f1 5599  df-fo 5600  df-f1o 5601  df-fv 5602  df-riota 6258  df-ov 6299  df-oprab 6300  df-mpt2 6301  df-1st 6799  df-2nd 6800  df-0g 14859  df-mgm 15999  df-sgrp 16038  df-mnd 16048  df-grp 16184  df-minusg 16185  df-sbg 16186  df-subg 16325
This theorem is referenced by:  sylow3lem6  16779
  Copyright terms: Public domain W3C validator