Home Metamath Proof ExplorerTheorem List (p. 154 of 449) < Previous  Next > Bad symbols? Try the GIF version. Mirrors  >  Metamath Home Page  >  MPE Home Page  >  Theorem List Contents  >  Recent Proofs       This page: Page List

 Color key: Metamath Proof Explorer (1-28687) Hilbert Space Explorer (28688-30210) Users' Mathboxes (30211-44891)

Theorem List for Metamath Proof Explorer - 15301-15400   *Has distinct variable group(s)
TypeLabelDescription
Statement

Theoremfprodnncl 15301* Closure of a finite product of positive integers. (Contributed by Scott Fenton, 14-Dec-2017.)
(𝜑𝐴 ∈ Fin)    &   ((𝜑𝑘𝐴) → 𝐵 ∈ ℕ)       (𝜑 → ∏𝑘𝐴 𝐵 ∈ ℕ)

Theoremfprodrpcl 15302* Closure of a finite product of positive reals. (Contributed by Scott Fenton, 14-Dec-2017.)
(𝜑𝐴 ∈ Fin)    &   ((𝜑𝑘𝐴) → 𝐵 ∈ ℝ+)       (𝜑 → ∏𝑘𝐴 𝐵 ∈ ℝ+)

Theoremfprodnn0cl 15303* Closure of a finite product of nonnegative integers. (Contributed by Scott Fenton, 14-Dec-2017.)
(𝜑𝐴 ∈ Fin)    &   ((𝜑𝑘𝐴) → 𝐵 ∈ ℕ0)       (𝜑 → ∏𝑘𝐴 𝐵 ∈ ℕ0)

Theoremfprodcllemf 15304* Finite product closure lemma. A version of fprodcllem 15297 using bound-variable hypotheses instead of distinct variable conditions. (Contributed by Glauco Siliprandi, 5-Apr-2020.)
𝑘𝜑    &   (𝜑𝑆 ⊆ ℂ)    &   ((𝜑 ∧ (𝑥𝑆𝑦𝑆)) → (𝑥 · 𝑦) ∈ 𝑆)    &   (𝜑𝐴 ∈ Fin)    &   ((𝜑𝑘𝐴) → 𝐵𝑆)    &   (𝜑 → 1 ∈ 𝑆)       (𝜑 → ∏𝑘𝐴 𝐵𝑆)

Theoremfprodreclf 15305* Closure of a finite product of real numbers. A version of fprodrecl 15299 using bound-variable hypotheses instead of distinct variable conditions. (Contributed by Glauco Siliprandi, 5-Apr-2020.)
𝑘𝜑    &   (𝜑𝐴 ∈ Fin)    &   ((𝜑𝑘𝐴) → 𝐵 ∈ ℝ)       (𝜑 → ∏𝑘𝐴 𝐵 ∈ ℝ)

Theoremfprodmul 15306* The product of two finite products. (Contributed by Scott Fenton, 14-Dec-2017.)
(𝜑𝐴 ∈ Fin)    &   ((𝜑𝑘𝐴) → 𝐵 ∈ ℂ)    &   ((𝜑𝑘𝐴) → 𝐶 ∈ ℂ)       (𝜑 → ∏𝑘𝐴 (𝐵 · 𝐶) = (∏𝑘𝐴 𝐵 · ∏𝑘𝐴 𝐶))

Theoremfproddiv 15307* The quotient of two finite products. (Contributed by Scott Fenton, 15-Jan-2018.)
(𝜑𝐴 ∈ Fin)    &   ((𝜑𝑘𝐴) → 𝐵 ∈ ℂ)    &   ((𝜑𝑘𝐴) → 𝐶 ∈ ℂ)    &   ((𝜑𝑘𝐴) → 𝐶 ≠ 0)       (𝜑 → ∏𝑘𝐴 (𝐵 / 𝐶) = (∏𝑘𝐴 𝐵 / ∏𝑘𝐴 𝐶))

Theoremprodsn 15308* A product of a singleton is the term. (Contributed by Scott Fenton, 14-Dec-2017.)
(𝑘 = 𝑀𝐴 = 𝐵)       ((𝑀𝑉𝐵 ∈ ℂ) → ∏𝑘 ∈ {𝑀}𝐴 = 𝐵)

Theoremfprod1 15309* A finite product of only one term is the term itself. (Contributed by Scott Fenton, 14-Dec-2017.)
(𝑘 = 𝑀𝐴 = 𝐵)       ((𝑀 ∈ ℤ ∧ 𝐵 ∈ ℂ) → ∏𝑘 ∈ (𝑀...𝑀)𝐴 = 𝐵)

Theoremprodsnf 15310* A product of a singleton is the term. A version of prodsn 15308 using bound-variable hypotheses instead of distinct variable conditions. (Contributed by Glauco Siliprandi, 5-Apr-2020.)
𝑘𝐵    &   (𝑘 = 𝑀𝐴 = 𝐵)       ((𝑀𝑉𝐵 ∈ ℂ) → ∏𝑘 ∈ {𝑀}𝐴 = 𝐵)

Theoremclimprod1 15311 The limit of a product over one. (Contributed by Scott Fenton, 15-Dec-2017.)
𝑍 = (ℤ𝑀)    &   (𝜑𝑀 ∈ ℤ)       (𝜑 → seq𝑀( · , (𝑍 × {1})) ⇝ 1)

Theoremfprodsplit 15312* Split a finite product into two parts. (Contributed by Scott Fenton, 16-Dec-2017.)
(𝜑 → (𝐴𝐵) = ∅)    &   (𝜑𝑈 = (𝐴𝐵))    &   (𝜑𝑈 ∈ Fin)    &   ((𝜑𝑘𝑈) → 𝐶 ∈ ℂ)       (𝜑 → ∏𝑘𝑈 𝐶 = (∏𝑘𝐴 𝐶 · ∏𝑘𝐵 𝐶))

