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

Theorem facndiv 11155
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 9290 . . . 4  |-  ( N  e.  NN  ->  N  e.  RR )
2 recnz 9718 . . . 4  |-  ( ( N  e.  RR  /\  1  <  N )  ->  -.  ( 1  /  N
)  e.  ZZ )
31, 2sylan 283 . . 3  |-  ( ( N  e.  NN  /\  1  <  N )  ->  -.  ( 1  /  N
)  e.  ZZ )
43ad2ant2lr 514 . 2  |-  ( ( ( M  e.  NN0  /\  N  e.  NN )  /\  ( 1  < 
N  /\  N  <_  M ) )  ->  -.  ( 1  /  N
)  e.  ZZ )
5 facdiv 11154 . . . . . . 7  |-  ( ( M  e.  NN0  /\  N  e.  NN  /\  N  <_  M )  ->  (
( ! `  M
)  /  N )  e.  NN )
653expa 1234 . . . . . 6  |-  ( ( ( M  e.  NN0  /\  N  e.  NN )  /\  N  <_  M
)  ->  ( ( ! `  M )  /  N )  e.  NN )
76nnzd 9746 . . . . 5  |-  ( ( ( M  e.  NN0  /\  N  e.  NN )  /\  N  <_  M
)  ->  ( ( ! `  M )  /  N )  e.  ZZ )
87adantrl 482 . . . 4  |-  ( ( ( M  e.  NN0  /\  N  e.  NN )  /\  ( 1  < 
N  /\  N  <_  M ) )  ->  (
( ! `  M
)  /  N )  e.  ZZ )
9 zsubcl 9664 . . . . 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 11151 . . . . . . . . 9  |-  ( M  e.  NN0  ->  ( ! `
 M )  e.  NN )
1312nncnd 9297 . . . . . . . 8  |-  ( M  e.  NN0  ->  ( ! `
 M )  e.  CC )
14 peano2cn 8451 . . . . . . . 8  |-  ( ( ! `  M )  e.  CC  ->  (
( ! `  M
)  +  1 )  e.  CC )
1513, 14syl 14 . . . . . . 7  |-  ( M  e.  NN0  ->  ( ( ! `  M )  +  1 )  e.  CC )
1615ad2antrr 492 . . . . . 6  |-  ( ( ( M  e.  NN0  /\  N  e.  NN )  /\  ( 1  < 
N  /\  N  <_  M ) )  ->  (
( ! `  M
)  +  1 )  e.  CC )
1713ad2antrr 492 . . . . . 6  |-  ( ( ( M  e.  NN0  /\  N  e.  NN )  /\  ( 1  < 
N  /\  N  <_  M ) )  ->  ( ! `  M )  e.  CC )
18 nncn 9291 . . . . . . 7  |-  ( N  e.  NN  ->  N  e.  CC )
1918ad2antlr 493 . . . . . 6  |-  ( ( ( M  e.  NN0  /\  N  e.  NN )  /\  ( 1  < 
N  /\  N  <_  M ) )  ->  N  e.  CC )
20 simplr 533 . . . . . . 7  |-  ( ( ( M  e.  NN0  /\  N  e.  NN )  /\  ( 1  < 
N  /\  N  <_  M ) )  ->  N  e.  NN )
2120nnap0d 9329 . . . . . 6  |-  ( ( ( M  e.  NN0  /\  N  e.  NN )  /\  ( 1  < 
N  /\  N  <_  M ) )  ->  N #  0 )
2216, 17, 19, 21divsubdirapd 9150 . . . . 5  |-  ( ( ( M  e.  NN0  /\  N  e.  NN )  /\  ( 1  < 
N  /\  N  <_  M ) )  ->  (
( ( ( ! `
 M )  +  1 )  -  ( ! `  M )
)  /  N )  =  ( ( ( ( ! `  M
)  +  1 )  /  N )  -  ( ( ! `  M )  /  N
) ) )
23 ax-1cn 8262 . . . . . . . 8  |-  1  e.  CC
24 pncan2 8523 . . . . . . . 8  |-  ( ( ( ! `  M
)  e.  CC  /\  1  e.  CC )  ->  ( ( ( ! `
 M )  +  1 )  -  ( ! `  M )
)  =  1 )
2513, 23, 24sylancl 417 . . . . . . 7  |-  ( M  e.  NN0  ->  ( ( ( ! `  M
)  +  1 )  -  ( ! `  M ) )  =  1 )
2625oveq1d 6090 . . . . . 6  |-  ( M  e.  NN0  ->  ( ( ( ( ! `  M )  +  1 )  -  ( ! `
 M ) )  /  N )  =  ( 1  /  N
) )
2726ad2antrr 492 . . . . 5  |-  ( ( ( M  e.  NN0  /\  N  e.  NN )  /\  ( 1  < 
N  /\  N  <_  M ) )  ->  (
( ( ( ! `
 M )  +  1 )  -  ( ! `  M )
)  /  N )  =  ( 1  /  N ) )
2822, 27eqtr3d 2273 . . . 4  |-  ( ( ( M  e.  NN0  /\  N  e.  NN )  /\  ( 1  < 
N  /\  N  <_  M ) )  ->  (
( ( ( ! `
 M )  +  1 )  /  N
)  -  ( ( ! `  M )  /  N ) )  =  ( 1  /  N ) )
2928eleq1d 2307 . . 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 673 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 1402    e. wcel 2209   class class class wbr 4125   ` cfv 5372  (class class class)co 6075   CCcc 8167   RRcr 8168   1c1 8170    + caddc 8172    < clt 8350    <_ cle 8351    - cmin 8487    / cdiv 8992   NNcn 9283   NN0cn0 9542   ZZcz 9623   !cfa 11141
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 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4241  ax-sep 4244  ax-nul 4254  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-iinf 4730  ax-cnex 8260  ax-resscn 8261  ax-1cn 8262  ax-1re 8263  ax-icn 8264  ax-addcl 8265  ax-addrcl 8266  ax-mulcl 8267  ax-mulrcl 8268  ax-addcom 8269  ax-mulcom 8270  ax-addass 8271  ax-mulass 8272  ax-distr 8273  ax-i2m1 8274  ax-0lt1 8275  ax-1rid 8276  ax-0id 8277  ax-rnegex 8278  ax-precex 8279  ax-cnre 8280  ax-pre-ltirr 8281  ax-pre-ltwlin 8282  ax-pre-lttrn 8283  ax-pre-apti 8284  ax-pre-ltadd 8285  ax-pre-mulgt0 8286  ax-pre-mulext 8287
This theorem depends on definitions:  df-bi 117  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-iun 4009  df-br 4126  df-opab 4188  df-mpt 4189  df-tr 4225  df-id 4433  df-po 4436  df-iso 4437  df-iord 4506  df-on 4508  df-ilim 4509  df-suc 4511  df-iom 4733  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-f1 5377  df-fo 5378  df-f1o 5379  df-fv 5380  df-riota 6028  df-ov 6078  df-oprab 6079  df-mpo 6080  df-1st 6364  df-2nd 6365  df-recs 6566  df-frec 6652  df-pnf 8352  df-mnf 8353  df-xr 8354  df-ltxr 8355  df-le 8356  df-sub 8489  df-neg 8490  df-reap 8893  df-ap 8900  df-div 8993  df-inn 9284  df-n0 9543  df-z 9624  df-uz 9901  df-seqfrec 10863  df-fac 11142
This theorem is referenced by:  infpnlem1  13116
  Copyright terms: Public domain W3C validator