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

Theorem bcp1n 10725
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 10101 . . . . 5  |-  ( K  e.  ( 0 ... N )  ->  N  e.  NN0 )
2 facp1 10694 . . . . 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 10043 . . . . . . . 8  |-  ( K  e.  ( 0 ... N )  ->  ( N  -  K )  e.  NN0 )
5 facp1 10694 . . . . . . . 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 9220 . . . . . . . . 9  |-  ( K  e.  ( 0 ... N )  ->  N  e.  CC )
8 1cnd 7964 . . . . . . . . 9  |-  ( K  e.  ( 0 ... N )  ->  1  e.  CC )
9 elfznn0 10100 . . . . . . . . . 10  |-  ( K  e.  ( 0 ... N )  ->  K  e.  NN0 )
109nn0cnd 9220 . . . . . . . . 9  |-  ( K  e.  ( 0 ... N )  ->  K  e.  CC )
117, 8, 10addsubd 8279 . . . . . . . 8  |-  ( K  e.  ( 0 ... N )  ->  (
( N  +  1 )  -  K )  =  ( ( N  -  K )  +  1 ) )
1211fveq2d 5515 . . . . . . 7  |-  ( K  e.  ( 0 ... N )  ->  ( ! `  ( ( N  +  1 )  -  K ) )  =  ( ! `  ( ( N  -  K )  +  1 ) ) )
1311oveq2d 5885 . . . . . . 7  |-  ( K  e.  ( 0 ... N )  ->  (
( ! `  ( N  -  K )
)  x.  ( ( N  +  1 )  -  K ) )  =  ( ( ! `
 ( N  -  K ) )  x.  ( ( N  -  K )  +  1 ) ) )
