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

Theorem bcp1n 10983
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 10311 . . . . 5  |-  ( K  e.  ( 0 ... N )  ->  N  e.  NN0 )
2 facp1 10952 . . . . 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 10253 . . . . . . . 8  |-  ( K  e.  ( 0 ... N )  ->  ( N  -  K )  e.  NN0 )
5 facp1 10952 . . . . . . . 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 9424 . . . . . . . . 9  |-  ( K  e.  ( 0 ... N )  ->  N  e.  CC )
8 1cnd 8162 . . . . . . . . 9  |-  ( K  e.  ( 0 ... N )  ->  1  e.  CC )
9 elfznn0 10310 . . . . . . . . . 10  |-  ( K  e.  ( 0 ... N )  ->  K  e.  NN0 )
109nn0cnd 9424 . . . . . . . . 9  |-  ( K  e.  ( 0 ... N )  ->  K  e.  CC )
117, 8, 10addsubd 8478 . . . . . . . 8  |-  ( K  e.  ( 0 ... N )  ->  (
( N  +  1 )  -  K )  =  ( ( N  -  K )  +  1 ) )
1211fveq2d 5631 . . . . . . 7  |-  ( K  e.  ( 0 ... N )  ->  ( ! `  ( ( N  +  1 )  -  K ) )  =  ( ! `  ( ( N  -  K )  +  1 ) ) )
1311oveq2d 6017 . . . . . . 7  |-  ( K  e.  ( 0 ... N )  ->  (
( ! `  ( N  -  K )
)  x.  ( ( N  +  1 )  -  K ) )  =  ( ( ! `
 ( N  -  K ) )  x.  ( ( N  -  K )  +  1 ) ) )
