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

Theorem facndiv 10961
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 9117 . . . 4  |-  ( N  e.  NN  ->  N  e.  RR )
2 recnz 9540 . . . 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 10960 . . . . . . 7  |-  ( ( M  e.  NN0  /\  N  e.  NN  /\  N  <_  M )  ->  (
( ! `  M
)  /  N )  e.  NN )
653expa 1227 . . . . . 6  |-  ( ( ( M  e.  NN0  /\  N  e.  NN )  /\  N  <_  M
)  ->  ( ( ! `  M )  /  N )  e.  NN )
76nnzd 9568 . . . . 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 9487 . . . . 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 10957 . . . . . . . . 9  |-  ( M  e.  NN0  ->  ( ! `
 M )  e.  NN )
1312nncnd 9124 . . . . . . . 8  |-  ( M  e.  NN0  ->  ( ! `
 M )  e.  CC )
14 peano2cn 8281 . . . . . . . 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 9118 . . . . . . 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 528 . . . . . . 7  |-  ( ( ( M  e.  NN0  /\  N  e.  NN )  /\  ( 1  < 
N  /\  N  <_  M ) )  ->  N  e.  NN )
2120nnap0d 9156 . . . . . 6  |-  ( ( ( M  e.  NN0  /\  N  e.  NN )  /\  ( 1  < 
N  /\  N  <_  M ) )  ->  N #  0 )
2216, 17, 19, 21divsubdirapd 8977 . . . . 5  |-  ( ( ( M  e.  NN0  /\  N  e.  NN )  /\  ( 1  < 
N  /\  N  <_  M ) )  ->  (
( ( ( ! `
 M )  +  1 )  -  ( ! `  M )
)  /  N )  =  ( ( ( ( ! `  M
)  +  1 )  /  N )  -  ( ( ! `  M )  /  N
) ) )
23 ax-1cn 8092 . . . . . . . 8  |-  1  e.  CC
24 pncan2 8353 . . . . . . . 8  |-  ( ( ( ! `  M
)  e.  CC  /\  1  e.  CC )  ->  ( ( ( ! `
 M )  +  1 )  -  ( ! `  M )
)  =  1 )
2513, 23, 24sylancl 413 . . . . . . 7  |-  ( M  e.  NN0  ->  ( ( ( ! `  M
)  +  1 )  -  ( ! `  M ) )  =  1 )
2625oveq1d 6016 . . . . . 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 2264 . . . 4  |-  ( ( ( M  e.  NN0  /\  N  e.  NN )  /\  ( 1  < 
N  /\  N  <_  M ) )  ->  (
( ( ( ! `
 M )  +  1 )  /  N
)  -  ( ( ! `  M )  /  N ) )  =  ( 1  /  N ) )
2928eleq1d 2298 . . 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 667 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 1395    e. wcel 2200   class class class wbr 4083   ` cfv 5318  (class class class)co 6001   CCcc 7997   RRcr 7998   1c1 8000    + caddc 8002    < clt 8181    <_ cle 8182    - cmin 8317    / cdiv 8819   NNcn 9110   NN0cn0 9369   ZZcz 9446   !cfa 10947
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4199  ax-sep 4202  ax-nul 4210  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-setind 4629  ax-iinf 4680  ax-cnex 8090  ax-resscn 8091  ax-1cn 8092  ax-1re 8093  ax-icn 8094  ax-addcl 8095  ax-addrcl 8096  ax-mulcl 8097  ax-mulrcl 8098  ax-addcom 8099  ax-mulcom 8100  ax-addass 8101  ax-mulass 8102  ax-distr 8103  ax-i2m1 8104  ax-0lt1 8105  ax-1rid 8106  ax-0id 8107  ax-rnegex 8108  ax-precex 8109  ax-cnre 8110  ax-pre-ltirr 8111  ax-pre-ltwlin 8112  ax-pre-lttrn 8113  ax-pre-apti 8114  ax-pre-ltadd 8115  ax-pre-mulgt0 8116  ax-pre-mulext 8117
This theorem depends on definitions:  df-bi 117  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rmo 2516  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-int 3924  df-iun 3967  df-br 4084  df-opab 4146  df-mpt 4147  df-tr 4183  df-id 4384  df-po 4387  df-iso 4388  df-iord 4457  df-on 4459  df-ilim 4460  df-suc 4462  df-iom 4683  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-res 4731  df-ima 4732  df-iota 5278  df-fun 5320  df-fn 5321  df-f 5322  df-f1 5323  df-fo 5324  df-f1o 5325  df-fv 5326  df-riota 5954  df-ov 6004  df-oprab 6005  df-mpo 6006  df-1st 6286  df-2nd 6287  df-recs 6451  df-frec 6537  df-pnf 8183  df-mnf 8184  df-xr 8185  df-ltxr 8186  df-le 8187  df-sub 8319  df-neg 8320  df-reap 8722  df-ap 8729  df-div 8820  df-inn 9111  df-n0 9370  df-z 9447  df-uz 9723  df-seqfrec 10670  df-fac 10948
This theorem is referenced by:  infpnlem1  12882
  Copyright terms: Public domain W3C validator