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

Theorem facndiv 11000
Description: No positive integer (greater than one) divides the factorial plus one of an equal or larger number. (Contributed by NM, 3-May-2005.)
Assertion
Ref Expression
facndiv  |-  ( ( ( M  e.  NN0  /\  N  e.  NN )  /\  ( 1  < 
N  /\  N  <_  M ) )  ->  -.  ( ( ( ! `
 M )  +  1 )  /  N
)  e.  ZZ )

Proof of Theorem facndiv
StepHypRef Expression
1 nnre 9149 . . . 4  |-  ( N  e.  NN  ->  N  e.  RR )
2 recnz 9572 . . . 4  |-  ( ( N  e.  RR  /\  1  <  N )  ->  -.  ( 1  /  N
)  e.  ZZ )
31, 2sylan 283 . . 3  |-  ( ( N  e.  NN  /\  1  <  N )  ->  -.  ( 1  /  N
)  e.  ZZ )
43ad2ant2lr 510 . 2  |-  ( ( ( M  e.  NN0  /\  N  e.  NN )  /\  ( 1  < 
N  /\  N  <_  M ) )  ->  -.  ( 1  /  N
)  e.  ZZ )
5 facdiv 10999 . . . . . . 7  |-  ( ( M  e.  NN0  /\  N  e.  NN  /\  N  <_  M )  ->  (
( ! `  M
)  /  N )  e.  NN )
653expa 1229 . . . . . 6  |-  ( ( ( M  e.  NN0  /\  N  e.  NN )  /\  N  <_  M
)  ->  ( ( ! `  M )  /  N )  e.  NN )
76nnzd 9600 . . . . 5  |-  ( ( ( M  e.  NN0  /\  N  e.  NN )  /\  N  <_  M
)  ->  ( ( ! `  M )  /  N )  e.  ZZ )
87adantrl 478 . . . 4  |-  ( ( ( M  e.  NN0  /\  N  e.  NN )  /\  ( 1  < 
N  /\  N  <_  M ) )  ->  (
( ! `  M
)  /  N )  e.  ZZ )
9 zsubcl 9519 . . . . 5  |-  ( ( ( ( ( ! `
 M )  +  1 )  /  N
)  e.  ZZ  /\  ( ( ! `  M )  /  N
)  e.  ZZ )  ->  ( ( ( ( ! `  M
)  +  1 )  /  N )  -  ( ( ! `  M )  /  N
) )  e.  ZZ )
109ex 115 . . . 4  |-  ( ( ( ( ! `  M )  +  1 )  /  N )  e.  ZZ  ->  (
( ( ! `  M )  /  N
)  e.  ZZ  ->  ( ( ( ( ! `
 M )  +  1 )  /  N
)  -  ( ( ! `  M )  /  N ) )  e.  ZZ ) )
118, 10syl5com 29 . . 3  |-  ( ( ( M  e.  NN0  /\  N  e.  NN )  /\  ( 1  < 
N  /\  N  <_  M ) )  ->  (
( ( ( ! `
 M )  +  1 )  /  N
)  e.  ZZ  ->  ( ( ( ( ! `
 M )  +  1 )  /  N
)  -  ( ( ! `  M )  /  N ) )  e.  ZZ ) )
12 faccl 10996 . . . . . . . . 9  |-  ( M  e.  NN0  ->  ( ! `
 M )  e.  NN )
1312nncnd 9156 . . . . . . . 8  |-  ( M  e.  NN0  ->  ( ! `
 M )  e.  CC )
