P. 157 of Theorem List - Metamath Proof Explorer

Theorem List for Metamath Proof Explorer - 15601-15700   *Has distinct variable group(s)

Type	Label	Description
Statement
Theorem	fprod1 15601*	A finite product of only one term is the term itself. (Contributed by Scott Fenton, 14-Dec-2017.)
⊢ (𝑘 = 𝑀 → 𝐴 = 𝐵)    ⇒   ⊢ ((𝑀 ∈ ℤ ∧ 𝐵 ∈ ℂ) → ∏𝑘 ∈ (𝑀...𝑀)𝐴 = 𝐵)
Theorem	prodsnf 15602*	A product of a singleton is the term. A version of prodsn 15600 using bound-variable hypotheses instead of distinct variable conditions. (Contributed by Glauco Siliprandi, 5-Apr-2020.)
⊢ Ⅎ𝑘𝐵    &   ⊢ (𝑘 = 𝑀 → 𝐴 = 𝐵)    ⇒   ⊢ ((𝑀 ∈ 𝑉 ∧ 𝐵 ∈ ℂ) → ∏𝑘 ∈ {𝑀}𝐴 = 𝐵)
Theorem	climprod1 15603	The limit of a product over one. (Contributed by Scott Fenton, 15-Dec-2017.)
⊢ 𝑍 = (ℤ≥‘𝑀)    &   ⊢ (𝜑 → 𝑀 ∈ ℤ)    ⇒   ⊢ (𝜑 → seq𝑀( · , (𝑍 × {1})) ⇝ 1)
Theorem	fprodsplit 15604*	Split a finite product into two parts. (Contributed by Scott Fenton, 16-Dec-2017.)
⊢ (𝜑 → (𝐴 ∩ 𝐵) = ∅)    &   ⊢ (𝜑 → 𝑈 = (𝐴 ∪ 𝐵))    &   ⊢ (𝜑 → 𝑈 ∈ Fin)    &   ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑈) → 𝐶 ∈ ℂ)    ⇒   ⊢ (𝜑 → ∏𝑘 ∈ 𝑈 𝐶 = (∏𝑘 ∈ 𝐴 𝐶 · ∏𝑘 ∈ 𝐵 𝐶))
Theorem	fprodm1 15605*	Separate out the last term in a finite product. (Contributed by Scott Fenton, 16-Dec-2017.)
⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘𝑀))    &   ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → 𝐴 ∈ ℂ)    &   ⊢ (𝑘 = 𝑁 → 𝐴 = 𝐵)    ⇒   ⊢ (𝜑 → ∏𝑘 ∈ (𝑀...𝑁)𝐴 = (∏𝑘 ∈ (𝑀...(𝑁 − 1))𝐴 · 𝐵))
Theorem	fprod1p 15606*	Separate out the first term in a finite product. (Contributed by Scott Fenton, 24-Dec-2017.)
⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘𝑀))    &   ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → 𝐴 ∈ ℂ)    &   ⊢ (𝑘 = 𝑀 → 𝐴 = 𝐵)    ⇒   ⊢ (𝜑 → ∏𝑘 ∈ (𝑀...𝑁)𝐴 = (𝐵 · ∏𝑘 ∈ ((𝑀 + 1)...𝑁)𝐴))
Theorem	fprodp1 15607*	Multiply in the last term in a finite product. (Contributed by Scott Fenton, 24-Dec-2017.)
⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘𝑀))    &   ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...(𝑁 + 1))) → 𝐴 ∈ ℂ)    &   ⊢ (𝑘 = (𝑁 + 1) → 𝐴 = 𝐵)    ⇒   ⊢ (𝜑 → ∏𝑘 ∈ (𝑀...(𝑁 + 1))𝐴 = (∏𝑘 ∈ (𝑀...𝑁)𝐴 · 𝐵))
Theorem	fprodm1s 15608*	Separate out the last term in a finite product. (Contributed by Scott Fenton, 27-Dec-2017.)
⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘𝑀))    &   ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → 𝐴 ∈ ℂ)    ⇒   ⊢ (𝜑 → ∏𝑘 ∈ (𝑀...𝑁)𝐴 = (∏𝑘 ∈ (𝑀...(𝑁 − 1))𝐴 · ⦋𝑁 / 𝑘⦌𝐴))
Theorem	fprodp1s 15609*	Multiply in the last term in a finite product. (Contributed by Scott Fenton, 27-Dec-2017.)
⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘𝑀))    &   ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...(𝑁 + 1))) → 𝐴 ∈ ℂ)    ⇒   ⊢ (𝜑 → ∏𝑘 ∈ (𝑀...(𝑁 + 1))𝐴 = (∏𝑘 ∈ (𝑀...𝑁)𝐴 · ⦋(𝑁 + 1) / 𝑘⦌𝐴))
Theorem	prodsns 15610*	A product of the singleton is the term. (Contributed by Scott Fenton, 25-Dec-2017.)
⊢ ((𝑀 ∈ 𝑉 ∧ ⦋𝑀 / 𝑘⦌𝐴 ∈ ℂ) → ∏𝑘 ∈ {𝑀}𝐴 = ⦋𝑀 / 𝑘⦌𝐴)
Theorem	fprodfac 15611*	Factorial using product notation. (Contributed by Scott Fenton, 15-Dec-2017.)
⊢ (𝐴 ∈ ℕ0 → (!‘𝐴) = ∏𝑘 ∈ (1...𝐴)𝑘)
Theorem	fprodabs 15612*	The absolute value of a finite product. (Contributed by Scott Fenton, 25-Dec-2017.)
⊢ 𝑍 = (ℤ≥‘𝑀)    &   ⊢ (𝜑 → 𝑁 ∈ 𝑍)    &   ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 𝐴 ∈ ℂ)    ⇒   ⊢ (𝜑 → (abs‘∏𝑘 ∈ (𝑀...𝑁)𝐴) = ∏𝑘 ∈ (𝑀...𝑁)(abs‘𝐴))
Theorem	fprodeq0 15613*	Any finite product containing a zero term is itself zero. (Contributed by Scott Fenton, 27-Dec-2017.)
⊢ 𝑍 = (ℤ≥‘𝑀)    &   ⊢ (𝜑 → 𝑁 ∈ 𝑍)    &   ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 𝐴 ∈ ℂ)    &   ⊢ ((𝜑 ∧ 𝑘 = 𝑁) → 𝐴 = 0)    ⇒   ⊢ ((𝜑 ∧ 𝐾 ∈ (ℤ≥‘𝑁)) → ∏𝑘 ∈ (𝑀...𝐾)𝐴 = 0)
Theorem	fprodshft 15614*	Shift the index of a finite product. (Contributed by Scott Fenton, 5-Jan-2018.)
⊢ (𝜑 → 𝐾 ∈ ℤ)    &   ⊢ (𝜑 → 𝑀 ∈ ℤ)    &   ⊢ (𝜑 → 𝑁 ∈ ℤ)    &   ⊢ ((𝜑 ∧ 𝑗 ∈ (𝑀...𝑁)) → 𝐴 ∈ ℂ)    &   ⊢ (𝑗 = (𝑘 − 𝐾) → 𝐴 = 𝐵)    ⇒   ⊢ (𝜑 → ∏𝑗 ∈ (𝑀...𝑁)𝐴 = ∏𝑘 ∈ ((𝑀 + 𝐾)...(𝑁 + 𝐾))𝐵)
Theorem	fprodrev 15615*	Reversal of a finite product. (Contributed by Scott Fenton, 5-Jan-2018.)
⊢ (𝜑 → 𝐾 ∈ ℤ)    &   ⊢ (𝜑 → 𝑀 ∈ ℤ)    &   ⊢ (𝜑 → 𝑁 ∈ ℤ)    &   ⊢ ((𝜑 ∧ 𝑗 ∈ (𝑀...𝑁)) → 𝐴 ∈ ℂ)    &   ⊢ (𝑗 = (𝐾 − 𝑘) → 𝐴 = 𝐵)    ⇒   ⊢ (𝜑 → ∏𝑗 ∈ (𝑀...𝑁)𝐴 = ∏𝑘 ∈ ((𝐾 − 𝑁)...(𝐾 − 𝑀))𝐵)
Theorem	fprodconst 15616*	The product of constant terms (𝑘 is not free in 𝐵). (Contributed by Scott Fenton, 12-Jan-2018.)
⊢ ((𝐴 ∈ Fin ∧ 𝐵 ∈ ℂ) → ∏𝑘 ∈ 𝐴 𝐵 = (𝐵↑(♯‘𝐴)))
Theorem	fprodn0 15617*	A finite product of nonzero terms is nonzero. (Contributed by Scott Fenton, 15-Jan-2018.)
⊢ (𝜑 → 𝐴 ∈ Fin)    &   ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℂ)    &   ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ≠ 0)    ⇒   ⊢ (𝜑 → ∏𝑘 ∈ 𝐴 𝐵 ≠ 0)
Theorem	fprod2dlem 15618*	Lemma for fprod2d 15619- induction step. (Contributed by Scott Fenton, 30-Jan-2018.)
⊢ (𝑧 = ⟨𝑗, 𝑘⟩ → 𝐷 = 𝐶)    &   ⊢ (𝜑 → 𝐴 ∈ Fin)    &   ⊢ ((𝜑 ∧ 𝑗 ∈ 𝐴) → 𝐵 ∈ Fin)    &   ⊢ ((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ 𝑘 ∈ 𝐵)) → 𝐶 ∈ ℂ)    &   ⊢ (𝜑 → ¬ 𝑦 ∈ 𝑥)    &   ⊢ (𝜑 → (𝑥 ∪ {𝑦}) ⊆ 𝐴)    &   ⊢ (𝜓 ↔ ∏𝑗 ∈ 𝑥 ∏𝑘 ∈ 𝐵 𝐶 = ∏𝑧 ∈ ∪ 𝑗 ∈ 𝑥 ({𝑗} × 𝐵)𝐷)    ⇒   ⊢ ((𝜑 ∧ 𝜓) → ∏𝑗 ∈ (𝑥 ∪ {𝑦})∏𝑘 ∈ 𝐵 𝐶 = ∏𝑧 ∈ ∪ 𝑗 ∈ (𝑥 ∪ {𝑦})({𝑗} × 𝐵)𝐷)
Theorem	fprod2d 15619*	Write a double product as a product over a two-dimensional region. Compare fsum2d 15411. (Contributed by Scott Fenton, 30-Jan-2018.)
⊢ (𝑧 = ⟨𝑗, 𝑘⟩ → 𝐷 = 𝐶)    &   ⊢ (𝜑 → 𝐴 ∈ Fin)    &   ⊢ ((𝜑 ∧ 𝑗 ∈ 𝐴) → 𝐵 ∈ Fin)    &   ⊢ ((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ 𝑘 ∈ 𝐵)) → 𝐶 ∈ ℂ)    ⇒   ⊢ (𝜑 → ∏𝑗 ∈ 𝐴 ∏𝑘 ∈ 𝐵 𝐶 = ∏𝑧 ∈ ∪ 𝑗 ∈ 𝐴 ({𝑗} × 𝐵)𝐷)
Theorem	fprodxp 15620*	Combine two products into a single product over the cartesian product. (Contributed by Scott Fenton, 1-Feb-2018.)
⊢ (𝑧 = ⟨𝑗, 𝑘⟩ → 𝐷 = 𝐶)    &   ⊢ (𝜑 → 𝐴 ∈ Fin)    &   ⊢ (𝜑 → 𝐵 ∈ Fin)    &   ⊢ ((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ 𝑘 ∈ 𝐵)) → 𝐶 ∈ ℂ)    ⇒   ⊢ (𝜑 → ∏𝑗 ∈ 𝐴 ∏𝑘 ∈ 𝐵 𝐶 = ∏𝑧 ∈ (𝐴 × 𝐵)𝐷)
Theorem	fprodcnv 15621*	Transform a product region using the converse operation. (Contributed by Scott Fenton, 1-Feb-2018.)
⊢ (𝑥 = ⟨𝑗, 𝑘⟩ → 𝐵 = 𝐷)    &   ⊢ (𝑦 = ⟨𝑘, 𝑗⟩ → 𝐶 = 𝐷)    &   ⊢ (𝜑 → 𝐴 ∈ Fin)    &   ⊢ (𝜑 → Rel 𝐴)    &   ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℂ)    ⇒   ⊢ (𝜑 → ∏𝑥 ∈ 𝐴 𝐵 = ∏𝑦 ∈ ◡ 𝐴𝐶)
Theorem	fprodcom2 15622*	Interchange order of multiplication. Note that 𝐵(𝑗) and 𝐷(𝑘) are not necessarily constant expressions. (Contributed by Scott Fenton, 1-Feb-2018.) (Proof shortened by JJ, 2-Aug-2021.)
⊢ (𝜑 → 𝐴 ∈ Fin)    &   ⊢ (𝜑 → 𝐶 ∈ Fin)    &   ⊢ ((𝜑 ∧ 𝑗 ∈ 𝐴) → 𝐵 ∈ Fin)    &   ⊢ (𝜑 → ((𝑗 ∈ 𝐴 ∧ 𝑘 ∈ 𝐵) ↔ (𝑘 ∈ 𝐶 ∧ 𝑗 ∈ 𝐷)))    &   ⊢ ((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ 𝑘 ∈ 𝐵)) → 𝐸 ∈ ℂ)    ⇒   ⊢ (𝜑 → ∏𝑗 ∈ 𝐴 ∏𝑘 ∈ 𝐵 𝐸 = ∏𝑘 ∈ 𝐶 ∏𝑗 ∈ 𝐷 𝐸)
Theorem	fprodcom 15623*	Interchange product order. (Contributed by Scott Fenton, 2-Feb-2018.)
⊢ (𝜑 → 𝐴 ∈ Fin)    &   ⊢ (𝜑 → 𝐵 ∈ Fin)    &   ⊢ ((𝜑 ∧ (𝑗 ∈ 𝐴 ∧ 𝑘 ∈ 𝐵)) → 𝐶 ∈ ℂ)    ⇒   ⊢ (𝜑 → ∏𝑗 ∈ 𝐴 ∏𝑘 ∈ 𝐵 𝐶 = ∏𝑘 ∈ 𝐵 ∏𝑗 ∈ 𝐴 𝐶)
Theorem	fprod0diag 15624*	Two ways to express "the product of 𝐴(𝑗, 𝑘) over the triangular region 𝑀 ≤ 𝑗, 𝑀 ≤ 𝑘, 𝑗 + 𝑘 ≤ 𝑁. Compare fsum0diag 15417. (Contributed by Scott Fenton, 2-Feb-2018.)
⊢ ((𝜑 ∧ (𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁 − 𝑗)))) → 𝐴 ∈ ℂ)    ⇒   ⊢ (𝜑 → ∏𝑗 ∈ (0...𝑁)∏𝑘 ∈ (0...(𝑁 − 𝑗))𝐴 = ∏𝑘 ∈ (0...𝑁)∏𝑗 ∈ (0...(𝑁 − 𝑘))𝐴)
Theorem	fproddivf 15625*	The quotient of two finite products. A version of fproddiv 15599 using bound-variable hypotheses instead of distinct variable conditions. (Contributed by Glauco Siliprandi, 5-Apr-2020.)
⊢ Ⅎ𝑘𝜑    &   ⊢ (𝜑 → 𝐴 ∈ Fin)    &   ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℂ)    &   ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐶 ∈ ℂ)    &   ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐶 ≠ 0)    ⇒   ⊢ (𝜑 → ∏𝑘 ∈ 𝐴 (𝐵 / 𝐶) = (∏𝑘 ∈ 𝐴 𝐵 / ∏𝑘 ∈ 𝐴 𝐶))
Theorem	fprodsplitf 15626*	Split a finite product into two parts. A version of fprodsplit 15604 using bound-variable hypotheses instead of distinct variable conditions. (Contributed by Glauco Siliprandi, 5-Apr-2020.)
⊢ Ⅎ𝑘𝜑    &   ⊢ (𝜑 → (𝐴 ∩ 𝐵) = ∅)    &   ⊢ (𝜑 → 𝑈 = (𝐴 ∪ 𝐵))    &   ⊢ (𝜑 → 𝑈 ∈ Fin)    &   ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑈) → 𝐶 ∈ ℂ)    ⇒   ⊢ (𝜑 → ∏𝑘 ∈ 𝑈 𝐶 = (∏𝑘 ∈ 𝐴 𝐶 · ∏𝑘 ∈ 𝐵 𝐶))
Theorem	fprodsplitsn 15627*	Separate out a term in a finite product. (Contributed by Glauco Siliprandi, 5-Apr-2020.)
⊢ Ⅎ𝑘𝜑    &   ⊢ Ⅎ𝑘𝐷    &   ⊢ (𝜑 → 𝐴 ∈ Fin)    &   ⊢ (𝜑 → 𝐵 ∈ 𝑉)    &   ⊢ (𝜑 → ¬ 𝐵 ∈ 𝐴)    &   ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐶 ∈ ℂ)    &   ⊢ (𝑘 = 𝐵 → 𝐶 = 𝐷)    &   ⊢ (𝜑 → 𝐷 ∈ ℂ)    ⇒   ⊢ (𝜑 → ∏𝑘 ∈ (𝐴 ∪ {𝐵})𝐶 = (∏𝑘 ∈ 𝐴 𝐶 · 𝐷))
Theorem	fprodsplit1f 15628*	Separate out a term in a finite product. A version of fprodsplit1 43024 using bound-variable hypotheses instead of distinct variable conditions. (Contributed by Glauco Siliprandi, 5-Apr-2020.)
⊢ Ⅎ𝑘𝜑    &   ⊢ (𝜑 → Ⅎ𝑘𝐷)    &   ⊢ (𝜑 → 𝐴 ∈ Fin)    &   ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℂ)    &   ⊢ (𝜑 → 𝐶 ∈ 𝐴)    &   ⊢ ((𝜑 ∧ 𝑘 = 𝐶) → 𝐵 = 𝐷)    ⇒   ⊢ (𝜑 → ∏𝑘 ∈ 𝐴 𝐵 = (𝐷 · ∏𝑘 ∈ (𝐴 ∖ {𝐶})𝐵))
Theorem	fprodn0f 15629*	A finite product of nonzero terms is nonzero. A version of fprodn0 15617 using bound-variable hypotheses instead of distinct variable conditions. (Contributed by Glauco Siliprandi, 5-Apr-2020.)
⊢ Ⅎ𝑘𝜑    &   ⊢ (𝜑 → 𝐴 ∈ Fin)    &   ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℂ)    &   ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ≠ 0)    ⇒   ⊢ (𝜑 → ∏𝑘 ∈ 𝐴 𝐵 ≠ 0)
Theorem	fprodclf 15630*	Closure of a finite product of complex numbers. A version of fprodcl 15590 using bound-variable hypotheses instead of distinct variable conditions. (Contributed by Glauco Siliprandi, 5-Apr-2020.)
⊢ Ⅎ𝑘𝜑    &   ⊢ (𝜑 → 𝐴 ∈ Fin)    &   ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℂ)    ⇒   ⊢ (𝜑 → ∏𝑘 ∈ 𝐴 𝐵 ∈ ℂ)
Theorem	fprodge0 15631*	If all the terms of a finite product are nonnegative, so is the product. (Contributed by Glauco Siliprandi, 5-Apr-2020.)
⊢ Ⅎ𝑘𝜑    &   ⊢ (𝜑 → 𝐴 ∈ Fin)    &   ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℝ)    &   ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 0 ≤ 𝐵)    ⇒   ⊢ (𝜑 → 0 ≤ ∏𝑘 ∈ 𝐴 𝐵)
Theorem	fprodeq0g 15632*	Any finite product containing a zero term is itself zero. (Contributed by Glauco Siliprandi, 5-Apr-2020.)
⊢ Ⅎ𝑘𝜑    &   ⊢ (𝜑 → 𝐴 ∈ Fin)    &   ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℂ)    &   ⊢ (𝜑 → 𝐶 ∈ 𝐴)    &   ⊢ ((𝜑 ∧ 𝑘 = 𝐶) → 𝐵 = 0)    ⇒   ⊢ (𝜑 → ∏𝑘 ∈ 𝐴 𝐵 = 0)
Theorem	fprodge1 15633*	If all of the terms of a finite product are greater than or equal to 1, so is the product. (Contributed by Glauco Siliprandi, 5-Apr-2020.)
⊢ Ⅎ𝑘𝜑    &   ⊢ (𝜑 → 𝐴 ∈ Fin)    &   ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℝ)    &   ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 1 ≤ 𝐵)    ⇒   ⊢ (𝜑 → 1 ≤ ∏𝑘 ∈ 𝐴 𝐵)
Theorem	fprodle 15634*	If all the terms of two finite products are nonnegative and compare, so do the two products. (Contributed by Glauco Siliprandi, 5-Apr-2020.)
⊢ Ⅎ𝑘𝜑    &   ⊢ (𝜑 → 𝐴 ∈ Fin)    &   ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℝ)    &   ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 0 ≤ 𝐵)    &   ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐶 ∈ ℝ)    &   ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ≤ 𝐶)    ⇒   ⊢ (𝜑 → ∏𝑘 ∈ 𝐴 𝐵 ≤ ∏𝑘 ∈ 𝐴 𝐶)
Theorem	fprodmodd 15635*	If all factors of two finite products are equal modulo 𝑀, the products are equal modulo 𝑀. (Contributed by AV, 7-Jul-2021.)
⊢ (𝜑 → 𝐴 ∈ Fin)    &   ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℤ)    &   ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐶 ∈ ℤ)    &   ⊢ (𝜑 → 𝑀 ∈ ℕ)    &   ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → (𝐵 mod 𝑀) = (𝐶 mod 𝑀))    ⇒   ⊢ (𝜑 → (∏𝑘 ∈ 𝐴 𝐵 mod 𝑀) = (∏𝑘 ∈ 𝐴 𝐶 mod 𝑀))
5.10.12.5  Infinite products
Theorem	iprodclim 15636*	An infinite product equals the value its sequence converges to. (Contributed by Scott Fenton, 18-Dec-2017.)
⊢ 𝑍 = (ℤ≥‘𝑀)    &   ⊢ (𝜑 → 𝑀 ∈ ℤ)    &   ⊢ (𝜑 → ∃𝑛 ∈ 𝑍 ∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦))    &   ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) = 𝐴)    &   ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 𝐴 ∈ ℂ)    &   ⊢ (𝜑 → seq𝑀( · , 𝐹) ⇝ 𝐵)    ⇒   ⊢ (𝜑 → ∏𝑘 ∈ 𝑍 𝐴 = 𝐵)
Theorem	iprodclim2 15637*	A converging product converges to its infinite product. (Contributed by Scott Fenton, 18-Dec-2017.)
⊢ 𝑍 = (ℤ≥‘𝑀)    &   ⊢ (𝜑 → 𝑀 ∈ ℤ)    &   ⊢ (𝜑 → ∃𝑛 ∈ 𝑍 ∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦))    &   ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) = 𝐴)    &   ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 𝐴 ∈ ℂ)    ⇒   ⊢ (𝜑 → seq𝑀( · , 𝐹) ⇝ ∏𝑘 ∈ 𝑍 𝐴)
Theorem	iprodclim3 15638*	The sequence of partial finite product of a converging infinite product converge to the infinite product of the series. Note that 𝑗 must not occur in 𝐴. (Contributed by Scott Fenton, 18-Dec-2017.)
⊢ 𝑍 = (ℤ≥‘𝑀)    &   ⊢ (𝜑 → 𝑀 ∈ ℤ)    &   ⊢ (𝜑 → ∃𝑛 ∈ 𝑍 ∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , (𝑘 ∈ 𝑍 ↦ 𝐴)) ⇝ 𝑦))    &   ⊢ (𝜑 → 𝐹 ∈ dom ⇝ )    &   ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 𝐴 ∈ ℂ)    &   ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → (𝐹‘𝑗) = ∏𝑘 ∈ (𝑀...𝑗)𝐴)    ⇒   ⊢ (𝜑 → 𝐹 ⇝ ∏𝑘 ∈ 𝑍 𝐴)
Theorem	iprodcl 15639*	The product of a non-trivially converging infinite sequence is a complex number. (Contributed by Scott Fenton, 18-Dec-2017.)
⊢ 𝑍 = (ℤ≥‘𝑀)    &   ⊢ (𝜑 → 𝑀 ∈ ℤ)    &   ⊢ (𝜑 → ∃𝑛 ∈ 𝑍 ∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦))    &   ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) = 𝐴)    &   ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 𝐴 ∈ ℂ)    ⇒   ⊢ (𝜑 → ∏𝑘 ∈ 𝑍 𝐴 ∈ ℂ)
Theorem	iprodrecl 15640*	The product of a non-trivially converging infinite real sequence is a real number. (Contributed by Scott Fenton, 18-Dec-2017.)
⊢ 𝑍 = (ℤ≥‘𝑀)    &   ⊢ (𝜑 → 𝑀 ∈ ℤ)    &   ⊢ (𝜑 → ∃𝑛 ∈ 𝑍 ∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦))    &   ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) = 𝐴)    &   ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 𝐴 ∈ ℝ)    ⇒   ⊢ (𝜑 → ∏𝑘 ∈ 𝑍 𝐴 ∈ ℝ)
Theorem	iprodmul 15641*	Multiplication of infinite sums. (Contributed by Scott Fenton, 18-Dec-2017.)
⊢ 𝑍 = (ℤ≥‘𝑀)    &   ⊢ (𝜑 → 𝑀 ∈ ℤ)    &   ⊢ (𝜑 → ∃𝑛 ∈ 𝑍 ∃𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦))    &   ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) = 𝐴)    &   ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 𝐴 ∈ ℂ)    &   ⊢ (𝜑 → ∃𝑚 ∈ 𝑍 ∃𝑧(𝑧 ≠ 0 ∧ seq𝑚( · , 𝐺) ⇝ 𝑧))    &   ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐺‘𝑘) = 𝐵)    &   ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 𝐵 ∈ ℂ)    ⇒   ⊢ (𝜑 → ∏𝑘 ∈ 𝑍 (𝐴 · 𝐵) = (∏𝑘 ∈ 𝑍 𝐴 · ∏𝑘 ∈ 𝑍 𝐵))
5.10.13  Falling and Rising Factorial
Syntax	cfallfac 15642	Declare the syntax for the falling factorial.
class FallFac
Syntax	crisefac 15643	Declare the syntax for the rising factorial.
class RiseFac
Definition	df-risefac 15644*	Define the rising factorial function. This is the function (𝐴 · (𝐴 + 1) · ...(𝐴 + 𝑁)) for complex 𝐴 and nonnegative integers 𝑁. (Contributed by Scott Fenton, 5-Jan-2018.)
⊢ RiseFac = (𝑥 ∈ ℂ, 𝑛 ∈ ℕ0 ↦ ∏𝑘 ∈ (0...(𝑛 − 1))(𝑥 + 𝑘))
Definition	df-fallfac 15645*	Define the falling factorial function. This is the function (𝐴 · (𝐴 − 1) · ...(𝐴 − 𝑁)) for complex 𝐴 and nonnegative integers 𝑁. (Contributed by Scott Fenton, 5-Jan-2018.)
⊢ FallFac = (𝑥 ∈ ℂ, 𝑛 ∈ ℕ0 ↦ ∏𝑘 ∈ (0...(𝑛 − 1))(𝑥 − 𝑘))
Theorem	risefacval 15646*	The value of the rising factorial function. (Contributed by Scott Fenton, 5-Jan-2018.)
⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (𝐴 RiseFac 𝑁) = ∏𝑘 ∈ (0...(𝑁 − 1))(𝐴 + 𝑘))
Theorem	fallfacval 15647*	The value of the falling factorial function. (Contributed by Scott Fenton, 5-Jan-2018.)
⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (𝐴 FallFac 𝑁) = ∏𝑘 ∈ (0...(𝑁 − 1))(𝐴 − 𝑘))
Theorem	risefacval2 15648*	One-based value of rising factorial. (Contributed by Scott Fenton, 15-Jan-2018.)
⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (𝐴 RiseFac 𝑁) = ∏𝑘 ∈ (1...𝑁)(𝐴 + (𝑘 − 1)))
Theorem	fallfacval2 15649*	One-based value of falling factorial. (Contributed by Scott Fenton, 15-Jan-2018.)
⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (𝐴 FallFac 𝑁) = ∏𝑘 ∈ (1...𝑁)(𝐴 − (𝑘 − 1)))
Theorem	fallfacval3 15650*	A product representation of falling factorial when 𝐴 is a nonnegative integer. (Contributed by Scott Fenton, 20-Mar-2018.)
⊢ (𝑁 ∈ (0...𝐴) → (𝐴 FallFac 𝑁) = ∏𝑘 ∈ ((𝐴 − (𝑁 − 1))...𝐴)𝑘)
Theorem	risefaccllem 15651*	Lemma for rising factorial closure laws. (Contributed by Scott Fenton, 5-Jan-2018.)
⊢ 𝑆 ⊆ ℂ    &   ⊢ 1 ∈ 𝑆    &   ⊢ ((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → (𝑥 · 𝑦) ∈ 𝑆)    &   ⊢ ((𝐴 ∈ 𝑆 ∧ 𝑘 ∈ ℕ0) → (𝐴 + 𝑘) ∈ 𝑆)    ⇒   ⊢ ((𝐴 ∈ 𝑆 ∧ 𝑁 ∈ ℕ0) → (𝐴 RiseFac 𝑁) ∈ 𝑆)
Theorem	fallfaccllem 15652*	Lemma for falling factorial closure laws. (Contributed by Scott Fenton, 5-Jan-2018.)
⊢ 𝑆 ⊆ ℂ    &   ⊢ 1 ∈ 𝑆    &   ⊢ ((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → (𝑥 · 𝑦) ∈ 𝑆)    &   ⊢ ((𝐴 ∈ 𝑆 ∧ 𝑘 ∈ ℕ0) → (𝐴 − 𝑘) ∈ 𝑆)    ⇒   ⊢ ((𝐴 ∈ 𝑆 ∧ 𝑁 ∈ ℕ0) → (𝐴 FallFac 𝑁) ∈ 𝑆)
Theorem	risefaccl 15653	Closure law for rising factorial. (Contributed by Scott Fenton, 5-Jan-2018.)
⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (𝐴 RiseFac 𝑁) ∈ ℂ)
Theorem	fallfaccl 15654	Closure law for falling factorial. (Contributed by Scott Fenton, 5-Jan-2018.)
⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (𝐴 FallFac 𝑁) ∈ ℂ)
Theorem	rerisefaccl 15655	Closure law for rising factorial. (Contributed by Scott Fenton, 5-Jan-2018.)
⊢ ((𝐴 ∈ ℝ ∧ 𝑁 ∈ ℕ0) → (𝐴 RiseFac 𝑁) ∈ ℝ)
Theorem	refallfaccl 15656	Closure law for falling factorial. (Contributed by Scott Fenton, 5-Jan-2018.)
⊢ ((𝐴 ∈ ℝ ∧ 𝑁 ∈ ℕ0) → (𝐴 FallFac 𝑁) ∈ ℝ)
Theorem	nnrisefaccl 15657	Closure law for rising factorial. (Contributed by Scott Fenton, 5-Jan-2018.)
⊢ ((𝐴 ∈ ℕ ∧ 𝑁 ∈ ℕ0) → (𝐴 RiseFac 𝑁) ∈ ℕ)
Theorem	zrisefaccl 15658	Closure law for rising factorial. (Contributed by Scott Fenton, 5-Jan-2018.)
⊢ ((𝐴 ∈ ℤ ∧ 𝑁 ∈ ℕ0) → (𝐴 RiseFac 𝑁) ∈ ℤ)
Theorem	zfallfaccl 15659	Closure law for falling factorial. (Contributed by Scott Fenton, 5-Jan-2018.)
⊢ ((𝐴 ∈ ℤ ∧ 𝑁 ∈ ℕ0) → (𝐴 FallFac 𝑁) ∈ ℤ)
Theorem	nn0risefaccl 15660	Closure law for rising factorial. (Contributed by Scott Fenton, 5-Jan-2018.)
⊢ ((𝐴 ∈ ℕ0 ∧ 𝑁 ∈ ℕ0) → (𝐴 RiseFac 𝑁) ∈ ℕ0)
Theorem	rprisefaccl 15661	Closure law for rising factorial. (Contributed by Scott Fenton, 9-Jan-2018.)
⊢ ((𝐴 ∈ ℝ+ ∧ 𝑁 ∈ ℕ0) → (𝐴 RiseFac 𝑁) ∈ ℝ+)
Theorem	risefallfac 15662	A relationship between rising and falling factorials. (Contributed by Scott Fenton, 15-Jan-2018.)
⊢ ((𝑋 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (𝑋 RiseFac 𝑁) = ((-1↑𝑁) · (-𝑋 FallFac 𝑁)))
Theorem	fallrisefac 15663	A relationship between falling and rising factorials. (Contributed by Scott Fenton, 17-Jan-2018.)
⊢ ((𝑋 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (𝑋 FallFac 𝑁) = ((-1↑𝑁) · (-𝑋 RiseFac 𝑁)))
Theorem	risefall0lem 15664	Lemma for risefac0 15665 and fallfac0 15666. Show a particular set of finite integers is empty. (Contributed by Scott Fenton, 5-Jan-2018.)
⊢ (0...(0 − 1)) = ∅
Theorem	risefac0 15665	The value of the rising factorial when 𝑁 = 0. (Contributed by Scott Fenton, 5-Jan-2018.)
⊢ (𝐴 ∈ ℂ → (𝐴 RiseFac 0) = 1)
Theorem	fallfac0 15666	The value of the falling factorial when 𝑁 = 0. (Contributed by Scott Fenton, 5-Jan-2018.)
⊢ (𝐴 ∈ ℂ → (𝐴 FallFac 0) = 1)
Theorem	risefacp1 15667	The value of the rising factorial at a successor. (Contributed by Scott Fenton, 5-Jan-2018.)
⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (𝐴 RiseFac (𝑁 + 1)) = ((𝐴 RiseFac 𝑁) · (𝐴 + 𝑁)))
Theorem	fallfacp1 15668	The value of the falling factorial at a successor. (Contributed by Scott Fenton, 5-Jan-2018.)
⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (𝐴 FallFac (𝑁 + 1)) = ((𝐴 FallFac 𝑁) · (𝐴 − 𝑁)))
Theorem	risefacp1d 15669	The value of the rising factorial at a successor. (Contributed by Scott Fenton, 19-Mar-2018.)
⊢ (𝜑 → 𝐴 ∈ ℂ)    &   ⊢ (𝜑 → 𝑁 ∈ ℕ0)    ⇒   ⊢ (𝜑 → (𝐴 RiseFac (𝑁 + 1)) = ((𝐴 RiseFac 𝑁) · (𝐴 + 𝑁)))
Theorem	fallfacp1d 15670	The value of the falling factorial at a successor. (Contributed by Scott Fenton, 19-Mar-2018.)
⊢ (𝜑 → 𝐴 ∈ ℂ)    &   ⊢ (𝜑 → 𝑁 ∈ ℕ0)    ⇒   ⊢ (𝜑 → (𝐴 FallFac (𝑁 + 1)) = ((𝐴 FallFac 𝑁) · (𝐴 − 𝑁)))
Theorem	risefac1 15671	The value of rising factorial at one. (Contributed by Scott Fenton, 5-Jan-2018.)
⊢ (𝐴 ∈ ℂ → (𝐴 RiseFac 1) = 𝐴)
Theorem	fallfac1 15672	The value of falling factorial at one. (Contributed by Scott Fenton, 5-Jan-2018.)
⊢ (𝐴 ∈ ℂ → (𝐴 FallFac 1) = 𝐴)
Theorem	risefacfac 15673	Relate rising factorial to factorial. (Contributed by Scott Fenton, 5-Jan-2018.)
⊢ (𝑁 ∈ ℕ0 → (1 RiseFac 𝑁) = (!‘𝑁))
Theorem	fallfacfwd 15674	The forward difference of a falling factorial. (Contributed by Scott Fenton, 21-Jan-2018.)
⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → (((𝐴 + 1) FallFac 𝑁) − (𝐴 FallFac 𝑁)) = (𝑁 · (𝐴 FallFac (𝑁 − 1))))
Theorem	0fallfac 15675	The value of the zero falling factorial at natural 𝑁. (Contributed by Scott Fenton, 17-Feb-2018.)
⊢ (𝑁 ∈ ℕ → (0 FallFac 𝑁) = 0)
Theorem	0risefac 15676	The value of the zero rising factorial at natural 𝑁. (Contributed by Scott Fenton, 17-Feb-2018.)
⊢ (𝑁 ∈ ℕ → (0 RiseFac 𝑁) = 0)
Theorem	binomfallfaclem1 15677	Lemma for binomfallfac 15679. Closure law. (Contributed by Scott Fenton, 13-Mar-2018.)
⊢ (𝜑 → 𝐴 ∈ ℂ)    &   ⊢ (𝜑 → 𝐵 ∈ ℂ)    &   ⊢ (𝜑 → 𝑁 ∈ ℕ0)    ⇒   ⊢ ((𝜑 ∧ 𝐾 ∈ (0...𝑁)) → ((𝑁C𝐾) · ((𝐴 FallFac (𝑁 − 𝐾)) · (𝐵 FallFac (𝐾 + 1)))) ∈ ℂ)
Theorem	binomfallfaclem2 15678*	Lemma for binomfallfac 15679. Inductive step. (Contributed by Scott Fenton, 13-Mar-2018.)
⊢ (𝜑 → 𝐴 ∈ ℂ)    &   ⊢ (𝜑 → 𝐵 ∈ ℂ)    &   ⊢ (𝜑 → 𝑁 ∈ ℕ0)    &   ⊢ (𝜓 → ((𝐴 + 𝐵) FallFac 𝑁) = Σ𝑘 ∈ (0...𝑁)((𝑁C𝑘) · ((𝐴 FallFac (𝑁 − 𝑘)) · (𝐵 FallFac 𝑘))))    ⇒   ⊢ ((𝜑 ∧ 𝜓) → ((𝐴 + 𝐵) FallFac (𝑁 + 1)) = Σ𝑘 ∈ (0...(𝑁 + 1))(((𝑁 + 1)C𝑘) · ((𝐴 FallFac ((𝑁 + 1) − 𝑘)) · (𝐵 FallFac 𝑘))))
Theorem	binomfallfac 15679*	A version of the binomial theorem using falling factorials instead of exponentials. (Contributed by Scott Fenton, 13-Mar-2018.)
⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → ((𝐴 + 𝐵) FallFac 𝑁) = Σ𝑘 ∈ (0...𝑁)((𝑁C𝑘) · ((𝐴 FallFac (𝑁 − 𝑘)) · (𝐵 FallFac 𝑘))))
Theorem	binomrisefac 15680*	A version of the binomial theorem using rising factorials instead of exponentials. (Contributed by Scott Fenton, 16-Mar-2018.)
⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → ((𝐴 + 𝐵) RiseFac 𝑁) = Σ𝑘 ∈ (0...𝑁)((𝑁C𝑘) · ((𝐴 RiseFac (𝑁 − 𝑘)) · (𝐵 RiseFac 𝑘))))
Theorem	fallfacval4 15681	Represent the falling factorial via factorials when the first argument is a natural. (Contributed by Scott Fenton, 20-Mar-2018.)
⊢ (𝑁 ∈ (0...𝐴) → (𝐴 FallFac 𝑁) = ((!‘𝐴) / (!‘(𝐴 − 𝑁))))
Theorem	bcfallfac 15682	Binomial coefficient in terms of falling factorials. (Contributed by Scott Fenton, 20-Mar-2018.)
⊢ (𝐾 ∈ (0...𝑁) → (𝑁C𝐾) = ((𝑁 FallFac 𝐾) / (!‘𝐾)))
Theorem	fallfacfac 15683	Relate falling factorial to factorial. (Contributed by Scott Fenton, 5-Jan-2018.)
⊢ (𝑁 ∈ ℕ0 → (𝑁 FallFac 𝑁) = (!‘𝑁))
5.10.14  Bernoulli polynomials and sums of k-th powers
Syntax	cbp 15684	Declare the constant for the Bernoulli polynomial operator.
class BernPoly
Definition	df-bpoly 15685*	Define the Bernoulli polynomials. Here we use well-founded recursion to define the Bernoulli polynomials. This agrees with most textbook definitions, although explicit formulas do exist. (Contributed by Scott Fenton, 22-May-2014.)
⊢ BernPoly = (𝑚 ∈ ℕ0, 𝑥 ∈ ℂ ↦ (wrecs( < , ℕ0, (𝑔 ∈ V ↦ ⦋(♯‘dom 𝑔) / 𝑛⦌((𝑥↑𝑛) − Σ𝑘 ∈ dom 𝑔((𝑛C𝑘) · ((𝑔‘𝑘) / ((𝑛 − 𝑘) + 1))))))‘𝑚))
Theorem	bpolylem 15686*	Lemma for bpolyval 15687. (Contributed by Scott Fenton, 22-May-2014.) (Revised by Mario Carneiro, 23-Aug-2014.)
⊢ 𝐺 = (𝑔 ∈ V ↦ ⦋(♯‘dom 𝑔) / 𝑛⦌((𝑋↑𝑛) − Σ𝑘 ∈ dom 𝑔((𝑛C𝑘) · ((𝑔‘𝑘) / ((𝑛 − 𝑘) + 1)))))    &   ⊢ 𝐹 = wrecs( < , ℕ0, 𝐺)    ⇒   ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑋 ∈ ℂ) → (𝑁 BernPoly 𝑋) = ((𝑋↑𝑁) − Σ𝑘 ∈ (0...(𝑁 − 1))((𝑁C𝑘) · ((𝑘 BernPoly 𝑋) / ((𝑁 − 𝑘) + 1)))))
Theorem	bpolyval 15687*	The value of the Bernoulli polynomials. (Contributed by Scott Fenton, 16-May-2014.)
⊢ ((𝑁 ∈ ℕ0 ∧ 𝑋 ∈ ℂ) → (𝑁 BernPoly 𝑋) = ((𝑋↑𝑁) − Σ𝑘 ∈ (0...(𝑁 − 1))((𝑁C𝑘) · ((𝑘 BernPoly 𝑋) / ((𝑁 − 𝑘) + 1)))))
Theorem	bpoly0 15688	The value of the Bernoulli polynomials at zero. (Contributed by Scott Fenton, 16-May-2014.)
⊢ (𝑋 ∈ ℂ → (0 BernPoly 𝑋) = 1)
Theorem	bpoly1 15689	The value of the Bernoulli polynomials at one. (Contributed by Scott Fenton, 16-May-2014.)
⊢ (𝑋 ∈ ℂ → (1 BernPoly 𝑋) = (𝑋 − (1 / 2)))
Theorem	bpolycl 15690	Closure law for Bernoulli polynomials. (Contributed by Scott Fenton, 16-May-2014.) (Proof shortened by Mario Carneiro, 22-May-2014.)
⊢ ((𝑁 ∈ ℕ0 ∧ 𝑋 ∈ ℂ) → (𝑁 BernPoly 𝑋) ∈ ℂ)
Theorem	bpolysum 15691*	A sum for Bernoulli polynomials. (Contributed by Scott Fenton, 16-May-2014.) (Proof shortened by Mario Carneiro, 22-May-2014.)
⊢ ((𝑁 ∈ ℕ0 ∧ 𝑋 ∈ ℂ) → Σ𝑘 ∈ (0...𝑁)((𝑁C𝑘) · ((𝑘 BernPoly 𝑋) / ((𝑁 − 𝑘) + 1))) = (𝑋↑𝑁))
Theorem	bpolydiflem 15692*	Lemma for bpolydif 15693. (Contributed by Scott Fenton, 12-Jun-2014.)
⊢ (𝜑 → 𝑁 ∈ ℕ)    &   ⊢ (𝜑 → 𝑋 ∈ ℂ)    &   ⊢ ((𝜑 ∧ 𝑘 ∈ (1...(𝑁 − 1))) → ((𝑘 BernPoly (𝑋 + 1)) − (𝑘 BernPoly 𝑋)) = (𝑘 · (𝑋↑(𝑘 − 1))))    ⇒   ⊢ (𝜑 → ((𝑁 BernPoly (𝑋 + 1)) − (𝑁 BernPoly 𝑋)) = (𝑁 · (𝑋↑(𝑁 − 1))))
Theorem	bpolydif 15693	Calculate the difference between successive values of the Bernoulli polynomials. (Contributed by Scott Fenton, 16-May-2014.) (Proof shortened by Mario Carneiro, 26-May-2014.)
⊢ ((𝑁 ∈ ℕ ∧ 𝑋 ∈ ℂ) → ((𝑁 BernPoly (𝑋 + 1)) − (𝑁 BernPoly 𝑋)) = (𝑁 · (𝑋↑(𝑁 − 1))))
Theorem	fsumkthpow 15694*	A closed-form expression for the sum of 𝐾-th powers. (Contributed by Scott Fenton, 16-May-2014.) This is Metamath 100 proof #77. (Revised by Mario Carneiro, 16-Jun-2014.)
⊢ ((𝐾 ∈ ℕ0 ∧ 𝑀 ∈ ℕ0) → Σ𝑛 ∈ (0...𝑀)(𝑛↑𝐾) = ((((𝐾 + 1) BernPoly (𝑀 + 1)) − ((𝐾 + 1) BernPoly 0)) / (𝐾 + 1)))
Theorem	bpoly2 15695	The Bernoulli polynomials at two. (Contributed by Scott Fenton, 8-Jul-2015.)
⊢ (𝑋 ∈ ℂ → (2 BernPoly 𝑋) = (((𝑋↑2) − 𝑋) + (1 / 6)))
Theorem	bpoly3 15696	The Bernoulli polynomials at three. (Contributed by Scott Fenton, 8-Jul-2015.)
⊢ (𝑋 ∈ ℂ → (3 BernPoly 𝑋) = (((𝑋↑3) − ((3 / 2) · (𝑋↑2))) + ((1 / 2) · 𝑋)))
Theorem	bpoly4 15697	The Bernoulli polynomials at four. (Contributed by Scott Fenton, 8-Jul-2015.)
⊢ (𝑋 ∈ ℂ → (4 BernPoly 𝑋) = ((((𝑋↑4) − (2 · (𝑋↑3))) + (𝑋↑2)) − (1 / ;30)))
Theorem	fsumcube 15698*	Express the sum of cubes in closed terms. (Contributed by Scott Fenton, 16-Jun-2015.)
⊢ (𝑇 ∈ ℕ0 → Σ𝑘 ∈ (0...𝑇)(𝑘↑3) = (((𝑇↑2) · ((𝑇 + 1)↑2)) / 4))
5.11  Elementary trigonometry
5.11.1  The exponential, sine, and cosine functions
Syntax	ce 15699	Extend class notation to include the exponential function.
class exp
Syntax	ceu 15700	Extend class notation to include Euler's constant e = 2.71828....
class e