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

Theorem dvdsprmpweqnn 13038
Description: If an integer greater than 1 divides a prime power, it is a (proper) prime power. (Contributed by AV, 13-Aug-2021.)
Assertion
Ref Expression
dvdsprmpweqnn  |-  ( ( P  e.  Prime  /\  A  e.  ( ZZ>= `  2 )  /\  N  e.  NN0 )  ->  ( A  ||  ( P ^ N )  ->  E. n  e.  NN  A  =  ( P ^ n ) ) )
Distinct variable groups:    A, n    n, N    P, n

Proof of Theorem dvdsprmpweqnn
StepHypRef Expression
1 eluz2nn 9901 . . . . 5  |-  ( A  e.  ( ZZ>= `  2
)  ->  A  e.  NN )
2 dvdsprmpweq 13037 . . . . 5  |-  ( ( P  e.  Prime  /\  A  e.  NN  /\  N  e. 
NN0 )  ->  ( A  ||  ( P ^ N )  ->  E. n  e.  NN0  A  =  ( P ^ n ) ) )
31, 2syl3an2 1308 . . . 4  |-  ( ( P  e.  Prime  /\  A  e.  ( ZZ>= `  2 )  /\  N  e.  NN0 )  ->  ( A  ||  ( P ^ N )  ->  E. n  e.  NN0  A  =  ( P ^
n ) ) )
43imp 124 . . 3  |-  ( ( ( P  e.  Prime  /\  A  e.  ( ZZ>= ` 
2 )  /\  N  e.  NN0 )  /\  A  ||  ( P ^ N
) )  ->  E. n  e.  NN0  A  =  ( P ^ n ) )
5 df-n0 9499 . . . . . 6  |-  NN0  =  ( NN  u.  { 0 } )
65rexeqi 2748 . . . . 5  |-  ( E. n  e.  NN0  A  =  ( P ^
n )  <->  E. n  e.  ( NN  u.  {
0 } ) A  =  ( P ^
n ) )
7 rexun 3401 . . . . 5  |-  ( E. n  e.  ( NN  u.  { 0 } ) A  =  ( P ^ n )  <-> 
( E. n  e.  NN  A  =  ( P ^ n )  \/  E. n  e. 
{ 0 } A  =  ( P ^
n ) ) )
86, 7bitri 184 . . . 4  |-  ( E. n  e.  NN0  A  =  ( P ^
n )  <->  ( E. n  e.  NN  A  =  ( P ^
n )  \/  E. n  e.  { 0 } A  =  ( P ^ n ) ) )
9 0z 9590 . . . . . . 7  |-  0  e.  ZZ
10 oveq2 6060 . . . . . . . . 9  |-  ( n  =  0  ->  ( P ^ n )  =  ( P ^ 0 ) )
1110eqeq2d 2246 . . . . . . . 8  |-  ( n  =  0  ->  ( A  =  ( P ^ n )  <->  A  =  ( P ^ 0 ) ) )
1211rexsng 3732 . . . . . . 7  |-  ( 0  e.  ZZ  ->  ( E. n  e.  { 0 } A  =  ( P ^ n )  <-> 
A  =  ( P ^ 0 ) ) )
139, 12ax-mp 5 . . . . . 6  |-  ( E. n  e.  { 0 } A  =  ( P ^ n )  <-> 
A  =  ( P ^ 0 ) )
14 prmnn 12811 . . . . . . . . . . . . 13  |-  ( P  e.  Prime  ->  P  e.  NN )
1514nncnd 9253 . . . . . . . . . . . 12  |-  ( P  e.  Prime  ->  P  e.  CC )
1615exp0d 11033 . . . . . . . . . . 11  |-  ( P  e.  Prime  ->  ( P ^ 0 )  =  1 )
17163ad2ant1 1045 . . . . . . . . . 10  |-  ( ( P  e.  Prime  /\  A  e.  ( ZZ>= `  2 )  /\  N  e.  NN0 )  ->  ( P ^
0 )  =  1 )
1817eqeq2d 2246 . . . . . . . . 9  |-  ( ( P  e.  Prime  /\  A  e.  ( ZZ>= `  2 )  /\  N  e.  NN0 )  ->  ( A  =  ( P ^ 0 )  <->  A  =  1
) )
19 eluz2b3 9939 . . . . . . . . . . 11  |-  ( A  e.  ( ZZ>= `  2
)  <->  ( A  e.  NN  /\  A  =/=  1 ) )
20 eqneqall 2424 . . . . . . . . . . . 12  |-  ( A  =  1  ->  ( A  =/=  1  ->  ( A  ||  ( P ^ N )  ->  E. n  e.  NN  A  =  ( P ^ n ) ) ) )
2120com12 30 . . . . . . . . . . 11  |-  ( A  =/=  1  ->  ( A  =  1  ->  ( A  ||  ( P ^ N )  ->  E. n  e.  NN  A  =  ( P ^ n ) ) ) )
2219, 21simplbiim 387 . . . . . . . . . 10  |-  ( A  e.  ( ZZ>= `  2
)  ->  ( A  =  1  ->  ( A  ||  ( P ^ N )  ->  E. n  e.  NN  A  =  ( P ^ n ) ) ) )
23223ad2ant2 1046 . . . . . . . . 9  |-  ( ( P  e.  Prime  /\  A  e.  ( ZZ>= `  2 )  /\  N  e.  NN0 )  ->  ( A  =  1  ->  ( A  ||  ( P ^ N
)  ->  E. n  e.  NN  A  =  ( P ^ n ) ) ) )
2418, 23sylbid 150 . . . . . . . 8  |-  ( ( P  e.  Prime  /\  A  e.  ( ZZ>= `  2 )  /\  N  e.  NN0 )  ->  ( A  =  ( P ^ 0 )  ->  ( A  ||  ( P ^ N
)  ->  E. n  e.  NN  A  =  ( P ^ n ) ) ) )
2524com12 30 . . . . . . 7  |-  ( A  =  ( P ^
0 )  ->  (
( P  e.  Prime  /\  A  e.  ( ZZ>= ` 
2 )  /\  N  e.  NN0 )  ->  ( A  ||  ( P ^ N )  ->  E. n  e.  NN  A  =  ( P ^ n ) ) ) )
2625impd 254 . . . . . 6  |-  ( A  =  ( P ^
0 )  ->  (
( ( P  e. 
Prime  /\  A  e.  (
ZZ>= `  2 )  /\  N  e.  NN0 )  /\  A  ||  ( P ^ N ) )  ->  E. n  e.  NN  A  =  ( P ^ n ) ) )
2713, 26sylbi 121 . . . . 5  |-  ( E. n  e.  { 0 } A  =  ( P ^ n )  ->  ( ( ( P  e.  Prime  /\  A  e.  ( ZZ>= `  2 )  /\  N  e.  NN0 )  /\  A  ||  ( P ^ N ) )  ->  E. n  e.  NN  A  =  ( P ^ n ) ) )
2827jao1i 804 . . . 4  |-  ( ( E. n  e.  NN  A  =  ( P ^ n )  \/ 
E. n  e.  {
0 } A  =  ( P ^ n
) )  ->  (
( ( P  e. 
Prime  /\  A  e.  (
ZZ>= `  2 )  /\  N  e.  NN0 )  /\  A  ||  ( P ^ N ) )  ->  E. n  e.  NN  A  =  ( P ^ n ) ) )
298, 28sylbi 121 . . 3  |-  ( E. n  e.  NN0  A  =  ( P ^
n )  ->  (
( ( P  e. 
Prime  /\  A  e.  (
ZZ>= `  2 )  /\  N  e.  NN0 )  /\  A  ||  ( P ^ N ) )  ->  E. n  e.  NN  A  =  ( P ^ n ) ) )
304, 29mpcom 36 . 2  |-  ( ( ( P  e.  Prime  /\  A  e.  ( ZZ>= ` 
2 )  /\  N  e.  NN0 )  /\  A  ||  ( P ^ N
) )  ->  E. n  e.  NN  A  =  ( P ^ n ) )
3130ex 115 1  |-  ( ( P  e.  Prime  /\  A  e.  ( ZZ>= `  2 )  /\  N  e.  NN0 )  ->  ( A  ||  ( P ^ N )  ->  E. n  e.  NN  A  =  ( P ^ n ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    \/ wo 716    /\ w3a 1005    = wceq 1398    e. wcel 2205    =/= wne 2414   E.wrex 2523    u. cun 3211   {csn 3691   class class class wbr 4111   ` cfv 5354  (class class class)co 6052   0cc0 8129   1c1 8130   NNcn 9239   2c2 9290   NN0cn0 9498   ZZcz 9579   ZZ>=cuz 9856   ^cexp 10904    || cdvds 12477   Primecprime 12808
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-coll 4227  ax-sep 4230  ax-nul 4238  ax-pow 4289  ax-pr 4324  ax-un 4556  ax-setind 4661  ax-iinf 4712  ax-cnex 8220  ax-resscn 8221  ax-1cn 8222  ax-1re 8223  ax-icn 8224  ax-addcl 8225  ax-addrcl 8226  ax-mulcl 8227  ax-mulrcl 8228  ax-addcom 8229  ax-mulcom 8230  ax-addass 8231  ax-mulass 8232  ax-distr 8233  ax-i2m1 8234  ax-0lt1 8235  ax-1rid 8236  ax-0id 8237  ax-rnegex 8238  ax-precex 8239  ax-cnre 8240  ax-pre-ltirr 8241  ax-pre-ltwlin 8242  ax-pre-lttrn 8243  ax-pre-apti 8244  ax-pre-ltadd 8245  ax-pre-mulgt0 8246  ax-pre-mulext 8247  ax-arch 8248  ax-caucvg 8249
This theorem depends on definitions:  df-bi 117  df-stab 839  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-reu 2529  df-rmo 2530  df-rab 2531  df-v 2817  df-sbc 3045  df-csb 3141  df-dif 3215  df-un 3217  df-in 3219  df-ss 3226  df-nul 3511  df-if 3623  df-pw 3673  df-sn 3697  df-pr 3698  df-op 3700  df-uni 3917  df-int 3952  df-iun 3995  df-br 4112  df-opab 4174  df-mpt 4175  df-tr 4211  df-id 4416  df-po 4419  df-iso 4420  df-iord 4489  df-on 4491  df-ilim 4492  df-suc 4494  df-iom 4715  df-xp 4757  df-rel 4758  df-cnv 4759  df-co 4760  df-dm 4761  df-rn 4762  df-res 4763  df-ima 4764  df-iota 5314  df-fun 5356  df-fn 5357  df-f 5358  df-f1 5359  df-fo 5360  df-f1o 5361  df-fv 5362  df-isom 5363  df-riota 6005  df-ov 6055  df-oprab 6056  df-mpo 6057  df-1st 6336  df-2nd 6337  df-recs 6538  df-frec 6624  df-1o 6649  df-2o 6650  df-er 6769  df-en 6978  df-sup 7277  df-inf 7278  df-pnf 8312  df-mnf 8313  df-xr 8314  df-ltxr 8315  df-le 8316  df-sub 8448  df-neg 8449  df-reap 8851  df-ap 8858  df-div 8949  df-inn 9240  df-2 9298  df-3 9299  df-4 9300  df-n0 9499  df-xnn0 9566  df-z 9580  df-uz 9857  df-q 9955  df-rp 9990  df-fz 10346  df-fzo 10481  df-fl 10634  df-mod 10689  df-seqfrec 10814  df-exp 10905  df-cj 11531  df-re 11532  df-im 11533  df-rsqrt 11687  df-abs 11688  df-dvds 12478  df-gcd 12654  df-prm 12809  df-pc 12987
This theorem is referenced by:  difsqpwdvds  13040
  Copyright terms: Public domain W3C validator