14 peano2cn 8313 . . . . . . . 8  |-  ( ( ! `  M )  e.  CC  ->  (
( ! `  M
)  +  1 )  e.  CC )
1513, 14syl 14 . . . . . . 7  |-  ( M  e.  NN0  ->  ( ( ! `  M )  +  1 )  e.  CC )
1615ad2antrr 488 . . . . . 6  |-  ( ( ( M  e.  NN0  /\  N  e.  NN )  /\  ( 1  < 
N  /\  N  <_  M ) )  ->  (
( ! `  M
)  +  1 )  e.  CC )
1713ad2antrr 488 . . . . . 6  |-  ( ( ( M  e.  NN0  /\  N  e.  NN )  /\  ( 1  < 
N  /\  N  <_  M ) )  ->  ( ! `  M )  e.  CC )
18 nncn 9150 . . . . . . 7  |-  ( N  e.  NN  ->  N  e.  CC )
1918ad2antlr 489 . . . . . 6  |-  ( ( ( M  e.  NN0  /\  N  e.  NN )  /\  ( 1  < 
N  /\  N  <_  M ) )  ->  N  e.  CC )
20 simplr 529 . . . . . . 7  |-  ( ( ( M  e.  NN0  /\  N  e.  NN )  /\  ( 1  < 
N  /\  N  <_  M ) )  ->  N  e.  NN )
2120nnap0d 9188 . . . . . 6  |-  ( ( ( M  e.  NN0  /\  N  e.  NN )  /\  ( 1  < 
N  /\  N  <_  M ) )  ->  N #  0 )
2216, 17, 19, 21divsubdirapd 9009 . . . . 5  |-  ( ( ( M  e.  NN0  /\  N  e.  NN )  /\  ( 1  < 
N  /\  N  <_  M ) )  ->  (
( ( ( ! `
 M )  +  1 )  -  ( ! `  M )
)  /  N )  =  ( ( ( ( ! `  M
)  +  1 )  /  N )  -  ( ( ! `  M )  /  N
) ) )
23 ax-1cn 8124 . . . . . . . 8  |-  1  e.  CC
24 pncan2 8385 . . . . . . . 8  |-  ( ( ( ! `  M
)  e.  CC  /\  1  e.  CC )  ->  ( ( ( ! `
 M )  +  1 )  -  ( ! `  M )
)  =  1 )
2513, 23, 24sylancl 413 . . . . . . 7  |-  ( M  e.  NN0  ->  ( ( ( ! `  M
)  +  1 )  -  ( ! `  M ) )  =  1 )
2625oveq1d 6032 . . . . . 6  |-  ( M  e.  NN0  ->  ( ( ( ( ! `  M )  +  1 )  -  ( ! `
 M ) )  /  N )  =  ( 1  /  N
) )
2726ad2antrr 488 . . . . 5  |-  ( ( ( M  e.  NN0  /\  N  e.  NN )  /\  ( 1  < 
N  /\  N  <_  M ) )  ->  (
( ( ( ! `
 M )  +  1 )  -  ( ! `  M )
)  /  N )  =  ( 1  /  N ) )
2822, 27eqtr3d 2266 . . . 4  |-  ( ( ( M  e.  NN0  /\  N  e.  NN )  /\  ( 1  < 
N  /\  N  <_  M ) )  ->  (
( ( ( ! `
 M )  +  1 )  /  N
)  -  ( ( ! `  M )  /  N ) )  =  ( 1  /  N ) )
2928eleq1d 2300 . . 3  |-  ( ( ( M  e.  NN0  /\  N  e.  NN )  /\  ( 1  < 
N  /\  N  <_  M ) )  ->  (
( ( ( ( ! `  M )  +  1 )  /  N )  -  (
( ! `  M
)  /  N ) )  e.  ZZ  <->  ( 1  /  N )  e.  ZZ ) )
3011, 29sylibd 149 . 2  |-  ( ( ( M  e.  NN0  /\  N  e.  NN )  /\  ( 1  < 
N  /\  N  <_  M ) )  ->  (
( ( ( ! `
 M )  +  1 )  /  N
)  e.  ZZ  ->  ( 1  /  N )  e.  ZZ ) )
314, 30mtod 669 1  |-  ( ( ( M  e.  NN0  /\  N  e.  NN )  /\  ( 1  < 
N  /\  N  <_  M ) )  ->  -.  ( ( ( ! `
 M )  +  1 )  /  N
)  e.  ZZ )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    = wceq 1397    e. wcel 2202   class class class wbr 4088   ` cfv 5326  (class class class)co 6017   CCcc 8029   RRcr 8030   1c1 8032    + caddc 8034    < clt 8213    <_ cle 8214    - cmin 8349    / cdiv 8851   NNcn 9142   NN0cn0 9401   ZZcz 9478   !cfa 10986
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-nul 4215  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-iinf 4686  ax-cnex 8122  ax-resscn 8123  ax-1cn 8124  ax-1re 8125  ax-icn 8126  ax-addcl 8127  ax-addrcl 8128  ax-mulcl 8129  ax-mulrcl 8130  ax-addcom 8131  ax-mulcom 8132  ax-addass 8133  ax-mulass 8134  ax-distr 8135  ax-i2m1 8136  ax-0lt1 8137  ax-1rid 8138  ax-0id 8139  ax-rnegex 8140  ax-precex 8141  ax-cnre 8142  ax-pre-ltirr 8143  ax-pre-ltwlin 8144  ax-pre-lttrn 8145  ax-pre-apti 8146  ax-pre-ltadd 8147  ax-pre-mulgt0 8148  ax-pre-mulext 8149
This theorem depends on definitions:  df-bi 117  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-reu 2517  df-rmo 2518  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-tr 4188  df-id 4390  df-po 4393  df-iso 4394  df-iord 4463  df-on 4465  df-ilim 4466  df-suc 4468  df-iom 4689  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-riota 5970  df-ov 6020  df-oprab 6021  df-mpo 6022  df-1st 6302  df-2nd 6303  df-recs 6470  df-frec 6556  df-pnf 8215  df-mnf 8216  df-xr 8217  df-ltxr 8218  df-le 8219  df-sub 8351  df-neg 8352  df-reap 8754  df-ap 8761  df-div 8852  df-inn 9143  df-n0 9402  df-z 9479  df-uz 9755  df-seqfrec 10709  df-fac 10987
This theorem is referenced by:  infpnlem1  12931
  Copyright terms: Public domain W3C validator