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

Theorem pcmptdvds 12712
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 1552 . . . . . . . . . 10  |-  F/ m  A  e.  NN0
3 nfcsb1v 3127 . . . . . . . . . . 11  |-  F/_ n [_ m  /  n ]_ A
43nfel1 2360 . . . . . . . . . 10  |-  F/ n [_ m  /  n ]_ A  e.  NN0
5 csbeq1a 3103 . . . . . . . . . . 11  |-  ( n  =  m  ->  A  =  [_ m  /  n ]_ A )
65eleq1d 2275 . . . . . . . . . 10  |-  ( n  =  m  ->  ( A  e.  NN0  <->  [_ m  /  n ]_ A  e.  NN0 ) )
72, 4, 6cbvralw 2733 . . . . . . . . 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 3097 . . . . . . . . . 10  |-  ( m  =  p  ->  [_ m  /  n ]_ A  = 
[_ p  /  n ]_ A )
109eleq1d 2275 . . . . . . . . 9  |-  ( m  =  p  ->  ( [_ m  /  n ]_ A  e.  NN0  <->  [_ p  /  n ]_ A  e.  NN0 ) )
1110rspcv 2874 . . . . . . . 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 9358 . . . . . 6  |-  ( (
ph  /\  p  e.  Prime )  ->  0  <_  [_ p  /  n ]_ A )
14 0le0 9132 . . . . . . 7  |-  0  <_  0
1514a1i 9 . . . . . 6  |-  ( (
ph  /\  p  e.  Prime )  ->  0  <_  0 )
16 prmz 12477 . . . . . . . 8  |-  ( p  e.  Prime  ->  p  e.  ZZ )
17 pcmptdvds.3 . . . . . . . . . 10  |-  ( ph  ->  M  e.  ( ZZ>= `  N ) )
18 eluzelz 9664 . . . . . . . . . 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 9456 . . . . . . . 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 9501 . . . . . . . . 9  |-  ( (
ph  /\  p  e.  Prime )  ->  N  e.  ZZ )
26 zdcle 9456 . . . . . . . . 9  |-  ( ( p  e.  ZZ  /\  N  e.  ZZ )  -> DECID  p  <_  N )
2716, 25, 26syl2an2 594 . . . . . . . 8  |-  ( (
ph  /\  p  e.  Prime )  -> DECID  p  <_  N )
28 dcn 844 . . . . . . . 8  |-  (DECID  p  <_  N  -> DECID  -.  p  <_  N )
2927, 28syl 14 . . . . . . 7  |-  ( (
ph  /\  p  e.  Prime )  -> DECID  -.  p  <_  N
)
30 dcan2 937 . . . . . . 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 4051 . . . . . . 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 4051 . . . . . . 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 3606 . . . . . 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 1250 . . . . 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 2349 . . . . . . . 8  |-  F/_ m if ( n  e.  Prime ,  ( n ^ A
) ,  1 )
38 nfv 1552 . . . . . . . . 9  |-  F/ n  m  e.  Prime
39 nfcv 2349 . . . . . . . . . 10  |-  F/_ n m
40 nfcv 2349 . . . . . . . . . 10  |-  F/_ n ^
4139, 40, 3nfov 5981 . . . . . . . . 9  |-  F/_ n
( m ^ [_ m  /  n ]_ A
)
42 nfcv 2349 . . . . . . . . 9  |-  F/_ n
1
4338, 41, 42nfif 3600 . . . . . . . 8  |-  F/_ n if ( m  e.  Prime ,  ( m ^ [_ m  /  n ]_ A
) ,  1 )
44 eleq1w 2267 . . . . . . . . 9  |-  ( n  =  m  ->  (
n  e.  Prime  <->  m  e.  Prime ) )
45 id 19 . . . . . . . . . 10  |-  ( n  =  m  ->  n  =  m )
4645, 5oveq12d 5969 . . . . . . . . 9  |-  ( n  =  m  ->  (
n ^ A )  =  ( m ^ [_ m  /  n ]_ A ) )
4744, 46ifbieq1d 3594 . . . . . . . 8  |-  ( n  =  m  ->  if ( n  e.  Prime ,  ( n ^ A
) ,  1 )  =  if ( m  e.  Prime ,  ( m ^ [_ m  /  n ]_ A ) ,  1 ) )
4837, 43, 47cbvmpt 4143 . . . . . . 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 2227 . . . . . 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 12711 . . . . 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 4075 . . . 4  |-  ( (
ph  /\  p  e.  Prime )  ->  0  <_  ( p  pCnt  ( (  seq 1 (  x.  ,  F ) `  M
)  /  (  seq 1 (  x.  ,  F ) `  N
) ) ) )
5554ralrimiva 2580 . . 3  |-  ( ph  ->  A. p  e.  Prime  0  <_  ( p  pCnt  ( (  seq 1 (  x.  ,  F ) `
 M )  / 
(  seq 1 (  x.  ,  F ) `  N ) ) ) )
5636, 1pcmptcl 12709 . . . . . . . 8  |-  ( ph  ->  ( F : NN --> NN  /\  seq 1 (  x.  ,  F ) : NN --> NN ) )
5756simprd 114 . . . . . . 7  |-  ( ph  ->  seq 1 (  x.  ,  F ) : NN --> NN )
58 eluznn 9728 . . . . . . . 8  |-  ( ( N  e.  NN  /\  M  e.  ( ZZ>= `  N ) )  ->  M  e.  NN )
5923, 17, 58syl2anc 411 . . . . . . 7  |-  ( ph  ->  M  e.  NN )
6057, 59ffvelcdmd 5723 . . . . . 6  |-  ( ph  ->  (  seq 1 (  x.  ,  F ) `
 M )  e.  NN )
6160nnzd 9501 . . . . 5  |-  ( ph  ->  (  seq 1 (  x.  ,  F ) `
 M )  e.  ZZ )
