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

Theorem pcfaclem 13072
Description: Lemma for pcfac 13073. (Contributed by Mario Carneiro, 20-May-2014.)
Assertion
Ref Expression
pcfaclem  |-  ( ( N  e.  NN0  /\  M  e.  ( ZZ>= `  N )  /\  P  e.  Prime )  ->  ( |_ `  ( N  / 
( P ^ M
) ) )  =  0 )

Proof of Theorem pcfaclem
StepHypRef Expression
1 nn0ge0 9538 . . . 4  |-  ( N  e.  NN0  ->  0  <_  N )
213ad2ant1 1045 . . 3  |-  ( ( N  e.  NN0  /\  M  e.  ( ZZ>= `  N )  /\  P  e.  Prime )  ->  0  <_  N )
3 nn0re 9522 . . . . 5  |-  ( N  e.  NN0  ->  N  e.  RR )
433ad2ant1 1045 . . . 4  |-  ( ( N  e.  NN0  /\  M  e.  ( ZZ>= `  N )  /\  P  e.  Prime )  ->  N  e.  RR )
5 prmnn 12832 . . . . . . 7  |-  ( P  e.  Prime  ->  P  e.  NN )
653ad2ant3 1047 . . . . . 6  |-  ( ( N  e.  NN0  /\  M  e.  ( ZZ>= `  N )  /\  P  e.  Prime )  ->  P  e.  NN )
7 eluznn0 9949 . . . . . . 7  |-  ( ( N  e.  NN0  /\  M  e.  ( ZZ>= `  N ) )  ->  M  e.  NN0 )
873adant3 1044 . . . . . 6  |-  ( ( N  e.  NN0  /\  M  e.  ( ZZ>= `  N )  /\  P  e.  Prime )  ->  M  e.  NN0 )
96, 8nnexpcld 11082 . . . . 5  |-  ( ( N  e.  NN0  /\  M  e.  ( ZZ>= `  N )  /\  P  e.  Prime )  ->  ( P ^ M )  e.  NN )
109nnred 9267 . . . 4  |-  ( ( N  e.  NN0  /\  M  e.  ( ZZ>= `  N )  /\  P  e.  Prime )  ->  ( P ^ M )  e.  RR )
119nngt0d 9298 . . . 4  |-  ( ( N  e.  NN0  /\  M  e.  ( ZZ>= `  N )  /\  P  e.  Prime )  ->  0  <  ( P ^ M
) )
12 ge0div 9162 . . . 4  |-  ( ( N  e.  RR  /\  ( P ^ M )  e.  RR  /\  0  <  ( P ^ M
) )  ->  (
0  <_  N  <->  0  <_  ( N  /  ( P ^ M ) ) ) )
134, 10, 11, 12syl3anc 1274 . . 3  |-  ( ( N  e.  NN0  /\  M  e.  ( ZZ>= `  N )  /\  P  e.  Prime )  ->  (
0  <_  N  <->  0  <_  ( N  /  ( P ^ M ) ) ) )
142, 13mpbid 147 . 2  |-  ( ( N  e.  NN0  /\  M  e.  ( ZZ>= `  N )  /\  P  e.  Prime )  ->  0  <_  ( N  /  ( P ^ M ) ) )
158nn0red 9571 . . . . . 6  |-  ( ( N  e.  NN0  /\  M  e.  ( ZZ>= `  N )  /\  P  e.  Prime )  ->  M  e.  RR )
16 eluzle 9884 . . . . . . 7  |-  ( M  e.  ( ZZ>= `  N
)  ->  N  <_  M )
17163ad2ant2 1046 . . . . . 6  |-  ( ( N  e.  NN0  /\  M  e.  ( ZZ>= `  N )  /\  P  e.  Prime )  ->  N  <_  M )
18 prmuz2 12853 . . . . . . . 8  |-  ( P  e.  Prime  ->  P  e.  ( ZZ>= `  2 )
)
19183ad2ant3 1047 . . . . . . 7  |-  ( ( N  e.  NN0  /\  M  e.  ( ZZ>= `  N )  /\  P  e.  Prime )  ->  P  e.  ( ZZ>= `  2 )
)
20 bernneq3 11049 . . . . . . 7  |-  ( ( P  e.  ( ZZ>= ` 
2 )  /\  M  e.  NN0 )  ->  M  <  ( P ^ M
) )
2119, 8, 20syl2anc 411 . . . . . 6  |-  ( ( N  e.  NN0  /\  M  e.  ( ZZ>= `  N )  /\  P  e.  Prime )  ->  M  <  ( P ^ M
) )
224, 15, 10, 17, 21lelttrd 8414 . . . . 5  |-  ( ( N  e.  NN0  /\  M  e.  ( ZZ>= `  N )  /\  P  e.  Prime )  ->  N  <  ( P ^ M
) )
239nncnd 9268 . . . . . 6  |-  ( ( N  e.  NN0  /\  M  e.  ( ZZ>= `  N )  /\  P  e.  Prime )  ->  ( P ^ M )  e.  CC )
2423mulridd 8307 . . . . 5  |-  ( ( N  e.  NN0  /\  M  e.  ( ZZ>= `  N )  /\  P  e.  Prime )  ->  (
( P ^ M
)  x.  1 )  =  ( P ^ M ) )
2522, 24breqtrrd 4142 . . . 4  |-  ( ( N  e.  NN0  /\  M  e.  ( ZZ>= `  N )  /\  P  e.  Prime )  ->  N  <  ( ( P ^ M )  x.  1 ) )
26 1red 8305 . . . . 5  |-  ( ( N  e.  NN0  /\  M  e.  ( ZZ>= `  N )  /\  P  e.  Prime )  ->  1  e.  RR )
27 ltdivmul 9167 . . . . 5  |-  ( ( N  e.  RR  /\  1  e.  RR  /\  (
( P ^ M
)  e.  RR  /\  0  <  ( P ^ M ) ) )  ->  ( ( N  /  ( P ^ M ) )  <  1  <->  N  <  ( ( P ^ M )  x.  1 ) ) )
284, 26, 10, 11, 27syl112anc 1278 . . . 4  |-  ( ( N  e.  NN0  /\  M  e.  ( ZZ>= `  N )  /\  P  e.  Prime )  ->  (
( N  /  ( P ^ M ) )  <  1  <->  N  <  ( ( P ^ M
)  x.  1 ) ) )
2925, 28mpbird 167 . . 3  |-  ( ( N  e.  NN0  /\  M  e.  ( ZZ>= `  N )  /\  P  e.  Prime )  ->  ( N  /  ( P ^ M ) )  <  1 )
30 0p1e1 9368 . . 3  |-  ( 0  +  1 )  =  1
3129, 30breqtrrdi 4156 . 2  |-  ( ( N  e.  NN0  /\  M  e.  ( ZZ>= `  N )  /\  P  e.  Prime )  ->  ( N  /  ( P ^ M ) )  < 
( 0  +  1 ) )
32 simp1 1024 . . . . 5  |-  ( ( N  e.  NN0  /\  M  e.  ( ZZ>= `  N )  /\  P  e.  Prime )  ->  N  e.  NN0 )
3332nn0zd 9716 . . . 4  |-  ( ( N  e.  NN0  /\  M  e.  ( ZZ>= `  N )  /\  P  e.  Prime )  ->  N  e.  ZZ )
34 znq 9974 . . . 4  |-  ( ( N  e.  ZZ  /\  ( P ^ M )  e.  NN )  -> 
( N  /  ( P ^ M ) )  e.  QQ )
3533, 9, 34syl2anc 411 . . 3  |-  ( ( N  e.  NN0  /\  M  e.  ( ZZ>= `  N )  /\  P  e.  Prime )  ->  ( N  /  ( P ^ M ) )  e.  QQ )
36 0z 9605 . . 3  |-  0  e.  ZZ
37 flqbi 10674 . . 3  |-  ( ( ( N  /  ( P ^ M ) )  e.  QQ  /\  0  e.  ZZ )  ->  (
( |_ `  ( N  /  ( P ^ M ) ) )  =  0  <->  ( 0  <_  ( N  / 
( P ^ M
) )  /\  ( N  /  ( P ^ M ) )  < 
( 0  +  1 ) ) ) )
3835, 36, 37sylancl 413 . 2  |-  ( ( N  e.  NN0  /\  M  e.  ( ZZ>= `  N )  /\  P  e.  Prime )  ->  (
( |_ `  ( N  /  ( P ^ M ) ) )  =  0  <->  ( 0  <_  ( N  / 
( P ^ M
) )  /\  ( N  /  ( P ^ M ) )  < 
( 0  +  1 ) ) ) )
3914, 31, 38mpbir2and 953 1  |-  ( ( N  e.  NN0  /\  M  e.  ( ZZ>= `  N )  /\  P  e.  Prime )  ->  ( |_ `  ( N  / 
( P ^ M
) ) )  =  0 )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 1005    = wceq 1398    e. wcel 2205   class class class wbr 4114   ` cfv 5357  (class class class)co 6058   RRcr 8142   0cc0 8143   1c1 8144    + caddc 8146    x. cmul 8148    < clt 8324    <_ cle 8325    / cdiv 8963   NNcn 9254   2c2 9305   NN0cn0 9513   ZZcz 9594   ZZ>=cuz 9871   QQcq 9969   |_cfl 10652   ^cexp 10924   Primecprime 12829
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-coll 4230  ax-sep 4233  ax-nul 4241  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-iinf 4715  ax-cnex 8234  ax-resscn 8235  ax-1cn 8236  ax-1re 8237  ax-icn 8238  ax-addcl 8239  ax-addrcl 8240  ax-mulcl 8241  ax-mulrcl 8242  ax-addcom 8243  ax-mulcom 8244  ax-addass 8245  ax-mulass 8246  ax-distr 8247  ax-i2m1 8248  ax-0lt1 8249  ax-1rid 8250  ax-0id 8251  ax-rnegex 8252  ax-precex 8253  ax-cnre 8254  ax-pre-ltirr 8255  ax-pre-ltwlin 8256  ax-pre-lttrn 8257  ax-pre-apti 8258  ax-pre-ltadd 8259  ax-pre-mulgt0 8260  ax-pre-mulext 8261  ax-arch 8262  ax-caucvg 8263
This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-reu 2529  df-rmo 2530  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-if 3625  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-tr 4214  df-id 4419  df-po 4422  df-iso 4423  df-iord 4492  df-on 4494  df-ilim 4495  df-suc 4497  df-iom 4718  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-riota 6011  df-ov 6061  df-oprab 6062  df-mpo 6063  df-1st 6347  df-2nd 6348  df-recs 6549  df-frec 6635  df-1o 6660  df-2o 6661  df-er 6780  df-en 6989  df-pnf 8326  df-mnf 8327  df-xr 8328  df-ltxr 8329  df-le 8330  df-sub 8462  df-neg 8463  df-reap 8866  df-ap 8873  df-div 8964  df-inn 9255  df-2 9313  df-3 9314  df-4 9315  df-n0 9514  df-z 9595  df-uz 9872  df-q 9970  df-rp 10005  df-fl 10654  df-seqfrec 10834  df-exp 10925  df-cj 11552  df-re 11553  df-im 11554  df-rsqrt 11708  df-abs 11709  df-dvds 12499  df-prm 12830
This theorem is referenced by:  pcfac  13073
  Copyright terms: Public domain W3C validator