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

Theorem pcmul 13109
Description: Multiplication property of the prime power function. (Contributed by Mario Carneiro, 23-Feb-2014.)
Assertion
Ref Expression
pcmul  |-  ( ( P  e.  Prime  /\  ( A  e.  ZZ  /\  A  =/=  0 )  /\  ( B  e.  ZZ  /\  B  =/=  0 ) )  -> 
( P  pCnt  ( A  x.  B )
)  =  ( ( P  pCnt  A )  +  ( P  pCnt  B ) ) )

Proof of Theorem pcmul
Dummy variable  n is distinct from all other variables.
StepHypRef Expression
1 eqid 2238 . . 3  |-  sup ( { n  e.  NN0  |  ( P ^ n
)  ||  A } ,  RR ,  <  )  =  sup ( { n  e.  NN0  |  ( P ^ n )  ||  A } ,  RR ,  <  )
2 eqid 2238 . . 3  |-  sup ( { n  e.  NN0  |  ( P ^ n
)  ||  B } ,  RR ,  <  )  =  sup ( { n  e.  NN0  |  ( P ^ n )  ||  B } ,  RR ,  <  )
3 eqid 2238 . . 3  |-  sup ( { n  e.  NN0  |  ( P ^ n
)  ||  ( A  x.  B ) } ,  RR ,  <  )  =  sup ( { n  e.  NN0  |  ( P ^ n )  ||  ( A  x.  B
) } ,  RR ,  <  )
41, 2, 3pcpremul 13101 . 2  |-  ( ( P  e.  Prime  /\  ( A  e.  ZZ  /\  A  =/=  0 )  /\  ( B  e.  ZZ  /\  B  =/=  0 ) )  -> 
( sup ( { n  e.  NN0  | 
( P ^ n
)  ||  A } ,  RR ,  <  )  +  sup ( { n  e.  NN0  |  ( P ^ n )  ||  B } ,  RR ,  <  ) )  =  sup ( { n  e.  NN0  |  ( P ^ n
)  ||  ( A  x.  B ) } ,  RR ,  <  ) )
51pczpre 13105 . . . 4  |-  ( ( P  e.  Prime  /\  ( A  e.  ZZ  /\  A  =/=  0 ) )  -> 
( P  pCnt  A
)  =  sup ( { n  e.  NN0  |  ( P ^ n
)  ||  A } ,  RR ,  <  )
)
653adant3 1048 . . 3  |-  ( ( P  e.  Prime  /\  ( A  e.  ZZ  /\  A  =/=  0 )  /\  ( B  e.  ZZ  /\  B  =/=  0 ) )  -> 
( P  pCnt  A
)  =  sup ( { n  e.  NN0  |  ( P ^ n
)  ||  A } ,  RR ,  <  )
)
72pczpre 13105 . . . 4  |-  ( ( P  e.  Prime  /\  ( B  e.  ZZ  /\  B  =/=  0 ) )  -> 
( P  pCnt  B
)  =  sup ( { n  e.  NN0  |  ( P ^ n
)  ||  B } ,  RR ,  <  )
)
873adant2 1047 . . 3  |-  ( ( P  e.  Prime  /\  ( A  e.  ZZ  /\  A  =/=  0 )  /\  ( B  e.  ZZ  /\  B  =/=  0 ) )  -> 
( P  pCnt  B
)  =  sup ( { n  e.  NN0  |  ( P ^ n
)  ||  B } ,  RR ,  <  )
)
96, 8oveq12d 6106 . 2  |-  ( ( P  e.  Prime  /\  ( A  e.  ZZ  /\  A  =/=  0 )  /\  ( B  e.  ZZ  /\  B  =/=  0 ) )  -> 
( ( P  pCnt  A )  +  ( P 
pCnt  B ) )  =  ( sup ( { n  e.  NN0  | 
( P ^ n
)  ||  A } ,  RR ,  <  )  +  sup ( { n  e.  NN0  |  ( P ^ n )  ||  B } ,  RR ,  <  ) ) )
10 zmulcl 9709 . . . . . 6  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ )  ->  ( A  x.  B
)  e.  ZZ )
1110ad2ant2r 513 . . . . 5  |-  ( ( ( A  e.  ZZ  /\  A  =/=  0 )  /\  ( B  e.  ZZ  /\  B  =/=  0 ) )  -> 
( A  x.  B
)  e.  ZZ )
12 zcn 9660 . . . . . . . 8  |-  ( A  e.  ZZ  ->  A  e.  CC )
1312ad2antrr 492 . . . . . . 7  |-  ( ( ( A  e.  ZZ  /\  A  =/=  0 )  /\  ( B  e.  ZZ  /\  B  =/=  0 ) )  ->  A  e.  CC )
14 zcn 9660 . . . . . . . 8  |-  ( B  e.  ZZ  ->  B  e.  CC )
1514ad2antrl 494 . . . . . . 7  |-  ( ( ( A  e.  ZZ  /\  A  =/=  0 )  /\  ( B  e.  ZZ  /\  B  =/=  0 ) )  ->  B  e.  CC )
16 simplr 533 . . . . . . . 8  |-  ( ( ( A  e.  ZZ  /\  A  =/=  0 )  /\  ( B  e.  ZZ  /\  B  =/=  0 ) )  ->  A  =/=  0 )
17 simpll 531 . . . . . . . . 9  |-  ( ( ( A  e.  ZZ  /\  A  =/=  0 )  /\  ( B  e.  ZZ  /\  B  =/=  0 ) )  ->  A  e.  ZZ )
18 0zd 9667 . . . . . . . . 9  |-  ( ( ( A  e.  ZZ  /\  A  =/=  0 )  /\  ( B  e.  ZZ  /\  B  =/=  0 ) )  -> 
0  e.  ZZ )
19 zapne 9730 . . . . . . . . 9  |-  ( ( A  e.  ZZ  /\  0  e.  ZZ )  ->  ( A #  0  <->  A  =/=  0 ) )
2017, 18, 19syl2anc 415 . . . . . . . 8  |-  ( ( ( A  e.  ZZ  /\  A  =/=  0 )  /\  ( B  e.  ZZ  /\  B  =/=  0 ) )  -> 
( A #  0  <->  A  =/=  0 ) )
2116, 20mpbird 167 . . . . . . 7  |-  ( ( ( A  e.  ZZ  /\  A  =/=  0 )  /\  ( B  e.  ZZ  /\  B  =/=  0 ) )  ->  A #  0 )
22 simprr 537 . . . . . . . 8  |-  ( ( ( A  e.  ZZ  /\  A  =/=  0 )  /\  ( B  e.  ZZ  /\  B  =/=  0 ) )  ->  B  =/=  0 )
23 simprl 535 . . . . . . . . 9  |-  ( ( ( A  e.  ZZ  /\  A  =/=  0 )  /\  ( B  e.  ZZ  /\  B  =/=  0 ) )  ->  B  e.  ZZ )
24 zapne 9730 . . . . . . . . 9  |-  ( ( B  e.  ZZ  /\  0  e.  ZZ )  ->  ( B #  0  <->  B  =/=  0 ) )
2523, 18, 24syl2anc 415 . . . . . . . 8  |-  ( ( ( A  e.  ZZ  /\  A  =/=  0 )  /\  ( B  e.  ZZ  /\  B  =/=  0 ) )  -> 
( B #  0  <->  B  =/=  0 ) )
2622, 25mpbird 167 . . . . . . 7  |-  ( ( ( A  e.  ZZ  /\  A  =/=  0 )  /\  ( B  e.  ZZ  /\  B  =/=  0 ) )  ->  B #  0 )
2713, 15, 21, 26mulap0d 8994 . . . . . 6  |-  ( ( ( A  e.  ZZ  /\  A  =/=  0 )  /\  ( B  e.  ZZ  /\  B  =/=  0 ) )  -> 
( A  x.  B
) #  0 )
28 zapne 9730 . . . . . . 7  |-  ( ( ( A  x.  B
)  e.  ZZ  /\  0  e.  ZZ )  ->  ( ( A  x.  B ) #  0  <->  ( A  x.  B )  =/=  0
) )
2911, 18, 28syl2anc 415 . . . . . 6  |-  ( ( ( A  e.  ZZ  /\  A  =/=  0 )  /\  ( B  e.  ZZ  /\  B  =/=  0 ) )  -> 
( ( A  x.  B ) #  0  <->  ( A  x.  B )  =/=  0
) )
3027, 29mpbid 147 . . . . 5  |-  ( ( ( A  e.  ZZ  /\  A  =/=  0 )  /\  ( B  e.  ZZ  /\  B  =/=  0 ) )  -> 
( A  x.  B
)  =/=  0 )
3111, 30jca 306 . . . 4  |-  ( ( ( A  e.  ZZ  /\  A  =/=  0 )  /\  ( B  e.  ZZ  /\  B  =/=  0 ) )  -> 
( ( A  x.  B )  e.  ZZ  /\  ( A  x.  B
)  =/=  0 ) )
323pczpre 13105 . . . 4  |-  ( ( P  e.  Prime  /\  (
( A  x.  B
)  e.  ZZ  /\  ( A  x.  B
)  =/=  0 ) )  ->  ( P  pCnt  ( A  x.  B
) )  =  sup ( { n  e.  NN0  |  ( P ^ n
)  ||  ( A  x.  B ) } ,  RR ,  <  ) )
3331, 32sylan2 286 . . 3  |-  ( ( P  e.  Prime  /\  (
( A  e.  ZZ  /\  A  =/=  0 )  /\  ( B  e.  ZZ  /\  B  =/=  0 ) ) )  ->  ( P  pCnt  ( A  x.  B ) )  =  sup ( { n  e.  NN0  |  ( P ^ n
)  ||  ( A  x.  B ) } ,  RR ,  <  ) )
34333impb 1230 . 2  |-  ( ( P  e.  Prime  /\  ( A  e.  ZZ  /\  A  =/=  0 )  /\  ( B  e.  ZZ  /\  B  =/=  0 ) )  -> 
( P  pCnt  ( A  x.  B )
)  =  sup ( { n  e.  NN0  |  ( P ^ n
)  ||  ( A  x.  B ) } ,  RR ,  <  ) )
354, 9, 343eqtr4rd 2282 1  |-  ( ( P  e.  Prime  /\  ( A  e.  ZZ  /\  A  =/=  0 )  /\  ( B  e.  ZZ  /\  B  =/=  0 ) )  -> 
( P  pCnt  ( A  x.  B )
)  =  ( ( P  pCnt  A )  +  ( P  pCnt  B ) ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 1009    = wceq 1402    e. wcel 2209    =/= wne 2420   {crab 2532   class class class wbr 4131  (class class class)co 6088   supcsup 7328   CCcc 8183   RRcr 8184   0cc0 8185    + caddc 8188    x. cmul 8190    < clt 8366   # cap 8917   NN0cn0 9574   ZZcz 9655   ^cexp 10996    || cdvds 12579   Primecprime 12910    pCnt cpc 13092
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4248  ax-sep 4251  ax-nul 4261  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-iinf 4737  ax-cnex 8276  ax-resscn 8277  ax-1cn 8278  ax-1re 8279  ax-icn 8280  ax-addcl 8281  ax-addrcl 8282  ax-mulcl 8283  ax-mulrcl 8284  ax-addcom 8285  ax-mulcom 8286  ax-addass 8287  ax-mulass 8288  ax-distr 8289  ax-i2m1 8290  ax-0lt1 8291  ax-1rid 8292  ax-0id 8293  ax-rnegex 8294  ax-precex 8295  ax-cnre 8296  ax-pre-ltirr 8297  ax-pre-ltwlin 8298  ax-pre-lttrn 8299  ax-pre-apti 8300  ax-pre-ltadd 8301  ax-pre-mulgt0 8302  ax-pre-mulext 8303  ax-arch 8304  ax-caucvg 8305
This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-if 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-tr 4232  df-id 4440  df-po 4443  df-iso 4444  df-iord 4513  df-on 4515  df-ilim 4516  df-suc 4518  df-iom 4740  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-isom 5389  df-riota 6041  df-ov 6091  df-oprab 6092  df-mpo 6093  df-1st 6378  df-2nd 6379  df-recs 6580  df-frec 6666  df-1o 6691  df-2o 6692  df-er 6811  df-en 7027  df-sup 7330  df-inf 7331  df-pnf 8368  df-mnf 8369  df-xr 8370  df-ltxr 8371  df-le 8372  df-sub 8506  df-neg 8507  df-reap 8911  df-ap 8918  df-div 9011  df-inn 9314  df-2 9372  df-3 9373  df-4 9374  df-n0 9575  df-z 9656  df-uz 9938  df-q 10036  df-rp 10072  df-fz 10429  df-fzo 10567  df-fl 10722  df-mod 10781  df-seqfrec 10906  df-exp 10997  df-cj 11629  df-re 11630  df-im 11631  df-rsqrt 11786  df-abs 11787  df-dvds 12580  df-gcd 12756  df-prm 12911  df-pc 13093
This theorem is used by:  pcqmul  13111  pcaddlem  13147  pcmpt  13151  pcfac  13158  pcbc  13159  chtublem  16295  lgsdi  16361
  Copyright terms: Public domain W3C validator