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

Theorem dvdsfac 12366
Description: A positive integer divides any greater factorial. (Contributed by Paul Chapman, 28-Nov-2012.)
Assertion
Ref Expression
dvdsfac  |-  ( ( K  e.  NN  /\  N  e.  ( ZZ>= `  K ) )  ->  K  ||  ( ! `  N ) )

Proof of Theorem dvdsfac
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fveq2 5626 . . . . 5  |-  ( x  =  K  ->  ( ! `  x )  =  ( ! `  K ) )
21breq2d 4094 . . . 4  |-  ( x  =  K  ->  ( K  ||  ( ! `  x )  <->  K  ||  ( ! `  K )
) )
32imbi2d 230 . . 3  |-  ( x  =  K  ->  (
( K  e.  NN  ->  K  ||  ( ! `
 x ) )  <-> 
( K  e.  NN  ->  K  ||  ( ! `
 K ) ) ) )
4 fveq2 5626 . . . . 5  |-  ( x  =  y  ->  ( ! `  x )  =  ( ! `  y ) )
54breq2d 4094 . . . 4  |-  ( x  =  y  ->  ( K  ||  ( ! `  x )  <->  K  ||  ( ! `  y )
) )
65imbi2d 230 . . 3  |-  ( x  =  y  ->  (
( K  e.  NN  ->  K  ||  ( ! `
 x ) )  <-> 
( K  e.  NN  ->  K  ||  ( ! `
 y ) ) ) )
7 fveq2 5626 . . . . 5  |-  ( x  =  ( y  +  1 )  ->  ( ! `  x )  =  ( ! `  ( y  +  1 ) ) )
87breq2d 4094 . . . 4  |-  ( x  =  ( y  +  1 )  ->  ( K  ||  ( ! `  x )  <->  K  ||  ( ! `  ( y  +  1 ) ) ) )
98imbi2d 230 . . 3  |-  ( x  =  ( y  +  1 )  ->  (
( K  e.  NN  ->  K  ||  ( ! `
 x ) )  <-> 
( K  e.  NN  ->  K  ||  ( ! `
 ( y  +  1 ) ) ) ) )
10 fveq2 5626 . . . . 5  |-  ( x  =  N  ->  ( ! `  x )  =  ( ! `  N ) )
1110breq2d 4094 . . . 4  |-  ( x  =  N  ->  ( K  ||  ( ! `  x )  <->  K  ||  ( ! `  N )
) )
1211imbi2d 230 . . 3  |-  ( x  =  N  ->  (
( K  e.  NN  ->  K  ||  ( ! `
 x ) )  <-> 
( K  e.  NN  ->  K  ||  ( ! `
 N ) ) ) )
13 nnm1nn0 9406 . . . . . . . 8  |-  ( K  e.  NN  ->  ( K  -  1 )  e.  NN0 )
14 faccl 10952 . . . . . . . 8  |-  ( ( K  -  1 )  e.  NN0  ->  ( ! `
 ( K  - 
1 ) )  e.  NN )
1513, 14syl 14 . . . . . . 7  |-  ( K  e.  NN  ->  ( ! `  ( K  -  1 ) )  e.  NN )
1615nnzd 9564 . . . . . 6  |-  ( K  e.  NN  ->  ( ! `  ( K  -  1 ) )  e.  ZZ )
17 nnz 9461 . . . . . 6  |-  ( K  e.  NN  ->  K  e.  ZZ )
18 dvdsmul2 12320 . . . . . 6  |-  ( ( ( ! `  ( K  -  1 ) )  e.  ZZ  /\  K  e.  ZZ )  ->  K  ||  ( ( ! `  ( K  -  1 ) )  x.  K ) )
1916, 17, 18syl2anc 411 . . . . 5  |-  ( K  e.  NN  ->  K  ||  ( ( ! `  ( K  -  1
) )  x.  K
) )
20 facnn2 10951 . . . . 5  |-  ( K  e.  NN  ->  ( ! `  K )  =  ( ( ! `
 ( K  - 
1 ) )  x.  K ) )
2119, 20breqtrrd 4110 . . . 4  |-  ( K  e.  NN  ->  K  ||  ( ! `  K
) )
2221a1i 9 . . 3  |-  ( K  e.  ZZ  ->  ( K  e.  NN  ->  K 
||  ( ! `  K ) ) )
2317adantl 277 . . . . . . 7  |-  ( ( y  e.  ( ZZ>= `  K )  /\  K  e.  NN )  ->  K  e.  ZZ )
24 elnnuz 9755 . . . . . . . . . . . 12  |-  ( K  e.  NN  <->  K  e.  ( ZZ>= `  1 )
)
25 uztrn 9735 . . . . . . . . . . . 12  |-  ( ( y  e.  ( ZZ>= `  K )  /\  K  e.  ( ZZ>= `  1 )
)  ->  y  e.  ( ZZ>= `  1 )
)
2624, 25sylan2b 287 . . . . . . . . . . 11  |-  ( ( y  e.  ( ZZ>= `  K )  /\  K  e.  NN )  ->  y  e.  ( ZZ>= `  1 )
)
27 elnnuz 9755 . . . . . . . . . . 11  |-  ( y  e.  NN  <->  y  e.  ( ZZ>= `  1 )
)
2826, 27sylibr 134 . . . . . . . . . 10  |-  ( ( y  e.  ( ZZ>= `  K )  /\  K  e.  NN )  ->  y  e.  NN )
2928nnnn0d 9418 . . . . . . . . 9  |-  ( ( y  e.  ( ZZ>= `  K )  /\  K  e.  NN )  ->  y  e.  NN0 )
30 faccl 10952 . . . . . . . . 9  |-  ( y  e.  NN0  ->  ( ! `
 y )  e.  NN )
3129, 30syl 14 . . . . . . . 8  |-  ( ( y  e.  ( ZZ>= `  K )  /\  K  e.  NN )  ->  ( ! `  y )  e.  NN )
3231nnzd 9564 . . . . . . 7  |-  ( ( y  e.  ( ZZ>= `  K )  /\  K  e.  NN )  ->  ( ! `  y )  e.  ZZ )
3328nnzd 9564 . . . . . . . 8  |-  ( ( y  e.  ( ZZ>= `  K )  /\  K  e.  NN )  ->  y  e.  ZZ )
3433peano2zd 9568 . . . . . . 7  |-  ( ( y  e.  ( ZZ>= `  K )  /\  K  e.  NN )  ->  (
y  +  1 )  e.  ZZ )
35 dvdsmultr1 12337 . . . . . . 7  |-  ( ( K  e.  ZZ  /\  ( ! `  y )  e.  ZZ  /\  (
y  +  1 )  e.  ZZ )  -> 
( K  ||  ( ! `  y )  ->  K  ||  ( ( ! `  y )  x.  ( y  +  1 ) ) ) )
3623, 32, 34, 35syl3anc 1271 . . . . . 6  |-  ( ( y  e.  ( ZZ>= `  K )  /\  K  e.  NN )  ->  ( K  ||  ( ! `  y )  ->  K  ||  ( ( ! `  y )  x.  (
y  +  1 ) ) ) )
37 facp1 10947 . . . . . . . 8  |-  ( y  e.  NN0  ->  ( ! `
 ( y  +  1 ) )  =  ( ( ! `  y )  x.  (
y  +  1 ) ) )
3829, 37syl 14 . . . . . . 7  |-  ( ( y  e.  ( ZZ>= `  K )  /\  K  e.  NN )  ->  ( ! `  ( y  +  1 ) )  =  ( ( ! `
 y )  x.  ( y  +  1 ) ) )
3938breq2d 4094 . . . . . 6  |-  ( ( y  e.  ( ZZ>= `  K )  /\  K  e.  NN )  ->  ( K  ||  ( ! `  ( y  +  1 ) )  <->  K  ||  (
( ! `  y
)  x.  ( y  +  1 ) ) ) )
4036, 39sylibrd 169 . . . . 5  |-  ( ( y  e.  ( ZZ>= `  K )  /\  K  e.  NN )  ->  ( K  ||  ( ! `  y )  ->  K  ||  ( ! `  (
y  +  1 ) ) ) )
4140ex 115 . . . 4  |-  ( y  e.  ( ZZ>= `  K
)  ->  ( K  e.  NN  ->  ( K  ||  ( ! `  y
)  ->  K  ||  ( ! `  ( y  +  1 ) ) ) ) )
4241a2d 26 . . 3  |-  ( y  e.  ( ZZ>= `  K
)  ->  ( ( K  e.  NN  ->  K 
||  ( ! `  y ) )  -> 
( K  e.  NN  ->  K  ||  ( ! `
 ( y  +  1 ) ) ) ) )
433, 6, 9, 12, 22, 42uzind4 9779 . 2  |-  ( N  e.  ( ZZ>= `  K
)  ->  ( K  e.  NN  ->  K  ||  ( ! `  N )
) )
4443impcom 125 1  |-  ( ( K  e.  NN  /\  N  e.  ( ZZ>= `  K ) )  ->  K  ||  ( ! `  N ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1395    e. wcel 2200   class class class wbr 4082   ` cfv 5317  (class class class)co 6000   1c1 7996    + caddc 7998    x. cmul 8000    - cmin 8313   NNcn 9106   NN0cn0 9365   ZZcz 9442   ZZ>=cuz 9718   !cfa 10942    || cdvds 12293
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 4198  ax-sep 4201  ax-nul 4209  ax-pow 4257  ax-pr 4292  ax-un 4523  ax-setind 4628  ax-iinf 4679  ax-cnex 8086  ax-resscn 8087  ax-1cn 8088  ax-1re 8089  ax-icn 8090  ax-addcl 8091  ax-addrcl 8092  ax-mulcl 8093  ax-mulrcl 8094  ax-addcom 8095  ax-mulcom 8096  ax-addass 8097  ax-mulass 8098  ax-distr 8099  ax-i2m1 8100  ax-0lt1 8101  ax-1rid 8102  ax-0id 8103  ax-rnegex 8104  ax-cnre 8106  ax-pre-ltirr 8107  ax-pre-ltwlin 8108  ax-pre-lttrn 8109  ax-pre-ltadd 8111
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-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 3888  df-int 3923  df-iun 3966  df-br 4083  df-opab 4145  df-mpt 4146  df-tr 4182  df-id 4383  df-iord 4456  df-on 4458  df-ilim 4459  df-suc 4461  df-iom 4682  df-xp 4724  df-rel 4725  df-cnv 4726  df-co 4727  df-dm 4728  df-rn 4729  df-res 4730  df-ima 4731  df-iota 5277  df-fun 5319  df-fn 5320  df-f 5321  df-f1 5322  df-fo 5323  df-f1o 5324  df-fv 5325  df-riota 5953  df-ov 6003  df-oprab 6004  df-mpo 6005  df-1st 6284  df-2nd 6285  df-recs 6449  df-frec 6535  df-pnf 8179  df-mnf 8180  df-xr 8181  df-ltxr 8182  df-le 8183  df-sub 8315  df-neg 8316  df-inn 9107  df-n0 9366  df-z 9443  df-uz 9719  df-seqfrec 10665  df-fac 10943  df-dvds 12294
This theorem is referenced by:  prmunb  12880
  Copyright terms: Public domain W3C validator