Theorem bcval 11187

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 11188 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.

Step	Hyp	Ref	Expression
1		iftrue 3645	. . . . 5 |- ( K e. ( 0 ... N ) -> if ( K e. ( 0 ... N ) , ( ( ! ` N ) / ( ( ! ` ( N - K ) ) x. ( ! ` K ) ) ) , 0 ) = ( ( ! ` N ) / ( ( ! ` ( N - K ) ) x. ( ! ` K ) ) ) )
2	1	adantl 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 )
4	3	faccld 11174	. . . . . 6 |- ( ( ( N e. NN0 /\ K e. ZZ ) /\ K e. ( 0 ... N ) ) -> ( ! ` N ) e. NN )
5	4	nnzd 9767	. . . . 5 |- ( ( ( N e. NN0 /\ K e. ZZ ) /\ K e. ( 0 ... N ) ) -> ( ! ` N ) e. ZZ )
6		fznn0sub 10463	. . . . . . . 8 |- ( K e. ( 0 ... N ) -> ( N - K ) e. NN0 )
7	6	adantl 277	. . . . . . 7 |- ( ( ( N e. NN0 /\ K e. ZZ ) /\ K e. ( 0 ... N ) ) -> ( N - K ) e. NN0 )
8	7	faccld 11174	. . . . . 6 |- ( ( ( N e. NN0 /\ K e. ZZ ) /\ K e. ( 0 ... N ) ) -> ( ! ` ( N - K ) ) e. NN )
9		elfznn0 10521	. . . . . . . 8 |- ( K e. ( 0 ... N ) -> K e. NN0 )
10	9	adantl 277	. . . . . . 7 |- ( ( ( N e. NN0 /\ K e. ZZ ) /\ K e. ( 0 ... N ) ) -> K e. NN0 )
11	10	faccld 11174	. . . . . 6 |- ( ( ( N e. NN0 /\ K e. ZZ ) /\ K e. ( 0 ... N ) ) -> ( ! ` K ) e. NN )
12	8, 11	nnmulcld 9353	. . . . 5 |- ( ( ( N e. NN0 /\ K e. ZZ ) /\ K e. ( 0 ... N ) ) -> ( ( ! ` ( N - K ) ) x. ( ! ` K ) ) e. NN )
13		znq 10024	. . . . 5 |- ( ( ( ! ` N ) e. ZZ /\ ( ( ! ` ( N - K ) ) x. ( ! ` K ) ) e. NN ) -> ( ( ! ` N ) / ( ( ! ` ( N - K ) ) x. ( ! ` K ) ) ) e. QQ )
14	5, 12, 13	syl2anc 415	. . . 4 |- ( ( ( N e. NN0 /\ K e. ZZ ) /\ K e. ( 0 ... N ) ) -> ( ( ! ` N ) / ( ( ! ` ( N - K ) ) x. ( ! ` K ) ) ) e. QQ )
15	2, 14	eqeltrd 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 3648	. . . . 5 |- ( -. K e. ( 0 ... N ) -> if ( K e. ( 0 ... N ) , ( ( ! ` N ) / ( ( ! ` ( N - K ) ) x. ( ! ` K ) ) ) , 0 ) = 0 )
17		0z 9655	. . . . . 6 |- 0 e. ZZ
18		zq 10026	. . . . . 6 |- ( 0 e. ZZ -> 0 e. QQ )
19	17, 18	ax-mp 5	. . . . 5 |- 0 e. QQ
20	16, 19	eqeltrdi 2329	. . . 4 |- ( -. K e. ( 0 ... N ) -> if ( K e. ( 0 ... N ) , ( ( ! ` N ) / ( ( ! ` ( N - K ) ) x. ( ! ` K ) ) ) , 0 ) e. QQ )
21	20	adantl 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 9656	. . . . 5 |- ( ( N e. NN0 /\ K e. ZZ ) -> 0 e. ZZ )
24		simpl 109	. . . . . 6 |- ( ( N e. NN0 /\ K e. ZZ ) -> N e. NN0 )
25	24	nn0zd 9766	. . . . 5 |- ( ( N e. NN0 /\ K e. ZZ ) -> N e. ZZ )
26		fzdcel 10444	. . . . 5 |- ( ( K e. ZZ /\ 0 e. ZZ /\ N e. ZZ ) -> DECID K e. ( 0 ... N ) )
27	22, 23, 25, 26	syl3anc 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 ) ) )
29	27, 28	syl 14	. . 3 |- ( ( N e. NN0 /\ K e. ZZ ) -> ( K e. ( 0 ... N ) \/ -. K e. ( 0 ... N ) ) )
30	15, 21, 29	mpjaodan 810	. 2 |- ( ( N e. NN0 /\ K e. ZZ ) -> if ( K e. ( 0 ... N ) , ( ( ! ` N ) / ( ( ! ` ( N - K ) ) x. ( ! ` K ) ) ) , 0 ) e. QQ )
31		oveq2 6093	. . . . 5 |- ( n = N -> ( 0 ... n ) = ( 0 ... N ) )
32	31	eleq2d 2308	. . . 4 |- ( n = N -> ( k e. ( 0 ... n ) <-> k e. ( 0 ... N ) ) )
33		fveq2 5695	. . . . 5 |- ( n = N -> ( ! ` n ) = ( ! ` N ) )
34		oveq1 6092	. . . . . . 7 |- ( n = N -> ( n - k ) = ( N - k ) )
35	34	fveq2d 5699	. . . . . 6 |- ( n = N -> ( ! ` ( n - k ) ) = ( ! ` ( N - k ) ) )
36	35	oveq1d 6100	. . . . 5 |- ( n = N -> ( ( ! ` ( n - k ) ) x. ( ! ` k ) ) = ( ( ! ` ( N - k ) ) x. ( ! ` k ) ) )
37	33, 36	oveq12d 6103	. . . 4 |- ( n = N -> ( ( ! ` n ) / ( ( ! ` ( n - k ) ) x. ( ! ` k ) ) ) = ( ( ! ` N ) / ( ( ! ` ( N - k ) ) x. ( ! ` k ) ) ) )
38	32, 37	ifbieq1d 3663	. . 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 6093	. . . . . . 7 |- ( k = K -> ( N - k ) = ( N - K ) )
41	40	fveq2d 5699	. . . . . 6 |- ( k = K -> ( ! ` ( N - k ) ) = ( ! ` ( N - K ) ) )
42		fveq2 5695	. . . . . 6 |- ( k = K -> ( ! ` k ) = ( ! ` K ) )
43	41, 42	oveq12d 6103	. . . . 5 |- ( k = K -> ( ( ! ` ( N - k ) ) x. ( ! ` k ) ) = ( ( ! ` ( N - K ) ) x. ( ! ` K ) ) )
44	43	oveq2d 6101	. . . 4 |- ( k = K -> ( ( ! ` N ) / ( ( ! ` ( N - k ) ) x. ( ! ` k ) ) ) = ( ( ! ` N ) / ( ( ! ` ( N - K ) ) x. ( ! ` K ) ) ) )
45	39, 44	ifbieq1d 3663	. . 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 11186	. . 3 |- _C = ( n e. NN0 , k e. ZZ |-> if ( k e. ( 0 ... n ) , ( ( ! ` n ) / ( ( ! ` ( n - k ) ) x. ( ! ` k ) ) ) , 0 ) )
47	38, 45, 46	ovmpog 6223	. 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 ) )
48	30, 47	mpd3an3 1379	1 |- ( ( N e. NN0 /\ K e. ZZ ) -> ( N _C K ) = if ( K e. ( 0 ... N ) , ( ( ! ` N ) / ( ( ! ` ( N - K ) ) x. ( ! ` K ) ) ) , 0 ) )

