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

Theorem pgpfi1 16195
Description: A finite group with order a power of a prime  P is a  P-group. (Contributed by Mario Carneiro, 16-Jan-2015.)
Hypothesis
Ref Expression
pgpfi1.1  |-  X  =  ( Base `  G
)
Assertion
Ref Expression
pgpfi1  |-  ( ( G  e.  Grp  /\  P  e.  Prime  /\  N  e.  NN0 )  ->  (
( # `  X )  =  ( P ^ N )  ->  P pGrp  G ) )

Proof of Theorem pgpfi1
Dummy variables  n  x are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simpl2 992 . . 3  |-  ( ( ( G  e.  Grp  /\  P  e.  Prime  /\  N  e.  NN0 )  /\  ( # `
 X )  =  ( P ^ N
) )  ->  P  e.  Prime )
2 simpl1 991 . . 3  |-  ( ( ( G  e.  Grp  /\  P  e.  Prime  /\  N  e.  NN0 )  /\  ( # `
 X )  =  ( P ^ N
) )  ->  G  e.  Grp )
3 simpll3 1029 . . . . . 6  |-  ( ( ( ( G  e. 
Grp  /\  P  e.  Prime  /\  N  e.  NN0 )  /\  ( # `  X
)  =  ( P ^ N ) )  /\  x  e.  X
)  ->  N  e.  NN0 )
42adantr 465 . . . . . . . 8  |-  ( ( ( ( G  e. 
Grp  /\  P  e.  Prime  /\  N  e.  NN0 )  /\  ( # `  X
)  =  ( P ^ N ) )  /\  x  e.  X
)  ->  G  e.  Grp )
5 simplr 754 . . . . . . . . . 10  |-  ( ( ( ( G  e. 
Grp  /\  P  e.  Prime  /\  N  e.  NN0 )  /\  ( # `  X
)  =  ( P ^ N ) )  /\  x  e.  X
)  ->  ( # `  X
)  =  ( P ^ N ) )
61adantr 465 . . . . . . . . . . . . 13  |-  ( ( ( ( G  e. 
Grp  /\  P  e.  Prime  /\  N  e.  NN0 )  /\  ( # `  X
)  =  ( P ^ N ) )  /\  x  e.  X
)  ->  P  e.  Prime )
7 prmnn 13865 . . . . . . . . . . . . 13  |-  ( P  e.  Prime  ->  P  e.  NN )
86, 7syl 16 . . . . . . . . . . . 12  |-  ( ( ( ( G  e. 
Grp  /\  P  e.  Prime  /\  N  e.  NN0 )  /\  ( # `  X
)  =  ( P ^ N ) )  /\  x  e.  X
)  ->  P  e.  NN )
98, 3nnexpcld 12127 . . . . . . . . . . 11  |-  ( ( ( ( G  e. 
Grp  /\  P  e.  Prime  /\  N  e.  NN0 )  /\  ( # `  X
)  =  ( P ^ N ) )  /\  x  e.  X
)  ->  ( P ^ N )  e.  NN )
109nnnn0d 10734 . . . . . . . . . 10  |-  ( ( ( ( G  e. 
Grp  /\  P  e.  Prime  /\  N  e.  NN0 )  /\  ( # `  X
)  =  ( P ^ N ) )  /\  x  e.  X
)  ->  ( P ^ N )  e.  NN0 )
115, 10eqeltrd 2537 . . . . . . . . 9  |-  ( ( ( ( G  e. 
Grp  /\  P  e.  Prime  /\  N  e.  NN0 )  /\  ( # `  X
)  =  ( P ^ N ) )  /\  x  e.  X
)  ->  ( # `  X
)  e.  NN0 )
12 pgpfi1.1 . . . . . . . . . . 11  |-  X  =  ( Base `  G
)
13 fvex 5796 . . . . . . . . . . 11  |-  ( Base `  G )  e.  _V
1412, 13eqeltri 2533 . . . . . . . . . 10  |-  X  e. 
_V
15 hashclb 12226 . . . . . . . . . 10  |-  ( X  e.  _V  ->  ( X  e.  Fin  <->  ( # `  X
)  e.  NN0 )
)
1614, 15ax-mp 5 . . . . . . . . 9  |-  ( X  e.  Fin  <->  ( # `  X
)  e.  NN0 )
1711, 16sylibr 212 . . . . . . . 8  |-  ( ( ( ( G  e. 
Grp  /\  P  e.  Prime  /\  N  e.  NN0 )  /\  ( # `  X
)  =  ( P ^ N ) )  /\  x  e.  X
)  ->  X  e.  Fin )
18 simpr 461 . . . . . . . 8  |-  ( ( ( ( G  e. 
Grp  /\  P  e.  Prime  /\  N  e.  NN0 )  /\  ( # `  X
)  =  ( P ^ N ) )  /\  x  e.  X
)  ->  x  e.  X )
19 eqid 2451 . . . . . . . . 9  |-  ( od
`  G )  =  ( od `  G
)
2012, 19oddvds2 16168 . . . . . . . 8  |-  ( ( G  e.  Grp  /\  X  e.  Fin  /\  x  e.  X )  ->  (
( od `  G
) `  x )  ||  ( # `  X
) )
214, 17, 18, 20syl3anc 1219 . . . . . . 7  |-  ( ( ( ( G  e. 
Grp  /\  P  e.  Prime  /\  N  e.  NN0 )  /\  ( # `  X
)  =  ( P ^ N ) )  /\  x  e.  X
)  ->  ( ( od `  G ) `  x )  ||  ( # `
 X ) )
2221, 5breqtrd 4411 . . . . . 6  |-  ( ( ( ( G  e. 
Grp  /\  P  e.  Prime  /\  N  e.  NN0 )  /\  ( # `  X
)  =  ( P ^ N ) )  /\  x  e.  X
)  ->  ( ( od `  G ) `  x )  ||  ( P ^ N ) )
23 oveq2 6195 . . . . . . . 8  |-  ( n  =  N  ->  ( P ^ n )  =  ( P ^ N
) )
2423breq2d 4399 . . . . . . 7  |-  ( n  =  N  ->  (
( ( od `  G ) `  x
)  ||  ( P ^ n )  <->  ( ( od `  G ) `  x )  ||  ( P ^ N ) ) )
2524rspcev 3166 . . . . . 6  |-  ( ( N  e.  NN0  /\  ( ( od `  G ) `  x
)  ||  ( P ^ N ) )  ->  E. n  e.  NN0  ( ( od `  G ) `  x
)  ||  ( P ^ n ) )
263, 22, 25syl2anc 661 . . . . 5  |-  ( ( ( ( G  e. 
Grp  /\  P  e.  Prime  /\  N  e.  NN0 )  /\  ( # `  X
)  =  ( P ^ N ) )  /\  x  e.  X
)  ->  E. n  e.  NN0  ( ( od
`  G ) `  x )  ||  ( P ^ n ) )
2712, 19odcl2 16167 . . . . . . 7  |-  ( ( G  e.  Grp  /\  X  e.  Fin  /\  x  e.  X )  ->  (
( od `  G
) `  x )  e.  NN )
284, 17, 18, 27syl3anc 1219 . . . . . 6  |-  ( ( ( ( G  e. 
Grp  /\  P  e.  Prime  /\  N  e.  NN0 )  /\  ( # `  X
)  =  ( P ^ N ) )  /\  x  e.  X
)  ->  ( ( od `  G ) `  x )  e.  NN )
29 pcprmpw2 14047 . . . . . . 7  |-  ( ( P  e.  Prime  /\  (
( od `  G
) `  x )  e.  NN )  ->  ( E. n  e.  NN0  ( ( od `  G ) `  x
)  ||  ( P ^ n )  <->  ( ( od `  G ) `  x )  =  ( P ^ ( P 
pCnt  ( ( od
`  G ) `  x ) ) ) ) )
30 pcprmpw 14048 . . . . . . 7  |-  ( ( P  e.  Prime  /\  (
( od `  G
) `  x )  e.  NN )  ->  ( E. n  e.  NN0  ( ( od `  G ) `  x
)  =  ( P ^ n )  <->  ( ( od `  G ) `  x )  =  ( P ^ ( P 
pCnt  ( ( od
`  G ) `  x ) ) ) ) )
3129, 30bitr4d 256 . . . . . 6  |-  ( ( P  e.  Prime  /\  (
( od `  G
) `  x )  e.  NN )  ->  ( E. n  e.  NN0  ( ( od `  G ) `  x
)  ||  ( P ^ n )  <->  E. n  e.  NN0  ( ( od
`  G ) `  x )  =  ( P ^ n ) ) )
326, 28, 31syl2anc 661 . . . . 5  |-  ( ( ( ( G  e. 
Grp  /\  P  e.  Prime  /\  N  e.  NN0 )  /\  ( # `  X
)  =  ( P ^ N ) )  /\  x  e.  X
)  ->  ( E. n  e.  NN0  ( ( od `  G ) `
 x )  ||  ( P ^ n )  <->  E. n  e.  NN0  ( ( od `  G ) `  x
)  =  ( P ^ n ) ) )
3326, 32mpbid 210 . . . 4  |-  ( ( ( ( G  e. 
Grp  /\  P  e.  Prime  /\  N  e.  NN0 )  /\  ( # `  X
)  =  ( P ^ N ) )  /\  x  e.  X
)  ->  E. n  e.  NN0  ( ( od
`  G ) `  x )  =  ( P ^ n ) )
3433ralrimiva 2820 . . 3  |-  ( ( ( G  e.  Grp  /\  P  e.  Prime  /\  N  e.  NN0 )  /\  ( # `
 X )  =  ( P ^ N
) )  ->  A. x  e.  X  E. n  e.  NN0  ( ( od
`  G ) `  x )  =  ( P ^ n ) )
3512, 19ispgp 16192 . . 3  |-  ( P pGrp 
G  <->  ( P  e. 
Prime  /\  G  e.  Grp  /\ 
A. x  e.  X  E. n  e.  NN0  ( ( od `  G ) `  x
)  =  ( P ^ n ) ) )
361, 2, 34, 35syl3anbrc 1172 . 2  |-  ( ( ( G  e.  Grp  /\  P  e.  Prime  /\  N  e.  NN0 )  /\  ( # `
 X )  =  ( P ^ N
) )  ->  P pGrp  G )
3736ex 434 1  |-  ( ( G  e.  Grp  /\  P  e.  Prime  /\  N  e.  NN0 )  ->  (
( # `  X )  =  ( P ^ N )  ->  P pGrp  G ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 184    /\ wa 369    /\ w3a 965    = wceq 1370    e. wcel 1758   A.wral 2793   E.wrex 2794   _Vcvv 3065   class class class wbr 4387   ` cfv 5513  (class class class)co 6187   Fincfn 7407   NNcn 10420   NN0cn0 10677   ^cexp 11963   #chash 12201    || cdivides 13634   Primecprime 13862    pCnt cpc 14002   Basecbs 14273   Grpcgrp 15509   odcod 16129   pGrp cpgp 16131
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1592  ax-4 1603  ax-5 1671  ax-6 1710  ax-7 1730  ax-8 1760  ax-9 1762  ax-10 1777  ax-11 1782  ax-12 1794  ax-13 1952  ax-ext 2430  ax-rep 4498  ax-sep 4508  ax-nul 4516  ax-pow 4565  ax-pr 4626  ax-un 6469  ax-inf2 7945  ax-cnex 9436  ax-resscn 9437  ax-1cn 9438  ax-icn 9439  ax-addcl 9440  ax-addrcl 9441  ax-mulcl 9442  ax-mulrcl 9443  ax-mulcom 9444  ax-addass 9445  ax-mulass 9446  ax-distr 9447  ax-i2m1 9448  ax-1ne0 9449  ax-1rid 9450  ax-rnegex 9451  ax-rrecex 9452  ax-cnre 9453  ax-pre-lttri 9454  ax-pre-lttrn 9455  ax-pre-ltadd 9456  ax-pre-mulgt0 9457  ax-pre-sup 9458
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3or 966  df-3an 967  df-tru 1373  df-fal 1376  df-ex 1588  df-nf 1591  df-sb 1703  df-eu 2264  df-mo 2265  df-clab 2437  df-cleq 2443  df-clel 2446  df-nfc 2599  df-ne 2644  df-nel 2645  df-ral 2798  df-rex 2799  df-reu 2800  df-rmo 2801  df-rab 2802  df-v 3067  df-sbc 3282  df-csb 3384  df-dif 3426  df-un 3428  df-in 3430  df-ss 3437  df-pss 3439  df-nul 3733  df-if 3887  df-pw 3957  df-sn 3973  df-pr 3975  df-tp 3977  df-op 3979  df-uni 4187  df-int 4224  df-iun 4268  df-disj 4358  df-br 4388  df-opab 4446  df-mpt 4447  df-tr 4481  df-eprel 4727  df-id 4731  df-po 4736  df-so 4737  df-fr 4774  df-se 4775  df-we 4776  df-ord 4817  df-on 4818  df-lim 4819  df-suc 4820  df-xp 4941  df-rel 4942  df-cnv 4943  df-co 4944  df-dm 4945  df-rn 4946  df-res 4947  df-ima 4948  df-iota 5476  df-fun 5515  df-fn 5516  df-f 5517  df-f1 5518  df-fo 5519  df-f1o 5520  df-fv 5521  df-isom 5522  df-riota 6148  df-ov 6190  df-oprab 6191  df-mpt2 6192  df-om 6574  df-1st 6674  df-2nd 6675  df-recs 6929  df-rdg 6963  df-1o 7017  df-2o 7018  df-oadd 7021  df-omul 7022  df-er 7198  df-ec 7200  df-qs 7204  df-map 7313  df-en 7408  df-dom 7409  df-sdom 7410  df-fin 7411  df-sup 7789  df-oi 7822  df-card 8207  df-acn 8210  df-pnf 9518  df-mnf 9519  df-xr 9520  df-ltxr 9521  df-le 9522  df-sub 9695  df-neg 9696  df-div 10092  df-nn 10421  df-2 10478  df-3 10479  df-n0 10678  df-z 10745  df-uz 10960  df-q 11052  df-rp 11090  df-fz 11536  df-fzo 11647  df-fl 11740  df-mod 11807  df-seq 11905  df-exp 11964  df-hash 12202  df-cj 12687  df-re 12688  df-im 12689  df-sqr 12823  df-abs 12824  df-clim 13065  df-sum 13263  df-dvds 13635  df-gcd 13790  df-prm 13863  df-pc 14003  df-ndx 14276  df-slot 14277  df-base 14278  df-sets 14279  df-ress 14280  df-plusg 14350  df-0g 14479  df-mnd 15514  df-grp 15644  df-minusg 15645  df-sbg 15646  df-mulg 15647  df-subg 15777  df-eqg 15779  df-od 16133  df-pgp 16135
This theorem is referenced by:  pgp0  16196  pgpfi  16205
  Copyright terms: Public domain W3C validator