146, 12, 133eqtr4d 2272 . . . . . 6  |-  ( K  e.  ( 0 ... N )  ->  ( ! `  ( ( N  +  1 )  -  K ) )  =  ( ( ! `
 ( N  -  K ) )  x.  ( ( N  + 
1 )  -  K
) ) )
1514oveq1d 6016 . . . . 5  |-  ( K  e.  ( 0 ... N )  ->  (
( ! `  (
( N  +  1 )  -  K ) )  x.  ( ! `
 K ) )  =  ( ( ( ! `  ( N  -  K ) )  x.  ( ( N  +  1 )  -  K ) )  x.  ( ! `  K
) ) )
164faccld 10958 . . . . . . 7  |-  ( K  e.  ( 0 ... N )  ->  ( ! `  ( N  -  K ) )  e.  NN )
1716nncnd 9124 . . . . . 6  |-  ( K  e.  ( 0 ... N )  ->  ( ! `  ( N  -  K ) )  e.  CC )
18 nn0p1nn 9408 . . . . . . . . 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 2306 . . . . . . 7  |-  ( K  e.  ( 0 ... N )  ->  (
( N  +  1 )  -  K )  e.  NN )
2120nncnd 9124 . . . . . 6  |-  ( K  e.  ( 0 ... N )  ->  (
( N  +  1 )  -  K )  e.  CC )
229faccld 10958 . . . . . . 7  |-  ( K  e.  ( 0 ... N )  ->  ( ! `  K )  e.  NN )
2322nncnd 9124 . . . . . 6  |-  ( K  e.  ( 0 ... N )  ->  ( ! `  K )  e.  CC )
2417, 21, 23mul32d 8299 . . . . 5  |-  ( K  e.  ( 0 ... N )  ->  (
( ( ! `  ( N  -  K
) )  x.  (
( N  +  1 )  -  K ) )  x.  ( ! `
 K ) )  =  ( ( ( ! `  ( N  -  K ) )  x.  ( ! `  K ) )  x.  ( ( N  + 
1 )  -  K
) ) )
2515, 24eqtrd 2262 . . . 4  |-  ( K  e.  ( 0 ... N )  ->  (
( ! `  (
( N  +  1 )  -  K ) )  x.  ( ! `
 K ) )  =  ( ( ( ! `  ( N  -  K ) )  x.  ( ! `  K ) )  x.  ( ( N  + 
1 )  -  K
) ) )
263, 25oveq12d 6019 . . 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 10958 . . . . 5  |-  ( K  e.  ( 0 ... N )  ->  ( ! `  N )  e.  NN )
2827nncnd 9124 . . . 4  |-  ( K  e.  ( 0 ... N )  ->  ( ! `  N )  e.  CC )
2916, 22nnmulcld 9159 . . . . 5  |-  ( K  e.  ( 0 ... N )  ->  (
( ! `  ( N  -  K )
)  x.  ( ! `
 K ) )  e.  NN )
3029nncnd 9124 . . . 4  |-  ( K  e.  ( 0 ... N )  ->  (
( ! `  ( N  -  K )
)  x.  ( ! `
 K ) )  e.  CC )
31 nn0p1nn 9408 . . . . . 6  |-  ( N  e.  NN0  ->  ( N  +  1 )  e.  NN )
321, 31syl 14 . . . . 5  |-  ( K  e.  ( 0 ... N )  ->  ( N  +  1 )  e.  NN )
3332nncnd 9124 . . . 4  |-  ( K  e.  ( 0 ... N )  ->  ( N  +  1 )  e.  CC )
3429nnap0d 9156 . . . 4  |-  ( K  e.  ( 0 ... N )  ->  (
( ! `  ( N  -  K )
)  x.  ( ! `
 K ) ) #  0 )
3520nnap0d 9156 . . . 4  |-  ( K  e.  ( 0 ... N )  ->  (
( N  +  1 )  -  K ) #  0 )
3628, 30, 33, 21, 34, 35divmuldivapd 8979 . . 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 2265 . 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 10270 . . 3  |-  ( K  e.  ( 0 ... N )  ->  K  e.  ( 0 ... ( N  +  1 ) ) )
39 bcval2 10972 . . 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 10972 . . 3  |-  ( K  e.  ( 0 ... N )  ->  ( N  _C  K )  =  ( ( ! `  N )  /  (
( ! `  ( N  -  K )
)  x.  ( ! `
 K ) ) ) )
4241oveq1d 6016 . 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 2272 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 1395    e. wcel 2200   ` cfv 5318  (class class class)co 6001   0cc0 7999   1c1 8000    + caddc 8002    x. cmul 8004    - cmin 8317    / cdiv 8819   NNcn 9110   NN0cn0 9369   ...cfz 10204   !cfa 10947    _C cbc 10969
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 4258  ax-pr 4293  ax-un 4524  ax-setind 4629  ax-iinf 4680  ax-cnex 8090  ax-resscn 8091  ax-1cn 8092  ax-1re 8093  ax-icn 8094  ax-addcl 8095  ax-addrcl 8096  ax-mulcl 8097  ax-mulrcl 8098  ax-addcom 8099  ax-mulcom 8100  ax-addass 8101  ax-mulass 8102  ax-distr 8103  ax-i2m1 8104  ax-0lt1 8105  ax-1rid 8106  ax-0id 8107  ax-rnegex 8108  ax-precex 8109  ax-cnre 8110  ax-pre-ltirr 8111  ax-pre-ltwlin 8112  ax-pre-lttrn 8113  ax-pre-apti 8114  ax-pre-ltadd 8115  ax-pre-mulgt0 8116  ax-pre-mulext 8117
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 4384  df-po 4387  df-iso 4388  df-iord 4457  df-on 4459  df-ilim 4460  df-suc 4462  df-iom 4683  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-res 4731  df-ima 4732  df-iota 5278  df-fun 5320  df-fn 5321  df-f 5322  df-f1 5323  df-fo 5324  df-f1o 5325  df-fv 5326  df-riota 5954  df-ov 6004  df-oprab 6005  df-mpo 6006  df-1st 6286  df-2nd 6287  df-recs 6451  df-frec 6537  df-pnf 8183  df-mnf 8184  df-xr 8185  df-ltxr 8186  df-le 8187  df-sub 8319  df-neg 8320  df-reap 8722  df-ap 8729  df-div 8820  df-inn 9111  df-n0 9370  df-z 9447  df-uz 9723  df-q 9815  df-fz 10205  df-seqfrec 10670  df-fac 10948  df-bc 10970
This theorem is referenced by:  bcp1nk  10984  bcpasc  10988
  Copyright terms: Public domain W3C validator