Theoremfprodm1 15313* Separate out the last term in a finite product. (Contributed by Scott Fenton, 16-Dec-2017.)
(𝜑𝑁 ∈ (ℤ𝑀))    &   ((𝜑𝑘 ∈ (𝑀...𝑁)) → 𝐴 ∈ ℂ)    &   (𝑘 = 𝑁𝐴 = 𝐵)       (𝜑 → ∏𝑘 ∈ (𝑀...𝑁)𝐴 = (∏𝑘 ∈ (𝑀...(𝑁 − 1))𝐴 · 𝐵))

Theoremfprod1p 15314* Separate out the first term in a finite product. (Contributed by Scott Fenton, 24-Dec-2017.)
(𝜑𝑁 ∈ (ℤ𝑀))    &   ((𝜑𝑘 ∈ (𝑀...𝑁)) → 𝐴 ∈ ℂ)    &   (𝑘 = 𝑀𝐴 = 𝐵)       (𝜑 → ∏𝑘 ∈ (𝑀...𝑁)𝐴 = (𝐵 · ∏𝑘 ∈ ((𝑀 + 1)...𝑁)𝐴))

Theoremfprodp1 15315* Multiply in the last term in a finite product. (Contributed by Scott Fenton, 24-Dec-2017.)
(𝜑𝑁 ∈ (ℤ𝑀))    &   ((𝜑𝑘 ∈ (𝑀...(𝑁 + 1))) → 𝐴 ∈ ℂ)    &   (𝑘 = (𝑁 + 1) → 𝐴 = 𝐵)       (𝜑 → ∏𝑘 ∈ (𝑀...(𝑁 + 1))𝐴 = (∏𝑘 ∈ (𝑀...𝑁)𝐴 · 𝐵))

Theoremfprodm1s 15316* Separate out the last term in a finite product. (Contributed by Scott Fenton, 27-Dec-2017.)
(𝜑𝑁 ∈ (ℤ𝑀))    &   ((𝜑𝑘 ∈ (𝑀...𝑁)) → 𝐴 ∈ ℂ)       (𝜑 → ∏𝑘 ∈ (𝑀...𝑁)𝐴 = (∏𝑘 ∈ (𝑀...(𝑁 − 1))𝐴 · 𝑁 / 𝑘𝐴))

Theoremfprodp1s 15317* Multiply in the last term in a finite product. (Contributed by Scott Fenton, 27-Dec-2017.)
(𝜑𝑁 ∈ (ℤ𝑀))    &   ((𝜑𝑘 ∈ (𝑀...(𝑁 + 1))) → 𝐴 ∈ ℂ)       (𝜑 → ∏𝑘 ∈ (𝑀...(𝑁 + 1))𝐴 = (∏𝑘 ∈ (𝑀...𝑁)𝐴 · (𝑁 + 1) / 𝑘𝐴))

Theoremprodsns 15318* A product of the singleton is the term. (Contributed by Scott Fenton, 25-Dec-2017.)
((𝑀𝑉𝑀 / 𝑘𝐴 ∈ ℂ) → ∏𝑘 ∈ {𝑀}𝐴 = 𝑀 / 𝑘𝐴)

Theoremfprodfac 15319* Factorial using product notation. (Contributed by Scott Fenton, 15-Dec-2017.)
(𝐴 ∈ ℕ0 → (!‘𝐴) = ∏𝑘 ∈ (1...𝐴)𝑘)

Theoremfprodabs 15320* The absolute value of a finite product. (Contributed by Scott Fenton, 25-Dec-2017.)
𝑍 = (ℤ𝑀)    &   (𝜑𝑁𝑍)    &   ((𝜑𝑘𝑍) → 𝐴 ∈ ℂ)       (𝜑 → (abs‘∏𝑘 ∈ (𝑀...𝑁)𝐴) = ∏𝑘 ∈ (𝑀...𝑁)(abs‘𝐴))

Theoremfprodeq0 15321* Anything finite product containing a zero term is itself zero. (Contributed by Scott Fenton, 27-Dec-2017.)
𝑍 = (ℤ𝑀)    &   (𝜑𝑁𝑍)    &   ((𝜑𝑘𝑍) → 𝐴 ∈ ℂ)    &   ((𝜑𝑘 = 𝑁) → 𝐴 = 0)       ((𝜑𝐾 ∈ (ℤ𝑁)) → ∏𝑘 ∈ (𝑀...𝐾)𝐴 = 0)

Theoremfprodshft 15322* Shift the index of a finite product. (Contributed by Scott Fenton, 5-Jan-2018.)
(𝜑𝐾 ∈ ℤ)    &   (𝜑𝑀 ∈ ℤ)    &   (𝜑𝑁 ∈ ℤ)    &   ((𝜑𝑗 ∈ (𝑀...𝑁)) → 𝐴 ∈ ℂ)    &   (𝑗 = (𝑘𝐾) → 𝐴 = 𝐵)       (𝜑 → ∏𝑗 ∈ (𝑀...𝑁)𝐴 = ∏𝑘 ∈ ((𝑀 + 𝐾)...(𝑁 + 𝐾))𝐵)

Theoremfprodrev 15323* Reversal of a finite product. (Contributed by Scott Fenton, 5-Jan-2018.)
(𝜑𝐾 ∈ ℤ)    &   (𝜑𝑀 ∈ ℤ)    &   (𝜑𝑁 ∈ ℤ)    &   ((𝜑𝑗 ∈ (𝑀...𝑁)) → 𝐴 ∈ ℂ)    &   (𝑗 = (𝐾𝑘) → 𝐴 = 𝐵)       (𝜑 → ∏𝑗 ∈ (𝑀...𝑁)𝐴 = ∏𝑘 ∈ ((𝐾𝑁)...(𝐾𝑀))𝐵)

Theoremfprodconst 15324* The product of constant terms (𝑘 is not free in 𝐵.) (Contributed by Scott Fenton, 12-Jan-2018.)
((𝐴 ∈ Fin ∧ 𝐵 ∈ ℂ) → ∏𝑘𝐴 𝐵 = (𝐵↑(♯‘𝐴)))

Theoremfprodn0 15325* A finite product of nonzero terms is nonzero. (Contributed by Scott Fenton, 15-Jan-2018.)
(𝜑𝐴 ∈ Fin)    &   ((𝜑𝑘𝐴) → 𝐵 ∈ ℂ)    &   ((𝜑𝑘𝐴) → 𝐵 ≠ 0)       (𝜑 → ∏𝑘𝐴 𝐵 ≠ 0)