6257, 23ffvelcdmd 5723 . . . . 5  |-  ( ph  ->  (  seq 1 (  x.  ,  F ) `
 N )  e.  NN )
63 znq 9752 . . . . 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 12699 . . . 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 9501 . . 3  |-  ( ph  ->  (  seq 1 (  x.  ,  F ) `
 N )  e.  ZZ )
6962nnne0d 9088 . . 3  |-  ( ph  ->  (  seq 1 (  x.  ,  F ) `
 N )  =/=  0 )
70 dvdsval2 12145 . . 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 1250 . 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 836    = wceq 1373    e. wcel 2177    =/= wne 2377   A.wral 2485   [_csb 3094   ifcif 3572   class class class wbr 4047    |-> cmpt 4109   -->wf 5272   ` cfv 5276  (class class class)co 5951   0cc0 7932   1c1 7933    x. cmul 7937    <_ cle 8115    / cdiv 8752   NNcn 9043   NN0cn0 9302   ZZcz 9379   ZZ>=cuz 9655   QQcq 9747    seqcseq 10599   ^cexp 10690    || cdvds 12142   Primecprime 12473    pCnt cpc 12651
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 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2179  ax-14 2180  ax-ext 2188  ax-coll 4163  ax-sep 4166  ax-nul 4174  ax-pow 4222  ax-pr 4257  ax-un 4484  ax-setind 4589  ax-iinf 4640  ax-cnex 8023  ax-resscn 8024  ax-1cn 8025  ax-1re 8026  ax-icn 8027  ax-addcl 8028  ax-addrcl 8029  ax-mulcl 8030  ax-mulrcl 8031  ax-addcom 8032  ax-mulcom 8033  ax-addass 8034  ax-mulass 8035  ax-distr 8036  ax-i2m1 8037  ax-0lt1 8038  ax-1rid 8039  ax-0id 8040  ax-rnegex 8041  ax-precex 8042  ax-cnre 8043  ax-pre-ltirr 8044  ax-pre-ltwlin 8045  ax-pre-lttrn 8046  ax-pre-apti 8047  ax-pre-ltadd 8048  ax-pre-mulgt0 8049  ax-pre-mulext 8050  ax-arch 8051  ax-caucvg 8052
This theorem depends on definitions:  df-bi 117  df-stab 833  df-dc 837  df-3or 982  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2193  df-cleq 2199  df-clel 2202  df-nfc 2338  df-ne 2378  df-nel 2473  df-ral 2490  df-rex 2491  df-reu 2492  df-rmo 2493  df-rab 2494  df-v 2775  df-sbc 3000  df-csb 3095  df-dif 3169  df-un 3171  df-in 3173  df-ss 3180  df-nul 3462  df-if 3573  df-pw 3619  df-sn 3640  df-pr 3641  df-op 3643  df-uni 3853  df-int 3888  df-iun 3931  df-br 4048  df-opab 4110  df-mpt 4111  df-tr 4147  df-id 4344  df-po 4347  df-iso 4348  df-iord 4417  df-on 4419  df-ilim 4420  df-suc 4422  df-iom 4643  df-xp 4685  df-rel 4686  df-cnv 4687  df-co 4688  df-dm 4689  df-rn 4690  df-res 4691  df-ima 4692  df-iota 5237  df-fun 5278  df-fn 5279  df-f 5280  df-f1 5281  df-fo 5282  df-f1o 5283  df-fv 5284  df-isom 5285  df-riota 5906  df-ov 5954  df-oprab 5955  df-mpo 5956  df-1st 6233  df-2nd 6234  df-recs 6398  df-frec 6484  df-1o 6509  df-2o 6510  df-er 6627  df-en 6835  df-fin 6837  df-sup 7093  df-inf 7094  df-pnf 8116  df-mnf 8117  df-xr 8118  df-ltxr 8119  df-le 8120  df-sub 8252  df-neg 8253  df-reap 8655  df-ap 8662  df-div 8753  df-inn 9044  df-2 9102  df-3 9103  df-4 9104  df-n0 9303  df-xnn0 9366  df-z 9380  df-uz 9656  df-q 9748  df-rp 9783  df-fz 10138  df-fzo 10272  df-fl 10420  df-mod 10475  df-seqfrec 10600  df-exp 10691  df-cj 11197  df-re 11198  df-im 11199  df-rsqrt 11353  df-abs 11354  df-dvds 12143  df-gcd 12319  df-prm 12474  df-pc 12652
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator