fallfacval3 - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > fallfacval3		Structured version Visualization version GIF version

Theorem fallfacval3 15975

Description: A product representation of falling factorial when 𝐴 is a nonnegative integer. (Contributed by Scott Fenton, 20-Mar-2018.)

**Assertion**
Ref	Expression
fallfacval3	⊢ (𝑁 ∈ (0...𝐴) → (𝐴 FallFac 𝑁) = ∏𝑘 ∈ ((𝐴 − (𝑁 − 1))...𝐴)𝑘)

Distinct variable groups: 𝐴,𝑘 𝑘,𝑁

Proof of Theorem fallfacval3 Dummy variable 𝑗 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		elfz3nn0 13573	. . . 4 ⊢ (𝑁 ∈ (0...𝐴) → 𝐴 ∈ ℕ₀)
2	1	nn0cnd 12498	. . 3 ⊢ (𝑁 ∈ (0...𝐴) → 𝐴 ∈ ℂ)
3		elfznn0 13572	. . 3 ⊢ (𝑁 ∈ (0...𝐴) → 𝑁 ∈ ℕ₀)
4		fallfacval 15972	. . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ₀) → (𝐴 FallFac 𝑁) = ∏𝑗 ∈ (0...(𝑁 − 1))(𝐴 − 𝑗))
5	2, 3, 4	syl2anc 590	. 2 ⊢ (𝑁 ∈ (0...𝐴) → (𝐴 FallFac 𝑁) = ∏𝑗 ∈ (0...(𝑁 − 1))(𝐴 − 𝑗))
6		elfzel2 13474	. . 3 ⊢ (𝑁 ∈ (0...𝐴) → 𝐴 ∈ ℤ)
7		elfzel1 13475	. . 3 ⊢ (𝑁 ∈ (0...𝐴) → 0 ∈ ℤ)
8		elfzelz 13476	. . . 4 ⊢ (𝑁 ∈ (0...𝐴) → 𝑁 ∈ ℤ)
9		peano2zm 12568	. . . 4 ⊢ (𝑁 ∈ ℤ → (𝑁 − 1) ∈ ℤ)
10	8, 9	syl 17	. . 3 ⊢ (𝑁 ∈ (0...𝐴) → (𝑁 − 1) ∈ ℤ)
11		elfzelz 13476	. . . . 5 ⊢ (𝑗 ∈ (0...(𝑁 − 1)) → 𝑗 ∈ ℤ)
12	11	zcnd 12632	. . . 4 ⊢ (𝑗 ∈ (0...(𝑁 − 1)) → 𝑗 ∈ ℂ)
13		subcl 11390	. . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝑗 ∈ ℂ) → (𝐴 − 𝑗) ∈ ℂ)
14	2, 12, 13	syl2an 602	. . 3 ⊢ ((𝑁 ∈ (0...𝐴) ∧ 𝑗 ∈ (0...(𝑁 − 1))) → (𝐴 − 𝑗) ∈ ℂ)
15		oveq2 7371	. . 3 ⊢ (𝑗 = (𝐴 − 𝑘) → (𝐴 − 𝑗) = (𝐴 − (𝐴 − 𝑘)))
16	6, 7, 10, 14, 15	fprodrev 15940	. 2 ⊢ (𝑁 ∈ (0...𝐴) → ∏𝑗 ∈ (0...(𝑁 − 1))(𝐴 − 𝑗) = ∏𝑘 ∈ ((𝐴 − (𝑁 − 1))...(𝐴 − 0))(𝐴 − (𝐴 − 𝑘)))
17	2	subid1d 11492	. . . 4 ⊢ (𝑁 ∈ (0...𝐴) → (𝐴 − 0) = 𝐴)
18	17	oveq2d 7379	. . 3 ⊢ (𝑁 ∈ (0...𝐴) → ((𝐴 − (𝑁 − 1))...(𝐴 − 0)) = ((𝐴 − (𝑁 − 1))...𝐴))
19	2	adantr 481	. . . 4 ⊢ ((𝑁 ∈ (0...𝐴) ∧ 𝑘 ∈ ((𝐴 − (𝑁 − 1))...(𝐴 − 0))) → 𝐴 ∈ ℂ)
20		elfzelz 13476	. . . . . 6 ⊢ (𝑘 ∈ ((𝐴 − (𝑁 − 1))...(𝐴 − 0)) → 𝑘 ∈ ℤ)
21	20	zcnd 12632	. . . . 5 ⊢ (𝑘 ∈ ((𝐴 − (𝑁 − 1))...(𝐴 − 0)) → 𝑘 ∈ ℂ)
22	21	adantl 482	. . . 4 ⊢ ((𝑁 ∈ (0...𝐴) ∧ 𝑘 ∈ ((𝐴 − (𝑁 − 1))...(𝐴 − 0))) → 𝑘 ∈ ℂ)
23	19, 22	nncand 11508	. . 3 ⊢ ((𝑁 ∈ (0...𝐴) ∧ 𝑘 ∈ ((𝐴 − (𝑁 − 1))...(𝐴 − 0))) → (𝐴 − (𝐴 − 𝑘)) = 𝑘)
24	18, 23	prodeq12dv 15889	. 2 ⊢ (𝑁 ∈ (0...𝐴) → ∏𝑘 ∈ ((𝐴 − (𝑁 − 1))...(𝐴 − 0))(𝐴 − (𝐴 − 𝑘)) = ∏𝑘 ∈ ((𝐴 − (𝑁 − 1))...𝐴)𝑘)
25	5, 16, 24	3eqtrd 2779	1 ⊢ (𝑁 ∈ (0...𝐴) → (𝐴 FallFac 𝑁) = ∏𝑘 ∈ ((𝐴 − (𝑁 − 1))...𝐴)𝑘)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 396 = wceq 1547 ∈ wcel 2119 (class class class)co 7363 ℂcc 11034 0cc0 11036 1c1 11037 − cmin 11375 ℕ₀cn0 12435 ℤcz 12522 ...cfz 13459 ∏cprod 15866 FallFac cfallfac 15967

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2712 ax-rep 5206 ax-sep 5225 ax-nul 5235 ax-pow 5301 ax-pr 5369 ax-un 7685 ax-inf2 9560 ax-cnex 11092 ax-resscn 11093 ax-1cn 11094 ax-icn 11095 ax-addcl 11096 ax-addrcl 11097 ax-mulcl 11098 ax-mulrcl 11099 ax-mulcom 11100 ax-addass 11101 ax-mulass 11102 ax-distr 11103 ax-i2m1 11104 ax-1ne0 11105 ax-1rid 11106 ax-rnegex 11107 ax-rrecex 11108 ax-cnre 11109 ax-pre-lttri 11110 ax-pre-lttrn 11111 ax-pre-ltadd 11112 ax-pre-mulgt0 11113 ax-pre-sup 11114