Theoremfprod2dlem 15326* Lemma for fprod2d 15327- induction step. (Contributed by Scott Fenton, 30-Jan-2018.)
(𝑧 = ⟨𝑗, 𝑘⟩ → 𝐷 = 𝐶)    &   (𝜑𝐴 ∈ Fin)    &   ((𝜑𝑗𝐴) → 𝐵 ∈ Fin)    &   ((𝜑 ∧ (𝑗𝐴𝑘𝐵)) → 𝐶 ∈ ℂ)    &   (𝜑 → ¬ 𝑦𝑥)    &   (𝜑 → (𝑥 ∪ {𝑦}) ⊆ 𝐴)    &   (𝜓 ↔ ∏𝑗𝑥𝑘𝐵 𝐶 = ∏𝑧 𝑗𝑥 ({𝑗} × 𝐵)𝐷)       ((𝜑𝜓) → ∏𝑗 ∈ (𝑥 ∪ {𝑦})∏𝑘𝐵 𝐶 = ∏𝑧 𝑗 ∈ (𝑥 ∪ {𝑦})({𝑗} × 𝐵)𝐷)

Theoremfprod2d 15327* Write a double product as a product over a two-dimensional region. Compare fsum2d 15118. (Contributed by Scott Fenton, 30-Jan-2018.)
(𝑧 = ⟨𝑗, 𝑘⟩ → 𝐷 = 𝐶)    &   (𝜑𝐴 ∈ Fin)    &   ((𝜑𝑗𝐴) → 𝐵 ∈ Fin)    &   ((𝜑 ∧ (𝑗𝐴𝑘𝐵)) → 𝐶 ∈ ℂ)       (𝜑 → ∏𝑗𝐴𝑘𝐵 𝐶 = ∏𝑧 𝑗𝐴 ({𝑗} × 𝐵)𝐷)

Theoremfprodxp 15328* Combine two products into a single product over the cartesian product. (Contributed by Scott Fenton, 1-Feb-2018.)
(𝑧 = ⟨𝑗, 𝑘⟩ → 𝐷 = 𝐶)    &   (𝜑𝐴 ∈ Fin)    &   (𝜑𝐵 ∈ Fin)    &   ((𝜑 ∧ (𝑗𝐴𝑘𝐵)) → 𝐶 ∈ ℂ)       (𝜑 → ∏𝑗𝐴𝑘𝐵 𝐶 = ∏𝑧 ∈ (𝐴 × 𝐵)𝐷)

Theoremfprodcnv 15329* Transform a product region using the converse operation. (Contributed by Scott Fenton, 1-Feb-2018.)
(𝑥 = ⟨𝑗, 𝑘⟩ → 𝐵 = 𝐷)    &   (𝑦 = ⟨𝑘, 𝑗⟩ → 𝐶 = 𝐷)    &   (𝜑𝐴 ∈ Fin)    &   (𝜑 → Rel 𝐴)    &   ((𝜑𝑥𝐴) → 𝐵 ∈ ℂ)       (𝜑 → ∏𝑥𝐴 𝐵 = ∏𝑦 𝐴𝐶)

Theoremfprodcom2 15330* 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)    &   (𝜑 → ((𝑗𝐴𝑘𝐵) ↔ (𝑘𝐶𝑗𝐷)))    &   ((𝜑 ∧ (𝑗𝐴𝑘𝐵)) → 𝐸 ∈ ℂ)       (𝜑 → ∏𝑗𝐴𝑘𝐵 𝐸 = ∏𝑘𝐶𝑗𝐷 𝐸)

Theoremfprodcom 15331* Interchange product order. (Contributed by Scott Fenton, 2-Feb-2018.)
(𝜑𝐴 ∈ Fin)    &   (𝜑𝐵 ∈ Fin)    &   ((𝜑 ∧ (𝑗𝐴𝑘𝐵)) → 𝐶 ∈ ℂ)       (𝜑 → ∏𝑗𝐴𝑘𝐵 𝐶 = ∏𝑘𝐵𝑗𝐴 𝐶)

Theoremfprod0diag 15332* Two ways to express "the product of 𝐴(𝑗, 𝑘) over the triangular region 𝑀𝑗, 𝑀𝑘, 𝑗 + 𝑘𝑁. Compare fsum0diag 15124. (Contributed by Scott Fenton, 2-Feb-2018.)
((𝜑 ∧ (𝑗 ∈ (0...𝑁) ∧ 𝑘 ∈ (0...(𝑁𝑗)))) → 𝐴 ∈ ℂ)       (𝜑 → ∏𝑗 ∈ (0...𝑁)∏𝑘 ∈ (0...(𝑁𝑗))𝐴 = ∏𝑘 ∈ (0...𝑁)∏𝑗 ∈ (0...(𝑁𝑘))𝐴)

Theoremfproddivf 15333* The quotient of two finite products. A version of fproddiv 15307 using bound-variable hypotheses instead of distinct variable conditions. (Contributed by Glauco Siliprandi, 5-Apr-2020.)
𝑘𝜑    &   (𝜑𝐴 ∈ Fin)    &   ((𝜑𝑘𝐴) → 𝐵 ∈ ℂ)    &   ((𝜑𝑘𝐴) → 𝐶 ∈ ℂ)    &   ((𝜑𝑘𝐴) → 𝐶 ≠ 0)       (𝜑 → ∏𝑘𝐴 (𝐵 / 𝐶) = (∏𝑘𝐴 𝐵 / ∏𝑘𝐴 𝐶))

Theoremfprodsplitf 15334* Split a finite product into two parts. A version of fprodsplit 15312 using bound-variable hypotheses instead of distinct variable conditions. (Contributed by Glauco Siliprandi, 5-Apr-2020.)
𝑘𝜑    &   (𝜑 → (𝐴𝐵) = ∅)    &   (𝜑𝑈 = (𝐴𝐵))    &   (𝜑𝑈 ∈ Fin)    &   ((𝜑𝑘𝑈) → 𝐶 ∈ ℂ)       (𝜑 → ∏𝑘𝑈 𝐶 = (∏𝑘𝐴 𝐶 · ∏𝑘𝐵 𝐶))

Theoremfprodsplitsn 15335* Separate out a term in a finite product. (Contributed by Glauco Siliprandi, 5-Apr-2020.)
𝑘𝜑    &   𝑘𝐷    &   (𝜑𝐴 ∈ Fin)    &   (𝜑𝐵𝑉)    &   (𝜑 → ¬ 𝐵𝐴)    &   ((𝜑𝑘𝐴) → 𝐶 ∈ ℂ)    &   (𝑘 = 𝐵𝐶 = 𝐷)    &   (𝜑𝐷 ∈ ℂ)       (𝜑 → ∏𝑘 ∈ (𝐴 ∪ {𝐵})𝐶 = (∏𝑘𝐴 𝐶 · 𝐷))

Theoremfprodsplit1f 15336* Separate out a term in a finite product. A version of fprodsplit1 41858 using bound-variable hypotheses instead of distinct variable conditions. (Contributed by Glauco Siliprandi, 5-Apr-2020.)
𝑘𝜑    &   (𝜑𝑘𝐷)    &   (𝜑𝐴 ∈ Fin)    &   ((𝜑𝑘𝐴) → 𝐵 ∈ ℂ)    &   (𝜑𝐶𝐴)    &   ((𝜑𝑘 = 𝐶) → 𝐵 = 𝐷)       (𝜑 → ∏𝑘𝐴 𝐵 = (𝐷 · ∏𝑘 ∈ (𝐴 ∖ {𝐶})𝐵))

Theoremfprodn0f 15337* A finite product of nonzero terms is nonzero. A version of fprodn0 15325 using bound-variable hypotheses instead of distinct variable conditions. (Contributed by Glauco Siliprandi, 5-Apr-2020.)
𝑘𝜑    &   (𝜑𝐴 ∈ Fin)    &   ((𝜑𝑘𝐴) → 𝐵 ∈ ℂ)    &   ((𝜑𝑘𝐴) → 𝐵 ≠ 0)       (𝜑 → ∏𝑘𝐴 𝐵 ≠ 0)

Theoremfprodclf 15338* Closure of a finite product of complex numbers. A version of fprodcl 15298 using bound-variable hypotheses instead of distinct variable conditions. (Contributed by Glauco Siliprandi, 5-Apr-2020.)
𝑘𝜑    &   (𝜑𝐴 ∈ Fin)    &   ((𝜑𝑘𝐴) → 𝐵 ∈ ℂ)       (𝜑 → ∏𝑘𝐴 𝐵 ∈ ℂ)

Theoremfprodge0 15339* If all the terms of a finite product are nonnegative, so is the product. (Contributed by Glauco Siliprandi, 5-Apr-2020.)
𝑘𝜑    &   (𝜑𝐴 ∈ Fin)    &   ((𝜑𝑘𝐴) → 𝐵 ∈ ℝ)    &   ((𝜑𝑘𝐴) → 0 ≤ 𝐵)       (𝜑 → 0 ≤ ∏𝑘𝐴 𝐵)

Theoremfprodeq0g 15340* Any finite product containing a zero term is itself zero. (Contributed by Glauco Siliprandi, 5-Apr-2020.)
𝑘𝜑    &   (𝜑𝐴 ∈ Fin)    &   ((𝜑𝑘𝐴) → 𝐵 ∈ ℂ)    &   (𝜑𝐶𝐴)    &   ((𝜑𝑘 = 𝐶) → 𝐵 = 0)       (𝜑 → ∏𝑘𝐴 𝐵 = 0)

Theoremfprodge1 15341* 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 ≤ ∏𝑘𝐴 𝐵)

Theoremfprodle 15342* 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 ≤ 𝐵)    &   ((𝜑𝑘𝐴) → 𝐶 ∈ ℝ)    &   ((𝜑𝑘𝐴) → 𝐵𝐶)       (𝜑 → ∏𝑘𝐴 𝐵 ≤ ∏𝑘𝐴 𝐶)

Theoremfprodmodd 15343* 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

Theoremiprodclim 15344* An infinite product equals the value its sequence converges to. (Contributed by Scott Fenton, 18-Dec-2017.)
𝑍 = (ℤ𝑀)    &   (𝜑𝑀 ∈ ℤ)    &   (𝜑 → ∃𝑛𝑍𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦))    &   ((𝜑𝑘𝑍) → (𝐹𝑘) = 𝐴)    &   ((𝜑𝑘𝑍) → 𝐴 ∈ ℂ)    &   (𝜑 → seq𝑀( · , 𝐹) ⇝ 𝐵)       (𝜑 → ∏𝑘𝑍 𝐴 = 𝐵)

Theoremiprodclim2 15345* A converging product converges to its infinite product. (Contributed by Scott Fenton, 18-Dec-2017.)
𝑍 = (ℤ𝑀)    &   (𝜑𝑀 ∈ ℤ)    &   (𝜑 → ∃𝑛𝑍𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦))    &   ((𝜑𝑘𝑍) → (𝐹𝑘) = 𝐴)    &   ((𝜑𝑘𝑍) → 𝐴 ∈ ℂ)       (𝜑 → seq𝑀( · , 𝐹) ⇝ ∏𝑘𝑍 𝐴)

Theoremiprodclim3 15346* 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 ⇝ )    &   ((𝜑𝑘𝑍) → 𝐴 ∈ ℂ)    &   ((𝜑𝑗𝑍) → (𝐹𝑗) = ∏𝑘 ∈ (𝑀...𝑗)𝐴)       (𝜑𝐹 ⇝ ∏𝑘𝑍 𝐴)

Theoremiprodcl 15347* The product of a non-trivially converging infinite sequence is a complex number. (Contributed by Scott Fenton, 18-Dec-2017.)
𝑍 = (ℤ𝑀)    &   (𝜑𝑀 ∈ ℤ)    &   (𝜑 → ∃𝑛𝑍𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦))    &   ((𝜑𝑘𝑍) → (𝐹𝑘) = 𝐴)    &   ((𝜑𝑘𝑍) → 𝐴 ∈ ℂ)       (𝜑 → ∏𝑘𝑍 𝐴 ∈ ℂ)

