ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  bccmpl Unicode version
Theorem bccmpl 11175
Description: "Complementing" its second argument doesn't change a binary coefficient. (Contributed by NM, 21-Jun-2005.) (Revised by Mario Carneiro, 5-Mar-2014.)
Assertion
Ref Expression
bccmpl |- ( ( N e. NN0 /\ K e. ZZ ) -> ( N _C K ) = ( N _C ( N - K ) ) )
Proof of Theorem bccmpl
StepHypRef Expression
1 bcval2 11171 . . . 4 |- ( K e. ( 0 ... N ) -> ( N _C K ) = ( ( ! ` N ) / ( ( ! ` ( N - K ) ) x. ( ! ` K ) ) ) )
2 fznn0sub2 10518 . . . . . 6 |- ( K e. ( 0 ... N ) -> ( N - K ) e. ( 0 ... N ) )
3 bcval2 11171 . . . . . 6 |- ( ( N - K ) e. ( 0 ... N ) -> ( N _C ( N - K ) ) = ( ( ! ` N ) / ( ( ! ` ( N - ( N - K ) ) ) x. ( ! ` ( N - K ) ) ) ) )
42, 3syl 14 . . . . 5 |- ( K e. ( 0 ... N ) -> ( N _C ( N - K ) ) = ( ( ! ` N ) / ( ( ! ` ( N - ( N - K ) ) ) x. ( ! ` ( N - K ) ) ) ) )
5 elfznn0 10504 . . . . . . . . . . 11 |- ( ( N - K ) e. ( 0 ... N ) -> ( N - K ) e. NN0 )
65faccld 11157 . . . . . . . . . 10 |- ( ( N - K ) e. ( 0 ... N ) -> ( ! ` ( N - K ) ) e. NN )
76nncnd 9301 . . . . . . . . 9 |- ( ( N - K ) e. ( 0 ... N ) -> ( ! ` ( N - K ) ) e. CC )
82, 7syl 14 . . . . . . . 8 |- ( K e. ( 0 ... N ) -> ( ! ` ( N - K ) ) e. CC )
9 elfznn0 10504 . . . . . . . . . 10 |- ( K e. ( 0 ... N ) -> K e. NN0 )
109faccld 11157 . . . . . . . . 9 |- ( K e. ( 0 ... N ) -> ( ! ` K ) e. NN )
1110nncnd 9301 . . . . . . . 8 |- ( K e. ( 0 ... N ) -> ( ! ` K ) e. CC )
128, 11mulcomd 8341 . . . . . . 7 |- ( K e. ( 0 ... N ) -> ( ( ! ` ( N - K ) ) x. ( ! ` K ) ) = ( ( ! ` K ) x. ( ! ` ( N - K ) ) ) )
13 elfz3nn0 10505 . . . . . . . . . 10 |- ( K e. ( 0 ... N ) -> N e. NN0 )
14 elfzelz 10411 . . . . . . . . . 10 |- ( K e. ( 0 ... N ) -> K e. ZZ )
15 nn0cn 9556 . . . . . . . . . . 11 |- ( N e. NN0 -> N e. CC )
16 zcn 9632 . . . . . . . . . . 11 |- ( K e. ZZ -> K e. CC )
17 nncan 8549 . . . . . . . . . . 11 |- ( ( N e. CC /\ K e. CC ) -> ( N - ( N - K ) ) = K )
1815, 16, 17syl2an 289 . . . . . . . . . 10 |- ( ( N e. NN0 /\ K e. ZZ ) -> ( N - ( N - K ) ) = K )
1913, 14, 18syl2anc 415 . . . . . . . . 9 |- ( K e. ( 0 ... N ) -> ( N - ( N - K ) ) = K )
2019fveq2d 5697 . . . . . . . 8 |- ( K e. ( 0 ... N ) -> ( ! ` ( N - ( N - K ) ) ) = ( ! ` K ) )
2120oveq1d 6094 . . . . . . 7 |- ( K e. ( 0 ... N ) -> ( ( ! ` ( N - ( N - K ) ) ) x. ( ! ` ( N - K ) ) ) = ( ( ! ` K ) x. ( ! ` ( N - K ) ) ) )
2212, 21eqtr4d 2274 . . . . . 6 |- ( K e. ( 0 ... N ) -> ( ( ! ` ( N - K ) ) x. ( ! ` K ) ) = ( ( ! ` ( N - ( N - K ) ) ) x. ( ! ` ( N - K ) ) ) )
2322oveq2d 6095 . . . . 5 |- ( K e. ( 0 ... N ) -> ( ( ! ` N ) / ( ( ! ` ( N - K ) ) x. ( ! ` K ) ) ) = ( ( ! ` N ) / ( ( ! ` ( N - ( N - K ) ) ) x. ( ! ` ( N - K ) ) ) ) )
244, 23eqtr4d 2274 . . . 4 |- ( K e. ( 0 ... N ) -> ( N _C ( N - K ) ) = ( ( ! ` N ) / ( ( ! ` ( N - K ) ) x. ( ! ` K ) ) ) )
251, 24eqtr4d 2274 . . 3 |- ( K e. ( 0 ... N ) -> ( N _C K ) = ( N _C ( N - K ) ) )
2625adantl 277 . 2 |- ( ( ( N e. NN0 /\ K e. ZZ ) /\ K e. ( 0 ... N ) ) -> ( N _C K ) = ( N _C ( N - K ) ) )
27 bcval3 11172 . . . 4 |- ( ( N e. NN0 /\ K e. ZZ /\ -. K e. ( 0 ... N ) ) -> ( N _C K ) = 0 )
28 simp1 1028 . . . . 5 |- ( ( N e. NN0 /\ K e. ZZ /\ -. K e. ( 0 ... N ) ) -> N e. NN0 )
29 nn0z 9647 . . . . . . 7 |- ( N e. NN0 -> N e. ZZ )
30 zsubcl 9668 . . . . . . 7 |- ( ( N e. ZZ /\ K e. ZZ ) -> ( N - K ) e. ZZ )
3129, 30sylan 283 . . . . . 6 |- ( ( N e. NN0 /\ K e. ZZ ) -> ( N - K ) e. ZZ )
32313adant3 1048 . . . . 5 |- ( ( N e. NN0 /\ K e. ZZ /\ -. K e. ( 0 ... N ) ) -> ( N - K ) e. ZZ )
33 fznn0sub2 10518 . . . . . . . 8 |- ( ( N - K ) e. ( 0 ... N ) -> ( N - ( N - K ) ) e. ( 0 ... N ) )
3418eleq1d 2307 . . . . . . . 8 |- ( ( N e. NN0 /\ K e. ZZ ) -> ( ( N - ( N - K ) ) e. ( 0 ... N ) <-> K e. ( 0 ... N ) ) )
3533, 34imbitrid 154 . . . . . . 7 |- ( ( N e. NN0 /\ K e. ZZ ) -> ( ( N - K ) e. ( 0 ... N ) -> K e. ( 0 ... N ) ) )
3635con3d 640 . . . . . 6 |- ( ( N e. NN0 /\ K e. ZZ ) -> ( -. K e. ( 0 ... N ) -> -. ( N - K ) e. ( 0 ... N ) ) )
37363impia 1231 . . . . 5 |- ( ( N e. NN0 /\ K e. ZZ /\ -. K e. ( 0 ... N ) ) -> -. ( N - K ) e. ( 0 ... N ) )
38 bcval3 11172 . . . . 5 |- ( ( N e. NN0 /\ ( N - K ) e. ZZ /\ -. ( N - K ) e. ( 0 ... N ) ) -> ( N _C ( N - K ) ) = 0 )
3928, 32, 37, 38syl3anc 1278 . . . 4 |- ( ( N e. NN0 /\ K e. ZZ /\ -. K e. ( 0 ... N ) ) -> ( N _C ( N - K ) ) = 0 )
4027, 39eqtr4d 2274 . . 3 |- ( ( N e. NN0 /\ K e. ZZ /\ -. K e. ( 0 ... N ) ) -> ( N _C K ) = ( N _C ( N - K ) ) )
41403expa 1234 . 2 |- ( ( ( N e. NN0 /\ K e. ZZ ) /\ -. K e. ( 0 ... N ) ) -> ( N _C K ) = ( N _C ( N - K ) ) )
42 simpr 110 . . . 4 |- ( ( N e. NN0 /\ K e. ZZ ) -> K e. ZZ )
43 0zd 9639 . . . 4 |- ( ( N e. NN0 /\ K e. ZZ ) -> 0 e. ZZ )
4429adantr 276 . . . 4 |- ( ( N e. NN0 /\ K e. ZZ ) -> N e. ZZ )
45 fzdcel 10427 . . . 4 |- ( ( K e. ZZ /\ 0 e. ZZ /\ N e. ZZ ) -> DECID K e. ( 0 ... N ) )
4642, 43, 44, 45syl3anc 1278 . . 3 |- ( ( N e. NN0 /\ K e. ZZ ) -> DECID K e. ( 0 ... N ) )
47 exmiddc 848 . . 3 |- (DECID K e. ( 0 ... N ) -> ( K e. ( 0 ... N ) \/ -. K e. ( 0 ... N ) ) )
4846, 47syl 14 . 2 |- ( ( N e. NN0 /\ K e. ZZ ) -> ( K e. ( 0 ... N ) \/ -. K e. ( 0 ... N ) ) )
4926, 41, 48mpjaodan 810 1 |- ( ( N e. NN0 /\ K e. ZZ ) -> ( N _C K ) = ( N _C ( N - K ) ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3   -> wi 4   /\ wa 104   \/ wo 720  DECID wdc 846   /\ w3a 1009   = wceq 1402   e. wcel 2209   ` cfv 5375  (class class class)co 6079   CCcc 8171   0cc0 8173   x. cmul 8178   - cmin 8491   / cdiv 8996   NN0cn0 9546   ZZcz 9627   ...cfz 10394   !cfa 11146   _C cbc 11168
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 4244  ax-sep 4247  ax-nul 4257  ax-pow 4309  ax-pr 4344  ax-un 4576  ax-setind 4682  ax-iinf 4733  ax-cnex 8264  ax-resscn 8265  ax-1cn 8266  ax-1re 8267  ax-icn 8268  ax-addcl 8269  ax-addrcl 8270  ax-mulcl 8271  ax-mulrcl 8272  ax-addcom 8273  ax-mulcom 8274  ax-addass 8275  ax-mulass 8276  ax-distr 8277  ax-i2m1 8278  ax-0lt1 8279  ax-1rid 8280  ax-0id 8281  ax-rnegex 8282  ax-precex 8283  ax-cnre 8284  ax-pre-ltirr 8285  ax-pre-ltwlin 8286  ax-pre-lttrn 8287  ax-pre-apti 8288  ax-pre-ltadd 8289  ax-pre-mulgt0 8290  ax-pre-mulext 8291
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 3639  df-pw 3690  df-sn 3714  df-pr 3715  df-op 3717  df-uni 3934  df-int 3969  df-iun 4012  df-br 4129  df-opab 4191  df-mpt 4192  df-tr 4228  df-id 4436  df-po 4439  df-iso 4440  df-iord 4509  df-on 4511  df-ilim 4512  df-suc 4514  df-iom 4736  df-xp 4778  df-rel 4779  df-cnv 4780  df-co 4781  df-dm 4782  df-rn 4783  df-res 4784  df-ima 4785  df-iota 5335  df-fun 5377  df-fn 5378  df-f 5379  df-f1 5380  df-fo 5381  df-f1o 5382  df-fv 5383  df-riota 6032  df-ov 6082  df-oprab 6083  df-mpo 6084  df-1st 6368  df-2nd 6369  df-recs 6570  df-frec 6656  df-pnf 8356  df-mnf 8357  df-xr 8358  df-ltxr 8359  df-le 8360  df-sub 8493  df-neg 8494  df-reap 8897  df-ap 8904  df-div 8997  df-inn 9288  df-n0 9547  df-z 9628  df-uz 9905  df-q 10003  df-fz 10395  df-seqfrec 10868  df-fac 11147  df-bc 11169
This theorem is referenced by:  bcnn  11178  bcnp1n  11180  bcp1m1  11186  bcnm1  11194
  Copyright terms: Public domain W3C validator