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

Theorem bcp1n 10872
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 10209 . . . . 5  |-  ( K  e.  ( 0 ... N )  ->  N  e.  NN0 )
2 facp1 10841 . . . . 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 10151 . . . . . . . 8  |-  ( K  e.  ( 0 ... N )  ->  ( N  -  K )  e.  NN0 )
5 facp1 10841 . . . . . . . 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 9323 . . . . . . . . 9  |-  ( K  e.  ( 0 ... N )  ->  N  e.  CC )
8 1cnd 8061 . . . . . . . . 9  |-  ( K  e.  ( 0 ... N )  ->  1  e.  CC )
9 elfznn0 10208 . . . . . . . . . 10  |-  ( K  e.  ( 0 ... N )  ->  K  e.  NN0 )
109nn0cnd 9323 . . . . . . . . 9  |-  ( K  e.  ( 0 ... N )  ->  K  e.  CC )
117, 8, 10addsubd 8377 . . . . . . . 8  |-  ( K  e.  ( 0 ... N )  ->  (
( N  +  1 )  -  K )  =  ( ( N  -  K )  +  1 ) )
1211fveq2d 5565 . . . . . . 7  |-  ( K  e.  ( 0 ... N )  ->  ( ! `  ( ( N  +  1 )  -  K ) )  =  ( ! `  ( ( N  -  K )  +  1 ) ) )
1311oveq2d 5941 . . . . . . 7  |-  ( K  e.  ( 0 ... N )  ->  (
( ! `  ( N  -  K )
)  x.  ( ( N  +  1 )  -  K ) )  =  ( ( ! `
 ( N  -  K ) )  x.  ( ( N  -  K )  +  1 ) ) )