This proof depends on syntax axioms:   -. wn 3   -> wi 4   /\ wa 104   \/ wo 720  DECID wdc 846   = wceq 1402   e. wcel 2209   ifcif 3638   ` cfv 5377  (class class class)co 6085   0cc0 8179   x. cmul 8184   - cmin 8497   / cdiv 9002   NNcn 9304   NN0cn0 9563   ZZcz 9644   QQcq 10019   ...cfz 10411   !cfa 11163   _C cbc 11185

This proof depends on 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 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-mulrcl 8278  ax-addcom 8279  ax-mulcom 8280  ax-addass 8281  ax-mulass 8282  ax-distr 8283  ax-i2m1 8284  ax-0lt1 8285  ax-1rid 8286  ax-0id 8287  ax-rnegex 8288  ax-precex 8289  ax-cnre 8290  ax-pre-ltirr 8291  ax-pre-ltwlin 8292  ax-pre-lttrn 8293  ax-pre-apti 8294  ax-pre-ltadd 8295  ax-pre-mulgt0 8296  ax-pre-mulext 8297

This proof 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 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-id 4438  df-po 4441  df-iso 4442  df-iord 4511  df-on 4513  df-ilim 4514  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-recs 6576  df-frec 6662  df-pnf 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-le 8366  df-sub 8499  df-neg 8500  df-reap 8903  df-ap 8910  df-div 9003  df-inn 9305  df-n0 9564  df-z 9645  df-uz 9922  df-q 10020  df-fz 10412  df-seqfrec 10885  df-fac 11164  df-bc 11186

This theorem is used by:  bcval2  11188  bcval3  11189