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

Theorem bcp1n 10908
Description: The proportion of one binomial coefficient to another with  N increased by 1. (Contributed by Mario Carneiro, 10-Mar-2014.)
Assertion
Ref Expression
bcp1n  |-  ( K  e.  ( 0 ... N )  ->  (
( N  +  1 )  _C  K )  =  ( ( N  _C  K )  x.  ( ( N  + 
1 )  /  (
( N  +  1 )  -  K ) ) ) )

Proof of Theorem bcp1n
StepHypRef Expression
1 elfz3nn0 10239 . . . . 5  |-  ( K  e.  ( 0 ... N )  ->  N  e.  NN0 )
2 facp1 10877 . . . . 5  |-  ( N  e.  NN0  ->  ( ! `
 ( N  + 
1 ) )  =  ( ( ! `  N )  x.  ( N  +  1 ) ) )
31, 2syl 14 . . . 4  |-  ( K  e.  ( 0 ... N )  ->  ( ! `  ( N  +  1 ) )  =  ( ( ! `
 N )  x.  ( N  +  1 ) ) )
4 fznn0sub 10181 . . . . . . . 8  |-  ( K  e.  ( 0 ... N )  ->  ( N  -  K )  e.  NN0 )
5 facp1 10877 . . . . . . . 8  |-  ( ( N  -  K )  e.  NN0  ->  ( ! `
 ( ( N  -  K )  +  1 ) )  =  ( ( ! `  ( N  -  K
) )  x.  (
( N  -  K
)  +  1 ) ) )
64, 5syl 14 . . . . . . 7  |-  ( K  e.  ( 0 ... N )  ->  ( ! `  ( ( N  -  K )  +  1 ) )  =  ( ( ! `
 ( N  -  K ) )  x.  ( ( N  -  K )  +  1 ) ) )
71nn0cnd 9352 . . . . . . . . 9  |-  ( K  e.  ( 0 ... N )  ->  N  e.  CC )
8 1cnd 8090 . . . . . . . . 9  |-  ( K  e.  ( 0 ... N )  ->  1  e.  CC )
9 elfznn0 10238 . . . . . . . . . 10  |-  ( K  e.  ( 0 ... N )  ->  K  e.  NN0 )
109nn0cnd 9352 . . . . . . . . 9  |-  ( K  e.  ( 0 ... N )  ->  K  e.  CC )
117, 8, 10addsubd 8406 . . . . . . . 8  |-  ( K  e.  ( 0 ... N )  ->  (
( N  +  1 )  -  K )  =  ( ( N  -  K )  +  1 ) )
1211fveq2d 5582 . . . . . . 7  |-  ( K  e.  ( 0 ... N )  ->  ( ! `  ( ( N  +  1 )  -  K ) )  =  ( ! `  ( ( N  -  K )  +  1 ) ) )
1311oveq2d 5962 . . . . . . 7  |-  ( K  e.  ( 0 ... N )  ->  (
( ! `  ( N  -  K )
)  x.  ( ( N  +  1 )  -  K ) )  =  ( ( ! `
 ( N  -  K ) )  x.  ( ( N  -  K )  +  1 ) ) )
