ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  bccmpl Unicode version
Theorem bccmpl 10993
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 10989 . . . 4 |- ( K e. ( 0 ... N ) -> ( N _C K ) = ( ( ! ` N ) / ( ( ! ` ( N - K ) ) x. ( ! ` K ) ) ) )
2 fznn0sub2 10341 . . . . . 6 |- ( K e. ( 0 ... N ) -> ( N - K ) e. ( 0 ... N ) )
3 bcval2 10989 . . . . . 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 10327 . . . . . . . . . . 11 |- ( ( N - K ) e. ( 0 ... N ) -> ( N - K ) e. NN0 )
65faccld 10975 . . . . . . . . . 10 |- ( ( N - K ) e. ( 0 ... N ) -> ( ! ` ( N - K ) ) e. NN )
76nncnd 9140 . . . . . . . . 9 |- ( ( N - K ) e. ( 0 ... N ) -> ( ! ` ( N - K ) ) e. CC )
82, 7syl 14 . . . . . . . 8 |- ( K e. ( 0 ... N ) -> ( ! ` ( N - K ) ) e. CC )
9 elfznn0 10327 . . . . . . . . . 10 |- ( K e. ( 0 ... N ) -> K e. NN0 )
109faccld 10975 . . . . . . . . 9 |- ( K e. ( 0 ... N ) -> ( ! ` K ) e. NN )
1110nncnd 9140 . . . . . . . 8 |- ( K e. ( 0 ... N ) -> ( ! ` K ) e. CC )
128, 11mulcomd 8184 . . . . . . 7 |- ( K e. ( 0 ... N ) -> ( ( ! ` ( N - K ) ) x. ( ! ` K ) ) = ( ( ! ` K ) x. ( ! ` ( N - K ) ) ) )
13 elfz3nn0 10328 . . . . . . . . . 10 |- ( K e. ( 0 ... N ) -> N e. NN0 )
14 elfzelz 10238 . . . . . . . . . 10 |- ( K e. ( 0 ... N ) -> K e. ZZ )
15 nn0cn 9395 . . . . . . . . . . 11 |- ( N e. NN0 -> N e. CC )
16 zcn 9467 . . . . . . . . . . 11 |- ( K e. ZZ -> K e. CC )
17 nncan 8391 . . . . . . . . . . 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 411 . . . . . . . . 9 |- ( K e. ( 0 ... N ) -> ( N - ( N - K ) ) = K )
2019fveq2d 5636 . . . . . . . 8 |- ( K e. ( 0 ... N ) -> ( ! ` ( N - ( N - K ) ) ) = ( ! ` K ) )
2120oveq1d 6025 . . . . . . 7 |- ( K e. ( 0 ... N ) -> ( ( ! ` ( N - ( N - K ) ) ) x. ( ! ` ( N - K ) ) ) = ( ( ! ` K ) x. ( ! ` ( N - K ) ) ) )
2212, 21eqtr4d 2265 . . . . . 6 |- ( K e. ( 0 ... N ) -> ( ( ! ` ( N - K ) ) x. ( ! ` K ) ) = ( ( ! ` ( N - ( N - K ) ) ) x. ( ! ` ( N - K ) ) ) )
2322oveq2d 6026 . . . . 5 |- ( K e. ( 0 ... N ) -> ( ( ! ` N ) / ( ( ! ` ( N - K ) ) x. ( ! ` K ) ) ) = ( ( ! ` N ) / ( ( ! ` ( N - ( N - K ) ) ) x. ( ! ` ( N - K ) ) ) ) )
244, 23eqtr4d 2265 . . . 4 |- ( K e. ( 0 ... N ) -> ( N _C ( N - K ) ) = ( ( ! ` N ) / ( ( ! ` ( N - K ) ) x. ( ! ` K ) ) ) )
251, 24eqtr4d 2265 . . 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 10990 . . . 4 |- ( ( N e. NN0 /\ K e. ZZ /\ -. K e. ( 0 ... N ) ) -> ( N _C K ) = 0 )
28 simp1 1021 . . . . 5 |- ( ( N e. NN0 /\ K e. ZZ /\ -. K e. ( 0 ... N ) ) -> N e. NN0 )
29 nn0z 9482 . . . . . . 7 |- ( N e. NN0 -> N e. ZZ )
30 zsubcl 9503 . . . . . . 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 1041 . . . . 5 |- ( ( N e. NN0 /\ K e. ZZ /\ -. K e. ( 0 ... N ) ) -> ( N - K ) e. ZZ )
33 fznn0sub2 10341 . . . . . . . 8 |- ( ( N - K ) e. ( 0 ... N ) -> ( N - ( N - K ) ) e. ( 0 ... N ) )
3418eleq1d 2298 . . . . . . . 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 634 . . . . . 6 |- ( ( N e. NN0 /\ K e. ZZ ) -> ( -. K e. ( 0 ... N ) -> -. ( N - K ) e. ( 0 ... N ) ) )
37363impia 1224 . . . . 5 |- ( ( N e. NN0 /\ K e. ZZ /\ -. K e. ( 0 ... N ) ) -> -. ( N - K ) e. ( 0 ... N ) )
38 bcval3 10990 . . . . 5 |- ( ( N e. NN0 /\ ( N - K ) e. ZZ /\ -. ( N - K ) e. ( 0 ... N ) ) -> ( N _C ( N - K ) ) = 0 )
3928, 32, 37, 38syl3anc 1271 . . . 4 |- ( ( N e. NN0 /\ K e. ZZ /\ -. K e. ( 0 ... N ) ) -> ( N _C ( N - K ) ) = 0 )
4027, 39eqtr4d 2265 . . 3 |- ( ( N e. NN0 /\ K e. ZZ /\ -. K e. ( 0 ... N ) ) -> ( N _C K ) = ( N _C ( N - K ) ) )
41403expa 1227 . 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 9474 . . . 4 |- ( ( N e. NN0 /\ K e. ZZ ) -> 0 e. ZZ )
4429adantr 276 . . . 4 |- ( ( N e. NN0 /\ K e. ZZ ) -> N e. ZZ )
45 fzdcel 10253 . . . 4 |- ( ( K e. ZZ /\ 0 e. ZZ /\ N e. ZZ ) -> DECID K e. ( 0 ... N ) )
4642, 43, 44, 45syl3anc 1271 . . 3 |- ( ( N e. NN0 /\ K e. ZZ ) -> DECID K e. ( 0 ... N ) )
47 exmiddc 841 . . 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 803 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 713  DECID wdc 839   /\ w3a 1002   = wceq 1395   e. wcel 2200   ` cfv 5321  (class class class)co 6010   CCcc 8013   0cc0 8015   x. cmul 8020   - cmin 8333   / cdiv 8835   NN0cn0 9385   ZZcz 9462   ...cfz 10221   !cfa 10964   _C cbc 10986
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 4199  ax-sep 4202  ax-nul 4210  ax-pow 4259  ax-pr 4294  ax-un 4525  ax-setind 4630  ax-iinf 4681  ax-cnex 8106  ax-resscn 8107  ax-1cn 8108  ax-1re 8109  ax-icn 8110  ax-addcl 8111  ax-addrcl 8112  ax-mulcl 8113  ax-mulrcl 8114  ax-addcom 8115  ax-mulcom 8116  ax-addass 8117  ax-mulass 8118  ax-distr 8119  ax-i2m1 8120  ax-0lt1 8121  ax-1rid 8122  ax-0id 8123  ax-rnegex 8124  ax-precex 8125  ax-cnre 8126  ax-pre-ltirr 8127  ax-pre-ltwlin 8128  ax-pre-lttrn 8129  ax-pre-apti 8130  ax-pre-ltadd 8131  ax-pre-mulgt0 8132  ax-pre-mulext 8133
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 3889  df-int 3924  df-iun 3967  df-br 4084  df-opab 4146  df-mpt 4147  df-tr 4183  df-id 4385  df-po 4388  df-iso 4389  df-iord 4458  df-on 4460  df-ilim 4461  df-suc 4463  df-iom 4684  df-xp 4726  df-rel 4727  df-cnv 4728  df-co 4729  df-dm 4730  df-rn 4731  df-res 4732  df-ima 4733  df-iota 5281  df-fun 5323  df-fn 5324  df-f 5325  df-f1 5326  df-fo 5327  df-f1o 5328  df-fv 5329  df-riota 5963  df-ov 6013  df-oprab 6014  df-mpo 6015  df-1st 6295  df-2nd 6296  df-recs 6462  df-frec 6548  df-pnf 8199  df-mnf 8200  df-xr 8201  df-ltxr 8202  df-le 8203  df-sub 8335  df-neg 8336  df-reap 8738  df-ap 8745  df-div 8836  df-inn 9127  df-n0 9386  df-z 9463  df-uz 9739  df-q 9832  df-fz 10222  df-seqfrec 10687  df-fac 10965  df-bc 10987
This theorem is referenced by:  bcnn  10996  bcnp1n  10998  bcp1m1  11004  bcnm1  11011
  Copyright terms: Public domain W3C validator