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

Theorem pcval 13104
Description: The value of the prime power function. (Contributed by Mario Carneiro, 23-Feb-2014.) (Revised by Mario Carneiro, 3-Oct-2014.)
Hypotheses
Ref Expression
pcval.1  |-  S  =  sup ( { n  e.  NN0  |  ( P ^ n )  ||  x } ,  RR ,  <  )
pcval.2  |-  T  =  sup ( { n  e.  NN0  |  ( P ^ n )  ||  y } ,  RR ,  <  )
Assertion
Ref Expression
pcval  |-  ( ( P  e.  Prime  /\  ( N  e.  QQ  /\  N  =/=  0 ) )  -> 
( P  pCnt  N
)  =  ( iota z E. x  e.  ZZ  E. y  e.  NN  ( N  =  ( x  /  y
)  /\  z  =  ( S  -  T
) ) ) )
Distinct variable groups:    x, n, y, z, N    P, n, x, y, z    z, S   
z, T
Allowed substitution hints:    S( x,  y,  n)    T( x,  y,  n)

Proof of Theorem pcval
Dummy variables  p  r are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simpl 109 . . 3  |-  ( ( P  e.  Prime  /\  ( N  e.  QQ  /\  N  =/=  0 ) )  ->  P  e.  Prime )
2 simprl 535 . . 3  |-  ( ( P  e.  Prime  /\  ( N  e.  QQ  /\  N  =/=  0 ) )  ->  N  e.  QQ )
3 ifnefalse 3651 . . . . 5  |-  ( N  =/=  0  ->  if ( N  =  0 , +oo ,  ( iota z E. x  e.  ZZ  E. y  e.  NN  ( N  =  ( x  /  y
)  /\  z  =  ( S  -  T
) ) ) )  =  ( iota z E. x  e.  ZZ  E. y  e.  NN  ( N  =  ( x  /  y )  /\  z  =  ( S  -  T ) ) ) )
43ad2antll 495 . . . 4  |-  ( ( P  e.  Prime  /\  ( N  e.  QQ  /\  N  =/=  0 ) )  ->  if ( N  =  0 , +oo ,  ( iota z E. x  e.  ZZ  E. y  e.  NN  ( N  =  ( x  /  y
)  /\  z  =  ( S  -  T
) ) ) )  =  ( iota z E. x  e.  ZZ  E. y  e.  NN  ( N  =  ( x  /  y )  /\  z  =  ( S  -  T ) ) ) )
5 pcval.1 . . . . . 6  |-  S  =  sup ( { n  e.  NN0  |  ( P ^ n )  ||  x } ,  RR ,  <  )
6 pcval.2 . . . . . 6  |-  T  =  sup ( { n  e.  NN0  |  ( P ^ n )  ||  y } ,  RR ,  <  )
75, 6pceu 13103 . . . . 5  |-  ( ( P  e.  Prime  /\  ( N  e.  QQ  /\  N  =/=  0 ) )  ->  E! z E. x  e.  ZZ  E. y  e.  NN  ( N  =  ( x  /  y
)  /\  z  =  ( S  -  T
) ) )
8 euiotaex 5357 . . . . 5  |-  ( E! z E. x  e.  ZZ  E. y  e.  NN  ( N  =  ( x  /  y
)  /\  z  =  ( S  -  T
) )  ->  ( iota z E. x  e.  ZZ  E. y  e.  NN  ( N  =  ( x  /  y
)  /\  z  =  ( S  -  T
) ) )  e. 
_V )
97, 8syl 14 . . . 4  |-  ( ( P  e.  Prime  /\  ( N  e.  QQ  /\  N  =/=  0 ) )  -> 
( iota z E. x  e.  ZZ  E. y  e.  NN  ( N  =  ( x  /  y
)  /\  z  =  ( S  -  T
) ) )  e. 
_V )
104, 9eqeltrd 2315 . . 3  |-  ( ( P  e.  Prime  /\  ( N  e.  QQ  /\  N  =/=  0 ) )  ->  if ( N  =  0 , +oo ,  ( iota z E. x  e.  ZZ  E. y  e.  NN  ( N  =  ( x  /  y
)  /\  z  =  ( S  -  T
) ) ) )  e.  _V )
11 simpr 110 . . . . . 6  |-  ( ( p  =  P  /\  r  =  N )  ->  r  =  N )
1211eqeq1d 2247 . . . . 5  |-  ( ( p  =  P  /\  r  =  N )  ->  ( r  =  0  <-> 
N  =  0 ) )
13 eqeq1 2245 . . . . . . . 8  |-  ( r  =  N  ->  (
r  =  ( x  /  y )  <->  N  =  ( x  /  y
) ) )
14 oveq1 6095 . . . . . . . . . . . . . 14  |-  ( p  =  P  ->  (
p ^ n )  =  ( P ^
n ) )
1514breq1d 4141 . . . . . . . . . . . . 13  |-  ( p  =  P  ->  (
( p ^ n
)  ||  x  <->  ( P ^ n )  ||  x ) )
1615rabbidv 2810 . . . . . . . . . . . 12  |-  ( p  =  P  ->  { n  e.  NN0  |  ( p ^ n )  ||  x }  =  {
n  e.  NN0  | 
( P ^ n
)  ||  x }
)
1716supeq1d 7333 . . . . . . . . . . 11  |-  ( p  =  P  ->  sup ( { n  e.  NN0  |  ( p ^ n
)  ||  x } ,  RR ,  <  )  =  sup ( { n  e.  NN0  |  ( P ^ n )  ||  x } ,  RR ,  <  ) )
1817, 5eqtr4di 2289 . . . . . . . . . 10  |-  ( p  =  P  ->  sup ( { n  e.  NN0  |  ( p ^ n
)  ||  x } ,  RR ,  <  )  =  S )
1914breq1d 4141 . . . . . . . . . . . . 13  |-  ( p  =  P  ->  (
( p ^ n
)  ||  y  <->  ( P ^ n )  ||  y ) )
2019rabbidv 2810 . . . . . . . . . . . 12  |-  ( p  =  P  ->  { n  e.  NN0  |  ( p ^ n )  ||  y }  =  {
n  e.  NN0  | 
( P ^ n
)  ||  y }
)
2120supeq1d 7333 . . . . . . . . . . 11  |-  ( p  =  P  ->  sup ( { n  e.  NN0  |  ( p ^ n
)  ||  y } ,  RR ,  <  )  =  sup ( { n  e.  NN0  |  ( P ^ n )  ||  y } ,  RR ,  <  ) )
2221, 6eqtr4di 2289 . . . . . . . . . 10  |-  ( p  =  P  ->  sup ( { n  e.  NN0  |  ( p ^ n
)  ||  y } ,  RR ,  <  )  =  T )
2318, 22oveq12d 6106 . . . . . . . . 9  |-  ( p  =  P  ->  ( sup ( { n  e. 
NN0  |  ( p ^ n )  ||  x } ,  RR ,  <  )  -  sup ( { n  e.  NN0  |  ( p ^ n
)  ||  y } ,  RR ,  <  )
)  =  ( S  -  T ) )
2423eqeq2d 2250 . . . . . . . 8  |-  ( p  =  P  ->  (
z  =  ( sup ( { n  e. 
NN0  |  ( p ^ n )  ||  x } ,  RR ,  <  )  -  sup ( { n  e.  NN0  |  ( p ^ n
)  ||  y } ,  RR ,  <  )
)  <->  z  =  ( S  -  T ) ) )
2513, 24bi2anan9r 615 . . . . . . 7  |-  ( ( p  =  P  /\  r  =  N )  ->  ( ( r  =  ( x  /  y
)  /\  z  =  ( sup ( { n  e.  NN0  |  ( p ^ n )  ||  x } ,  RR ,  <  )  -  sup ( { n  e.  NN0  |  ( p ^ n
)  ||  y } ,  RR ,  <  )
) )  <->  ( N  =  ( x  / 
y )  /\  z  =  ( S  -  T ) ) ) )
26252rexbidv 2575 . . . . . 6  |-  ( ( p  =  P  /\  r  =  N )  ->  ( E. x  e.  ZZ  E. y  e.  NN  ( r  =  ( x  /  y
)  /\  z  =  ( sup ( { n  e.  NN0  |  ( p ^ n )  ||  x } ,  RR ,  <  )  -  sup ( { n  e.  NN0  |  ( p ^ n
)  ||  y } ,  RR ,  <  )
) )  <->  E. x  e.  ZZ  E. y  e.  NN  ( N  =  ( x  /  y
)  /\  z  =  ( S  -  T
) ) ) )
2726iotabidv 5363 . . . . 5  |-  ( ( p  =  P  /\  r  =  N )  ->  ( iota z E. x  e.  ZZ  E. y  e.  NN  (
r  =  ( x  /  y )  /\  z  =  ( sup ( { n  e.  NN0  |  ( p ^ n
)  ||  x } ,  RR ,  <  )  -  sup ( { n  e.  NN0  |  ( p ^ n )  ||  y } ,  RR ,  <  ) ) ) )  =  ( iota z E. x  e.  ZZ  E. y  e.  NN  ( N  =  ( x  /  y )  /\  z  =  ( S  -  T ) ) ) )
2812, 27ifbieq2d 3665 . . . 4  |-  ( ( p  =  P  /\  r  =  N )  ->  if ( r  =  0 , +oo , 
( iota z E. x  e.  ZZ  E. y  e.  NN  ( r  =  ( x  /  y
)  /\  z  =  ( sup ( { n  e.  NN0  |  ( p ^ n )  ||  x } ,  RR ,  <  )  -  sup ( { n  e.  NN0  |  ( p ^ n
)  ||  y } ,  RR ,  <  )
) ) ) )  =  if ( N  =  0 , +oo ,  ( iota z E. x  e.  ZZ  E. y  e.  NN  ( N  =  ( x  /  y )  /\  z  =  ( S  -  T ) ) ) ) )
29 df-pc 13093 . . . 4  |-  pCnt  =  ( p  e.  Prime ,  r  e.  QQ  |->  if ( r  =  0 , +oo ,  ( iota z E. x  e.  ZZ  E. y  e.  NN  ( r  =  ( x  /  y
)  /\  z  =  ( sup ( { n  e.  NN0  |  ( p ^ n )  ||  x } ,  RR ,  <  )  -  sup ( { n  e.  NN0  |  ( p ^ n
)  ||  y } ,  RR ,  <  )
) ) ) ) )
3028, 29ovmpoga 6221 . . 3  |-  ( ( P  e.  Prime  /\  N  e.  QQ  /\  if ( N  =  0 , +oo ,  ( iota z E. x  e.  ZZ  E. y  e.  NN  ( N  =  ( x  /  y
)  /\  z  =  ( S  -  T
) ) ) )  e.  _V )  -> 
( P  pCnt  N
)  =  if ( N  =  0 , +oo ,  ( iota z E. x  e.  ZZ  E. y  e.  NN  ( N  =  ( x  /  y
)  /\  z  =  ( S  -  T
) ) ) ) )
311, 2, 10, 30syl3anc 1278 . 2  |-  ( ( P  e.  Prime  /\  ( N  e.  QQ  /\  N  =/=  0 ) )  -> 
( P  pCnt  N
)  =  if ( N  =  0 , +oo ,  ( iota z E. x  e.  ZZ  E. y  e.  NN  ( N  =  ( x  /  y
)  /\  z  =  ( S  -  T
) ) ) ) )
3231, 4eqtrd 2271 1  |-  ( ( P  e.  Prime  /\  ( N  e.  QQ  /\  N  =/=  0 ) )  -> 
( P  pCnt  N
)  =  ( iota z E. x  e.  ZZ  E. y  e.  NN  ( N  =  ( x  /  y
)  /\  z  =  ( S  -  T
) ) ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    = wceq 1402   E!weu 2086    e. wcel 2209    =/= wne 2420   E.wrex 2529   {crab 2532   _Vcvv 2821   ifcif 3638   class class class wbr 4131   iotacio 5338  (class class class)co 6088   supcsup 7328   RRcr 8184   0cc0 8185   +oocpnf 8363    < clt 8366    - cmin 8504    / cdiv 9010   NNcn 9313   NN0cn0 9574   ZZcz 9655   QQcq 10035   ^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:  pczpre  13105  pcdiv  13110
  Copyright terms: Public domain W3C validator