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

Theorem pc11 13088
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 6083 . . 3  |-  ( A  =  B  ->  (
p  pCnt  A )  =  ( p  pCnt  B ) )
21ralrimivw 2624 . 2  |-  ( A  =  B  ->  A. p  e.  Prime  ( p  pCnt  A )  =  ( p 
pCnt  B ) )
3 nn0z 9643 . . . 4  |-  ( A  e.  NN0  ->  A  e.  ZZ )
4 nn0z 9643 . . . 4  |-  ( B  e.  NN0  ->  B  e.  ZZ )
5 zq 10005 . . . . . . . . . . 11  |-  ( A  e.  ZZ  ->  A  e.  QQ )
6 pcxcl 13068 . . . . . . . . . . 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 10005 . . . . . . . . . . 11  |-  ( B  e.  ZZ  ->  B  e.  QQ )
9 pcxcl 13068 . . . . . . . . . . 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 608 . . . . . . . . 9  |-  ( ( p  e.  Prime  /\  ( A  e.  ZZ  /\  B  e.  ZZ ) )  -> 
( ( p  pCnt  A )  e.  RR*  /\  (
p  pCnt  B )  e.  RR* ) )
12 xrletri3 10185 . . . . . . . . 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 2546 . . . . . 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 2677 . . . . . 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 13087 . . . . . 6  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ )  ->  ( A  ||  B  <->  A. p  e.  Prime  (
p  pCnt  A )  <_  ( p  pCnt  B
) ) )
19 pc2dvds 13087 . . . . . . 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 477 . . . . 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 12593 . . . 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 1402    e. wcel 2209   A.wral 2528   class class class wbr 4125  (class class class)co 6075   RR*cxr 8349    <_ cle 8351   NN0cn0 9542   ZZcz 9623   QQcq 9998    || cdvds 12532   Primecprime 12863    pCnt cpc 13041
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 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 4241  ax-sep 4244  ax-nul 4254  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-iinf 4730  ax-cnex 8260  ax-resscn 8261  ax-1cn 8262  ax-1re 8263  ax-icn 8264  ax-addcl 8265  ax-addrcl 8266  ax-mulcl 8267  ax-mulrcl 8268  ax-addcom 8269  ax-mulcom 8270  ax-addass 8271  ax-mulass 8272  ax-distr 8273  ax-i2m1 8274  ax-0lt1 8275  ax-1rid 8276  ax-0id 8277  ax-rnegex 8278  ax-precex 8279  ax-cnre 8280  ax-pre-ltirr 8281  ax-pre-ltwlin 8282  ax-pre-lttrn 8283  ax-pre-apti 8284  ax-pre-ltadd 8285  ax-pre-mulgt0 8286  ax-pre-mulext 8287  ax-arch 8288  ax-caucvg 8289
This theorem depends on definitions:  df-bi 117  df-stab 843  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 3636  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-iun 4009  df-br 4126  df-opab 4188  df-mpt 4189  df-tr 4225  df-id 4433  df-po 4436  df-iso 4437  df-iord 4506  df-on 4508  df-ilim 4509  df-suc 4511  df-iom 4733  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-f1 5377  df-fo 5378  df-f1o 5379  df-fv 5380  df-isom 5381  df-riota 6028  df-ov 6078  df-oprab 6079  df-mpo 6080  df-1st 6364  df-2nd 6365  df-recs 6566  df-frec 6652  df-1o 6677  df-2o 6678  df-er 6797  df-en 7013  df-sup 7314  df-inf 7315  df-pnf 8352  df-mnf 8353  df-xr 8354  df-ltxr 8355  df-le 8356  df-sub 8489  df-neg 8490  df-reap 8893  df-ap 8900  df-div 8993  df-inn 9284  df-2 9342  df-3 9343  df-4 9344  df-n0 9543  df-xnn0 9610  df-z 9624  df-uz 9901  df-q 9999  df-rp 10034  df-fz 10391  df-fzo 10528  df-fl 10683  df-mod 10738  df-seqfrec 10863  df-exp 10954  df-cj 11585  df-re 11586  df-im 11587  df-rsqrt 11742  df-abs 11743  df-dvds 12533  df-gcd 12709  df-prm 12864  df-pc 13042
This theorem is referenced by:  pcprod  13103  1arith  13124
  Copyright terms: Public domain W3C validator