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

Theorem bcval 10966
Description: Value of the binomial coefficient,  N choose  K. Definition of binomial coefficient in [Gleason] p. 295. As suggested by Gleason, we define it to be 0 when  0  <_  K  <_  N does not hold. See bcval2 10967 for the value in the standard domain. (Contributed by NM, 10-Jul-2005.) (Revised by Mario Carneiro, 7-Nov-2013.)
Assertion
Ref Expression
bcval  |-  ( ( N  e.  NN0  /\  K  e.  ZZ )  ->  ( N  _C  K
)  =  if ( K  e.  ( 0 ... N ) ,  ( ( ! `  N )  /  (
( ! `  ( N  -  K )
)  x.  ( ! `
 K ) ) ) ,  0 ) )

Proof of Theorem bcval
Dummy variables  k  n are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 iftrue 3607 . . . . 5  |-  ( K  e.  ( 0 ... N )  ->  if ( K  e.  (
0 ... N ) ,  ( ( ! `  N )  /  (
( ! `  ( N  -  K )
)  x.  ( ! `
 K ) ) ) ,  0 )  =  ( ( ! `
 N )  / 
( ( ! `  ( N  -  K
) )  x.  ( ! `  K )
) ) )
21adantl 277 . . . 4  |-  ( ( ( N  e.  NN0  /\  K  e.  ZZ )  /\  K  e.  ( 0 ... N ) )  ->  if ( K  e.  ( 0 ... N ) ,  ( ( ! `  N )  /  (
( ! `  ( N  -  K )
)  x.  ( ! `
 K ) ) ) ,  0 )  =  ( ( ! `
 N )  / 
( ( ! `  ( N  -  K
) )  x.  ( ! `  K )
) ) )
3 simpll 527 . . . . . . 7  |-  ( ( ( N  e.  NN0  /\  K  e.  ZZ )  /\  K  e.  ( 0 ... N ) )  ->  N  e.  NN0 )
43faccld 10953 . . . . . 6  |-  ( ( ( N  e.  NN0  /\  K  e.  ZZ )  /\  K  e.  ( 0 ... N ) )  ->  ( ! `  N )  e.  NN )
54nnzd 9564 . . . . 5  |-  ( ( ( N  e.  NN0  /\  K  e.  ZZ )  /\  K  e.  ( 0 ... N ) )  ->  ( ! `  N )  e.  ZZ )
6 fznn0sub 10249 . . . . . . . 8  |-  ( K  e.  ( 0 ... N )  ->  ( N  -  K )  e.  NN0 )
76adantl 277 . . . . . . 7  |-  ( ( ( N  e.  NN0  /\  K  e.  ZZ )  /\  K  e.  ( 0 ... N ) )  ->  ( N  -  K )  e.  NN0 )
87faccld 10953 . . . . . 6  |-  ( ( ( N  e.  NN0  /\  K  e.  ZZ )  /\  K  e.  ( 0 ... N ) )  ->  ( ! `  ( N  -  K
) )  e.  NN )
9 elfznn0 10306 . . . . . . . 8  |-  ( K  e.  ( 0 ... N )  ->  K  e.  NN0 )
109adantl 277 . . . . . . 7  |-  ( ( ( N  e.  NN0  /\  K  e.  ZZ )  /\  K  e.  ( 0 ... N ) )  ->  K  e.  NN0 )
1110faccld 10953 . . . . . 6  |-  ( ( ( N  e.  NN0  /\  K  e.  ZZ )  /\  K  e.  ( 0 ... N ) )  ->  ( ! `  K )  e.  NN )
128, 11nnmulcld 9155 . . . . 5  |-  ( ( ( N  e.  NN0  /\  K  e.  ZZ )  /\  K  e.  ( 0 ... N ) )  ->  ( ( ! `  ( N  -  K ) )  x.  ( ! `  K
) )  e.  NN )
13 znq 9815 . . . . 5  |-  ( ( ( ! `  N
)  e.  ZZ  /\  ( ( ! `  ( N  -  K
) )  x.  ( ! `  K )
)  e.  NN )  ->  ( ( ! `
 N )  / 
( ( ! `  ( N  -  K
) )  x.  ( ! `  K )
) )  e.  QQ )
145, 12, 13syl2anc 411 . . . 4  |-  ( ( ( N  e.  NN0  /\  K  e.  ZZ )  /\  K  e.  ( 0 ... N ) )  ->  ( ( ! `  N )  /  ( ( ! `
 ( N  -  K ) )  x.  ( ! `  K
) ) )  e.  QQ )
152, 14eqeltrd 2306 . . 3  |-  ( ( ( N  e.  NN0  /\  K  e.  ZZ )  /\  K  e.  ( 0 ... N ) )  ->  if ( K  e.  ( 0 ... N ) ,  ( ( ! `  N )  /  (
( ! `  ( N  -  K )
)  x.  ( ! `
 K ) ) ) ,  0 )  e.  QQ )
16 iffalse 3610 . . . . 5  |-  ( -.  K  e.  ( 0 ... N )  ->  if ( K  e.  ( 0 ... N ) ,  ( ( ! `
 N )  / 
( ( ! `  ( N  -  K
) )  x.  ( ! `  K )
) ) ,  0 )  =  0 )
17 0z 9453 . . . . . 6  |-  0  e.  ZZ
18 zq 9817 . . . . . 6  |-  ( 0  e.  ZZ  ->  0  e.  QQ )
1917, 18ax-mp 5 . . . . 5  |-  0  e.  QQ
2016, 19eqeltrdi 2320 . . . 4  |-  ( -.  K  e.  ( 0 ... N )  ->  if ( K  e.  ( 0 ... N ) ,  ( ( ! `
 N )  / 
( ( ! `  ( N  -  K
) )  x.  ( ! `  K )
) ) ,  0 )  e.  QQ )
2120adantl 277 . . 3  |-  ( ( ( N  e.  NN0  /\  K  e.  ZZ )  /\  -.  K  e.  ( 0 ... N
) )  ->  if ( K  e.  (
0 ... N ) ,  ( ( ! `  N )  /  (
( ! `  ( N  -  K )
)  x.  ( ! `
 K ) ) ) ,  0 )  e.  QQ )