Theoremiprodrecl 15348* The product of a non-trivially converging infinite real sequence is a real number. (Contributed by Scott Fenton, 18-Dec-2017.)
𝑍 = (ℤ𝑀)    &   (𝜑𝑀 ∈ ℤ)    &   (𝜑 → ∃𝑛𝑍𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦))    &   ((𝜑𝑘𝑍) → (𝐹𝑘) = 𝐴)    &   ((𝜑𝑘𝑍) → 𝐴 ∈ ℝ)       (𝜑 → ∏𝑘𝑍 𝐴 ∈ ℝ)

Theoremiprodmul 15349* Multiplication of infinite sums. (Contributed by Scott Fenton, 18-Dec-2017.)
𝑍 = (ℤ𝑀)    &   (𝜑𝑀 ∈ ℤ)    &   (𝜑 → ∃𝑛𝑍𝑦(𝑦 ≠ 0 ∧ seq𝑛( · , 𝐹) ⇝ 𝑦))    &   ((𝜑𝑘𝑍) → (𝐹𝑘) = 𝐴)    &   ((𝜑𝑘𝑍) → 𝐴 ∈ ℂ)    &   (𝜑 → ∃𝑚𝑍𝑧(𝑧 ≠ 0 ∧ seq𝑚( · , 𝐺) ⇝ 𝑧))    &   ((𝜑𝑘𝑍) → (𝐺𝑘) = 𝐵)    &   ((𝜑𝑘𝑍) → 𝐵 ∈ ℂ)       (𝜑 → ∏𝑘𝑍 (𝐴 · 𝐵) = (∏𝑘𝑍 𝐴 · ∏𝑘𝑍 𝐵))

5.10.13  Falling and Rising Factorial

Syntaxcfallfac 15350 Declare the syntax for the falling factorial.
class FallFac

Syntaxcrisefac 15351 Declare the syntax for the rising factorial.
class RiseFac

Definitiondf-risefac 15352* 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))(𝑥 + 𝑘))

Definitiondf-fallfac 15353* 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))(𝑥𝑘))

