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

Theorem pcmptdvds 12539
Description: The partial products of the prime power map form a divisibility chain. (Contributed by Mario Carneiro, 12-Mar-2014.)
Hypotheses
Ref Expression
pcmpt.1  |-  F  =  ( n  e.  NN  |->  if ( n  e.  Prime ,  ( n ^ A
) ,  1 ) )
pcmpt.2  |-  ( ph  ->  A. n  e.  Prime  A  e.  NN0 )
pcmpt.3  |-  ( ph  ->  N  e.  NN )
pcmptdvds.3  |-  ( ph  ->  M  e.  ( ZZ>= `  N ) )
Assertion
Ref Expression
pcmptdvds  |-  ( ph  ->  (  seq 1 (  x.  ,  F ) `
 N )  ||  (  seq 1 (  x.  ,  F ) `  M ) )

Proof of Theorem pcmptdvds
Dummy variables  m  p are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 pcmpt.2 . . . . . . . . 9  |-  ( ph  ->  A. n  e.  Prime  A  e.  NN0 )
2 nfv 1542 . . . . . . . . . 10  |-  F/ m  A  e.  NN0
3 nfcsb1v 3117 . . . . . . . . . . 11  |-  F/_ n [_ m  /  n ]_ A
43nfel1 2350 . . . . . . . . . 10  |-  F/ n [_ m  /  n ]_ A  e.  NN0
5 csbeq1a 3093 . . . . . . . . . . 11  |-  ( n  =  m  ->  A  =  [_ m  /  n ]_ A )
65eleq1d 2265 . . . . . . . . . 10  |-  ( n  =  m  ->  ( A  e.  NN0  <->  [_ m  /  n ]_ A  e.  NN0 ) )
72, 4, 6cbvralw 2723 . . . . . . . . 9  |-  ( A. n  e.  Prime  A  e. 
NN0 
<-> 
A. m  e.  Prime  [_ m  /  n ]_ A  e.  NN0 )
81, 7sylib 122 . . . . . . . 8  |-  ( ph  ->  A. m  e.  Prime  [_ m  /  n ]_ A  e.  NN0 )
9 csbeq1 3087 . . . . . . . . . 10  |-  ( m  =  p  ->  [_ m  /  n ]_ A  = 
[_ p  /  n ]_ A )
109eleq1d 2265 . . . . . . . . 9  |-  ( m  =  p  ->  ( [_ m  /  n ]_ A  e.  NN0  <->  [_ p  /  n ]_ A  e.  NN0 ) )
1110rspcv 2864 . . . . . . . 8  |-  ( p  e.  Prime  ->  ( A. m  e.  Prime  [_ m  /  n ]_ A  e. 
NN0  ->  [_ p  /  n ]_ A  e.  NN0 ) )
128, 11mpan9 281 . . . . . . 7  |-  ( (
ph  /\  p  e.  Prime )  ->  [_ p  /  n ]_ A  e.  NN0 )
1312nn0ge0d 9322 . . . . . 6  |-  ( (
ph  /\  p  e.  Prime )  ->  0  <_  [_ p  /  n ]_ A )
14 0le0 9096 . . . . . . 7  |-  0  <_  0
1514a1i 9 . . . . . 6  |-  ( (
ph  /\  p  e.  Prime )  ->  0  <_  0 )
16 prmz 12304 . . . . . . . 8  |-  ( p  e.  Prime  ->  p  e.  ZZ )
17 pcmptdvds.3 . . . . . . . . . 10  |-  ( ph  ->  M  e.  ( ZZ>= `  N ) )
18 eluzelz 9627 . . . . . . . . . 10  |-  ( M  e.  ( ZZ>= `  N
)  ->  M  e.  ZZ )
1917, 18syl 14 . . . . . . . . 9  |-  ( ph  ->  M  e.  ZZ )
2019adantr 276 . . . . . . . 8  |-  ( (
ph  /\  p  e.  Prime )  ->  M  e.  ZZ )
21 zdcle 9419 . . . . . . . 8  |-  ( ( p  e.  ZZ  /\  M  e.  ZZ )  -> DECID  p  <_  M )
2216, 20, 21syl2an2 594 . . . . . . 7  |-  ( (
ph  /\  p  e.  Prime )  -> DECID  p  <_  M )
23 pcmpt.3 . . . . . . . . . . 11  |-  ( ph  ->  N  e.  NN )
2423adantr 276 . . . . . . . . . 10  |-  ( (
ph  /\  p  e.  Prime )  ->  N  e.  NN )
2524nnzd 9464 . . . . . . . . 9  |-  ( (
ph  /\  p  e.  Prime )  ->  N  e.  ZZ )
26 zdcle 9419 . . . . . . . . 9  |-  ( ( p  e.  ZZ  /\  N  e.  ZZ )  -> DECID  p  <_  N )
2716, 25, 26syl2an2 594 . . . . . . . 8  |-  ( (
ph  /\  p  e.  Prime )  -> DECID  p  <_  N )
28 dcn 843 . . . . . . . 8  |-  (DECID  p  <_  N  -> DECID  -.  p  <_  N )
2927, 28syl 14 . . . . . . 7  |-  ( (
ph  /\  p  e.  Prime )  -> DECID  -.  p  <_  N
)
30 dcan2 936 . . . . . . 7  |-  (DECID  p  <_  M  ->  (DECID  -.  p  <_  N  -> DECID  ( p  <_  M  /\  -.  p  <_  N ) ) )
3122, 29, 30sylc 62 . . . . . 6  |-  ( (
ph  /\  p  e.  Prime )  -> DECID  ( p  <_  M  /\  -.  p  <_  N
) )
32 breq2 4038 . . . . . . 7  |-  ( [_ p  /  n ]_ A  =  if ( ( p  <_  M  /\  -.  p  <_  N ) , 
[_ p  /  n ]_ A ,  0 )  ->  ( 0  <_  [_ p  /  n ]_ A  <->  0  <_  if ( ( p  <_  M  /\  -.  p  <_  N ) ,  [_ p  /  n ]_ A ,  0 ) ) )
33 breq2 4038 . . . . . . 7  |-  ( 0  =  if ( ( p  <_  M  /\  -.  p  <_  N ) ,  [_ p  /  n ]_ A ,  0 )  ->  ( 0  <_  0  <->  0  <_  if ( ( p  <_  M  /\  -.  p  <_  N ) ,  [_ p  /  n ]_ A ,  0 ) ) )
3432, 33ifbothdc 3595 . . . . . 6  |-  ( ( 0  <_  [_ p  /  n ]_ A  /\  0  <_  0  /\ DECID  ( p  <_  M  /\  -.  p  <_  N
) )  ->  0  <_  if ( ( p  <_  M  /\  -.  p  <_  N ) , 
[_ p  /  n ]_ A ,  0 ) )
3513, 15, 31, 34syl3anc 1249 . . . . 5  |-  ( (
ph  /\  p  e.  Prime )  ->  0  <_  if ( ( p  <_  M  /\  -.  p  <_  N ) ,  [_ p  /  n ]_ A ,  0 ) )
36 pcmpt.1 . . . . . . 7  |-  F  =  ( n  e.  NN  |->  if ( n  e.  Prime ,  ( n ^ A
) ,  1 ) )
37 nfcv 2339 . . . . . . . 8  |-  F/_ m if ( n  e.  Prime ,  ( n ^ A
) ,  1 )
38 nfv 1542 . . . . . . . . 9  |-  F/ n  m  e.  Prime
39 nfcv 2339 . . . . . . . . . 10  |-  F/_ n m
40 nfcv 2339 . . . . . . . . . 10  |-  F/_ n ^
4139, 40, 3nfov 5955 . . . . . . . . 9  |-  F/_ n
( m ^ [_ m  /  n ]_ A
)
42 nfcv 2339 . . . . . . . . 9  |-  F/_ n
1
4338, 41, 42nfif 3590 . . . . . . . 8  |-  F/_ n if ( m  e.  Prime ,  ( m ^ [_ m  /  n ]_ A
) ,  1 )
44 eleq1w 2257 . . . . . . . . 9  |-  ( n  =  m  ->  (
n  e.  Prime  <->  m  e.  Prime ) )
45 id 19 . . . . . . . . . 10  |-  ( n  =  m  ->  n  =  m )
4645, 5oveq12d 5943 . . . . . . . . 9  |-  ( n  =  m  ->  (
n ^ A )  =  ( m ^ [_ m  /  n ]_ A ) )
4744, 46ifbieq1d 3584 . . . . . . . 8  |-  ( n  =  m  ->  if ( n  e.  Prime ,  ( n ^ A
) ,  1 )  =  if ( m  e.  Prime ,  ( m ^ [_ m  /  n ]_ A ) ,  1 ) )
4837, 43, 47cbvmpt 4129 . . . . . . 7  |-  ( n  e.  NN  |->  if ( n  e.  Prime ,  ( n ^ A ) ,  1 ) )  =  ( m  e.  NN  |->  if ( m  e.  Prime ,  ( m ^ [_ m  /  n ]_ A ) ,  1 ) )
4936, 48eqtri 2217 . . . . . 6  |-  F  =  ( m  e.  NN  |->  if ( m  e.  Prime ,  ( m ^ [_ m  /  n ]_ A
) ,  1 ) )
508adantr 276 . . . . . 6  |-  ( (
ph  /\  p  e.  Prime )  ->  A. m  e.  Prime  [_ m  /  n ]_ A  e.  NN0 )
51 simpr 110 . . . . . 6  |-  ( (
ph  /\  p  e.  Prime )  ->  p  e.  Prime )
5217adantr 276 . . . . . 6  |-  ( (
ph  /\  p  e.  Prime )  ->  M  e.  ( ZZ>= `  N )
)
5349, 50, 24, 51, 9, 52pcmpt2 12538 . . . . 5  |-  ( (
ph  /\  p  e.  Prime )  ->  ( p  pCnt  ( (  seq 1
(  x.  ,  F
) `  M )  /  (  seq 1
(  x.  ,  F
) `  N )
) )  =  if ( ( p  <_  M  /\  -.  p  <_  N ) ,  [_ p  /  n ]_ A ,  0 ) )
5435, 53breqtrrd 4062 . . . 4  |-  ( (
ph  /\  p  e.  Prime )  ->  0  <_  ( p  pCnt  ( (  seq 1 (  x.  ,  F ) `  M
)  /  (  seq 1 (  x.  ,  F ) `  N
) ) ) )
5554ralrimiva 2570 . . 3  |-  ( ph  ->  A. p  e.  Prime  0  <_  ( p  pCnt  ( (  seq 1 (  x.  ,  F ) `
 M )  / 
(  seq 1 (  x.  ,  F ) `  N ) ) ) )
5636, 1pcmptcl 12536 . . . . . . . 8  |-  ( ph  ->  ( F : NN --> NN  /\  seq 1 (  x.  ,  F ) : NN --> NN ) )
5756simprd 114 . . . . . . 7  |-  ( ph  ->  seq 1 (  x.  ,  F ) : NN --> NN )
58 eluznn 9691 . . . . . . . 8  |-  ( ( N  e.  NN  /\  M  e.  ( ZZ>= `  N ) )  ->  M  e.  NN )
5923, 17, 58syl2anc 411 . . . . . . 7  |-  ( ph  ->  M  e.  NN )
6057, 59ffvelcdmd 5701 . . . . . 6  |-  ( ph  ->  (  seq 1 (  x.  ,  F ) `
 M )  e.  NN )
6160nnzd 9464 . . . . 5  |-  ( ph  ->  (  seq 1 (  x.  ,  F ) `
 M )  e.  ZZ )
6257, 23ffvelcdmd 5701 . . . . 5  |-  ( ph  ->  (  seq 1 (  x.  ,  F ) `
 N )  e.  NN )
63 znq 9715 . . . . 5  |-  ( ( (  seq 1 (  x.  ,  F ) `
 M )  e.  ZZ  /\  (  seq 1 (  x.  ,  F ) `  N
)  e.  NN )  ->  ( (  seq 1 (  x.  ,  F ) `  M
)  /  (  seq 1 (  x.  ,  F ) `  N
) )  e.  QQ )
6461, 62, 63syl2anc 411 . . . 4  |-  ( ph  ->  ( (  seq 1
(  x.  ,  F
) `  M )  /  (  seq 1
(  x.  ,  F
) `  N )
)  e.  QQ )
65 pcz 12526 . . . 4  |-  ( ( (  seq 1 (  x.  ,  F ) `
 M )  / 
(  seq 1 (  x.  ,  F ) `  N ) )  e.  QQ  ->  ( (
(  seq 1 (  x.  ,  F ) `  M )  /  (  seq 1 (  x.  ,  F ) `  N
) )  e.  ZZ  <->  A. p  e.  Prime  0  <_  ( p  pCnt  (
(  seq 1 (  x.  ,  F ) `  M )  /  (  seq 1 (  x.  ,  F ) `  N
) ) ) ) )
6664, 65syl 14 . . 3  |-  ( ph  ->  ( ( (  seq 1 (  x.  ,  F ) `  M
)  /  (  seq 1 (  x.  ,  F ) `  N
) )  e.  ZZ  <->  A. p  e.  Prime  0  <_  ( p  pCnt  (
(  seq 1 (  x.  ,  F ) `  M )  /  (  seq 1 (  x.  ,  F ) `  N
) ) ) ) )
6755, 66mpbird 167 . 2  |-  ( ph  ->  ( (  seq 1
(  x.  ,  F
) `  M )  /  (  seq 1
(  x.  ,  F
) `  N )
)  e.  ZZ )
6862nnzd 9464 . . 3  |-  ( ph  ->  (  seq 1 (  x.  ,  F ) `
 N )  e.  ZZ )
6962nnne0d 9052 . . 3  |-  ( ph  ->  (  seq 1 (  x.  ,  F ) `
 N )  =/=  0 )
70 dvdsval2 11972 . . 3  |-  ( ( (  seq 1 (  x.  ,  F ) `
 N )  e.  ZZ  /\  (  seq 1 (  x.  ,  F ) `  N
)  =/=  0  /\  (  seq 1 (  x.  ,  F ) `
 M )  e.  ZZ )  ->  (
(  seq 1 (  x.  ,  F ) `  N )  ||  (  seq 1 (  x.  ,  F ) `  M
)  <->  ( (  seq 1 (  x.  ,  F ) `  M
)  /  (  seq 1 (  x.  ,  F ) `  N
) )  e.  ZZ ) )
7168, 69, 61, 70syl3anc 1249 . 2  |-  ( ph  ->  ( (  seq 1
(  x.  ,  F
) `  N )  ||  (  seq 1
(  x.  ,  F
) `  M )  <->  ( (  seq 1 (  x.  ,  F ) `
 M )  / 
(  seq 1 (  x.  ,  F ) `  N ) )  e.  ZZ ) )
7267, 71mpbird 167 1  |-  ( ph  ->  (  seq 1 (  x.  ,  F ) `
 N )  ||  (  seq 1 (  x.  ,  F ) `  M ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    <-> wb 105  DECID wdc 835    = wceq 1364    e. wcel 2167    =/= wne 2367   A.wral 2475   [_csb 3084   ifcif 3562   class class class wbr 4034    |-> cmpt 4095   -->wf 5255   ` cfv 5259  (class class class)co 5925   0cc0 7896   1c1 7897    x. cmul 7901    <_ cle 8079    / cdiv 8716   NNcn 9007   NN0cn0 9266   ZZcz 9343   ZZ>=cuz 9618   QQcq 9710    seqcseq 10556   ^cexp 10647    || cdvds 11969   Primecprime 12300    pCnt cpc 12478
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 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-coll 4149  ax-sep 4152  ax-nul 4160  ax-pow 4208  ax-pr 4243  ax-un 4469  ax-setind 4574  ax-iinf 4625  ax-cnex 7987  ax-resscn 7988  ax-1cn 7989  ax-1re 7990  ax-icn 7991  ax-addcl 7992  ax-addrcl 7993  ax-mulcl 7994  ax-mulrcl 7995  ax-addcom 7996  ax-mulcom 7997  ax-addass 7998  ax-mulass 7999  ax-distr 8000  ax-i2m1 8001  ax-0lt1 8002  ax-1rid 8003  ax-0id 8004  ax-rnegex 8005  ax-precex 8006  ax-cnre 8007  ax-pre-ltirr 8008  ax-pre-ltwlin 8009  ax-pre-lttrn 8010  ax-pre-apti 8011  ax-pre-ltadd 8012  ax-pre-mulgt0 8013  ax-pre-mulext 8014  ax-arch 8015  ax-caucvg 8016
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 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-nel 2463  df-ral 2480  df-rex 2481  df-reu 2482  df-rmo 2483  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3452  df-if 3563  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-int 3876  df-iun 3919  df-br 4035  df-opab 4096  df-mpt 4097  df-tr 4133  df-id 4329  df-po 4332  df-iso 4333  df-iord 4402  df-on 4404  df-ilim 4405  df-suc 4407  df-iom 4628  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-res 4676  df-ima 4677  df-iota 5220  df-fun 5261  df-fn 5262  df-f 5263  df-f1 5264  df-fo 5265  df-f1o 5266  df-fv 5267  df-isom 5268  df-riota 5880  df-ov 5928  df-oprab 5929  df-mpo 5930  df-1st 6207  df-2nd 6208  df-recs 6372  df-frec 6458  df-1o 6483  df-2o 6484  df-er 6601  df-en 6809  df-fin 6811  df-sup 7059  df-inf 7060  df-pnf 8080  df-mnf 8081  df-xr 8082  df-ltxr 8083  df-le 8084  df-sub 8216  df-neg 8217  df-reap 8619  df-ap 8626  df-div 8717  df-inn 9008  df-2 9066  df-3 9067  df-4 9068  df-n0 9267  df-xnn0 9330  df-z 9344  df-uz 9619  df-q 9711  df-rp 9746  df-fz 10101  df-fzo 10235  df-fl 10377  df-mod 10432  df-seqfrec 10557  df-exp 10648  df-cj 11024  df-re 11025  df-im 11026  df-rsqrt 11180  df-abs 11181  df-dvds 11970  df-gcd 12146  df-prm 12301  df-pc 12479
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator