Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > risefacp1 | Structured version Visualization version GIF version |
Description: The value of the rising factorial at a successor. (Contributed by Scott Fenton, 5-Jan-2018.) |
Ref | Expression |
---|---|
risefacp1 | ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (𝐴 RiseFac (𝑁 + 1)) = ((𝐴 RiseFac 𝑁) · (𝐴 + 𝑁))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nn0cn 11901 | . . . . . . 7 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℂ) | |
2 | 1 | adantl 484 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → 𝑁 ∈ ℂ) |
3 | 1cnd 10630 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → 1 ∈ ℂ) | |
4 | 2, 3 | pncand 10992 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → ((𝑁 + 1) − 1) = 𝑁) |
5 | 4 | oveq2d 7166 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (0...((𝑁 + 1) − 1)) = (0...𝑁)) |
6 | 5 | prodeq1d 15269 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → ∏𝑘 ∈ (0...((𝑁 + 1) − 1))(𝐴 + 𝑘) = ∏𝑘 ∈ (0...𝑁)(𝐴 + 𝑘)) |
7 | elnn0uz 12277 | . . . . . 6 ⊢ (𝑁 ∈ ℕ0 ↔ 𝑁 ∈ (ℤ≥‘0)) | |
8 | 7 | biimpi 218 | . . . . 5 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ (ℤ≥‘0)) |
9 | 8 | adantl 484 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → 𝑁 ∈ (ℤ≥‘0)) |
10 | elfznn0 12994 | . . . . . . 7 ⊢ (𝑘 ∈ (0...𝑁) → 𝑘 ∈ ℕ0) | |
11 | 10 | nn0cnd 11951 | . . . . . 6 ⊢ (𝑘 ∈ (0...𝑁) → 𝑘 ∈ ℂ) |
12 | addcl 10613 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℂ) → (𝐴 + 𝑘) ∈ ℂ) | |
13 | 11, 12 | sylan2 594 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝑘 ∈ (0...𝑁)) → (𝐴 + 𝑘) ∈ ℂ) |
14 | 13 | adantlr 713 | . . . 4 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) ∧ 𝑘 ∈ (0...𝑁)) → (𝐴 + 𝑘) ∈ ℂ) |
15 | oveq2 7158 | . . . 4 ⊢ (𝑘 = 𝑁 → (𝐴 + 𝑘) = (𝐴 + 𝑁)) | |
16 | 9, 14, 15 | fprodm1 15315 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → ∏𝑘 ∈ (0...𝑁)(𝐴 + 𝑘) = (∏𝑘 ∈ (0...(𝑁 − 1))(𝐴 + 𝑘) · (𝐴 + 𝑁))) |
17 | 6, 16 | eqtrd 2856 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → ∏𝑘 ∈ (0...((𝑁 + 1) − 1))(𝐴 + 𝑘) = (∏𝑘 ∈ (0...(𝑁 − 1))(𝐴 + 𝑘) · (𝐴 + 𝑁))) |
18 | peano2nn0 11931 | . . 3 ⊢ (𝑁 ∈ ℕ0 → (𝑁 + 1) ∈ ℕ0) | |
19 | risefacval 15356 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ (𝑁 + 1) ∈ ℕ0) → (𝐴 RiseFac (𝑁 + 1)) = ∏𝑘 ∈ (0...((𝑁 + 1) − 1))(𝐴 + 𝑘)) | |
20 | 18, 19 | sylan2 594 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (𝐴 RiseFac (𝑁 + 1)) = ∏𝑘 ∈ (0...((𝑁 + 1) − 1))(𝐴 + 𝑘)) |
21 | risefacval 15356 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (𝐴 RiseFac 𝑁) = ∏𝑘 ∈ (0...(𝑁 − 1))(𝐴 + 𝑘)) | |
22 | 21 | oveq1d 7165 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → ((𝐴 RiseFac 𝑁) · (𝐴 + 𝑁)) = (∏𝑘 ∈ (0...(𝑁 − 1))(𝐴 + 𝑘) · (𝐴 + 𝑁))) |
23 | 17, 20, 22 | 3eqtr4d 2866 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (𝐴 RiseFac (𝑁 + 1)) = ((𝐴 RiseFac 𝑁) · (𝐴 + 𝑁))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 = wceq 1533 ∈ wcel 2110 ‘cfv 6350 (class class class)co 7150 ℂcc 10529 0cc0 10531 1c1 10532 + caddc 10534 · cmul 10536 − cmin 10864 ℕ0cn0 11891 ℤ≥cuz 12237 ...cfz 12886 ∏cprod 15253 RiseFac crisefac 15353 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2156 ax-12 2172 ax-ext 2793 ax-rep 5183 ax-sep 5196 ax-nul 5203 ax-pow 5259 ax-pr 5322 ax-un 7455 ax-inf2 9098 ax-cnex 10587 ax-resscn 10588 ax-1cn 10589 ax-icn 10590 ax-addcl 10591 ax-addrcl 10592 ax-mulcl 10593 ax-mulrcl 10594 ax-mulcom 10595 ax-addass 10596 ax-mulass 10597 ax-distr 10598 ax-i2m1 10599 ax-1ne0 10600 ax-1rid 10601 ax-rnegex 10602 ax-rrecex 10603 ax-cnre 10604 ax-pre-lttri 10605 ax-pre-lttrn 10606 ax-pre-ltadd 10607 ax-pre-mulgt0 10608 ax-pre-sup 10609 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-fal 1546 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3497 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-pss 3954 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4562 df-pr 4564 df-tp 4566 df-op 4568 df-uni 4833 df-int 4870 df-iun 4914 df-br 5060 df-opab 5122 df-mpt 5140 df-tr 5166 df-id 5455 df-eprel 5460 df-po 5469 df-so 5470 df-fr 5509 df-se 5510 df-we 5511 df-xp 5556 df-rel 5557 df-cnv 5558 df-co 5559 df-dm 5560 df-rn 5561 df-res 5562 df-ima 5563 df-pred 6143 df-ord 6189 df-on 6190 df-lim 6191 df-suc 6192 df-iota 6309 df-fun 6352 df-fn 6353 df-f 6354 df-f1 6355 df-fo 6356 df-f1o 6357 df-fv 6358 df-isom 6359 df-riota 7108 df-ov 7153 df-oprab 7154 df-mpo 7155 df-om 7575 df-1st 7683 df-2nd 7684 df-wrecs 7941 df-recs 8002 df-rdg 8040 df-1o 8096 df-oadd 8100 df-er 8283 df-en 8504 df-dom 8505 df-sdom 8506 df-fin 8507 df-sup 8900 df-oi 8968 df-card 9362 df-pnf 10671 df-mnf 10672 df-xr 10673 df-ltxr 10674 df-le 10675 df-sub 10866 df-neg 10867 df-div 11292 df-nn 11633 df-2 11694 df-3 11695 df-n0 11892 df-z 11976 df-uz 12238 df-rp 12384 df-fz 12887 df-fzo 13028 df-seq 13364 df-exp 13424 df-hash 13685 df-cj 14452 df-re 14453 df-im 14454 df-sqrt 14588 df-abs 14589 df-clim 14839 df-prod 15254 df-risefac 15354 |
This theorem is referenced by: risefacp1d 15379 risefac1 15381 |
Copyright terms: Public domain | W3C validator |