This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2719 df-cleq 2732 df-clel 2815 df-nfc 2889 df-ne 2936 df-nel 3040 df-ral 3055 df-rex 3065 df-rmo 3345 df-reu 3346 df-rab 3393 df-v 3434 df-sbc 3731 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4269 df-if 4462 df-pw 4538 df-sn 4563 df-pr 4565 df-op 4569 df-uni 4846 df-int 4885 df-iun 4930 df-br 5080 df-opab 5142 df-mpt 5161 df-tr 5187 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 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-isom 6501 df-riota 7320 df-ov 7366 df-oprab 7367 df-mpo 7368 df-om 7814 df-1st 7938 df-2nd 7939 df-frecs 8228 df-wrecs 8259 df-recs 8308 df-rdg 8346 df-1o 8402 df-er 8640 df-en 8891 df-dom 8892 df-sdom 8893 df-fin 8894 df-sup 9352 df-oi 9422 df-card 9861 df-pnf 11179 df-mnf 11180 df-xr 11181 df-ltxr 11182 df-le 11183 df-sub 11377 df-neg 11378 df-div 11806 df-nn 12173 df-2 12242 df-3 12243 df-n0 12436 df-z 12523 df-uz 12787 df-rp 12941 df-fz 13460 df-fzo 13607 df-seq 13962 df-exp 14022 df-hash 14291 df-cj 15059 df-re 15060 df-im 15061 df-sqrt 15195 df-abs 15196 df-clim 15448 df-prod 15867 df-fallfac 15970

This theorem is referenced by: fallfacval4 16006

W3C validator