146, 12, 133eqtr4d 2220 . . . . . 6  |-  ( K  e.  ( 0 ... N )  ->  ( ! `  ( ( N  +  1 )  -  K ) )  =  ( ( ! `
 ( N  -  K ) )  x.  ( ( N  + 
1 )  -  K
) ) )
1514oveq1d 5884 . . . . 5  |-  ( K  e.  ( 0 ... N )  ->  (
( ! `  (
( N  +  1 )  -  K ) )  x.  ( ! `
 K ) )  =  ( ( ( ! `  ( N  -  K ) )  x.  ( ( N  +  1 )  -  K ) )  x.  ( ! `  K
) ) )
164faccld 10700 . . . . . . 7  |-  ( K  e.  ( 0 ... N )  ->  ( ! `  ( N  -  K ) )  e.  NN )
1716nncnd 8922 . . . . . 6  |-  ( K  e.  ( 0 ... N )  ->  ( ! `  ( N  -  K ) )  e.  CC )
18 nn0p1nn 9204 . . . . . . . . 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 2254 . . . . . . 7  |-  ( K  e.  ( 0 ... N )  ->  (
( N  +  1 )  -  K )  e.  NN )
2120nncnd 8922 . . . . . 6  |-  ( K  e.  ( 0 ... N )  ->  (
( N  +  1 )  -  K )  e.  CC )
229faccld 10700 . . . . . . 7  |-  ( K  e.  ( 0 ... N )  ->  ( ! `  K )  e.  NN )
2322nncnd 8922 . . . . . 6  |-  ( K  e.  ( 0 ... N )  ->  ( ! `  K )  e.  CC )
2417, 21, 23mul32d 8100 . . . . 5  |-  ( K  e.  ( 0 ... N )  ->  (
( ( ! `  ( N  -  K
) )  x.  (
( N  +  1 )  -  K ) )  x.  ( ! `
 K ) )  =  ( ( ( ! `  ( N  -  K ) )  x.  ( ! `  K ) )  x.  ( ( N  + 
1 )  -  K
) ) )
2515, 24eqtrd 2210 . . . 4  |-  ( K  e.  ( 0 ... N )  ->  (
( ! `  (
( N  +  1 )  -  K ) )  x.  ( ! `
 K ) )  =  ( ( ( ! `  ( N  -  K ) )  x.  ( ! `  K ) )  x.  ( ( N  + 
1 )  -  K
) ) )
263, 25oveq12d 5887 . . 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 10700 . . . . 5  |-  ( K  e.  ( 0 ... N )  ->  ( ! `  N )  e.  NN )
2827nncnd 8922 . . . 4  |-  ( K  e.  ( 0 ... N )  ->  ( ! `  N )  e.  CC )
2916, 22nnmulcld 8957 . . . . 5  |-  ( K  e.  ( 0 ... N )  ->  (
( ! `  ( N  -  K )
)  x.  ( ! `
 K ) )  e.  NN )
3029nncnd 8922 . . . 4  |-  ( K  e.  ( 0 ... N )  ->  (
( ! `  ( N  -  K )
)  x.  ( ! `
 K ) )  e.  CC )
31 nn0p1nn 9204 . . . . . 6  |-  ( N  e.  NN0  ->  ( N  +  1 )  e.  NN )
321, 31syl 14 . . . . 5  |-  ( K  e.  ( 0 ... N )  ->  ( N  +  1 )  e.  NN )
3332nncnd 8922 . . . 4  |-  ( K  e.  ( 0 ... N )  ->  ( N  +  1 )  e.  CC )
3429nnap0d 8954 . . . 4  |-  ( K  e.  ( 0 ... N )  ->  (
( ! `  ( N  -  K )
)  x.  ( ! `
 K ) ) #  0 )
3520nnap0d 8954 . . . 4  |-  ( K  e.  ( 0 ... N )  ->  (
( N  +  1 )  -  K ) #  0 )
3628, 30, 33, 21, 34, 35divmuldivapd 8778 . . 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 2213 . 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 10060 . . 3  |-  ( K  e.  ( 0 ... N )  ->  K  e.  ( 0 ... ( N  +  1 ) ) )
39 bcval2 10714 . . 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 10714 . . 3  |-  ( K  e.  ( 0 ... N )  ->  ( N  _C  K )  =  ( ( ! `  N )  /  (
( ! `  ( N  -  K )
)  x.  ( ! `
 K ) ) ) )
4241oveq1d 5884 . 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 2220 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 1353    e. wcel 2148   ` cfv 5212  (class class class)co 5869   0cc0 7802   1c1 7803    + caddc 7805    x. cmul 7807    - cmin 8118    / cdiv 8618   NNcn 8908   NN0cn0 9165   ...cfz 9995   !cfa 10689    _C cbc 10711
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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-coll 4115  ax-sep 4118  ax-nul 4126  ax-pow 4171  ax-pr 4206  ax-un 4430  ax-setind 4533  ax-iinf 4584  ax-cnex 7893  ax-resscn 7894  ax-1cn 7895  ax-1re 7896  ax-icn 7897  ax-addcl 7898  ax-addrcl 7899  ax-mulcl 7900  ax-mulrcl 7901  ax-addcom 7902  ax-mulcom 7903  ax-addass 7904  ax-mulass 7905  ax-distr 7906  ax-i2m1 7907  ax-0lt1 7908  ax-1rid 7909  ax-0id 7910  ax-rnegex 7911  ax-precex 7912  ax-cnre 7913  ax-pre-ltirr 7914  ax-pre-ltwlin 7915  ax-pre-lttrn 7916  ax-pre-apti 7917  ax-pre-ltadd 7918  ax-pre-mulgt0 7919  ax-pre-mulext 7920
This theorem depends on definitions:  df-bi 117  df-dc 835  df-3or 979  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-nel 2443  df-ral 2460  df-rex 2461  df-reu 2462  df-rmo 2463  df-rab 2464  df-v 2739  df-sbc 2963  df-csb 3058  df-dif 3131  df-un 3133  df-in 3135  df-ss 3142  df-nul 3423  df-if 3535  df-pw 3576  df-sn 3597  df-pr 3598  df-op 3600  df-uni 3808  df-int 3843  df-iun 3886  df-br 4001  df-opab 4062  df-mpt 4063  df-tr 4099  df-id 4290  df-po 4293  df-iso 4294  df-iord 4363  df-on 4365  df-ilim 4366  df-suc 4368  df-iom 4587  df-xp 4629  df-rel 4630  df-cnv 4631  df-co 4632  df-dm 4633  df-rn 4634  df-res 4635  df-ima 4636  df-iota 5174  df-fun 5214  df-fn 5215  df-f 5216  df-f1 5217  df-fo 5218  df-f1o 5219  df-fv 5220  df-riota 5825  df-ov 5872  df-oprab 5873  df-mpo 5874  df-1st 6135  df-2nd 6136  df-recs 6300  df-frec 6386  df-pnf 7984  df-mnf 7985  df-xr 7986  df-ltxr 7987  df-le 7988  df-sub 8120  df-neg 8121  df-reap 8522  df-ap 8529  df-div 8619  df-inn 8909  df-n0 9166  df-z 9243  df-uz 9518  df-q 9609  df-fz 9996  df-seqfrec 10432  df-fac 10690  df-bc 10712
This theorem is referenced by:  bcp1nk  10726  bcpasc  10730
  Copyright terms: Public domain W3C validator