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

Theorem sylow1 15192
Description: Sylow's first theorem. If  P ^ N is a prime power that divides the cardinality of  G, then  G has a supgroup with size  P ^ N. (Contributed by Mario Carneiro, 16-Jan-2015.)
Hypotheses
Ref Expression
sylow1.x  |-  X  =  ( Base `  G
)
sylow1.g  |-  ( ph  ->  G  e.  Grp )
sylow1.f  |-  ( ph  ->  X  e.  Fin )
sylow1.p  |-  ( ph  ->  P  e.  Prime )
sylow1.n  |-  ( ph  ->  N  e.  NN0 )
sylow1.d  |-  ( ph  ->  ( P ^ N
)  ||  ( # `  X
) )
Assertion
Ref Expression
sylow1  |-  ( ph  ->  E. g  e.  (SubGrp `  G ) ( # `  g )  =  ( P ^ N ) )
Distinct variable groups:    g, N    g, X    g, G    P, g    ph, g

Proof of Theorem sylow1
Dummy variables  a 
b  s  u  x  y  z  h  k  t  v are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 sylow1.x . . 3  |-  X  =  ( Base `  G
)
2 sylow1.g . . 3  |-  ( ph  ->  G  e.  Grp )
3 sylow1.f . . 3  |-  ( ph  ->  X  e.  Fin )
4 sylow1.p . . 3  |-  ( ph  ->  P  e.  Prime )
5 sylow1.n . . 3  |-  ( ph  ->  N  e.  NN0 )
6 sylow1.d . . 3  |-  ( ph  ->  ( P ^ N
)  ||  ( # `  X
) )
7 eqid 2404 . . 3  |-  ( +g  `  G )  =  ( +g  `  G )
8 eqid 2404 . . 3  |-  { s  e.  ~P X  | 
( # `  s )  =  ( P ^ N ) }  =  { s  e.  ~P X  |  ( # `  s
)  =  ( P ^ N ) }
9 oveq2 6048 . . . . . . 7  |-  ( s  =  z  ->  (
u ( +g  `  G
) s )  =  ( u ( +g  `  G ) z ) )
109cbvmptv 4260 . . . . . 6  |-  ( s  e.  v  |->  ( u ( +g  `  G
) s ) )  =  ( z  e.  v  |->  ( u ( +g  `  G ) z ) )
11 oveq1 6047 . . . . . . 7  |-  ( u  =  x  ->  (
u ( +g  `  G
) z )  =  ( x ( +g  `  G ) z ) )
1211mpteq2dv 4256 . . . . . 6  |-  ( u  =  x  ->  (
z  e.  v  |->  ( u ( +g  `  G
) z ) )  =  ( z  e.  v  |->  ( x ( +g  `  G ) z ) ) )
1310, 12syl5eq 2448 . . . . 5  |-  ( u  =  x  ->  (
s  e.  v  |->  ( u ( +g  `  G
) s ) )  =  ( z  e.  v  |->  ( x ( +g  `  G ) z ) ) )
1413rneqd 5056 . . . 4  |-  ( u  =  x  ->  ran  ( s  e.  v 
|->  ( u ( +g  `  G ) s ) )  =  ran  (
z  e.  v  |->  ( x ( +g  `  G
) z ) ) )
15 mpteq1 4249 . . . . 5  |-  ( v  =  y  ->  (
z  e.  v  |->  ( x ( +g  `  G
) z ) )  =  ( z  e.  y  |->  ( x ( +g  `  G ) z ) ) )
1615rneqd 5056 . . . 4  |-  ( v  =  y  ->  ran  ( z  e.  v 
|->  ( x ( +g  `  G ) z ) )  =  ran  (
z  e.  y  |->  ( x ( +g  `  G
) z ) ) )
1714, 16cbvmpt2v 6111 . . 3  |-  ( u  e.  X ,  v  e.  { s  e. 
~P X  |  (
# `  s )  =  ( P ^ N ) }  |->  ran  ( s  e.  v 
|->  ( u ( +g  `  G ) s ) ) )  =  ( x  e.  X , 
y  e.  { s  e.  ~P X  | 
( # `  s )  =  ( P ^ N ) }  |->  ran  ( z  e.  y 
|->  ( x ( +g  `  G ) z ) ) )
18 preq12 3845 . . . . . 6  |-  ( ( a  =  x  /\  b  =  y )  ->  { a ,  b }  =  { x ,  y } )
1918sseq1d 3335 . . . . 5  |-  ( ( a  =  x  /\  b  =  y )  ->  ( { a ,  b }  C_  { s  e.  ~P X  | 
( # `  s )  =  ( P ^ N ) }  <->  { x ,  y }  C_  { s  e.  ~P X  |  ( # `  s
)  =  ( P ^ N ) } ) )
20 oveq2 6048 . . . . . . 7  |-  ( a  =  x  ->  (
k ( u  e.  X ,  v  e. 
{ s  e.  ~P X  |  ( # `  s
)  =  ( P ^ N ) } 
|->  ran  ( s  e.  v  |->  ( u ( +g  `  G ) s ) ) ) a )  =  ( k ( u  e.  X ,  v  e. 
{ s  e.  ~P X  |  ( # `  s
)  =  ( P ^ N ) } 
|->  ran  ( s  e.  v  |->  ( u ( +g  `  G ) s ) ) ) x ) )
21 id 20 . . . . . . 7  |-  ( b  =  y  ->  b  =  y )
2220, 21eqeqan12d 2419 . . . . . 6  |-  ( ( a  =  x  /\  b  =  y )  ->  ( ( k ( u  e.  X , 
v  e.  { s  e.  ~P X  | 
( # `  s )  =  ( P ^ N ) }  |->  ran  ( s  e.  v 
|->  ( u ( +g  `  G ) s ) ) ) a )  =  b  <->  ( k
( u  e.  X ,  v  e.  { s  e.  ~P X  | 
( # `  s )  =  ( P ^ N ) }  |->  ran  ( s  e.  v 
|->  ( u ( +g  `  G ) s ) ) ) x )  =  y ) )
2322rexbidv 2687 . . . . 5  |-  ( ( a  =  x  /\  b  =  y )  ->  ( E. k  e.  X  ( k ( u  e.  X , 
v  e.  { s  e.  ~P X  | 
( # `  s )  =  ( P ^ N ) }  |->  ran  ( s  e.  v 
|->  ( u ( +g  `  G ) s ) ) ) a )  =  b  <->  E. k  e.  X  ( k
( u  e.  X ,  v  e.  { s  e.  ~P X  | 
( # `  s )  =  ( P ^ N ) }  |->  ran  ( s  e.  v 
|->  ( u ( +g  `  G ) s ) ) ) x )  =  y ) )
2419, 23anbi12d 692 . . . 4  |-  ( ( a  =  x  /\  b  =  y )  ->  ( ( { a ,  b }  C_  { s  e.  ~P X  |  ( # `  s
)  =  ( P ^ N ) }  /\  E. k  e.  X  ( k ( u  e.  X , 
v  e.  { s  e.  ~P X  | 
( # `  s )  =  ( P ^ N ) }  |->  ran  ( s  e.  v 
|->  ( u ( +g  `  G ) s ) ) ) a )  =  b )  <->  ( {
x ,  y } 
C_  { s  e. 
~P X  |  (
# `  s )  =  ( P ^ N ) }  /\  E. k  e.  X  ( k ( u  e.  X ,  v  e. 
{ s  e.  ~P X  |  ( # `  s
)  =  ( P ^ N ) } 
|->  ran  ( s  e.  v  |->  ( u ( +g  `  G ) s ) ) ) x )  =  y ) ) )
2524cbvopabv 4237 . . 3  |-  { <. a ,  b >.  |  ( { a ,  b }  C_  { s  e.  ~P X  |  (
# `  s )  =  ( P ^ N ) }  /\  E. k  e.  X  ( k ( u  e.  X ,  v  e. 
{ s  e.  ~P X  |  ( # `  s
)  =  ( P ^ N ) } 
|->  ran  ( s  e.  v  |->  ( u ( +g  `  G ) s ) ) ) a )  =  b ) }  =  { <. x ,  y >.  |  ( { x ,  y }  C_  { s  e.  ~P X  |  ( # `  s
)  =  ( P ^ N ) }  /\  E. k  e.  X  ( k ( u  e.  X , 
v  e.  { s  e.  ~P X  | 
( # `  s )  =  ( P ^ N ) }  |->  ran  ( s  e.  v 
|->  ( u ( +g  `  G ) s ) ) ) x )  =  y ) }
261, 2, 3, 4, 5, 6, 7, 8, 17, 25sylow1lem3 15189 . 2  |-  ( ph  ->  E. h  e.  {
s  e.  ~P X  |  ( # `  s
)  =  ( P ^ N ) }  ( P  pCnt  ( # `
 [ h ] { <. a ,  b
>.  |  ( {
a ,  b } 
C_  { s  e. 
~P X  |  (
# `  s )  =  ( P ^ N ) }  /\  E. k  e.  X  ( k ( u  e.  X ,  v  e. 
{ s  e.  ~P X  |  ( # `  s
)  =  ( P ^ N ) } 
|->  ran  ( s  e.  v  |->  ( u ( +g  `  G ) s ) ) ) a )  =  b ) } ) )  <_  ( ( P 
pCnt  ( # `  X
) )  -  N
) )
272adantr 452 . . 3  |-  ( (
ph  /\  ( h  e.  { s  e.  ~P X  |  ( # `  s
)  =  ( P ^ N ) }  /\  ( P  pCnt  (
# `  [ h ] { <. a ,  b
>.  |  ( {
a ,  b } 
C_  { s  e. 
~P X  |  (
# `  s )  =  ( P ^ N ) }  /\  E. k  e.  X  ( k ( u  e.  X ,  v  e. 
{ s  e.  ~P X  |  ( # `  s
)  =  ( P ^ N ) } 
|->  ran  ( s  e.  v  |->  ( u ( +g  `  G ) s ) ) ) a )  =  b ) } ) )  <_  ( ( P 
pCnt  ( # `  X
) )  -  N
) ) )  ->  G  e.  Grp )
283adantr 452 . . 3  |-  ( (
ph  /\  ( h  e.  { s  e.  ~P X  |  ( # `  s
)  =  ( P ^ N ) }  /\  ( P  pCnt  (
# `  [ h ] { <. a ,  b
>.  |  ( {
a ,  b } 
C_  { s  e. 
~P X  |  (
# `  s )  =  ( P ^ N ) }  /\  E. k  e.  X  ( k ( u  e.  X ,  v  e. 
{ s  e.  ~P X  |  ( # `  s
)  =  ( P ^ N ) } 
|->  ran  ( s  e.  v  |->  ( u ( +g  `  G ) s ) ) ) a )  =  b ) } ) )  <_  ( ( P 
pCnt  ( # `  X
) )  -  N
) ) )  ->  X  e.  Fin )
294adantr 452 . . 3  |-  ( (
ph  /\  ( h  e.  { s  e.  ~P X  |  ( # `  s
)  =  ( P ^ N ) }  /\  ( P  pCnt  (
# `  [ h ] { <. a ,  b
>.  |  ( {
a ,  b } 
C_  { s  e. 
~P X  |  (
# `  s )  =  ( P ^ N ) }  /\  E. k  e.  X  ( k ( u  e.  X ,  v  e. 
{ s  e.  ~P X  |  ( # `  s
)  =  ( P ^ N ) } 
|->  ran  ( s  e.  v  |->  ( u ( +g  `  G ) s ) ) ) a )  =  b ) } ) )  <_  ( ( P 
pCnt  ( # `  X
) )  -  N
) ) )  ->  P  e.  Prime )
305adantr 452 . . 3  |-  ( (
ph  /\  ( h  e.  { s  e.  ~P X  |  ( # `  s
)  =  ( P ^ N ) }  /\  ( P  pCnt  (
# `  [ h ] { <. a ,  b
>.  |  ( {
a ,  b } 
C_  { s  e. 
~P X  |  (
# `  s )  =  ( P ^ N ) }  /\  E. k  e.  X  ( k ( u  e.  X ,  v  e. 
{ s  e.  ~P X  |  ( # `  s
)  =  ( P ^ N ) } 
|->  ran  ( s  e.  v  |->  ( u ( +g  `  G ) s ) ) ) a )  =  b ) } ) )  <_  ( ( P 
pCnt  ( # `  X
) )  -  N
) ) )  ->  N  e.  NN0 )
316adantr 452 . . 3  |-  ( (
ph  /\  ( h  e.  { s  e.  ~P X  |  ( # `  s
)  =  ( P ^ N ) }  /\  ( P  pCnt  (
# `  [ h ] { <. a ,  b
>.  |  ( {
a ,  b } 
C_  { s  e. 
~P X  |  (
# `  s )  =  ( P ^ N ) }  /\  E. k  e.  X  ( k ( u  e.  X ,  v  e. 
{ s  e.  ~P X  |  ( # `  s
)  =  ( P ^ N ) } 
|->  ran  ( s  e.  v  |->  ( u ( +g  `  G ) s ) ) ) a )  =  b ) } ) )  <_  ( ( P 
pCnt  ( # `  X
) )  -  N
) ) )  -> 
( P ^ N
)  ||  ( # `  X
) )
32 simprl 733 . . 3  |-  ( (
ph  /\  ( h  e.  { s  e.  ~P X  |  ( # `  s
)  =  ( P ^ N ) }  /\  ( P  pCnt  (
# `  [ h ] { <. a ,  b
>.  |  ( {
a ,  b } 
C_  { s  e. 
~P X  |  (
# `  s )  =  ( P ^ N ) }  /\  E. k  e.  X  ( k ( u  e.  X ,  v  e. 
{ s  e.  ~P X  |  ( # `  s
)  =  ( P ^ N ) } 
|->  ran  ( s  e.  v  |->  ( u ( +g  `  G ) s ) ) ) a )  =  b ) } ) )  <_  ( ( P 
pCnt  ( # `  X
) )  -  N
) ) )  ->  h  e.  { s  e.  ~P X  |  (
# `  s )  =  ( P ^ N ) } )
33 eqid 2404 . . 3  |-  { t  e.  X  |  ( t ( u  e.  X ,  v  e. 
{ s  e.  ~P X  |  ( # `  s
)  =  ( P ^ N ) } 
|->  ran  ( s  e.  v  |->  ( u ( +g  `  G ) s ) ) ) h )  =  h }  =  { t  e.  X  |  ( t ( u  e.  X ,  v  e. 
{ s  e.  ~P X  |  ( # `  s
)  =  ( P ^ N ) } 
|->  ran  ( s  e.  v  |->  ( u ( +g  `  G ) s ) ) ) h )  =  h }
34 simprr 734 . . 3  |-  ( (
ph  /\  ( h  e.  { s  e.  ~P X  |  ( # `  s
)  =  ( P ^ N ) }  /\  ( P  pCnt  (
# `  [ h ] { <. a ,  b
>.  |  ( {
a ,  b } 
C_  { s  e. 
~P X  |  (
# `  s )  =  ( P ^ N ) }  /\  E. k  e.  X  ( k ( u  e.  X ,  v  e. 
{ s  e.  ~P X  |  ( # `  s
)  =  ( P ^ N ) } 
|->  ran  ( s  e.  v  |->  ( u ( +g  `  G ) s ) ) ) a )  =  b ) } ) )  <_  ( ( P 
pCnt  ( # `  X
) )  -  N
) ) )  -> 
( P  pCnt  ( # `
 [ h ] { <. a ,  b
>.  |  ( {
a ,  b } 
C_  { s  e. 
~P X  |  (
# `  s )  =  ( P ^ N ) }  /\  E. k  e.  X  ( k ( u  e.  X ,  v  e. 
{ s  e.  ~P X  |  ( # `  s
)  =  ( P ^ N ) } 
|->  ran  ( s  e.  v  |->  ( u ( +g  `  G ) s ) ) ) a )  =  b ) } ) )  <_  ( ( P 
pCnt  ( # `  X
) )  -  N
) )
351, 27, 28, 29, 30, 31, 7, 8, 17, 25, 32, 33, 34sylow1lem5 15191 . 2  |-  ( (
ph  /\  ( h  e.  { s  e.  ~P X  |  ( # `  s
)  =  ( P ^ N ) }  /\  ( P  pCnt  (
# `  [ h ] { <. a ,  b
>.  |  ( {
a ,  b } 
C_  { s  e. 
~P X  |  (
# `  s )  =  ( P ^ N ) }  /\  E. k  e.  X  ( k ( u  e.  X ,  v  e. 
{ s  e.  ~P X  |  ( # `  s
)  =  ( P ^ N ) } 
|->  ran  ( s  e.  v  |->  ( u ( +g  `  G ) s ) ) ) a )  =  b ) } ) )  <_  ( ( P 
pCnt  ( # `  X
) )  -  N
) ) )  ->  E. g  e.  (SubGrp `  G ) ( # `  g )  =  ( P ^ N ) )
3626, 35rexlimddv 2794 1  |-  ( ph  ->  E. g  e.  (SubGrp `  G ) ( # `  g )  =  ( P ^ N ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 359    = wceq 1649    e. wcel 1721   E.wrex 2667   {crab 2670    C_ wss 3280   ~Pcpw 3759   {cpr 3775   class class class wbr 4172   {copab 4225    e. cmpt 4226   ran crn 4838   ` cfv 5413  (class class class)co 6040    e. cmpt2 6042   [cec 6862   Fincfn 7068    <_ cle 9077    - cmin 9247   NN0cn0 10177   ^cexp 11337   #chash 11573    || cdivides 12807   Primecprime 13034    pCnt cpc 13165   Basecbs 13424   +g cplusg 13484   Grpcgrp 14640  SubGrpcsubg 14893
This theorem is referenced by:  odcau  15193  slwhash  15213
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1552  ax-5 1563  ax-17 1623  ax-9 1662  ax-8 1683  ax-13 1723  ax-14 1725  ax-6 1740  ax-7 1745  ax-11 1757  ax-12 1946  ax-ext 2385  ax-rep 4280  ax-sep 4290  ax-nul 4298  ax-pow 4337  ax-pr 4363  ax-un 4660  ax-inf2 7552  ax-cnex 9002  ax-resscn 9003  ax-1cn 9004  ax-icn 9005  ax-addcl 9006  ax-addrcl 9007  ax-mulcl 9008  ax-mulrcl 9009  ax-mulcom 9010  ax-addass 9011  ax-mulass 9012  ax-distr 9013  ax-i2m1 9014  ax-1ne0 9015  ax-1rid 9016  ax-rnegex 9017  ax-rrecex 9018  ax-cnre 9019  ax-pre-lttri 9020  ax-pre-lttrn 9021  ax-pre-ltadd 9022  ax-pre-mulgt0 9023  ax-pre-sup 9024
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3or 937  df-3an 938  df-tru 1325  df-ex 1548  df-nf 1551  df-sb 1656  df-eu 2258  df-mo 2259  df-clab 2391  df-cleq 2397  df-clel 2400  df-nfc 2529  df-ne 2569  df-nel 2570  df-ral 2671  df-rex 2672  df-reu 2673  df-rmo 2674  df-rab 2675  df-v 2918  df-sbc 3122  df-csb 3212  df-dif 3283  df-un 3285  df-in 3287  df-ss 3294  df-pss 3296  df-nul 3589  df-if 3700  df-pw 3761  df-sn 3780  df-pr 3781  df-tp 3782  df-op 3783  df-uni 3976  df-int 4011  df-iun 4055  df-disj 4143  df-br 4173  df-opab 4227  df-mpt 4228  df-tr 4263  df-eprel 4454  df-id 4458  df-po 4463  df-so 4464  df-fr 4501  df-se 4502  df-we 4503  df-ord 4544  df-on 4545  df-lim 4546  df-suc 4547  df-om 4805  df-xp 4843  df-rel 4844  df-cnv 4845  df-co 4846  df-dm 4847  df-rn 4848  df-res 4849  df-ima 4850  df-iota 5377  df-fun 5415  df-fn 5416  df-f 5417  df-f1 5418  df-fo 5419  df-f1o 5420  df-fv 5421  df-isom 5422  df-ov 6043  df-oprab 6044  df-mpt2 6045  df-1st 6308  df-2nd 6309  df-riota 6508  df-recs 6592  df-rdg 6627  df-1o 6683  df-2o 6684  df-oadd 6687  df-er 6864  df-ec 6866  df-qs 6870  df-map 6979  df-en 7069  df-dom 7070  df-sdom 7071  df-fin 7072  df-sup 7404  df-oi 7435  df-card 7782  df-cda 8004  df-pnf 9078  df-mnf 9079  df-xr 9080  df-ltxr 9081  df-le 9082  df-sub 9249  df-neg 9250  df-div 9634  df-nn 9957  df-2 10014  df-3 10015  df-n0 10178  df-z 10239  df-uz 10445  df-q 10531  df-rp 10569  df-fz 11000  df-fzo 11091  df-fl 11157  df-mod 11206  df-seq 11279  df-exp 11338  df-fac 11522  df-bc 11549  df-hash 11574  df-cj 11859  df-re 11860  df-im 11861  df-sqr 11995  df-abs 11996  df-clim 12237  df-sum 12435  df-dvds 12808  df-gcd 12962  df-prm 13035  df-pc 13166  df-ndx 13427  df-slot 13428  df-base 13429  df-sets 13430  df-ress 13431  df-plusg 13497  df-0g 13682  df-mnd 14645  df-grp 14767  df-minusg 14768  df-subg 14896  df-eqg 14898  df-ga 15022
  Copyright terms: Public domain W3C validator