| 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 13541 | . . . 4 ⊢ (𝑁 ∈ (0...𝐴) → 𝐴 ∈ ℕ0) | |
| 2 | 1 | nn0cnd 12468 | . . 3 ⊢ (𝑁 ∈ (0...𝐴) → 𝐴 ∈ ℂ) |
| 3 | elfznn0 13540 | . . 3 ⊢ (𝑁 ∈ (0...𝐴) → 𝑁 ∈ ℕ0) | |
| 4 | fallfacval 15936 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (𝐴 FallFac 𝑁) = ∏𝑗 ∈ (0...(𝑁 − 1))(𝐴 − 𝑗)) | |
| 5 | 2, 3, 4 | syl2anc 585 | . 2 ⊢ (𝑁 ∈ (0...𝐴) → (𝐴 FallFac 𝑁) = ∏𝑗 ∈ (0...(𝑁 − 1))(𝐴 − 𝑗)) |
| 6 | elfzel2 13442 | . . 3 ⊢ (𝑁 ∈ (0...𝐴) → 𝐴 ∈ ℤ) | |
| 7 | elfzel1 13443 | . . 3 ⊢ (𝑁 ∈ (0...𝐴) → 0 ∈ ℤ) | |
| 8 | elfzelz 13444 | . . . 4 ⊢ (𝑁 ∈ (0...𝐴) → 𝑁 ∈ ℤ) | |
| 9 | peano2zm 12538 | . . . 4 ⊢ (𝑁 ∈ ℤ → (𝑁 − 1) ∈ ℤ) | |
| 10 | 8, 9 | syl 17 | . . 3 ⊢ (𝑁 ∈ (0...𝐴) → (𝑁 − 1) ∈ ℤ) |
| 11 | elfzelz 13444 | . . . . 5 ⊢ (𝑗 ∈ (0...(𝑁 − 1)) → 𝑗 ∈ ℤ) | |
| 12 | 11 | zcnd 12601 | . . . 4 ⊢ (𝑗 ∈ (0...(𝑁 − 1)) → 𝑗 ∈ ℂ) |
| 13 | subcl 11383 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝑗 ∈ ℂ) → (𝐴 − 𝑗) ∈ ℂ) | |
| 14 | 2, 12, 13 | syl2an 597 | . . 3 ⊢ ((𝑁 ∈ (0...𝐴) ∧ 𝑗 ∈ (0...(𝑁 − 1))) → (𝐴 − 𝑗) ∈ ℂ) |
| 15 | oveq2 7368 | . . 3 ⊢ (𝑗 = (𝐴 − 𝑘) → (𝐴 − 𝑗) = (𝐴 − (𝐴 − 𝑘))) | |
| 16 | 6, 7, 10, 14, 15 | fprodrev 15904 | . 2 ⊢ (𝑁 ∈ (0...𝐴) → ∏𝑗 ∈ (0...(𝑁 − 1))(𝐴 − 𝑗) = ∏𝑘 ∈ ((𝐴 − (𝑁 − 1))...(𝐴 − 0))(𝐴 − (𝐴 − 𝑘))) |
| 17 | 2 | subid1d 11485 | . . . 4 ⊢ (𝑁 ∈ (0...𝐴) → (𝐴 − 0) = 𝐴) |
| 18 | 17 | oveq2d 7376 | . . 3 ⊢ (𝑁 ∈ (0...𝐴) → ((𝐴 − (𝑁 − 1))...(𝐴 − 0)) = ((𝐴 − (𝑁 − 1))...𝐴)) |
| 19 | 2 | adantr 480 | . . . 4 ⊢ ((𝑁 ∈ (0...𝐴) ∧ 𝑘 ∈ ((𝐴 − (𝑁 − 1))...(𝐴 − 0))) → 𝐴 ∈ ℂ) |
| 20 | elfzelz 13444 | . . . . . 6 ⊢ (𝑘 ∈ ((𝐴 − (𝑁 − 1))...(𝐴 − 0)) → 𝑘 ∈ ℤ) | |
| 21 | 20 | zcnd 12601 | . . . . 5 ⊢ (𝑘 ∈ ((𝐴 − (𝑁 − 1))...(𝐴 − 0)) → 𝑘 ∈ ℂ) |
| 22 | 21 | adantl 481 | . . . 4 ⊢ ((𝑁 ∈ (0...𝐴) ∧ 𝑘 ∈ ((𝐴 − (𝑁 − 1))...(𝐴 − 0))) → 𝑘 ∈ ℂ) |
| 23 | 19, 22 | nncand 11501 | . . 3 ⊢ ((𝑁 ∈ (0...𝐴) ∧ 𝑘 ∈ ((𝐴 − (𝑁 − 1))...(𝐴 − 0))) → (𝐴 − (𝐴 − 𝑘)) = 𝑘) |
| 24 | 18, 23 | prodeq12dv 15853 | . 2 ⊢ (𝑁 ∈ (0...𝐴) → ∏𝑘 ∈ ((𝐴 − (𝑁 − 1))...(𝐴 − 0))(𝐴 − (𝐴 − 𝑘)) = ∏𝑘 ∈ ((𝐴 − (𝑁 − 1))...𝐴)𝑘) |
| 25 | 5, 16, 24 | 3eqtrd 2776 | 1 ⊢ (𝑁 ∈ (0...𝐴) → (𝐴 FallFac 𝑁) = ∏𝑘 ∈ ((𝐴 − (𝑁 − 1))...𝐴)𝑘) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 (class class class)co 7360 ℂcc 11028 0cc0 11030 1c1 11031 − cmin 11368 ℕ0cn0 12405 ℤcz 12492 ...cfz 13427 ∏cprod 15830 FallFac cfallfac 15931 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5225 ax-sep 5242 ax-nul 5252 ax-pow 5311 ax-pr 5378 ax-un 7682 ax-inf2 9554 ax-cnex 11086 ax-resscn 11087 ax-1cn 11088 ax-icn 11089 ax-addcl 11090 ax-addrcl 11091 ax-mulcl 11092 ax-mulrcl 11093 ax-mulcom 11094 ax-addass 11095 ax-mulass 11096 ax-distr 11097 ax-i2m1 11098 ax-1ne0 11099 ax-1rid 11100 ax-rnegex 11101 ax-rrecex 11102 ax-cnre 11103 ax-pre-lttri 11104 ax-pre-lttrn 11105 ax-pre-ltadd 11106 ax-pre-mulgt0 11107 ax-pre-sup 11108 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3062 df-rmo 3351 df-reu 3352 df-rab 3401 df-v 3443 df-sbc 3742 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4287 df-if 4481 df-pw 4557 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-int 4904 df-iun 4949 df-br 5100 df-opab 5162 df-mpt 5181 df-tr 5207 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-se 5579 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6260 df-ord 6321 df-on 6322 df-lim 6323 df-suc 6324 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-isom 6502 df-riota 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-om 7811 df-1st 7935 df-2nd 7936 df-frecs 8225 df-wrecs 8256 df-recs 8305 df-rdg 8343 df-1o 8399 df-er 8637 df-en 8888 df-dom 8889 df-sdom 8890 df-fin 8891 df-sup 9349 df-oi 9419 df-card 9855 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-div 11799 df-nn 12150 df-2 12212 df-3 12213 df-n0 12406 df-z 12493 df-uz 12756 df-rp 12910 df-fz 13428 df-fzo 13575 df-seq 13929 df-exp 13989 df-hash 14258 df-cj 15026 df-re 15027 df-im 15028 df-sqrt 15162 df-abs 15163 df-clim 15415 df-prod 15831 df-fallfac 15934 |
| This theorem is referenced by: fallfacval4 15970 |
| Copyright terms: Public domain | W3C validator |