Theoremrisefacval 15354* The value of the rising factorial function. (Contributed by Scott Fenton, 5-Jan-2018.)
((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (𝐴 RiseFac 𝑁) = ∏𝑘 ∈ (0...(𝑁 − 1))(𝐴 + 𝑘))

Theoremfallfacval 15355* The value of the falling factorial function. (Contributed by Scott Fenton, 5-Jan-2018.)
((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (𝐴 FallFac 𝑁) = ∏𝑘 ∈ (0...(𝑁 − 1))(𝐴𝑘))

Theoremrisefacval2 15356* One-based value of rising factorial. (Contributed by Scott Fenton, 15-Jan-2018.)
((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (𝐴 RiseFac 𝑁) = ∏𝑘 ∈ (1...𝑁)(𝐴 + (𝑘 − 1)))

Theoremfallfacval2 15357* One-based value of falling factorial. (Contributed by Scott Fenton, 15-Jan-2018.)
((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (𝐴 FallFac 𝑁) = ∏𝑘 ∈ (1...𝑁)(𝐴 − (𝑘 − 1)))

Theoremfallfacval3 15358* A product representation of falling factorial when 𝐴 is a nonnegative integer. (Contributed by Scott Fenton, 20-Mar-2018.)
(𝑁 ∈ (0...𝐴) → (𝐴 FallFac 𝑁) = ∏𝑘 ∈ ((𝐴 − (𝑁 − 1))...𝐴)𝑘)

Theoremrisefaccllem 15359* Lemma for rising factorial closure laws. (Contributed by Scott Fenton, 5-Jan-2018.)
𝑆 ⊆ ℂ    &   1 ∈ 𝑆    &   ((𝑥𝑆𝑦𝑆) → (𝑥 · 𝑦) ∈ 𝑆)    &   ((𝐴𝑆𝑘 ∈ ℕ0) → (𝐴 + 𝑘) ∈ 𝑆)       ((𝐴𝑆𝑁 ∈ ℕ0) → (𝐴 RiseFac 𝑁) ∈ 𝑆)

Theoremfallfaccllem 15360* Lemma for falling factorial closure laws. (Contributed by Scott Fenton, 5-Jan-2018.)
𝑆 ⊆ ℂ    &   1 ∈ 𝑆    &   ((𝑥𝑆𝑦𝑆) → (𝑥 · 𝑦) ∈ 𝑆)    &   ((𝐴𝑆𝑘 ∈ ℕ0) → (𝐴𝑘) ∈ 𝑆)       ((𝐴𝑆𝑁 ∈ ℕ0) → (𝐴 FallFac 𝑁) ∈ 𝑆)

Theoremrisefaccl 15361 Closure law for rising factorial. (Contributed by Scott Fenton, 5-Jan-2018.)
((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (𝐴 RiseFac 𝑁) ∈ ℂ)

Theoremfallfaccl 15362 Closure law for falling factorial. (Contributed by Scott Fenton, 5-Jan-2018.)
((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (𝐴 FallFac 𝑁) ∈ ℂ)

Theoremrerisefaccl 15363 Closure law for rising factorial. (Contributed by Scott Fenton, 5-Jan-2018.)
((𝐴 ∈ ℝ ∧ 𝑁 ∈ ℕ0) → (𝐴 RiseFac 𝑁) ∈ ℝ)

Theoremrefallfaccl 15364 Closure law for falling factorial. (Contributed by Scott Fenton, 5-Jan-2018.)
((𝐴 ∈ ℝ ∧ 𝑁 ∈ ℕ0) → (𝐴 FallFac 𝑁) ∈ ℝ)

Theoremnnrisefaccl 15365 Closure law for rising factorial. (Contributed by Scott Fenton, 5-Jan-2018.)
((𝐴 ∈ ℕ ∧ 𝑁 ∈ ℕ0) → (𝐴 RiseFac 𝑁) ∈ ℕ)

Theoremzrisefaccl 15366 Closure law for rising factorial. (Contributed by Scott Fenton, 5-Jan-2018.)
((𝐴 ∈ ℤ ∧ 𝑁 ∈ ℕ0) → (𝐴 RiseFac 𝑁) ∈ ℤ)

Theoremzfallfaccl 15367 Closure law for falling factorial. (Contributed by Scott Fenton, 5-Jan-2018.)
((𝐴 ∈ ℤ ∧ 𝑁 ∈ ℕ0) → (𝐴 FallFac 𝑁) ∈ ℤ)

Theoremnn0risefaccl 15368 Closure law for rising factorial. (Contributed by Scott Fenton, 5-Jan-2018.)
((𝐴 ∈ ℕ0𝑁 ∈ ℕ0) → (𝐴 RiseFac 𝑁) ∈ ℕ0)

Theoremrprisefaccl 15369 Closure law for rising factorial. (Contributed by Scott Fenton, 9-Jan-2018.)
((𝐴 ∈ ℝ+𝑁 ∈ ℕ0) → (𝐴 RiseFac 𝑁) ∈ ℝ+)

Theoremrisefallfac 15370 A relationship between rising and falling factorials. (Contributed by Scott Fenton, 15-Jan-2018.)
((𝑋 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (𝑋 RiseFac 𝑁) = ((-1↑𝑁) · (-𝑋 FallFac 𝑁)))

Theoremfallrisefac 15371 A relationship between falling and rising factorials. (Contributed by Scott Fenton, 17-Jan-2018.)
((𝑋 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (𝑋 FallFac 𝑁) = ((-1↑𝑁) · (-𝑋 RiseFac 𝑁)))

Theoremrisefall0lem 15372 Lemma for risefac0 15373 and fallfac0 15374. Show a particular set of finite integers is empty. (Contributed by Scott Fenton, 5-Jan-2018.)
(0...(0 − 1)) = ∅

Theoremrisefac0 15373 The value of the rising factorial when 𝑁 = 0. (Contributed by Scott Fenton, 5-Jan-2018.)
(𝐴 ∈ ℂ → (𝐴 RiseFac 0) = 1)

Theoremfallfac0 15374 The value of the falling factorial when 𝑁 = 0. (Contributed by Scott Fenton, 5-Jan-2018.)
(𝐴 ∈ ℂ → (𝐴 FallFac 0) = 1)

Theoremrisefacp1 15375 The value of the rising factorial at a successor. (Contributed by Scott Fenton, 5-Jan-2018.)
((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (𝐴 RiseFac (𝑁 + 1)) = ((𝐴 RiseFac 𝑁) · (𝐴 + 𝑁)))

Theoremfallfacp1 15376 The value of the falling factorial at a successor. (Contributed by Scott Fenton, 5-Jan-2018.)
((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (𝐴 FallFac (𝑁 + 1)) = ((𝐴 FallFac 𝑁) · (𝐴𝑁)))

Theoremrisefacp1d 15377 The value of the rising factorial at a successor. (Contributed by Scott Fenton, 19-Mar-2018.)
(𝜑𝐴 ∈ ℂ)    &   (𝜑𝑁 ∈ ℕ0)       (𝜑 → (𝐴 RiseFac (𝑁 + 1)) = ((𝐴 RiseFac 𝑁) · (𝐴 + 𝑁)))

Theoremfallfacp1d 15378 The value of the falling factorial at a successor. (Contributed by Scott Fenton, 19-Mar-2018.)
(𝜑𝐴 ∈ ℂ)    &   (𝜑𝑁 ∈ ℕ0)       (𝜑 → (𝐴 FallFac (𝑁 + 1)) = ((𝐴 FallFac 𝑁) · (𝐴𝑁)))

Theoremrisefac1 15379 The value of rising factorial at one. (Contributed by Scott Fenton, 5-Jan-2018.)
(𝐴 ∈ ℂ → (𝐴 RiseFac 1) = 𝐴)

Theoremfallfac1 15380 The value of falling factorial at one. (Contributed by Scott Fenton, 5-Jan-2018.)
(𝐴 ∈ ℂ → (𝐴 FallFac 1) = 𝐴)

Theoremrisefacfac 15381 Relate rising factorial to factorial. (Contributed by Scott Fenton, 5-Jan-2018.)
(𝑁 ∈ ℕ0 → (1 RiseFac 𝑁) = (!‘𝑁))

Theoremfallfacfwd 15382 The forward difference of a falling factorial. (Contributed by Scott Fenton, 21-Jan-2018.)
((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → (((𝐴 + 1) FallFac 𝑁) − (𝐴 FallFac 𝑁)) = (𝑁 · (𝐴 FallFac (𝑁 − 1))))

Theorem0fallfac 15383 The value of the zero falling factorial at natural 𝑁. (Contributed by Scott Fenton, 17-Feb-2018.)
(𝑁 ∈ ℕ → (0 FallFac 𝑁) = 0)

Theorem0risefac 15384 The value of the zero rising factorial at natural 𝑁. (Contributed by Scott Fenton, 17-Feb-2018.)
(𝑁 ∈ ℕ → (0 RiseFac 𝑁) = 0)

Theorembinomfallfaclem1 15385 Lemma for binomfallfac 15387. Closure law. (Contributed by Scott Fenton, 13-Mar-2018.)
(𝜑𝐴 ∈ ℂ)    &   (𝜑𝐵 ∈ ℂ)    &   (𝜑𝑁 ∈ ℕ0)       ((𝜑𝐾 ∈ (0...𝑁)) → ((𝑁C𝐾) · ((𝐴 FallFac (𝑁𝐾)) · (𝐵 FallFac (𝐾 + 1)))) ∈ ℂ)

Theorembinomfallfaclem2 15386* Lemma for binomfallfac 15387. Inductive step. (Contributed by Scott Fenton, 13-Mar-2018.)
(𝜑𝐴 ∈ ℂ)    &   (𝜑𝐵 ∈ ℂ)    &   (𝜑𝑁 ∈ ℕ0)    &   (𝜓 → ((𝐴 + 𝐵) FallFac 𝑁) = Σ𝑘 ∈ (0...𝑁)((𝑁C𝑘) · ((𝐴 FallFac (𝑁𝑘)) · (𝐵 FallFac 𝑘))))       ((𝜑𝜓) → ((𝐴 + 𝐵) FallFac (𝑁 + 1)) = Σ𝑘 ∈ (0...(𝑁 + 1))(((𝑁 + 1)C𝑘) · ((𝐴 FallFac ((𝑁 + 1) − 𝑘)) · (𝐵 FallFac 𝑘))))

Theorembinomfallfac 15387* 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 𝑘))))

Theorembinomrisefac 15388* 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 𝑘))))

Theoremfallfacval4 15389 Represent the falling factorial via factorials when the first argument is a natural. (Contributed by Scott Fenton, 20-Mar-2018.)
(𝑁 ∈ (0...𝐴) → (𝐴 FallFac 𝑁) = ((!‘𝐴) / (!‘(𝐴𝑁))))

Theorembcfallfac 15390 Binomial coefficient in terms of falling factorials. (Contributed by Scott Fenton, 20-Mar-2018.)
(𝐾 ∈ (0...𝑁) → (𝑁C𝐾) = ((𝑁 FallFac 𝐾) / (!‘𝐾)))

Theoremfallfacfac 15391 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

Syntaxcbp 15392 Declare the constant for the Bernoulli polynomial operator.
class BernPoly

Definitiondf-bpoly 15393* 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))))))‘𝑚))

