| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fallfacval3 | Structured version Visualization version GIF version | ||
| Description: A product representation of falling factorial when 𝐴 is a nonnegative integer. (Contributed by Scott Fenton, 20-Mar-2018.) |
| Ref | Expression |
|---|---|
| fallfacval3 | ⊢ (𝑁 ∈ (0...𝐴) → (𝐴 FallFac 𝑁) = ∏𝑘 ∈ ((𝐴 − (𝑁 − 1))...𝐴)𝑘) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elfz3nn0 13649 | . . . 4 ⊢ (𝑁 ∈ (0...𝐴) → 𝐴 ∈ ℕ0) | |
| 2 | 1 | nn0cnd 12566 | . . 3 ⊢ (𝑁 ∈ (0...𝐴) → 𝐴 ∈ ℂ) |
| 3 | elfznn0 13648 | . . 3 ⊢ (𝑁 ∈ (0...𝐴) → 𝑁 ∈ ℕ0) | |
| 4 | fallfacval 16063 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (𝐴 FallFac 𝑁) = ∏𝑗 ∈ (0...(𝑁 − 1))(𝐴 − 𝑗)) | |
| 5 | 2, 3, 4 | syl2anc 595 | . 2 ⊢ (𝑁 ∈ (0...𝐴) → (𝐴 FallFac 𝑁) = ∏𝑗 ∈ (0...(𝑁 − 1))(𝐴 − 𝑗)) |
| 6 | elfzel2 13549 | . . 3 ⊢ (𝑁 ∈ (0...𝐴) → 𝐴 ∈ ℤ) | |
| 7 | elfzel1 13550 | . . 3 ⊢ (𝑁 ∈ (0...𝐴) → 0 ∈ ℤ) | |
| 8 | elfzelz 13551 | . . . 4 ⊢ (𝑁 ∈ (0...𝐴) → 𝑁 ∈ ℤ) | |
| 9 | peano2zm 12636 | . . . 4 ⊢ (𝑁 ∈ ℤ → (𝑁 − 1) ∈ ℤ) | |
| 10 | 8, 9 | syl 18 | . . 3 ⊢ (𝑁 ∈ (0...𝐴) → (𝑁 − 1) ∈ ℤ) |
| 11 | elfzelz 13551 | . . . . 5 ⊢ (𝑗 ∈ (0...(𝑁 − 1)) → 𝑗 ∈ ℤ) | |
| 12 | 11 | zcnd 12700 | . . . 4 ⊢ (𝑗 ∈ (0...(𝑁 − 1)) → 𝑗 ∈ ℂ) |
| 13 | subcl 11455 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝑗 ∈ ℂ) → (𝐴 − 𝑗) ∈ ℂ) | |
| 14 | 2, 12, 13 | syl2an 607 | . . 3 ⊢ ((𝑁 ∈ (0...𝐴) ∧ 𝑗 ∈ (0...(𝑁 − 1))) → (𝐴 − 𝑗) ∈ ℂ) |
| 15 | oveq2 7418 | . . 3 ⊢ (𝑗 = (𝐴 − 𝑘) → (𝐴 − 𝑗) = (𝐴 − (𝐴 − 𝑘))) | |
| 16 | 6, 7, 10, 14, 15 | fprodrev 16031 | . 2 ⊢ (𝑁 ∈ (0...𝐴) → ∏𝑗 ∈ (0...(𝑁 − 1))(𝐴 − 𝑗) = ∏𝑘 ∈ ((𝐴 − (𝑁 − 1))...(𝐴 − 0))(𝐴 − (𝐴 − 𝑘))) |
| 17 | 2 | subid1d 11557 | . . . 4 ⊢ (𝑁 ∈ (0...𝐴) → (𝐴 − 0) = 𝐴) |
| 18 | 17 | oveq2d 7426 | . . 3 ⊢ (𝑁 ∈ (0...𝐴) → ((𝐴 − (𝑁 − 1))...(𝐴 − 0)) = ((𝐴 − (𝑁 − 1))...𝐴)) |
| 19 | 2 | adantr 485 | . . . 4 ⊢ ((𝑁 ∈ (0...𝐴) ∧ 𝑘 ∈ ((𝐴 − (𝑁 − 1))...(𝐴 − 0))) → 𝐴 ∈ ℂ) |
| 20 | elfzelz 13551 | . . . . . 6 ⊢ (𝑘 ∈ ((𝐴 − (𝑁 − 1))...(𝐴 − 0)) → 𝑘 ∈ ℤ) | |
| 21 | 20 | zcnd 12700 | . . . . 5 ⊢ (𝑘 ∈ ((𝐴 − (𝑁 − 1))...(𝐴 − 0)) → 𝑘 ∈ ℂ) |
| 22 | 21 | adantl 486 | . . . 4 ⊢ ((𝑁 ∈ (0...𝐴) ∧ 𝑘 ∈ ((𝐴 − (𝑁 − 1))...(𝐴 − 0))) → 𝑘 ∈ ℂ) |
| 23 | 19, 22 | nncand 11573 | . . 3 ⊢ ((𝑁 ∈ (0...𝐴) ∧ 𝑘 ∈ ((𝐴 − (𝑁 − 1))...(𝐴 − 0))) → (𝐴 − (𝐴 − 𝑘)) = 𝑘) |
| 24 | 18, 23 | prodeq12dv 15980 | . 2 ⊢ (𝑁 ∈ (0...𝐴) → ∏𝑘 ∈ ((𝐴 − (𝑁 − 1))...(𝐴 − 0))(𝐴 − (𝐴 − 𝑘)) = ∏𝑘 ∈ ((𝐴 − (𝑁 − 1))...𝐴)𝑘) |
| 25 | 5, 16, 24 | 3eqtrd 2800 | 1 ⊢ (𝑁 ∈ (0...𝐴) → (𝐴 FallFac 𝑁) = ∏𝑘 ∈ ((𝐴 − (𝑁 − 1))...𝐴)𝑘) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1568 ∈ wcel 2141 (class class class)co 7410 ℂcc 11097 0cc0 11099 1c1 11100 − cmin 11440 ℕ0cn0 12503 ℤcz 12590 ...cfz 13534 ∏cprod 15957 FallFac cfallfac 16058 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1823 ax-4 1837 ax-5 1938 ax-6 1995 ax-7 2036 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-rep 5237 ax-sep 5256 ax-nul 5268 ax-pow 5336 ax-pr 5404 ax-un 7732 ax-inf2 9609 ax-cnex 11155 ax-resscn 11156 ax-1cn 11157 ax-icn 11158 ax-addcl 11159 ax-addrcl 11160 ax-mulcl 11161 ax-mulrcl 11162 ax-mulcom 11163 ax-addass 11164 ax-mulass 11165 ax-distr 11166 ax-i2m1 11167 ax-1ne0 11168 ax-1rid 11169 ax-rnegex 11170 ax-rrecex 11171 ax-cnre 11172 ax-pre-lttri 11173 ax-pre-lttrn 11174 ax-pre-ltadd 11175 ax-pre-mulgt0 11176 ax-pre-sup 11177 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1571 df-fal 1581 df-ex 1808 df-nf 1812 df-sb 2095 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3744 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-int 4912 df-iun 4957 df-br 5109 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5556 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-se 5615 df-we 5616 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-isom 6545 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-om 7862 df-1st 7985 df-2nd 7986 df-frecs 8277 df-wrecs 8308 df-recs 8357 df-rdg 8396 df-1o 8452 df-er 8693 df-en 8943 df-dom 8944 df-sdom 8945 df-fin 8946 df-sup 9401 df-oi 9471 df-card 9924 df-pnf 11244 df-mnf 11245 df-xr 11246 df-ltxr 11247 df-le 11248 df-sub 11442 df-neg 11443 df-div 11871 df-nn 12233 df-2 12302 df-3 12303 df-n0 12504 df-z 12591 df-uz 12862 df-rp 13016 df-fz 13535 df-fzo 13683 df-seq 14038 df-exp 14098 df-hash 14367 df-cj 15150 df-re 15151 df-im 15152 df-sqrt 15286 df-abs 15287 df-clim 15539 df-prod 15958 df-fallfac 16061 |
| This theorem is referenced by: fallfacval4 16096 |
| Copyright terms: Public domain | W3C validator |