146, 12, 133eqtr4d 2248 . . . . . 6  |-  ( K  e.  ( 0 ... N )  ->  ( ! `  ( ( N  +  1 )  -  K ) )  =  ( ( ! `
 ( N  -  K ) )  x.  ( ( N  + 
1 )  -  K
) ) )
1514oveq1d 5961 . . . . 5  |-  ( K  e.  ( 0 ... N )  ->  (
( ! `  (
( N  +  1 )  -  K ) )  x.  ( ! `
 K ) )  =  ( ( ( ! `  ( N  -  K ) )  x.  ( ( N  +  1 )  -  K ) )  x.  ( ! `  K
) ) )
164faccld 10883 . . . . . . 7  |-  ( K  e.  ( 0 ... N )  ->  ( ! `  ( N  -  K ) )  e.  NN )
1716nncnd 9052 . . . . . 6  |-  ( K  e.  ( 0 ... N )  ->  ( ! `  ( N  -  K ) )  e.  CC )
18 nn0p1nn 9336 . . . . . . . . 9  |-  ( ( N  -  K )  e.  NN0  ->  ( ( N  -  K )  +  1 )  e.  NN )
194, 18syl 14 . . . . . . . 8  |-  ( K  e.  ( 0 ... N )  ->  (
( N  -  K
)  +  1 )  e.  NN )
2011, 19eqeltrd 2282 . . . . . . 7  |-  ( K  e.  ( 0 ... N )  ->  (
( N  +  1 )  -  K )  e.  NN )
2120nncnd 9052 . . . . . 6  |-  ( K  e.  ( 0 ... N )  ->  (
( N  +  1 )  -  K )  e.  CC )
229faccld 10883 . . . . . . 7  |-  ( K  e.  ( 0 ... N )  ->  ( ! `  K )  e.  NN )
2322nncnd 9052 . . . . . 6  |-  ( K  e.  ( 0 ... N )  ->  ( ! `  K )  e.  CC )
2417, 21, 23mul32d 8227 . . . . 5  |-  ( K  e.  ( 0 ... N )  ->  (
( ( ! `  ( N  -  K
) )  x.  (
( N  +  1 )  -  K ) )  x.  ( ! `
 K ) )  =  ( ( ( ! `  ( N  -  K ) )  x.  ( ! `  K ) )  x.  ( ( N  + 
1 )  -  K
) ) )
2515, 24eqtrd 2238 . . . 4  |-  ( K  e.  ( 0 ... N )  ->  (
( ! `  (
( N  +  1 )  -  K ) )  x.  ( ! `
 K ) )  =  ( ( ( ! `  ( N  -  K ) )  x.  ( ! `  K ) )  x.  ( ( N  + 
1 )  -  K
) ) )
263, 25oveq12d 5964 . . 3  |-  ( K  e.  ( 0 ... N )  ->  (
( ! `  ( N  +  1 ) )  /  ( ( ! `  ( ( N  +  1 )  -  K ) )  x.  ( ! `  K ) ) )  =  ( ( ( ! `  N )  x.  ( N  + 
1 ) )  / 
( ( ( ! `
 ( N  -  K ) )  x.  ( ! `  K
) )  x.  (
( N  +  1 )  -  K ) ) ) )
271faccld 10883 . . . . 5  |-  ( K  e.  ( 0 ... N )  ->  ( ! `  N )  e.  NN )
2827nncnd 9052 . . . 4  |-  ( K  e.  ( 0 ... N )  ->  ( ! `  N )  e.  CC )
2916, 22nnmulcld 9087 . . . . 5  |-  ( K  e.  ( 0 ... N )  ->  (
( ! `  ( N  -  K )
)  x.  ( ! `
 K ) )  e.  NN )
3029nncnd 9052 . . . 4  |-  ( K  e.  ( 0 ... N )  ->  (
( ! `  ( N  -  K )
)  x.  ( ! `
 K ) )  e.  CC )
31 nn0p1nn 9336 . . . . . 6  |-  ( N  e.  NN0  ->  ( N  +  1 )  e.  NN )
321, 31syl 14 . . . . 5  |-  ( K  e.  ( 0 ... N )  ->  ( N  +  1 )  e.  NN )
3332nncnd 9052 . . . 4  |-  ( K  e.  ( 0 ... N )  ->  ( N  +  1 )  e.  CC )
3429nnap0d 9084 . . . 4  |-  ( K  e.  ( 0 ... N )  ->  (
( ! `  ( N  -  K )
)  x.  ( ! `
 K ) ) #  0 )
3520nnap0d 9084 . . . 4  |-  ( K  e.  ( 0 ... N )  ->  (
( N  +  1 )  -  K ) #  0 )
3628, 30, 33, 21, 34, 35divmuldivapd 8907 . . 3  |-  ( K  e.  ( 0 ... N )  ->  (
( ( ! `  N )  /  (
( ! `  ( N  -  K )
)  x.  ( ! `
 K ) ) )  x.  ( ( N  +  1 )  /  ( ( N  +  1 )  -  K ) ) )  =  ( ( ( ! `  N )  x.  ( N  + 
1 ) )  / 
( ( ( ! `
 ( N  -  K ) )  x.  ( ! `  K
) )  x.  (
( N  +  1 )  -  K ) ) ) )
3726, 36eqtr4d 2241 . 2  |-  ( K  e.  ( 0 ... N )  ->  (
( ! `  ( N  +  1 ) )  /  ( ( ! `  ( ( N  +  1 )  -  K ) )  x.  ( ! `  K ) ) )  =  ( ( ( ! `  N )  /  ( ( ! `
 ( N  -  K ) )  x.  ( ! `  K
) ) )  x.  ( ( N  + 
1 )  /  (
( N  +  1 )  -  K ) ) ) )
38 fzelp1 10198 . . 3  |-  ( K  e.  ( 0 ... N )  ->  K  e.  ( 0 ... ( N  +  1 ) ) )
39 bcval2 10897 . . 3  |-  ( K  e.  ( 0 ... ( N  +  1 ) )  ->  (
( N  +  1 )  _C  K )  =  ( ( ! `
 ( N  + 
1 ) )  / 
( ( ! `  ( ( N  + 
1 )  -  K
) )  x.  ( ! `  K )
) ) )
4038, 39syl 14 . 2  |-  ( K  e.  ( 0 ... N )  ->  (
( N  +  1 )  _C  K )  =  ( ( ! `
 ( N  + 
1 ) )  / 
( ( ! `  ( ( N  + 
1 )  -  K
) )  x.  ( ! `  K )
) ) )
41 bcval2 10897 . . 3  |-  ( K  e.  ( 0 ... N )  ->  ( N  _C  K )  =  ( ( ! `  N )  /  (
( ! `  ( N  -  K )
)  x.  ( ! `
 K ) ) ) )
4241oveq1d 5961 . 2  |-  ( K  e.  ( 0 ... N )  ->  (
( N  _C  K
)  x.  ( ( N  +  1 )  /  ( ( N  +  1 )  -  K ) ) )  =  ( ( ( ! `  N )  /  ( ( ! `
 ( N  -  K ) )  x.  ( ! `  K
) ) )  x.  ( ( N  + 
1 )  /  (
( N  +  1 )  -  K ) ) ) )
4337, 40, 423eqtr4d 2248 1  |-  ( K  e.  ( 0 ... N )  ->  (
( N  +  1 )  _C  K )  =  ( ( N  _C  K )  x.  ( ( N  + 
1 )  /  (
( N  +  1 )  -  K ) ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1373    e. wcel 2176   ` cfv 5272  (class class class)co 5946   0cc0 7927   1c1 7928    + caddc 7930    x. cmul 7932    - cmin 8245    / cdiv 8747   NNcn 9038   NN0cn0 9297   ...cfz 10132   !cfa 10872    _C cbc 10894
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 615  ax-in2 616  ax-io 711  ax-5 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-13 2178  ax-14 2179  ax-ext 2187  ax-coll 4160  ax-sep 4163  ax-nul 4171  ax-pow 4219  ax-pr 4254  ax-un 4481  ax-setind 4586  ax-iinf 4637  ax-cnex 8018  ax-resscn 8019  ax-1cn 8020  ax-1re 8021  ax-icn 8022  ax-addcl 8023  ax-addrcl 8024  ax-mulcl 8025  ax-mulrcl 8026  ax-addcom 8027  ax-mulcom 8028  ax-addass 8029  ax-mulass 8030  ax-distr 8031  ax-i2m1 8032  ax-0lt1 8033  ax-1rid 8034  ax-0id 8035  ax-rnegex 8036  ax-precex 8037  ax-cnre 8038  ax-pre-ltirr 8039  ax-pre-ltwlin 8040  ax-pre-lttrn 8041  ax-pre-apti 8042  ax-pre-ltadd 8043  ax-pre-mulgt0 8044  ax-pre-mulext 8045
This theorem depends on definitions:  df-bi 117  df-dc 837  df-3or 982  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1484  df-sb 1786  df-eu 2057  df-mo 2058  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-ne 2377  df-nel 2472  df-ral 2489  df-rex 2490  df-reu 2491  df-rmo 2492  df-rab 2493  df-v 2774  df-sbc 2999  df-csb 3094  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-nul 3461  df-if 3572  df-pw 3618  df-sn 3639  df-pr 3640  df-op 3642  df-uni 3851  df-int 3886  df-iun 3929  df-br 4046  df-opab 4107  df-mpt 4108  df-tr 4144  df-id 4341  df-po 4344  df-iso 4345  df-iord 4414  df-on 4416  df-ilim 4417  df-suc 4419  df-iom 4640  df-xp 4682  df-rel 4683  df-cnv 4684  df-co 4685  df-dm 4686  df-rn 4687  df-res 4688  df-ima 4689  df-iota 5233  df-fun 5274  df-fn 5275  df-f 5276  df-f1 5277  df-fo 5278  df-f1o 5279  df-fv 5280  df-riota 5901  df-ov 5949  df-oprab 5950  df-mpo 5951  df-1st 6228  df-2nd 6229  df-recs 6393  df-frec 6479  df-pnf 8111  df-mnf 8112  df-xr 8113  df-ltxr 8114  df-le 8115  df-sub 8247  df-neg 8248  df-reap 8650  df-ap 8657  df-div 8748  df-inn 9039  df-n0 9298  df-z 9375  df-uz 9651  df-q 9743  df-fz 10133  df-seqfrec 10595  df-fac 10873  df-bc 10895
This theorem is referenced by:  bcp1nk  10909  bcpasc  10913
  Copyright terms: Public domain W3C validator