Metamath Proof Explorer


Theorem fprodp1

Description: Multiply in the last term in a finite product. (Contributed by Scott Fenton, 24-Dec-2017)

Ref Expression
Hypotheses fprodp1.1 ⊢ φ → N ∈ ℤ ≥ M
fprodp1.2 ⊢ φ ∧ k ∈ M … N + 1 → A ∈ ℂ
fprodp1.3 ⊢ k = N + 1 → A = B
Assertion fprodp1 ⊢ φ → ∏ k = M N + 1 A = ∏ k = M N A ⁢ B

Proof

Step Hyp Ref Expression
1 fprodp1.1 ⊢ φ → N ∈ ℤ ≥ M
2 fprodp1.2 ⊢ φ ∧ k ∈ M … N + 1 → A ∈ ℂ
3 fprodp1.3 ⊢ k = N + 1 → A = B
4 peano2uz ⊢ N ∈ ℤ ≥ M → N + 1 ∈ ℤ ≥ M
5 1 4 syl ⊢ φ → N + 1 ∈ ℤ ≥ M
6 5 2 3 fprodm1 ⊢ φ → ∏ k = M N + 1 A = ∏ k = M N + 1 - 1 A ⁢ B
7 eluzelz ⊢ N ∈ ℤ ≥ M → N ∈ ℤ
8 1 7 syl ⊢ φ → N ∈ ℤ
9 8 zcnd ⊢ φ → N ∈ ℂ
10 1cnd ⊢ φ → 1 ∈ ℂ
11 9 10 pncand ⊢ φ → N + 1 - 1 = N
12 11 oveq2d ⊢ φ → M … N + 1 - 1 = M … N
13 12 prodeq1d ⊢ φ → ∏ k = M N + 1 - 1 A = ∏ k = M N A
14 13 oveq1d ⊢ φ → ∏ k = M N + 1 - 1 A ⁢ B = ∏ k = M N A ⁢ B
15 6 14 eqtrd ⊢ φ → ∏ k = M N + 1 A = ∏ k = M N A ⁢ B