Theorembpolylem 15394* Lemma for bpolyval 15395. (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)))))

Theorembpolyval 15395* The value of the Bernoulli polynomials. (Contributed by Scott Fenton, 16-May-2014.)
((𝑁 ∈ ℕ0𝑋 ∈ ℂ) → (𝑁 BernPoly 𝑋) = ((𝑋𝑁) − Σ𝑘 ∈ (0...(𝑁 − 1))((𝑁C𝑘) · ((𝑘 BernPoly 𝑋) / ((𝑁𝑘) + 1)))))

Theorembpoly0 15396 The value of the Bernoulli polynomials at zero. (Contributed by Scott Fenton, 16-May-2014.)
(𝑋 ∈ ℂ → (0 BernPoly 𝑋) = 1)

Theorembpoly1 15397 The value of the Bernoulli polynomials at one. (Contributed by Scott Fenton, 16-May-2014.)
(𝑋 ∈ ℂ → (1 BernPoly 𝑋) = (𝑋 − (1 / 2)))

Theorembpolycl 15398 Closure law for Bernoulli polynomials. (Contributed by Scott Fenton, 16-May-2014.) (Proof shortened by Mario Carneiro, 22-May-2014.)
((𝑁 ∈ ℕ0𝑋 ∈ ℂ) → (𝑁 BernPoly 𝑋) ∈ ℂ)

Theorembpolysum 15399* 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))) = (𝑋𝑁))

Theorembpolydiflem 15400* Lemma for bpolydif 15401. (Contributed by Scott Fenton, 12-Jun-2014.)
(𝜑𝑁 ∈ ℕ)    &   (𝜑𝑋 ∈ ℂ)    &   ((𝜑𝑘 ∈ (1...(𝑁 − 1))) → ((𝑘 BernPoly (𝑋 + 1)) − (𝑘 BernPoly 𝑋)) = (𝑘 · (𝑋↑(𝑘 − 1))))       (𝜑 → ((𝑁 BernPoly (𝑋 + 1)) − (𝑁 BernPoly 𝑋)) = (𝑁 · (𝑋↑(𝑁 − 1))))

