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

Theorem bcval 11165
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 11166 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 3642 . . . . 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 531 . . . . . . 7  |-  ( ( ( N  e.  NN0  /\  K  e.  ZZ )  /\  K  e.  ( 0 ... N ) )  ->  N  e.  NN0 )
43faccld 11152 . . . . . 6  |-  ( ( ( N  e.  NN0  /\  K  e.  ZZ )  /\  K  e.  ( 0 ... N ) )  ->  ( ! `  N )  e.  NN )
54nnzd 9746 . . . . 5  |-  ( ( ( N  e.  NN0  /\  K  e.  ZZ )  /\  K  e.  ( 0 ... N ) )  ->  ( ! `  N )  e.  ZZ )
6 fznn0sub 10441 . . . . . . . 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 11152 . . . . . 6  |-  ( ( ( N  e.  NN0  /\  K  e.  ZZ )  /\  K  e.  ( 0 ... N ) )  ->  ( ! `  ( N  -  K
) )  e.  NN )
9 elfznn0 10499 . . . . . . . 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 11152 . . . . . 6  |-  ( ( ( N  e.  NN0  /\  K  e.  ZZ )  /\  K  e.  ( 0 ... N ) )  ->  ( ! `  K )  e.  NN )
128, 11nnmulcld 9332 . . . . 5  |-  ( ( ( N  e.  NN0  /\  K  e.  ZZ )  /\  K  e.  ( 0 ... N ) )  ->  ( ( ! `  ( N  -  K ) )  x.  ( ! `  K
) )  e.  NN )
13 znq 10003 . . . . 5  |-  ( ( ( ! `  N
)  e.  ZZ  /\  ( ( ! `  ( N  -  K
) )  x.  ( ! `  K )
)  e.  NN )  ->  ( ( ! `
 N )  / 
( ( ! `  ( N  -  K
) )  x.  ( ! `  K )
) )  e.  QQ )
145, 12, 13syl2anc 415 . . . 4  |-  ( ( ( N  e.  NN0  /\  K  e.  ZZ )  /\  K  e.  ( 0 ... N ) )  ->  ( ( ! `  N )  /  ( ( ! `
 ( N  -  K ) )  x.  ( ! `  K
) ) )  e.  QQ )
152, 14eqeltrd 2315 . . 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 3645 . . . . 5  |-  ( -.  K  e.  ( 0 ... N )  ->  if ( K  e.  ( 0 ... N ) ,  ( ( ! `
 N )  / 
( ( ! `  ( N  -  K
) )  x.  ( ! `  K )
) ) ,  0 )  =  0 )
17 0z 9634 . . . . . 6  |-  0  e.  ZZ
18 zq 10005 . . . . . 6  |-  ( 0  e.  ZZ  ->  0  e.  QQ )
1917, 18ax-mp 5 . . . . 5  |-  0  e.  QQ
2016, 19eqeltrdi 2329 . . . 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 9635 . . . . 5  |-  ( ( N  e.  NN0  /\  K  e.  ZZ )  ->  0  e.  ZZ )
24 simpl 109 . . . . . 6  |-  ( ( N  e.  NN0  /\  K  e.  ZZ )  ->  N  e.  NN0 )
2524nn0zd 9745 . . . . 5  |-  ( ( N  e.  NN0  /\  K  e.  ZZ )  ->  N  e.  ZZ )
26 fzdcel 10423 . . . . 5  |-  ( ( K  e.  ZZ  /\  0  e.  ZZ  /\  N  e.  ZZ )  -> DECID  K  e.  (
0 ... N ) )
2722, 23, 25, 26syl3anc 1278 . . . 4  |-  ( ( N  e.  NN0  /\  K  e.  ZZ )  -> DECID  K  e.  ( 0 ... N ) )
28 exmiddc 848 . . . 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 810 . 2  |-  ( ( N  e.  NN0  /\  K  e.  ZZ )  ->  if ( K  e.  ( 0 ... N
) ,  ( ( ! `  N )  /  ( ( ! `
 ( N  -  K ) )  x.  ( ! `  K
) ) ) ,  0 )  e.  QQ )
31 oveq2 6083 . . . . 5  |-  ( n  =  N  ->  (
0 ... n )  =  ( 0 ... N
) )
3231eleq2d 2308 . . . 4  |-  ( n  =  N  ->  (
k  e.  ( 0 ... n )  <->  k  e.  ( 0 ... N
) ) )
33 fveq2 5690 . . . . 5  |-  ( n  =  N  ->  ( ! `  n )  =  ( ! `  N ) )
34 oveq1 6082 . . . . . . 7  |-  ( n  =  N  ->  (
n  -  k )  =  ( N  -  k ) )
3534fveq2d 5694 . . . . . 6  |-  ( n  =  N  ->  ( ! `  ( n  -  k ) )  =  ( ! `  ( N  -  k
) ) )
3635oveq1d 6090 . . . . 5  |-  ( n  =  N  ->  (
( ! `  (
n  -  k ) )  x.  ( ! `
 k ) )  =  ( ( ! `
 ( N  -  k ) )  x.  ( ! `  k
) ) )
3733, 36oveq12d 6093 . . . 4  |-  ( n  =  N  ->  (
( ! `  n
)  /  ( ( ! `  ( n  -  k ) )  x.  ( ! `  k ) ) )  =  ( ( ! `
 N )  / 
( ( ! `  ( N  -  k
) )  x.  ( ! `  k )
) ) )
3832, 37ifbieq1d 3660 . . 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 2301 . . . 4  |-  ( k  =  K  ->  (
k  e.  ( 0 ... N )  <->  K  e.  ( 0 ... N
) ) )
40 oveq2 6083 . . . . . . 7  |-  ( k  =  K  ->  ( N  -  k )  =  ( N  -  K ) )
4140fveq2d 5694 . . . . . 6  |-  ( k  =  K  ->  ( ! `  ( N  -  k ) )  =  ( ! `  ( N  -  K
) ) )
42 fveq2 5690 . . . . . 6  |-  ( k  =  K  ->  ( ! `  k )  =  ( ! `  K ) )
4341, 42oveq12d 6093 . . . . 5  |-  ( k  =  K  ->  (
( ! `  ( N  -  k )
)  x.  ( ! `
 k ) )  =  ( ( ! `
 ( N  -  K ) )  x.  ( ! `  K
) ) )
4443oveq2d 6091 . . . 4  |-  ( k  =  K  ->  (
( ! `  N
)  /  ( ( ! `  ( N  -  k ) )  x.  ( ! `  k ) ) )  =  ( ( ! `
 N )  / 
( ( ! `  ( N  -  K
) )  x.  ( ! `  K )
) ) )
4539, 44ifbieq1d 3660 . . 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 11164 . . 3  |-  _C  =  ( n  e.  NN0 ,  k  e.  ZZ  |->  if ( k  e.  ( 0 ... n ) ,  ( ( ! `
 n )  / 
( ( ! `  ( n  -  k
) )  x.  ( ! `  k )
) ) ,  0 ) )
4738, 45, 46ovmpog 6213 . 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 1379 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 720  DECID wdc 846    = wceq 1402    e. wcel 2209   ifcif 3635   ` cfv 5372  (class class class)co 6075   0cc0 8169    x. cmul 8174    - cmin 8487    / cdiv 8992   NNcn 9283   NN0cn0 9542   ZZcz 9623   QQcq 9998   ...cfz 10390   !cfa 11141    _C cbc 11163
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-dc 847  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-if 3636  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-q 9999  df-fz 10391  df-seqfrec 10863  df-fac 11142  df-bc 11164
This theorem is referenced by:  bcval2  11166  bcval3  11167
  Copyright terms: Public domain W3C validator