ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  bccmpl Unicode version
Theorem bccmpl 11060
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 11056 . . . 4 |- ( K e. ( 0 ... N ) -> ( N _C K ) = ( ( ! ` N ) / ( ( ! ` ( N - K ) ) x. ( ! ` K ) ) ) )
2 fznn0sub2 10406 . . . . . 6 |- ( K e. ( 0 ... N ) -> ( N - K ) e. ( 0 ... N ) )
3 bcval2 11056 . . . . . 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 10392 . . . . . . . . . . 11 |- ( ( N - K ) e. ( 0 ... N ) -> ( N - K ) e. NN0 )
65faccld 11042 . . . . . . . . . 10 |- ( ( N - K ) e. ( 0 ... N ) -> ( ! ` ( N - K ) ) e. NN )
76nncnd 9200 . . . . . . . . 9 |- ( ( N - K ) e. ( 0 ... N ) -> ( ! ` ( N - K ) ) e. CC )
82, 7syl 14 . . . . . . . 8 |- ( K e. ( 0 ... N ) -> ( ! ` ( N - K ) ) e. CC )
9 elfznn0 10392 . . . . . . . . . 10 |- ( K e. ( 0 ... N ) -> K e. NN0 )
109faccld 11042 . . . . . . . . 9 |- ( K e. ( 0 ... N ) -> ( ! ` K ) e. NN )
1110nncnd 9200 . . . . . . . 8 |- ( K e. ( 0 ... N ) -> ( ! ` K ) e. CC )
128, 11mulcomd 8244 . . . . . . 7 |- ( K e. ( 0 ... N ) -> ( ( ! ` ( N - K ) ) x. ( ! ` K ) ) = ( ( ! ` K ) x. ( ! ` ( N - K ) ) ) )
13 elfz3nn0 10393 . . . . . . . . . 10 |- ( K e. ( 0 ... N ) -> N e. NN0 )
14 elfzelz 10303 . . . . . . . . . 10 |- ( K e. ( 0 ... N ) -> K e. ZZ )
15 nn0cn 9455 . . . . . . . . . . 11 |- ( N e. NN0 -> N e. CC )
16 zcn 9527 . . . . . . . . . . 11 |- ( K e. ZZ -> K e. CC )
17 nncan 8451 . . . . . . . . . . 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 5652 . . . . . . . 8 |- ( K e. ( 0 ... N ) -> ( ! ` ( N - ( N - K ) ) ) = ( ! ` K ) )
2120oveq1d 6043 . . . . . . 7 |- ( K e. ( 0 ... N ) -> ( ( ! ` ( N - ( N - K ) ) ) x. ( ! ` ( N - K ) ) ) = ( ( ! ` K ) x. ( ! ` ( N - K ) ) ) )
2212, 21eqtr4d 2267 . . . . . 6 |- ( K e. ( 0 ... N ) -> ( ( ! ` ( N - K ) ) x. ( ! ` K ) ) = ( ( ! ` ( N - ( N - K ) ) ) x. ( ! ` ( N - K ) ) ) )
2322oveq2d 6044 . . . . 5 |- ( K e. ( 0 ... N ) -> ( ( ! ` N ) / ( ( ! ` ( N - K ) ) x. ( ! ` K ) ) ) = ( ( ! ` N ) / ( ( ! ` ( N - ( N - K ) ) ) x. ( ! ` ( N - K ) ) ) ) )
244, 23eqtr4d 2267 . . . 4 |- ( K e. ( 0 ... N ) -> ( N _C ( N - K ) ) = ( ( ! ` N ) / ( ( ! ` ( N - K ) ) x. ( ! ` K ) ) ) )
251, 24eqtr4d 2267 . . 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 11057 . . . 4 |- ( ( N e. NN0 /\ K e. ZZ /\ -. K e. ( 0 ... N ) ) -> ( N _C K ) = 0 )
28 simp1 1024 . . . . 5 |- ( ( N e. NN0 /\ K e. ZZ /\ -. K e. ( 0 ... N ) ) -> N e. NN0 )
29 nn0z 9542 . . . . . . 7 |- ( N e. NN0 -> N e. ZZ )
30 zsubcl 9563 . . . . . . 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 1044 . . . . 5 |- ( ( N e. NN0 /\ K e. ZZ /\ -. K e. ( 0 ... N ) ) -> ( N - K ) e. ZZ )
33 fznn0sub2 10406 . . . . . . . 8 |- ( ( N - K ) e. ( 0 ... N ) -> ( N - ( N - K ) ) e. ( 0 ... N ) )
3418eleq1d 2300 . . . . . . . 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 636 . . . . . 6 |- ( ( N e. NN0 /\ K e. ZZ ) -> ( -. K e. ( 0 ... N ) -> -. ( N - K ) e. ( 0 ... N ) ) )
37363impia 1227 . . . . 5 |- ( ( N e. NN0 /\ K e. ZZ /\ -. K e. ( 0 ... N ) ) -> -. ( N - K ) e. ( 0 ... N ) )
38 bcval3 11057 . . . . 5 |- ( ( N e. NN0 /\ ( N - K ) e. ZZ /\ -. ( N - K ) e. ( 0 ... N ) ) -> ( N _C ( N - K ) ) = 0 )
3928, 32, 37, 38syl3anc 1274 . . . 4 |- ( ( N e. NN0 /\ K e. ZZ /\ -. K e. ( 0 ... N ) ) -> ( N _C ( N - K ) ) = 0 )
4027, 39eqtr4d 2267 . . 3 |- ( ( N e. NN0 /\ K e. ZZ /\ -. K e. ( 0 ... N ) ) -> ( N _C K ) = ( N _C ( N - K ) ) )
41403expa 1230 . 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 9534 . . . 4 |- ( ( N e. NN0 /\ K e. ZZ ) -> 0 e. ZZ )
4429adantr 276 . . . 4 |- ( ( N e. NN0 /\ K e. ZZ ) -> N e. ZZ )
45 fzdcel 10318 . . . 4 |- ( ( K e. ZZ /\ 0 e. ZZ /\ N e. ZZ ) -> DECID K e. ( 0 ... N ) )
4642, 43, 44, 45syl3anc 1274 . . 3 |- ( ( N e. NN0 /\ K e. ZZ ) -> DECID K e. ( 0 ... N ) )
47 exmiddc 844 . . 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 806 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 716  DECID wdc 842   /\ w3a 1005   = wceq 1398   e. wcel 2202   ` cfv 5333  (class class class)co 6028   CCcc 8073   0cc0 8075   x. cmul 8080   - cmin 8393   / cdiv 8895   NN0cn0 9445   ZZcz 9522   ...cfz 10286   !cfa 11031   _C cbc 11053
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4209  ax-sep 4212  ax-nul 4220  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-iinf 4692  ax-cnex 8166  ax-resscn 8167  ax-1cn 8168  ax-1re 8169  ax-icn 8170  ax-addcl 8171  ax-addrcl 8172  ax-mulcl 8173  ax-mulrcl 8174  ax-addcom 8175  ax-mulcom 8176  ax-addass 8177  ax-mulass 8178  ax-distr 8179  ax-i2m1 8180  ax-0lt1 8181  ax-1rid 8182  ax-0id 8183  ax-rnegex 8184  ax-precex 8185  ax-cnre 8186  ax-pre-ltirr 8187  ax-pre-ltwlin 8188  ax-pre-lttrn 8189  ax-pre-apti 8190  ax-pre-ltadd 8191  ax-pre-mulgt0 8192  ax-pre-mulext 8193
This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-nel 2499  df-ral 2516  df-rex 2517  df-reu 2518  df-rmo 2519  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-if 3608  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-tr 4193  df-id 4396  df-po 4399  df-iso 4400  df-iord 4469  df-on 4471  df-ilim 4472  df-suc 4474  df-iom 4695  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-riota 5981  df-ov 6031  df-oprab 6032  df-mpo 6033  df-1st 6312  df-2nd 6313  df-recs 6514  df-frec 6600  df-pnf 8259  df-mnf 8260  df-xr 8261  df-ltxr 8262  df-le 8263  df-sub 8395  df-neg 8396  df-reap 8798  df-ap 8805  df-div 8896  df-inn 9187  df-n0 9446  df-z 9523  df-uz 9799  df-q 9897  df-fz 10287  df-seqfrec 10754  df-fac 11032  df-bc 11054
This theorem is referenced by:  bcnn  11063  bcnp1n  11065  bcp1m1  11071  bcnm1  11078
  Copyright terms: Public domain W3C validator