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

Theorem dvdsfac 12571
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 5675 . . . . 5  |-  ( x  =  K  ->  ( ! `  x )  =  ( ! `  K ) )
21breq2d 4126 . . . 4  |-  ( x  =  K  ->  ( K  ||  ( ! `  x )  <->  K  ||  ( ! `  K )
) )
32imbi2d 230 . . 3  |-  ( x  =  K  ->  (
( K  e.  NN  ->  K  ||  ( ! `
 x ) )  <-> 
( K  e.  NN  ->  K  ||  ( ! `
 K ) ) ) )
4 fveq2 5675 . . . . 5  |-  ( x  =  y  ->  ( ! `  x )  =  ( ! `  y ) )
54breq2d 4126 . . . 4  |-  ( x  =  y  ->  ( K  ||  ( ! `  x )  <->  K  ||  ( ! `  y )
) )
65imbi2d 230 . . 3  |-  ( x  =  y  ->  (
( K  e.  NN  ->  K  ||  ( ! `
 x ) )  <-> 
( K  e.  NN  ->  K  ||  ( ! `
 y ) ) ) )
7 fveq2 5675 . . . . 5  |-  ( x  =  ( y  +  1 )  ->  ( ! `  x )  =  ( ! `  ( y  +  1 ) ) )
87breq2d 4126 . . . 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 5675 . . . . 5  |-  ( x  =  N  ->  ( ! `  x )  =  ( ! `  N ) )
1110breq2d 4126 . . . 4  |-  ( x  =  N  ->  ( K  ||  ( ! `  x )  <->  K  ||  ( ! `  N )
) )
1211imbi2d 230 . . 3  |-  ( x  =  N  ->  (
( K  e.  NN  ->  K  ||  ( ! `
 x ) )  <-> 
( K  e.  NN  ->  K  ||  ( ! `
 N ) ) ) )
13 nnm1nn0 9554 . . . . . . . 8  |-  ( K  e.  NN  ->  ( K  -  1 )  e.  NN0 )
14 faccl 11122 . . . . . . . 8  |-  ( ( K  -  1 )  e.  NN0  ->  ( ! `
 ( K  - 
1 ) )  e.  NN )
1513, 14syl 14 . . . . . . 7  |-  ( K  e.  NN  ->  ( ! `  ( K  -  1 ) )  e.  NN )
1615nnzd 9717 . . . . . 6  |-  ( K  e.  NN  ->  ( ! `  ( K  -  1 ) )  e.  ZZ )
17 nnz 9613 . . . . . 6  |-  ( K  e.  NN  ->  K  e.  ZZ )
18 dvdsmul2 12525 . . . . . 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 11121 . . . . 5  |-  ( K  e.  NN  ->  ( ! `  K )  =  ( ( ! `
 ( K  - 
1 ) )  x.  K ) )
2119, 20breqtrrd 4142 . . . 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 9909 . . . . . . . . . . . 12  |-  ( K  e.  NN  <->  K  e.  ( ZZ>= `  1 )
)
25 uztrn 9889 . . . . . . . . . . . 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 9909 . . . . . . . . . . 11  |-  ( y  e.  NN  <->  y  e.  ( ZZ>= `  1 )
)
2826, 27sylibr 134 . . . . . . . . . 10  |-  ( ( y  e.  ( ZZ>= `  K )  /\  K  e.  NN )  ->  y  e.  NN )
2928nnnn0d 9570 . . . . . . . . 9  |-  ( ( y  e.  ( ZZ>= `  K )  /\  K  e.  NN )  ->  y  e.  NN0 )
30 faccl 11122 . . . . . . . . 9  |-  ( y  e.  NN0  ->  ( ! `
 y )  e.  NN )
3129, 30syl 14 . . . . . . . 8  |-  ( ( y  e.  ( ZZ>= `  K )  /\  K  e.  NN )  ->  ( ! `  y )  e.  NN )
3231nnzd 9717 . . . . . . 7  |-  ( ( y  e.  ( ZZ>= `  K )  /\  K  e.  NN )  ->  ( ! `  y )  e.  ZZ )
3328nnzd 9717 . . . . . . . 8  |-  ( ( y  e.  ( ZZ>= `  K )  /\  K  e.  NN )  ->  y  e.  ZZ )
3433peano2zd 9721 . . . . . . 7  |-  ( ( y  e.  ( ZZ>= `  K )  /\  K  e.  NN )  ->  (
y  +  1 )  e.  ZZ )
35 dvdsmultr1 12542 . . . . . . 7  |-  ( ( K  e.  ZZ  /\  ( ! `  y )  e.  ZZ  /\  (
y  +  1 )  e.  ZZ )  -> 
( K  ||  ( ! `  y )  ->  K  ||  ( ( ! `  y )  x.  ( y  +  1 ) ) ) )
3623, 32, 34, 35syl3anc 1274 . . . . . 6  |-  ( ( y  e.  ( ZZ>= `  K )  /\  K  e.  NN )  ->  ( K  ||  ( ! `  y )  ->  K  ||  ( ( ! `  y )  x.  (
y  +  1 ) ) ) )
37 facp1 11117 . . . . . . . 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 4126 . . . . . 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 9938 . 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 1398    e. wcel 2205   class class class wbr 4114   ` cfv 5357  (class class class)co 6058   1c1 8144    + caddc 8146    x. cmul 8148    - cmin 8460   NNcn 9254   NN0cn0 9513   ZZcz 9594   ZZ>=cuz 9871   !cfa 11112    || cdvds 12498
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 2207  ax-14 2208  ax-ext 2216  ax-coll 4230  ax-sep 4233  ax-nul 4241  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-iinf 4715  ax-cnex 8234  ax-resscn 8235  ax-1cn 8236  ax-1re 8237  ax-icn 8238  ax-addcl 8239  ax-addrcl 8240  ax-mulcl 8241  ax-mulrcl 8242  ax-addcom 8243  ax-mulcom 8244  ax-addass 8245  ax-mulass 8246  ax-distr 8247  ax-i2m1 8248  ax-0lt1 8249  ax-1rid 8250  ax-0id 8251  ax-rnegex 8252  ax-cnre 8254  ax-pre-ltirr 8255  ax-pre-ltwlin 8256  ax-pre-lttrn 8257  ax-pre-ltadd 8259
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 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-tr 4214  df-id 4419  df-iord 4492  df-on 4494  df-ilim 4495  df-suc 4497  df-iom 4718  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-riota 6011  df-ov 6061  df-oprab 6062  df-mpo 6063  df-1st 6347  df-2nd 6348  df-recs 6549  df-frec 6635  df-pnf 8326  df-mnf 8327  df-xr 8328  df-ltxr 8329  df-le 8330  df-sub 8462  df-neg 8463  df-inn 9255  df-n0 9514  df-z 9595  df-uz 9872  df-seqfrec 10834  df-fac 11113  df-dvds 12499
This theorem is referenced by:  prmunb  13085
  Copyright terms: Public domain W3C validator