Page List
Jump to page: Contents  1 1-100 2 101-200 3 201-300 4 301-400 5 401-500 6 501-600 7 601-700 8 701-800 9 801-900 10 901-1000 11 1001-1100 12 1101-1200 13 1201-1300 14 1301-1400 15 1401-1500 16 1501-1600 17 1601-1700 18 1701-1800 19 1801-1900 20 1901-2000 21 2001-2100 22 2101-2200 23 2201-2300 24 2301-2400 25 2401-2500 26 2501-2600 27 2601-2700 28 2701-2800 29 2801-2900 30 2901-3000 31 3001-3100 32 3101-3200 33 3201-3300 34 3301-3400 35 3401-3500 36 3501-3600 37 3601-3700 38 3701-3800 39 3801-3900 40 3901-4000 41 4001-4100 42 4101-4200 43 4201-4300 44 4301-4400 45 4401-4500 46 4501-4600 47 4601-4700 48 4701-4800 49 4801-4900 50 4901-5000 51 5001-5100 52 5101-5200 53 5201-5300 54 5301-5400 55 5401-5500 56 5501-5600 57 5601-5700 58 5701-5800 59 5801-5900 60 5901-6000 61 6001-6100 62 6101-6200 63 6201-6300 64 6301-6400 65 6401-6500 66 6501-6600 67 6601-6700 68 6701-6800 69 6801-6900 70 6901-7000 71 7001-7100 72 7101-7200 73 7201-7300 74 7301-7400 75 7401-7500 76 7501-7600 77 7601-7700 78 7701-7800 79 7801-7900 80 7901-8000 81 8001-8100 82 8101-8200 83 8201-8300 84 8301-8400 85 8401-8500 86 8501-8600 87 8601-8700 88 8701-8800 89 8801-8900 90 8901-9000 91 9001-9100 92 9101-9200 93 9201-9300 94 9301-9400 95 9401-9500 96 9501-9600 97 9601-9700 98 9701-9800 99 9801-9900 100 9901-10000 101 10001-10100 102 10101-10200 103 10201-10300 104 10301-10400 105 10401-10500 106 10501-10600 107 10601-10700 108 10701-10800 109 10801-10900 110 10901-11000 111 11001-11100 112 11101-11200 113 11201-11300 114 11301-11400 115 11401-11500 116 11501-11600 117 11601-11700 118 11701-11800 119 11801-11900 120 11901-12000 121 12001-12100 122 12101-12200 123 12201-12300 124 12301-12400 125 12401-12500 126 12501-12600 127 12601-12700 128 12701-12800 129 12801-12900 130 12901-13000 131 13001-13100 132 13101-13200 133 13201-13300 134 13301-13400 135 13401-13500 136 13501-13600 137 13601-13700 138 13701-13800 139 13801-13900 140 13901-14000 141 14001-14100 142 14101-14200 143 14201-14300 144 14301-14400 145 14401-14500 146 14501-14600 147 14601-14700 148 14701-14800 149 14801-14900 150 14901-15000 151 15001-15100 152 15101-15200 153 15201-15300 154 15301-15400 155 15401-15500 156 15501-15600 157 15601-15700 158 15701-15800 159 15801-15900 160 15901-16000 161 16001-16100 162 16101-16200 163 16201-16300 164 16301-16400 165 16401-16500 166 16501-16600 167 16601-16700 168 16701-16800 169 16801-16900 170 16901-17000 171 17001-17100 172 17101-17200 173 17201-17300 174 17301-17400 175 17401-17500 176 17501-17600 177 17601-17700 178 17701-17800 179 17801-17900 180 17901-18000 181 18001-18100 182 18101-18200 183 18201-18300 184 18301-18400 185 18401-18500 186 18501-18600 187 18601-18700 188 18701-18800 189 18801-18900 190 18901-19000 191 19001-19100 192 19101-19200 193 19201-19300 194 19301-19400 195 19401-19500 196 19501-19600 197 19601-19700 198 19701-19800 199 19801-19900 200 19901-20000 201 20001-20100 202 20101-20200 203 20201-20300 204 20301-20400 205 20401-20500 206 20501-20600 207 20601-20700 208 20701-20800 209 20801-20900 210 20901-21000 211 21001-21100 212 21101-21200 213 21201-21300 214 21301-21400 215 21401-21500 216 21501-21600 217 21601-21700 218 21701-21800 219 21801-21900 220 21901-22000 221 22001-22100 222 22101-22200 223 22201-22300 224 22301-22400 225 22401-22500 226 22501-22600 227 22601-22700 228 22701-22800 229 22801-22900 230 22901-23000 231 23001-23100 232 23101-23200 233 23201-23300 234 23301-23400 235 23401-23500 236 23501-23600 237 23601-23700 238 23701-23800 239 23801-23900 240 23901-24000 241 24001-24100 242 24101-24200 243 24201-24300 244 24301-24400 245 24401-24500 246 24501-24600 247 24601-24700 248 24701-24800 249 24801-24900 250 24901-25000 251 25001-25100 252 25101-25200 253 25201-25300 254 25301-25400 255 25401-25500 256 25501-25600 257 25601-25700 258 25701-25800 259 25801-25900 260 25901-26000 261 26001-26100 262 26101-26200 263 26201-26300 264 26301-26400 265 26401-26500 266 26501-26600 267 26601-26700 268 26701-26800 269 26801-26900 270 26901-27000 271 27001-27100 272 27101-27200 273 27201-27300 274 27301-27400 275 27401-27500 276 27501-27600 277 27601-27700 278 27701-27800 279 27801-27900 280 27901-28000 281 28001-28100 282 28101-28200 283 28201-28300 284 28301-28400 285 28401-28500 286 28501-28600 287 28601-28700 288 28701-28800 289 28801-28900 290 28901-29000 291 29001-29100 292 29101-29200 293 29201-29300 294 29301-29400 295 29401-29500 296 29501-29600 297 29601-29700 298 29701-29800 299 29801-29900 300 29901-30000 301 30001-30100 302 30101-30200 303 30201-30300 304 30301-30400 305 30401-30500 306 30501-30600 307 30601-30700 308 30701-30800 309 30801-30900 310 30901-31000 311 31001-31100 312 31101-31200 313 31201-31300 314 31301-31400 315 31401-31500 316 31501-31600 317 31601-31700 318 31701-31800 319 31801-31900 320 31901-32000 321 32001-32100 322 32101-32200 323 32201-32300 324 32301-32400 325 32401-32500 326 32501-32600 327 32601-32700 328 32701-32800 329 32801-32900 330 32901-33000 331 33001-33100 332 33101-33200 333 33201-33300 334 33301-33400 335 33401-33500 336 33501-33600 337 33601-33700 338 33701-33800 339 33801-33900 340 33901-34000 341 34001-34100 342 34101-34200 343 34201-34300 344 34301-34400 345 34401-34500 346 34501-34600 347 34601-34700 348 34701-34800 349 34801-34900 350 34901-35000 351 35001-35100 352 35101-35200 353 35201-35300 354 35301-35400 355 35401-35500 356 35501-35600 357 35601-35700 358 35701-35800 359 35801-35900 360 35901-36000 361 36001-36100 362 36101-36200 363 36201-36300 364 36301-36400 365 36401-36500 366 36501-36600 367 36601-36700 368 36701-36800 369 36801-36900 370 36901-37000 371 37001-37100 372 37101-37200 373 37201-37300 374 37301-37400 375 37401-37500 376 37501-37600 377 37601-37700 378 37701-37800 379 37801-37900 380 37901-38000 381 38001-38100 382 38101-38200 383 38201-38300 384 38301-38400 385 38401-38500 386 38501-38600 387 38601-38700 388 38701-38800 389 38801-38900 390 38901-39000 391 39001-39100 392 39101-39200 393 39201-39300 394 39301-39400 395 39401-39500 396 39501-39600 397 39601-39700 398 39701-39800 399 39801-39900 400 39901-40000 401 40001-40100 402 40101-40200 403 40201-40300 404 40301-40400 405 40401-40500 406 40501-40600 407 40601-40700 408 40701-40800 409 40801-40900 410 40901-41000 411 41001-41100 412 41101-41200 413 41201-41300 414 41301-41400 415 41401-41500 416 41501-41600 417 41601-41700 418 41701-41800 419 41801-41900 420 41901-42000 421 42001-42100 422 42101-42200 423 42201-42300 424 42301-42400 425 42401-42500 426 42501-42600 427 42601-42700 428 42701-42800 429 42801-42900 430 42901-43000 431 43001-43100 432 43101-43200 433 43201-43300 434 43301-43400 435 43401-43500 436 43501-43600 437 43601-43700 438 43701-43800 439 43801-43900 440 43901-44000 441 44001-44100 442 44101-44200 443 44201-44300 444 44301-44400 445 44401-44500 446 44501-44600 447 44601-44700 448 44701-44800 449 44801-44891
 Copyright terms: Public domain < Previous  Next >