Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > binom1p | Structured version Visualization version GIF version |
Description: Special case of the binomial theorem for (1 + 𝐴)↑𝑁. (Contributed by Paul Chapman, 10-May-2007.) |
Ref | Expression |
---|---|
binom1p | ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → ((1 + 𝐴)↑𝑁) = Σ𝑘 ∈ (0...𝑁)((𝑁C𝑘) · (𝐴↑𝑘))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ax-1cn 10583 | . . 3 ⊢ 1 ∈ ℂ | |
2 | binom 15173 | . . 3 ⊢ ((1 ∈ ℂ ∧ 𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → ((1 + 𝐴)↑𝑁) = Σ𝑘 ∈ (0...𝑁)((𝑁C𝑘) · ((1↑(𝑁 − 𝑘)) · (𝐴↑𝑘)))) | |
3 | 1, 2 | mp3an1 1439 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → ((1 + 𝐴)↑𝑁) = Σ𝑘 ∈ (0...𝑁)((𝑁C𝑘) · ((1↑(𝑁 − 𝑘)) · (𝐴↑𝑘)))) |
4 | fznn0sub 12927 | . . . . . . . . 9 ⊢ (𝑘 ∈ (0...𝑁) → (𝑁 − 𝑘) ∈ ℕ0) | |
5 | 4 | adantl 482 | . . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) ∧ 𝑘 ∈ (0...𝑁)) → (𝑁 − 𝑘) ∈ ℕ0) |
6 | 5 | nn0zd 12073 | . . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) ∧ 𝑘 ∈ (0...𝑁)) → (𝑁 − 𝑘) ∈ ℤ) |
7 | 1exp 13446 | . . . . . . 7 ⊢ ((𝑁 − 𝑘) ∈ ℤ → (1↑(𝑁 − 𝑘)) = 1) | |
8 | 6, 7 | syl 17 | . . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) ∧ 𝑘 ∈ (0...𝑁)) → (1↑(𝑁 − 𝑘)) = 1) |
9 | 8 | oveq1d 7160 | . . . . 5 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) ∧ 𝑘 ∈ (0...𝑁)) → ((1↑(𝑁 − 𝑘)) · (𝐴↑𝑘)) = (1 · (𝐴↑𝑘))) |
10 | simpl 483 | . . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → 𝐴 ∈ ℂ) | |
11 | elfznn0 12988 | . . . . . . 7 ⊢ (𝑘 ∈ (0...𝑁) → 𝑘 ∈ ℕ0) | |
12 | expcl 13435 | . . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ0) → (𝐴↑𝑘) ∈ ℂ) | |
13 | 10, 11, 12 | syl2an 595 | . . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) ∧ 𝑘 ∈ (0...𝑁)) → (𝐴↑𝑘) ∈ ℂ) |
14 | 13 | mulid2d 10647 | . . . . 5 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) ∧ 𝑘 ∈ (0...𝑁)) → (1 · (𝐴↑𝑘)) = (𝐴↑𝑘)) |
15 | 9, 14 | eqtrd 2853 | . . . 4 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) ∧ 𝑘 ∈ (0...𝑁)) → ((1↑(𝑁 − 𝑘)) · (𝐴↑𝑘)) = (𝐴↑𝑘)) |
16 | 15 | oveq2d 7161 | . . 3 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) ∧ 𝑘 ∈ (0...𝑁)) → ((𝑁C𝑘) · ((1↑(𝑁 − 𝑘)) · (𝐴↑𝑘))) = ((𝑁C𝑘) · (𝐴↑𝑘))) |
17 | 16 | sumeq2dv 15048 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → Σ𝑘 ∈ (0...𝑁)((𝑁C𝑘) · ((1↑(𝑁 − 𝑘)) · (𝐴↑𝑘))) = Σ𝑘 ∈ (0...𝑁)((𝑁C𝑘) · (𝐴↑𝑘))) |
18 | 3, 17 | eqtrd 2853 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → ((1 + 𝐴)↑𝑁) = Σ𝑘 ∈ (0...𝑁)((𝑁C𝑘) · (𝐴↑𝑘))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 = wceq 1528 ∈ wcel 2105 (class class class)co 7145 ℂcc 10523 0cc0 10525 1c1 10526 + caddc 10528 · cmul 10530 − cmin 10858 ℕ0cn0 11885 ℤcz 11969 ...cfz 12880 ↑cexp 13417 Ccbc 13650 Σcsu 15030 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2790 ax-rep 5181 ax-sep 5194 ax-nul 5201 ax-pow 5257 ax-pr 5320 ax-un 7450 ax-inf2 9092 ax-cnex 10581 ax-resscn 10582 ax-1cn 10583 ax-icn 10584 ax-addcl 10585 ax-addrcl 10586 ax-mulcl 10587 ax-mulrcl 10588 ax-mulcom 10589 ax-addass 10590 ax-mulass 10591 ax-distr 10592 ax-i2m1 10593 ax-1ne0 10594 ax-1rid 10595 ax-rnegex 10596 ax-rrecex 10597 ax-cnre 10598 ax-pre-lttri 10599 ax-pre-lttrn 10600 ax-pre-ltadd 10601 ax-pre-mulgt0 10602 ax-pre-sup 10603 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-3or 1080 df-3an 1081 df-tru 1531 df-fal 1541 df-ex 1772 df-nf 1776 df-sb 2061 df-mo 2615 df-eu 2647 df-clab 2797 df-cleq 2811 df-clel 2890 df-nfc 2960 df-ne 3014 df-nel 3121 df-ral 3140 df-rex 3141 df-reu 3142 df-rmo 3143 df-rab 3144 df-v 3494 df-sbc 3770 df-csb 3881 df-dif 3936 df-un 3938 df-in 3940 df-ss 3949 df-pss 3951 df-nul 4289 df-if 4464 df-pw 4537 df-sn 4558 df-pr 4560 df-tp 4562 df-op 4564 df-uni 4831 df-int 4868 df-iun 4912 df-br 5058 df-opab 5120 df-mpt 5138 df-tr 5164 df-id 5453 df-eprel 5458 df-po 5467 df-so 5468 df-fr 5507 df-se 5508 df-we 5509 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-res 5560 df-ima 5561 df-pred 6141 df-ord 6187 df-on 6188 df-lim 6189 df-suc 6190 df-iota 6307 df-fun 6350 df-fn 6351 df-f 6352 df-f1 6353 df-fo 6354 df-f1o 6355 df-fv 6356 df-isom 6357 df-riota 7103 df-ov 7148 df-oprab 7149 df-mpo 7150 df-om 7570 df-1st 7678 df-2nd 7679 df-wrecs 7936 df-recs 7997 df-rdg 8035 df-1o 8091 df-oadd 8095 df-er 8278 df-en 8498 df-dom 8499 df-sdom 8500 df-fin 8501 df-sup 8894 df-oi 8962 df-card 9356 df-pnf 10665 df-mnf 10666 df-xr 10667 df-ltxr 10668 df-le 10669 df-sub 10860 df-neg 10861 df-div 11286 df-nn 11627 df-2 11688 df-3 11689 df-n0 11886 df-z 11970 df-uz 12232 df-rp 12378 df-fz 12881 df-fzo 13022 df-seq 13358 df-exp 13418 df-fac 13622 df-bc 13651 df-hash 13679 df-cj 14446 df-re 14447 df-im 14448 df-sqrt 14582 df-abs 14583 df-clim 14833 df-sum 15031 |
This theorem is referenced by: binom11 15175 binom1dif 15176 bpolydiflem 15396 musum 25695 |
Copyright terms: Public domain | W3C validator |