22 simpr 110 . . . . 5  |-  ( ( N  e.  NN0  /\  K  e.  ZZ )  ->  K  e.  ZZ )
23 0zd 9454 . . . . 5  |-  ( ( N  e.  NN0  /\  K  e.  ZZ )  ->  0  e.  ZZ )
24 simpl 109 . . . . . 6  |-  ( ( N  e.  NN0  /\  K  e.  ZZ )  ->  N  e.  NN0 )
2524nn0zd 9563 . . . . 5  |-  ( ( N  e.  NN0  /\  K  e.  ZZ )  ->  N  e.  ZZ )
26 fzdcel 10232 . . . . 5  |-  ( ( K  e.  ZZ  /\  0  e.  ZZ  /\  N  e.  ZZ )  -> DECID  K  e.  (
0 ... N ) )
2722, 23, 25, 26syl3anc 1271 . . . 4  |-  ( ( N  e.  NN0  /\  K  e.  ZZ )  -> DECID  K  e.  ( 0 ... N ) )
28 exmiddc 841 . . . 4  |-  (DECID  K  e.  ( 0 ... N
)  ->  ( K  e.  ( 0 ... N
)  \/  -.  K  e.  ( 0 ... N
) ) )
2927, 28syl 14 . . 3  |-  ( ( N  e.  NN0  /\  K  e.  ZZ )  ->  ( K  e.  ( 0 ... N )  \/  -.  K  e.  ( 0 ... N
) ) )
3015, 21, 29mpjaodan 803 . 2  |-  ( ( N  e.  NN0  /\  K  e.  ZZ )  ->  if ( K  e.  ( 0 ... N
) ,  ( ( ! `  N )  /  ( ( ! `
 ( N  -  K ) )  x.  ( ! `  K
) ) ) ,  0 )  e.  QQ )
31 oveq2 6008 . . . . 5  |-  ( n  =  N  ->  (
0 ... n )  =  ( 0 ... N
) )
3231eleq2d 2299 . . . 4  |-  ( n  =  N  ->  (
k  e.  ( 0 ... n )  <->  k  e.  ( 0 ... N
) ) )
33 fveq2 5626 . . . . 5  |-  ( n  =  N  ->  ( ! `  n )  =  ( ! `  N ) )
34 oveq1 6007 . . . . . . 7  |-  ( n  =  N  ->  (
n  -  k )  =  ( N  -  k ) )
3534fveq2d 5630 . . . . . 6  |-  ( n  =  N  ->  ( ! `  ( n  -  k ) )  =  ( ! `  ( N  -  k
) ) )
3635oveq1d 6015 . . . . 5  |-  ( n  =  N  ->  (
( ! `  (
n  -  k ) )  x.  ( ! `
 k ) )  =  ( ( ! `
 ( N  -  k ) )  x.  ( ! `  k
) ) )
3733, 36oveq12d 6018 . . . 4  |-  ( n  =  N  ->  (
( ! `  n
)  /  ( ( ! `  ( n  -  k ) )  x.  ( ! `  k ) ) )  =  ( ( ! `
 N )  / 
( ( ! `  ( N  -  k
) )  x.  ( ! `  k )
) ) )
3832, 37ifbieq1d 3625 . . 3  |-  ( n  =  N  ->  if ( k  e.  ( 0 ... n ) ,  ( ( ! `
 n )  / 
( ( ! `  ( n  -  k
) )  x.  ( ! `  k )
) ) ,  0 )  =  if ( k  e.  ( 0 ... N ) ,  ( ( ! `  N )  /  (
( ! `  ( N  -  k )
)  x.  ( ! `
 k ) ) ) ,  0 ) )
39 eleq1 2292 . . . 4  |-  ( k  =  K  ->  (
k  e.  ( 0 ... N )  <->  K  e.  ( 0 ... N
) ) )
40 oveq2 6008 . . . . . . 7  |-  ( k  =  K  ->  ( N  -  k )  =  ( N  -  K ) )
4140fveq2d 5630 . . . . . 6  |-  ( k  =  K  ->  ( ! `  ( N  -  k ) )  =  ( ! `  ( N  -  K
) ) )
42 fveq2 5626 . . . . . 6  |-  ( k  =  K  ->  ( ! `  k )  =  ( ! `  K ) )
4341, 42oveq12d 6018 . . . . 5  |-  ( k  =  K  ->  (
( ! `  ( N  -  k )
)  x.  ( ! `
 k ) )  =  ( ( ! `
 ( N  -  K ) )  x.  ( ! `  K
) ) )
4443oveq2d 6016 . . . 4  |-  ( k  =  K  ->  (
( ! `  N
)  /  ( ( ! `  ( N  -  k ) )  x.  ( ! `  k ) ) )  =  ( ( ! `
 N )  / 
( ( ! `  ( N  -  K
) )  x.  ( ! `  K )
) ) )
4539, 44ifbieq1d 3625 . . 3  |-  ( k  =  K  ->  if ( k  e.  ( 0 ... N ) ,  ( ( ! `
 N )  / 
( ( ! `  ( N  -  k
) )  x.  ( ! `  k )
) ) ,  0 )  =  if ( K  e.  ( 0 ... N ) ,  ( ( ! `  N )  /  (
( ! `  ( N  -  K )
)  x.  ( ! `
 K ) ) ) ,  0 ) )
46 df-bc 10965 . . 3  |-  _C  =  ( n  e.  NN0 ,  k  e.  ZZ  |->  if ( k  e.  ( 0 ... n ) ,  ( ( ! `
 n )  / 
( ( ! `  ( n  -  k
) )  x.  ( ! `  k )
) ) ,  0 ) )
4738, 45, 46ovmpog 6138 . 2  |-  ( ( N  e.  NN0  /\  K  e.  ZZ  /\  if ( K  e.  (
0 ... N ) ,  ( ( ! `  N )  /  (
( ! `  ( N  -  K )
)  x.  ( ! `
 K ) ) ) ,  0 )  e.  QQ )  -> 
( N  _C  K
)  =  if ( K  e.  ( 0 ... N ) ,  ( ( ! `  N )  /  (
( ! `  ( N  -  K )
)  x.  ( ! `
 K ) ) ) ,  0 ) )
4830, 47mpd3an3 1372 1  |-  ( ( N  e.  NN0  /\  K  e.  ZZ )  ->  ( N  _C  K
)  =  if ( K  e.  ( 0 ... N ) ,  ( ( ! `  N )  /  (
( ! `  ( N  -  K )
)  x.  ( ! `
 K ) ) ) ,  0 ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    \/ wo 713  DECID wdc 839    = wceq 1395    e. wcel 2200   ifcif 3602   ` cfv 5317  (class class class)co 6000   0cc0 7995    x. cmul 8000    - cmin 8313    / cdiv 8815   NNcn 9106   NN0cn0 9365   ZZcz 9442   QQcq 9810   ...cfz 10200   !cfa 10942    _C cbc 10964
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-precex 8105  ax-cnre 8106  ax-pre-ltirr 8107  ax-pre-ltwlin 8108  ax-pre-lttrn 8109  ax-pre-apti 8110  ax-pre-ltadd 8111  ax-pre-mulgt0 8112  ax-pre-mulext 8113
This theorem depends on definitions:  df-bi 117  df-dc 840  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-if 3603  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-po 4386  df-iso 4387  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-reap 8718  df-ap 8725  df-div 8816  df-inn 9107  df-n0 9366  df-z 9443  df-uz 9719  df-q 9811  df-fz 10201  df-seqfrec 10665  df-fac 10943  df-bc 10965
This theorem is referenced by:  bcval2  10967  bcval3  10968
  Copyright terms: Public domain W3C validator