146, 12, 133eqtr4d 2239 . . . . . 6  |-  ( K  e.  ( 0 ... N )  ->  ( ! `  ( ( N  +  1 )  -  K ) )  =  ( ( ! `
 ( N  -  K ) )  x.  ( ( N  + 
1 )  -  K
) ) )
1514oveq1d 5940 . . . . 5  |-  ( K  e.  ( 0 ... N )  ->  (
( ! `  (
( N  +  1 )  -  K ) )  x.  ( ! `
 K ) )  =  ( ( ( ! `  ( N  -  K ) )  x.  ( ( N  +  1 )  -  K ) )  x.  ( ! `  K
) ) )
164faccld 10847 . . . . . . 7  |-  ( K  e.  ( 0 ... N )  ->  ( ! `  ( N  -  K ) )  e.  NN )
1716nncnd 9023 . . . . . 6  |-  ( K  e.  ( 0 ... N )  ->  ( ! `  ( N  -  K ) )  e.  CC )
18 nn0p1nn 9307 . . . . . . . . 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 2273 . . . . . . 7  |-  ( K  e.  ( 0 ... N )  ->  (
( N  +  1 )  -  K )  e.  NN )
2120nncnd 9023 . . . . . 6  |-  ( K  e.  ( 0 ... N )  ->  (
( N  +  1 )  -  K )  e.  CC )
229faccld 10847 . . . . . . 7  |-  ( K  e.  ( 0 ... N )  ->  ( ! `  K )  e.  NN )
2322nncnd 9023 . . . . . 6  |-  ( K  e.  ( 0 ... N )  ->  ( ! `  K )  e.  CC )
2417, 21, 23mul32d 8198 . . . . 5  |-  ( K  e.  ( 0 ... N )  ->  (
( ( ! `  ( N  -  K
) )  x.  (
( N  +  1 )  -  K ) )  x.  ( ! `
 K ) )  =  ( ( ( ! `  ( N  -  K ) )  x.  ( ! `  K ) )  x.  ( ( N  + 
1 )  -  K
) ) )
2515, 24eqtrd 2229 . . . 4  |-  ( K  e.  ( 0 ... N )  ->  (
( ! `  (
( N  +  1 )  -  K ) )  x.  ( ! `
 K ) )  =  ( ( ( ! `  ( N  -  K ) )  x.  ( ! `  K ) )  x.  ( ( N  + 
1 )  -  K
) ) )
263, 25oveq12d 5943 . . 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 10847 . . . . 5  |-  ( K  e.  ( 0 ... N )  ->  ( ! `  N )  e.  NN )
2827nncnd 9023 . . . 4  |-  ( K  e.  ( 0 ... N )  ->  ( ! `  N )  e.  CC )
2916, 22nnmulcld 9058 . . . . 5  |-  ( K  e.  ( 0 ... N )  ->  (
( ! `  ( N  -  K )
)  x.  ( ! `
 K ) )  e.  NN )
3029nncnd 9023 . . . 4  |-  ( K  e.  ( 0 ... N )  ->  (
( ! `  ( N  -  K )
)  x.  ( ! `
 K ) )  e.  CC )
31 nn0p1nn 9307 . . . . . 6  |-  ( N  e.  NN0  ->  ( N  +  1 )  e.  NN )
321, 31syl 14 . . . . 5  |-  ( K  e.  ( 0 ... N )  ->  ( N  +  1 )  e.  NN )
3332nncnd 9023 . . . 4  |-  ( K  e.  ( 0 ... N )  ->  ( N  +  1 )  e.  CC )
3429nnap0d 9055 . . . 4  |-  ( K  e.  ( 0 ... N )  ->  (
( ! `  ( N  -  K )
)  x.  ( ! `
 K ) ) #  0 )
3520nnap0d 9055 . . . 4  |-  ( K  e.  ( 0 ... N )  ->  (
( N  +  1 )  -  K ) #  0 )
3628, 30, 33, 21, 34, 35divmuldivapd 8878 . . 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 2232 . 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 10168 . . 3  |-  ( K  e.  ( 0 ... N )  ->  K  e.  ( 0 ... ( N  +  1 ) ) )
39 bcval2 10861 . . 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 10861 . . 3  |-  ( K  e.  ( 0 ... N )  ->  ( N  _C  K )  =  ( ( ! `  N )  /  (
( ! `  ( N  -  K )
)  x.  ( ! `
 K ) ) ) )
4241oveq1d 5940 . 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 2239 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 1364    e. wcel 2167   ` cfv 5259  (class class class)co 5925   0cc0 7898   1c1 7899    + caddc 7901    x. cmul 7903    - cmin 8216    / cdiv 8718   NNcn 9009   NN0cn0 9268   ...cfz 10102   !cfa 10836    _C cbc 10858
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 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-coll 4149  ax-sep 4152  ax-nul 4160  ax-pow 4208  ax-pr 4243  ax-un 4469  ax-setind 4574  ax-iinf 4625  ax-cnex 7989  ax-resscn 7990  ax-1cn 7991  ax-1re 7992  ax-icn 7993  ax-addcl 7994  ax-addrcl 7995  ax-mulcl 7996  ax-mulrcl 7997  ax-addcom 7998  ax-mulcom 7999  ax-addass 8000  ax-mulass 8001  ax-distr 8002  ax-i2m1 8003  ax-0lt1 8004  ax-1rid 8005  ax-0id 8006  ax-rnegex 8007  ax-precex 8008  ax-cnre 8009  ax-pre-ltirr 8010  ax-pre-ltwlin 8011  ax-pre-lttrn 8012  ax-pre-apti 8013  ax-pre-ltadd 8014  ax-pre-mulgt0 8015  ax-pre-mulext 8016
This theorem depends on definitions:  df-bi 117  df-dc 836  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-nel 2463  df-ral 2480  df-rex 2481  df-reu 2482  df-rmo 2483  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3452  df-if 3563  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-int 3876  df-iun 3919  df-br 4035  df-opab 4096  df-mpt 4097  df-tr 4133  df-id 4329  df-po 4332  df-iso 4333  df-iord 4402  df-on 4404  df-ilim 4405  df-suc 4407  df-iom 4628  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-res 4676  df-ima 4677  df-iota 5220  df-fun 5261  df-fn 5262  df-f 5263  df-f1 5264  df-fo 5265  df-f1o 5266  df-fv 5267  df-riota 5880  df-ov 5928  df-oprab 5929  df-mpo 5930  df-1st 6207  df-2nd 6208  df-recs 6372  df-frec 6458  df-pnf 8082  df-mnf 8083  df-xr 8084  df-ltxr 8085  df-le 8086  df-sub 8218  df-neg 8219  df-reap 8621  df-ap 8628  df-div 8719  df-inn 9010  df-n0 9269  df-z 9346  df-uz 9621  df-q 9713  df-fz 10103  df-seqfrec 10559  df-fac 10837  df-bc 10859
This theorem is referenced by:  bcp1nk  10873  bcpasc  10877
  Copyright terms: Public domain W3C validator