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

Theorem facndiv 11064
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 9209 . . . 4  |-  ( N  e.  NN  ->  N  e.  RR )
2 recnz 9634 . . . 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 11063 . . . . . . 7  |-  ( ( M  e.  NN0  /\  N  e.  NN  /\  N  <_  M )  ->  (
( ! `  M
)  /  N )  e.  NN )
653expa 1230 . . . . . 6  |-  ( ( ( M  e.  NN0  /\  N  e.  NN )  /\  N  <_  M
)  ->  ( ( ! `  M )  /  N )  e.  NN )
76nnzd 9662 . . . . 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 9581 . . . . 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 11060 . . . . . . . . 9  |-  ( M  e.  NN0  ->  ( ! `
 M )  e.  NN )
1312nncnd 9216 . . . . . . . 8  |-  ( M  e.  NN0  ->  ( ! `
 M )  e.  CC )
14 peano2cn 8373 . . . . . . . 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 9210 . . . . . . 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 9248 . . . . . 6  |-  ( ( ( M  e.  NN0  /\  N  e.  NN )  /\  ( 1  < 
N  /\  N  <_  M ) )  ->  N #  0 )
2216, 17, 19, 21divsubdirapd 9069 . . . . 5  |-  ( ( ( M  e.  NN0  /\  N  e.  NN )  /\  ( 1  < 
N  /\  N  <_  M ) )  ->  (
( ( ( ! `
 M )  +  1 )  -  ( ! `  M )
)  /  N )  =  ( ( ( ( ! `  M
)  +  1 )  /  N )  -  ( ( ! `  M )  /  N
) ) )
23 ax-1cn 8185 . . . . . . . 8  |-  1  e.  CC
24 pncan2 8445 . . . . . . . 8  |-  ( ( ( ! `  M
)  e.  CC  /\  1  e.  CC )  ->  ( ( ( ! `
 M )  +  1 )  -  ( ! `  M )
)  =  1 )
2513, 23, 24sylancl 413 . . . . . . 7  |-  ( M  e.  NN0  ->  ( ( ( ! `  M
)  +  1 )  -  ( ! `  M ) )  =  1 )
2625oveq1d 6043 . . . . . 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 1398    e. wcel 2202   class class class wbr 4093   ` cfv 5333  (class class class)co 6028   CCcc 8090   RRcr 8091   1c1 8093    + caddc 8095    < clt 8273    <_ cle 8274    - cmin 8409    / cdiv 8911   NNcn 9202   NN0cn0 9461   ZZcz 9540   !cfa 11050
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 2204  ax-14 2205  ax-ext 2213  ax-coll 4209  ax-sep 4212  ax-nul 4220  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-iinf 4692  ax-cnex 8183  ax-resscn 8184  ax-1cn 8185  ax-1re 8186  ax-icn 8187  ax-addcl 8188  ax-addrcl 8189  ax-mulcl 8190  ax-mulrcl 8191  ax-addcom 8192  ax-mulcom 8193  ax-addass 8194  ax-mulass 8195  ax-distr 8196  ax-i2m1 8197  ax-0lt1 8198  ax-1rid 8199  ax-0id 8200  ax-rnegex 8201  ax-precex 8202  ax-cnre 8203  ax-pre-ltirr 8204  ax-pre-ltwlin 8205  ax-pre-lttrn 8206  ax-pre-apti 8207  ax-pre-ltadd 8208  ax-pre-mulgt0 8209  ax-pre-mulext 8210
This theorem depends on definitions:  df-bi 117  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-nel 2499  df-ral 2516  df-rex 2517  df-reu 2518  df-rmo 2519  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-tr 4193  df-id 4396  df-po 4399  df-iso 4400  df-iord 4469  df-on 4471  df-ilim 4472  df-suc 4474  df-iom 4695  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-riota 5981  df-ov 6031  df-oprab 6032  df-mpo 6033  df-1st 6312  df-2nd 6313  df-recs 6514  df-frec 6600  df-pnf 8275  df-mnf 8276  df-xr 8277  df-ltxr 8278  df-le 8279  df-sub 8411  df-neg 8412  df-reap 8814  df-ap 8821  df-div 8912  df-inn 9203  df-n0 9462  df-z 9541  df-uz 9817  df-seqfrec 10773  df-fac 11051
This theorem is referenced by:  infpnlem1  13012
  Copyright terms: Public domain W3C validator