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

Theorem pc11 12366
Description: The prime count function, viewed as a function from  NN to  ( NN  ^m  Prime ), is one-to-one. (Contributed by Mario Carneiro, 23-Feb-2014.)
Assertion
Ref Expression
pc11  |-  ( ( A  e.  NN0  /\  B  e.  NN0 )  -> 
( A  =  B  <->  A. p  e.  Prime  ( p  pCnt  A )  =  ( p  pCnt  B ) ) )
Distinct variable groups:    A, p    B, p

Proof of Theorem pc11
StepHypRef Expression
1 oveq2 5905 . . 3  |-  ( A  =  B  ->  (
p  pCnt  A )  =  ( p  pCnt  B ) )
21ralrimivw 2564 . 2  |-  ( A  =  B  ->  A. p  e.  Prime  ( p  pCnt  A )  =  ( p 
pCnt  B ) )
3 nn0z 9304 . . . 4  |-  ( A  e.  NN0  ->  A  e.  ZZ )
4 nn0z 9304 . . . 4  |-  ( B  e.  NN0  ->  B  e.  ZZ )
5 zq 9658 . . . . . . . . . . 11  |-  ( A  e.  ZZ  ->  A  e.  QQ )
6 pcxcl 12346 . . . . . . . . . . 11  |-  ( ( p  e.  Prime  /\  A  e.  QQ )  ->  (
p  pCnt  A )  e.  RR* )
75, 6sylan2 286 . . . . . . . . . 10  |-  ( ( p  e.  Prime  /\  A  e.  ZZ )  ->  (
p  pCnt  A )  e.  RR* )
8 zq 9658 . . . . . . . . . . 11  |-  ( B  e.  ZZ  ->  B  e.  QQ )
9 pcxcl 12346 . . . . . . . . . . 11  |-  ( ( p  e.  Prime  /\  B  e.  QQ )  ->  (
p  pCnt  B )  e.  RR* )
108, 9sylan2 286 . . . . . . . . . 10  |-  ( ( p  e.  Prime  /\  B  e.  ZZ )  ->  (
p  pCnt  B )  e.  RR* )
117, 10anim12dan 600 . . . . . . . . 9  |-  ( ( p  e.  Prime  /\  ( A  e.  ZZ  /\  B  e.  ZZ ) )  -> 
( ( p  pCnt  A )  e.  RR*  /\  (
p  pCnt  B )  e.  RR* ) )
12 xrletri3 9836 . . . . . . . . 9  |-  ( ( ( p  pCnt  A
)  e.  RR*  /\  (
p  pCnt  B )  e.  RR* )  ->  (
( p  pCnt  A
)  =  ( p 
pCnt  B )  <->  ( (
p  pCnt  A )  <_  ( p  pCnt  B
)  /\  ( p  pCnt  B )  <_  (
p  pCnt  A )
) ) )
1311, 12syl 14 . . . . . . . 8  |-  ( ( p  e.  Prime  /\  ( A  e.  ZZ  /\  B  e.  ZZ ) )  -> 
( ( p  pCnt  A )  =  ( p 
pCnt  B )  <->  ( (
p  pCnt  A )  <_  ( p  pCnt  B
)  /\  ( p  pCnt  B )  <_  (
p  pCnt  A )
) ) )
1413ancoms 268 . . . . . . 7  |-  ( ( ( A  e.  ZZ  /\  B  e.  ZZ )  /\  p  e.  Prime )  ->  ( ( p 
pCnt  A )  =  ( p  pCnt  B )  <->  ( ( p  pCnt  A
)  <_  ( p  pCnt  B )  /\  (
p  pCnt  B )  <_  ( p  pCnt  A
) ) ) )
1514ralbidva 2486 . . . . . 6  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ )  ->  ( A. p  e. 
Prime  ( p  pCnt  A
)  =  ( p 
pCnt  B )  <->  A. p  e.  Prime  ( ( p 
pCnt  A )  <_  (
p  pCnt  B )  /\  ( p  pCnt  B
)  <_  ( p  pCnt  A ) ) ) )
16 r19.26 2616 . . . . . 6  |-  ( A. p  e.  Prime  ( ( p  pCnt  A )  <_  ( p  pCnt  B
)  /\  ( p  pCnt  B )  <_  (
p  pCnt  A )
)  <->  ( A. p  e.  Prime  ( p  pCnt  A )  <_  ( p  pCnt  B )  /\  A. p  e.  Prime  ( p 
pCnt  B )  <_  (
p  pCnt  A )
) )
1715, 16bitrdi 196 . . . . 5  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ )  ->  ( A. p  e. 
Prime  ( p  pCnt  A
)  =  ( p 
pCnt  B )  <->  ( A. p  e.  Prime  ( p 
pCnt  A )  <_  (
p  pCnt  B )  /\  A. p  e.  Prime  ( p  pCnt  B )  <_  ( p  pCnt  A
) ) ) )
18 pc2dvds 12365 . . . . . 6  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ )  ->  ( A  ||  B  <->  A. p  e.  Prime  (
p  pCnt  A )  <_  ( p  pCnt  B
) ) )
19 pc2dvds 12365 . . . . . . 7  |-  ( ( B  e.  ZZ  /\  A  e.  ZZ )  ->  ( B  ||  A  <->  A. p  e.  Prime  (
p  pCnt  B )  <_  ( p  pCnt  A
) ) )
2019ancoms 268 . . . . . 6  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ )  ->  ( B  ||  A  <->  A. p  e.  Prime  (
p  pCnt  B )  <_  ( p  pCnt  A
) ) )
2118, 20anbi12d 473 . . . . 5  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ )  ->  ( ( A  ||  B  /\  B  ||  A
)  <->  ( A. p  e.  Prime  ( p  pCnt  A )  <_  ( p  pCnt  B )  /\  A. p  e.  Prime  ( p 
pCnt  B )  <_  (
p  pCnt  A )
) ) )
2217, 21bitr4d 191 . . . 4  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ )  ->  ( A. p  e. 
Prime  ( p  pCnt  A
)  =  ( p 
pCnt  B )  <->  ( A  ||  B  /\  B  ||  A ) ) )
233, 4, 22syl2an 289 . . 3  |-  ( ( A  e.  NN0  /\  B  e.  NN0 )  -> 
( A. p  e. 
Prime  ( p  pCnt  A
)  =  ( p 
pCnt  B )  <->  ( A  ||  B  /\  B  ||  A ) ) )
24 dvdseq 11889 . . . 4  |-  ( ( ( A  e.  NN0  /\  B  e.  NN0 )  /\  ( A  ||  B  /\  B  ||  A ) )  ->  A  =  B )
2524ex 115 . . 3  |-  ( ( A  e.  NN0  /\  B  e.  NN0 )  -> 
( ( A  ||  B  /\  B  ||  A
)  ->  A  =  B ) )
2623, 25sylbid 150 . 2  |-  ( ( A  e.  NN0  /\  B  e.  NN0 )  -> 
( A. p  e. 
Prime  ( p  pCnt  A
)  =  ( p 
pCnt  B )  ->  A  =  B ) )
272, 26impbid2 143 1  |-  ( ( A  e.  NN0  /\  B  e.  NN0 )  -> 
( A  =  B  <->  A. p  e.  Prime  ( p  pCnt  A )  =  ( p  pCnt  B ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1364    e. wcel 2160   A.wral 2468   class class class wbr 4018  (class class class)co 5897   RR*cxr 8022    <_ cle 8024   NN0cn0 9207   ZZcz 9284   QQcq 9651    || cdvds 11829   Primecprime 12142    pCnt cpc 12319
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 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2162  ax-14 2163  ax-ext 2171  ax-coll 4133  ax-sep 4136  ax-nul 4144  ax-pow 4192  ax-pr 4227  ax-un 4451  ax-setind 4554  ax-iinf 4605  ax-cnex 7933  ax-resscn 7934  ax-1cn 7935  ax-1re 7936  ax-icn 7937  ax-addcl 7938  ax-addrcl 7939  ax-mulcl 7940  ax-mulrcl 7941  ax-addcom 7942  ax-mulcom 7943  ax-addass 7944  ax-mulass 7945  ax-distr 7946  ax-i2m1 7947  ax-0lt1 7948  ax-1rid 7949  ax-0id 7950  ax-rnegex 7951  ax-precex 7952  ax-cnre 7953  ax-pre-ltirr 7954  ax-pre-ltwlin 7955  ax-pre-lttrn 7956  ax-pre-apti 7957  ax-pre-ltadd 7958  ax-pre-mulgt0 7959  ax-pre-mulext 7960  ax-arch 7961  ax-caucvg 7962
This theorem depends on definitions:  df-bi 117  df-stab 832  df-dc 836  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2041  df-mo 2042  df-clab 2176  df-cleq 2182  df-clel 2185  df-nfc 2321  df-ne 2361  df-nel 2456  df-ral 2473  df-rex 2474  df-reu 2475  df-rmo 2476  df-rab 2477  df-v 2754  df-sbc 2978  df-csb 3073  df-dif 3146  df-un 3148  df-in 3150  df-ss 3157  df-nul 3438  df-if 3550  df-pw 3592  df-sn 3613  df-pr 3614  df-op 3616  df-uni 3825  df-int 3860  df-iun 3903  df-br 4019  df-opab 4080  df-mpt 4081  df-tr 4117  df-id 4311  df-po 4314  df-iso 4315  df-iord 4384  df-on 4386  df-ilim 4387  df-suc 4389  df-iom 4608  df-xp 4650  df-rel 4651  df-cnv 4652  df-co 4653  df-dm 4654  df-rn 4655  df-res 4656  df-ima 4657  df-iota 5196  df-fun 5237  df-fn 5238  df-f 5239  df-f1 5240  df-fo 5241  df-f1o 5242  df-fv 5243  df-isom 5244  df-riota 5852  df-ov 5900  df-oprab 5901  df-mpo 5902  df-1st 6166  df-2nd 6167  df-recs 6331  df-frec 6417  df-1o 6442  df-2o 6443  df-er 6560  df-en 6768  df-sup 7014  df-inf 7015  df-pnf 8025  df-mnf 8026  df-xr 8027  df-ltxr 8028  df-le 8029  df-sub 8161  df-neg 8162  df-reap 8563  df-ap 8570  df-div 8661  df-inn 8951  df-2 9009  df-3 9010  df-4 9011  df-n0 9208  df-xnn0 9271  df-z 9285  df-uz 9560  df-q 9652  df-rp 9686  df-fz 10041  df-fzo 10175  df-fl 10303  df-mod 10356  df-seqfrec 10479  df-exp 10554  df-cj 10886  df-re 10887  df-im 10888  df-rsqrt 11042  df-abs 11043  df-dvds 11830  df-gcd 11979  df-prm 12143  df-pc 12320
This theorem is referenced by:  pcprod  12381  1arith  12402
  Copyright terms: Public domain W3C validator