Home Metamath Proof ExplorerTheorem List (p. 233 of 424) < 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-27159) Hilbert Space Explorer (27160-28684) Users' Mathboxes (28685-42360)

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

Theoremmbfdm 23201 The domain of a measurable function is measurable. (Contributed by Mario Carneiro, 17-Jun-2014.)
(𝐹 ∈ MblFn → dom 𝐹 ∈ dom vol)

Theoremmbfconstlem 23202 Lemma for mbfconst 23208. (Contributed by Mario Carneiro, 17-Jun-2014.)
((𝐴 ∈ dom vol ∧ 𝐶 ∈ ℝ) → ((𝐴 × {𝐶}) “ 𝐵) ∈ dom vol)

Theoremismbf 23203* The predicate "𝐹 is a measurable function". A function is measurable iff the preimages of all open intervals are measurable sets in the sense of ismbl 23101. (Contributed by Mario Carneiro, 17-Jun-2014.)
(𝐹:𝐴⟶ℝ → (𝐹 ∈ MblFn ↔ ∀𝑥 ∈ ran (,)(𝐹𝑥) ∈ dom vol))

Theoremismbfcn 23204 A complex function is measurable iff the real and imaginary components of the function are measurable. (Contributed by Mario Carneiro, 17-Jun-2014.)
(𝐹:𝐴⟶ℂ → (𝐹 ∈ MblFn ↔ ((ℜ ∘ 𝐹) ∈ MblFn ∧ (ℑ ∘ 𝐹) ∈ MblFn)))

Theoremmbfima 23205 Definitional property of a measurable function: the preimage of an open right-unbounded interval is measurable. (Contributed by Mario Carneiro, 17-Jun-2014.)
((𝐹 ∈ MblFn ∧ 𝐹:𝐴⟶ℝ) → (𝐹 “ (𝐵(,)𝐶)) ∈ dom vol)

Theoremmbfimaicc 23206 The preimage of any closed interval under a measurable function is measurable. (Contributed by Mario Carneiro, 18-Jun-2014.)
(((𝐹 ∈ MblFn ∧ 𝐹:𝐴⟶ℝ) ∧ (𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ)) → (𝐹 “ (𝐵[,]𝐶)) ∈ dom vol)

Theoremmbfimasn 23207 The preimage of a point under a measurable function is measurable. (Contributed by Mario Carneiro, 18-Jun-2014.)
((𝐹 ∈ MblFn ∧ 𝐹:𝐴⟶ℝ ∧ 𝐵 ∈ ℝ) → (𝐹 “ {𝐵}) ∈ dom vol)

Theoremmbfconst 23208 A constant function is measurable. (Contributed by Mario Carneiro, 17-Jun-2014.)
((𝐴 ∈ dom vol ∧ 𝐵 ∈ ℂ) → (𝐴 × {𝐵}) ∈ MblFn)

Theoremmbfid 23209 The identity function is measurable. (Contributed by Mario Carneiro, 17-Jun-2014.)
(𝐴 ∈ dom vol → ( I ↾ 𝐴) ∈ MblFn)

Theoremmbfmptcl 23210* Lemma for the MblFn predicate applied to a mapping operation. (Contributed by Mario Carneiro, 11-Aug-2014.)
(𝜑 → (𝑥𝐴𝐵) ∈ MblFn)    &   ((𝜑𝑥𝐴) → 𝐵𝑉)       ((𝜑𝑥𝐴) → 𝐵 ∈ ℂ)

Theoremmbfdm2 23211* The domain of a measurable function is measurable. (Contributed by Mario Carneiro, 31-Aug-2014.)
(𝜑 → (𝑥𝐴𝐵) ∈ MblFn)    &   ((𝜑𝑥𝐴) → 𝐵𝑉)       (𝜑𝐴 ∈ dom vol)

Theoremismbfcn2 23212* A complex function is measurable iff the real and imaginary components of the function are measurable. (Contributed by Mario Carneiro, 13-Aug-2014.)
((𝜑𝑥𝐴) → 𝐵 ∈ ℂ)       (𝜑 → ((𝑥𝐴𝐵) ∈ MblFn ↔ ((𝑥𝐴 ↦ (ℜ‘𝐵)) ∈ MblFn ∧ (𝑥𝐴 ↦ (ℑ‘𝐵)) ∈ MblFn)))

Theoremismbfd 23213* Deduction to prove measurability of a real function. The third hypothesis is not necessary, but the proof of this requires countable choice, so we derive this separately as ismbf3d 23227. (Contributed by Mario Carneiro, 18-Jun-2014.)
(𝜑𝐹:𝐴⟶ℝ)    &   ((𝜑𝑥 ∈ ℝ*) → (𝐹 “ (𝑥(,)+∞)) ∈ dom vol)    &   ((𝜑𝑥 ∈ ℝ*) → (𝐹 “ (-∞(,)𝑥)) ∈ dom vol)       (𝜑𝐹 ∈ MblFn)

Theoremismbf2d 23214* Deduction to prove measurability of a real function. (Contributed by Mario Carneiro, 18-Jun-2014.)
(𝜑𝐹:𝐴⟶ℝ)    &   (𝜑𝐴 ∈ dom vol)    &   ((𝜑𝑥 ∈ ℝ) → (𝐹 “ (𝑥(,)+∞)) ∈ dom vol)    &   ((𝜑𝑥 ∈ ℝ) → (𝐹 “ (-∞(,)𝑥)) ∈ dom vol)       (𝜑𝐹 ∈ MblFn)

Theoremmbfeqalem 23215* Lemma for mbfeqa 23216. (Contributed by Mario Carneiro, 2-Sep-2014.)
(𝜑𝐴 ⊆ ℝ)    &   (𝜑 → (vol*‘𝐴) = 0)    &   ((𝜑𝑥 ∈ (𝐵𝐴)) → 𝐶 = 𝐷)    &   ((𝜑𝑥𝐵) → 𝐶 ∈ ℝ)    &   ((𝜑𝑥𝐵) → 𝐷 ∈ ℝ)       (𝜑 → ((𝑥𝐵𝐶) ∈ MblFn ↔ (𝑥𝐵𝐷) ∈ MblFn))

Theoremmbfeqa 23216* If two functions are equal almost everywhere, then one is measurable iff the other is. (Contributed by Mario Carneiro, 17-Jun-2014.) (Revised by Mario Carneiro, 2-Sep-2014.)
(𝜑𝐴 ⊆ ℝ)    &   (𝜑 → (vol*‘𝐴) = 0)    &   ((𝜑𝑥 ∈ (𝐵𝐴)) → 𝐶 = 𝐷)    &   ((𝜑𝑥𝐵) → 𝐶 ∈ ℂ)    &   ((𝜑𝑥𝐵) → 𝐷 ∈ ℂ)       (𝜑 → ((𝑥𝐵𝐶) ∈ MblFn ↔ (𝑥𝐵𝐷) ∈ MblFn))

Theoremmbfres 23217 The restriction of a measurable function is measurable. (Contributed by Mario Carneiro, 18-Jun-2014.)
((𝐹 ∈ MblFn ∧ 𝐴 ∈ dom vol) → (𝐹𝐴) ∈ MblFn)

Theoremmbfres2 23218 Measurability of a piecewise function: if 𝐹 is measurable on subsets 𝐵 and 𝐶 of its domain, and these pieces make up all of 𝐴, then 𝐹 is measurable on the whole domain. (Contributed by Mario Carneiro, 18-Jun-2014.)
(𝜑𝐹:𝐴⟶ℝ)    &   (𝜑 → (𝐹𝐵) ∈ MblFn)    &   (𝜑 → (𝐹𝐶) ∈ MblFn)    &   (𝜑 → (𝐵𝐶) = 𝐴)       (𝜑𝐹 ∈ MblFn)

Theoremmbfss 23219* Change the domain of a measurability predicate. (Contributed by Mario Carneiro, 17-Aug-2014.)
(𝜑𝐴𝐵)    &   (𝜑𝐵 ∈ dom vol)    &   ((𝜑𝑥𝐴) → 𝐶𝑉)    &   ((𝜑𝑥 ∈ (𝐵𝐴)) → 𝐶 = 0)    &   (𝜑 → (𝑥𝐴𝐶) ∈ MblFn)       (𝜑 → (𝑥𝐵𝐶) ∈ MblFn)

Theoremmbfmulc2lem 23220 Multiplication by a constant preserves measurability. (Contributed by Mario Carneiro, 18-Jun-2014.)
(𝜑𝐹 ∈ MblFn)    &   (𝜑𝐵 ∈ ℝ)    &   (𝜑𝐹:𝐴⟶ℝ)       (𝜑 → ((𝐴 × {𝐵}) ∘𝑓 · 𝐹) ∈ MblFn)

Theoremmbfmulc2re 23221 Multiplication by a constant preserves measurability. (Contributed by Mario Carneiro, 15-Aug-2014.)
(𝜑𝐹 ∈ MblFn)    &   (𝜑𝐵 ∈ ℝ)    &   (𝜑𝐹:𝐴⟶ℂ)       (𝜑 → ((𝐴 × {𝐵}) ∘𝑓 · 𝐹) ∈ MblFn)

Theoremmbfmax 23222* The maximum of two functions is measurable. (Contributed by Mario Carneiro, 18-Jun-2014.)
(𝜑𝐹:𝐴⟶ℝ)    &   (𝜑𝐹 ∈ MblFn)    &   (𝜑𝐺:𝐴⟶ℝ)    &   (𝜑𝐺 ∈ MblFn)    &   𝐻 = (𝑥𝐴 ↦ if((𝐹𝑥) ≤ (𝐺𝑥), (𝐺𝑥), (𝐹𝑥)))       (𝜑𝐻 ∈ MblFn)

Theoremmbfneg 23223* The negative of a measurable function is measurable. (Contributed by Mario Carneiro, 31-Jul-2014.)
((𝜑𝑥𝐴) → 𝐵𝑉)    &   (𝜑 → (𝑥𝐴𝐵) ∈ MblFn)       (𝜑 → (𝑥𝐴 ↦ -𝐵) ∈ MblFn)

Theoremmbfpos 23224* The positive part of a measurable function is measurable. (Contributed by Mario Carneiro, 31-Jul-2014.)
((𝜑𝑥𝐴) → 𝐵 ∈ ℝ)    &   (𝜑 → (𝑥𝐴𝐵) ∈ MblFn)       (𝜑 → (𝑥𝐴 ↦ if(0 ≤ 𝐵, 𝐵, 0)) ∈ MblFn)

Theoremmbfposr 23225* Converse to mbfpos 23224. (Contributed by Mario Carneiro, 11-Aug-2014.)
((𝜑𝑥𝐴) → 𝐵 ∈ ℝ)    &   (𝜑 → (𝑥𝐴 ↦ if(0 ≤ 𝐵, 𝐵, 0)) ∈ MblFn)    &   (𝜑 → (𝑥𝐴 ↦ if(0 ≤ -𝐵, -𝐵, 0)) ∈ MblFn)       (𝜑 → (𝑥𝐴𝐵) ∈ MblFn)

Theoremmbfposb 23226* A function is measurable iff its positive and negative parts are measurable. (Contributed by Mario Carneiro, 11-Aug-2014.)
((𝜑𝑥𝐴) → 𝐵 ∈ ℝ)       (𝜑 → ((𝑥𝐴𝐵) ∈ MblFn ↔ ((𝑥𝐴 ↦ if(0 ≤ 𝐵, 𝐵, 0)) ∈ MblFn ∧ (𝑥𝐴 ↦ if(0 ≤ -𝐵, -𝐵, 0)) ∈ MblFn)))

Theoremismbf3d 23227* Simplified form of ismbfd 23213. (Contributed by Mario Carneiro, 18-Jun-2014.)
(𝜑𝐹:𝐴⟶ℝ)    &   ((𝜑𝑥 ∈ ℝ) → (𝐹 “ (𝑥(,)+∞)) ∈ dom vol)       (𝜑𝐹 ∈ MblFn)

Theoremmbfimaopnlem 23228* Lemma for mbfimaopn 23229. (Contributed by Mario Carneiro, 25-Aug-2014.)
𝐽 = (TopOpen‘ℂfld)    &   𝐺 = (𝑥 ∈ ℝ, 𝑦 ∈ ℝ ↦ (𝑥 + (i · 𝑦)))    &   𝐵 = ((,) “ (ℚ × ℚ))    &   𝐾 = ran (𝑥𝐵, 𝑦𝐵 ↦ (𝑥 × 𝑦))       ((𝐹 ∈ MblFn ∧ 𝐴𝐽) → (𝐹𝐴) ∈ dom vol)

Theoremmbfimaopn 23229 The preimage of any open set (in the complex topology) under a measurable function is measurable. (See also cncombf 23231, which explains why 𝐴 ∈ dom vol is too weak a condition for this theorem.) (Contributed by Mario Carneiro, 25-Aug-2014.)
𝐽 = (TopOpen‘ℂfld)       ((𝐹 ∈ MblFn ∧ 𝐴𝐽) → (𝐹𝐴) ∈ dom vol)

Theoremmbfimaopn2 23230 The preimage of any set open in the subspace topology of the range of the function is measurable. (Contributed by Mario Carneiro, 25-Aug-2014.)
𝐽 = (TopOpen‘ℂfld)    &   𝐾 = (𝐽t 𝐵)       (((𝐹 ∈ MblFn ∧ 𝐹:𝐴𝐵𝐵 ⊆ ℂ) ∧ 𝐶𝐾) → (𝐹𝐶) ∈ dom vol)

Theoremcncombf 23231 The composition of a continuous function with a measurable function is measurable. (More generally, 𝐺 can be a Borel-measurable function, but notably the condition that 𝐺 be only measurable is too weak, the usual counterexample taking 𝐺 to be the Cantor function and 𝐹 the indicator function of the 𝐺-image of a nonmeasurable set, which is a subset of the Cantor set and hence null and measurable.) (Contributed by Mario Carneiro, 25-Aug-2014.)
((𝐹 ∈ MblFn ∧ 𝐹:𝐴𝐵𝐺 ∈ (𝐵cn→ℂ)) → (𝐺𝐹) ∈ MblFn)

Theoremcnmbf 23232 A continuous function is measurable. (Contributed by Mario Carneiro, 18-Jun-2014.) (Revised by Mario Carneiro, 26-Mar-2015.)
((𝐴 ∈ dom vol ∧ 𝐹 ∈ (𝐴cn→ℂ)) → 𝐹 ∈ MblFn)

Theoremmbfaddlem 23233 The sum of two measurable functions is measurable. (Contributed by Mario Carneiro, 15-Aug-2014.)
(𝜑𝐹 ∈ MblFn)    &   (𝜑𝐺 ∈ MblFn)    &   (𝜑𝐹:𝐴⟶ℝ)    &   (𝜑𝐺:𝐴⟶ℝ)       (𝜑 → (𝐹𝑓 + 𝐺) ∈ MblFn)

Theoremmbfadd 23234 The sum of two measurable functions is measurable. (Contributed by Mario Carneiro, 15-Aug-2014.)
(𝜑𝐹 ∈ MblFn)    &   (𝜑𝐺 ∈ MblFn)       (𝜑 → (𝐹𝑓 + 𝐺) ∈ MblFn)

Theoremmbfsub 23235 The difference of two measurable functions is measurable. (Contributed by Mario Carneiro, 5-Sep-2014.)
(𝜑𝐹 ∈ MblFn)    &   (𝜑𝐺 ∈ MblFn)       (𝜑 → (𝐹𝑓𝐺) ∈ MblFn)

Theoremmbfmulc2 23236* A complex constant times a measurable function is measurable. (Contributed by Mario Carneiro, 17-Aug-2014.)
(𝜑𝐶 ∈ ℂ)    &   ((𝜑𝑥𝐴) → 𝐵𝑉)    &   (𝜑 → (𝑥𝐴𝐵) ∈ MblFn)       (𝜑 → (𝑥𝐴 ↦ (𝐶 · 𝐵)) ∈ MblFn)

Theoremmbfsup 23237* The supremum of a sequence of measurable, real-valued functions is measurable. Note that in this and related theorems, 𝐵(𝑛, 𝑥) is a function of both 𝑛 and 𝑥, since it is an 𝑛-indexed sequence of functions on 𝑥. (Contributed by Mario Carneiro, 14-Aug-2014.) (Revised by Mario Carneiro, 7-Sep-2014.)
𝑍 = (ℤ𝑀)    &   𝐺 = (𝑥𝐴 ↦ sup(ran (𝑛𝑍𝐵), ℝ, < ))    &   (𝜑𝑀 ∈ ℤ)    &   ((𝜑𝑛𝑍) → (𝑥𝐴𝐵) ∈ MblFn)    &   ((𝜑 ∧ (𝑛𝑍𝑥𝐴)) → 𝐵 ∈ ℝ)    &   ((𝜑𝑥𝐴) → ∃𝑦 ∈ ℝ ∀𝑛𝑍 𝐵𝑦)       (𝜑𝐺 ∈ MblFn)

Theoremmbfinf 23238* The infimum of a sequence of measurable, real-valued functions is measurable. (Contributed by Mario Carneiro, 7-Sep-2014.) (Revised by AV, 13-Sep-2020.)
𝑍 = (ℤ𝑀)    &   𝐺 = (𝑥𝐴 ↦ inf(ran (𝑛𝑍𝐵), ℝ, < ))    &   (𝜑𝑀 ∈ ℤ)    &   ((𝜑𝑛𝑍) → (𝑥𝐴𝐵) ∈ MblFn)    &   ((𝜑 ∧ (𝑛𝑍𝑥𝐴)) → 𝐵 ∈ ℝ)    &   ((𝜑𝑥𝐴) → ∃𝑦 ∈ ℝ ∀𝑛𝑍 𝑦𝐵)       (𝜑𝐺 ∈ MblFn)

Theoremmbflimsup 23239* The limit supremum of a sequence of measurable real-valued functions is measurable. (Contributed by Mario Carneiro, 7-Sep-2014.) (Revised by AV, 12-Sep-2020.)
𝑍 = (ℤ𝑀)    &   𝐺 = (𝑥𝐴 ↦ (lim sup‘(𝑛𝑍𝐵)))    &   𝐻 = (𝑚 ∈ ℝ ↦ sup((((𝑛𝑍𝐵) “ (𝑚[,)+∞)) ∩ ℝ*), ℝ*, < ))    &   (𝜑𝑀 ∈ ℤ)    &   ((𝜑𝑥𝐴) → (lim sup‘(𝑛𝑍𝐵)) ∈ ℝ)    &   ((𝜑𝑛𝑍) → (𝑥𝐴𝐵) ∈ MblFn)    &   ((𝜑 ∧ (𝑛𝑍𝑥𝐴)) → 𝐵 ∈ ℝ)       (𝜑𝐺 ∈ MblFn)

Theoremmbflimlem 23240* The pointwise limit of a sequence of measurable real-valued functions is measurable. (Contributed by Mario Carneiro, 7-Sep-2014.)
𝑍 = (ℤ𝑀)    &   (𝜑𝑀 ∈ ℤ)    &   ((𝜑𝑥𝐴) → (𝑛𝑍𝐵) ⇝ 𝐶)    &   ((𝜑𝑛𝑍) → (𝑥𝐴𝐵) ∈ MblFn)    &   ((𝜑 ∧ (𝑛𝑍𝑥𝐴)) → 𝐵 ∈ ℝ)       (𝜑 → (𝑥𝐴𝐶) ∈ MblFn)

Theoremmbflim 23241* The pointwise limit of a sequence of measurable functions is measurable. (Contributed by Mario Carneiro, 7-Sep-2014.)
𝑍 = (ℤ𝑀)    &   (𝜑𝑀 ∈ ℤ)    &   ((𝜑𝑥𝐴) → (𝑛𝑍𝐵) ⇝ 𝐶)    &   ((𝜑𝑛𝑍) → (𝑥𝐴𝐵) ∈ MblFn)    &   ((𝜑 ∧ (𝑛𝑍𝑥𝐴)) → 𝐵𝑉)       (𝜑 → (𝑥𝐴𝐶) ∈ MblFn)

Syntaxc0p 23242 Extend class notation to include the zero polynomial.
class 0𝑝

Definitiondf-0p 23243 Define the zero polynomial. (Contributed by Mario Carneiro, 19-Jun-2014.)
0𝑝 = (ℂ × {0})

Theorem0pval 23244 The zero function evaluates to zero at every point. (Contributed by Mario Carneiro, 23-Jul-2014.)
(𝐴 ∈ ℂ → (0𝑝𝐴) = 0)

Theorem0plef 23245 Two ways to say that the function 𝐹 on the reals is nonnegative. (Contributed by Mario Carneiro, 17-Aug-2014.)
(𝐹:ℝ⟶(0[,)+∞) ↔ (𝐹:ℝ⟶ℝ ∧ 0𝑝𝑟𝐹))

Theorem0pledm 23246 Adjust the domain of the left argument to match the right, which works better in our theorems. (Contributed by Mario Carneiro, 28-Jul-2014.)
(𝜑𝐴 ⊆ ℂ)    &   (𝜑𝐹 Fn 𝐴)       (𝜑 → (0𝑝𝑟𝐹 ↔ (𝐴 × {0}) ∘𝑟𝐹))

Theoremisi1f 23247 The predicate "𝐹 is a simple function". A simple function is a finite nonnegative linear combination of indicator functions for finitely measurable sets. We use the idiom 𝐹 ∈ dom ∫1 to represent this concept because 1 is the first preparation function for our final definition (see df-itg 23198); unlike that operator, which can integrate any function, this operator can only integrate simple functions. (Contributed by Mario Carneiro, 18-Jun-2014.)
(𝐹 ∈ dom ∫1 ↔ (𝐹 ∈ MblFn ∧ (𝐹:ℝ⟶ℝ ∧ ran 𝐹 ∈ Fin ∧ (vol‘(𝐹 “ (ℝ ∖ {0}))) ∈ ℝ)))

Theoremi1fmbf 23248 Simple functions are measurable. (Contributed by Mario Carneiro, 18-Jun-2014.)
(𝐹 ∈ dom ∫1𝐹 ∈ MblFn)

Theoremi1ff 23249 A simple function is a function on the reals. (Contributed by Mario Carneiro, 26-Jun-2014.)
(𝐹 ∈ dom ∫1𝐹:ℝ⟶ℝ)

Theoremi1frn 23250 A simple function has finite range. (Contributed by Mario Carneiro, 26-Jun-2014.)
(𝐹 ∈ dom ∫1 → ran 𝐹 ∈ Fin)

Theoremi1fima 23251 Any preimage of a simple function is measurable. (Contributed by Mario Carneiro, 26-Jun-2014.)
(𝐹 ∈ dom ∫1 → (𝐹𝐴) ∈ dom vol)

Theoremi1fima2 23252 Any preimage of a simple function not containing zero has finite measure. (Contributed by Mario Carneiro, 26-Jun-2014.)
((𝐹 ∈ dom ∫1 ∧ ¬ 0 ∈ 𝐴) → (vol‘(𝐹𝐴)) ∈ ℝ)

Theoremi1fima2sn 23253 Preimage of a singleton. (Contributed by Mario Carneiro, 26-Jun-2014.)
((𝐹 ∈ dom ∫1𝐴 ∈ (𝐵 ∖ {0})) → (vol‘(𝐹 “ {𝐴})) ∈ ℝ)

Theoremi1fd 23254* A simplified set of assumptions to show that a given function is simple. (Contributed by Mario Carneiro, 26-Jun-2014.)
(𝜑𝐹:ℝ⟶ℝ)    &   (𝜑 → ran 𝐹 ∈ Fin)    &   ((𝜑𝑥 ∈ (ran 𝐹 ∖ {0})) → (𝐹 “ {𝑥}) ∈ dom vol)    &   ((𝜑𝑥 ∈ (ran 𝐹 ∖ {0})) → (vol‘(𝐹 “ {𝑥})) ∈ ℝ)       (𝜑𝐹 ∈ dom ∫1)

Theoremi1f0rn 23255 Any simple function takes the value zero on a set of unbounded measure, so in particular this set is not empty. (Contributed by Mario Carneiro, 18-Jun-2014.)
(𝐹 ∈ dom ∫1 → 0 ∈ ran 𝐹)

Theoremitg1val 23256* The value of the integral on simple functions. (Contributed by Mario Carneiro, 18-Jun-2014.)
(𝐹 ∈ dom ∫1 → (∫1𝐹) = Σ𝑥 ∈ (ran 𝐹 ∖ {0})(𝑥 · (vol‘(𝐹 “ {𝑥}))))

Theoremitg1val2 23257* The value of the integral on simple functions. (Contributed by Mario Carneiro, 26-Jun-2014.)
((𝐹 ∈ dom ∫1 ∧ (𝐴 ∈ Fin ∧ (ran 𝐹 ∖ {0}) ⊆ 𝐴𝐴 ⊆ (ℝ ∖ {0}))) → (∫1𝐹) = Σ𝑥𝐴 (𝑥 · (vol‘(𝐹 “ {𝑥}))))

Theoremitg1cl 23258 Closure of the integral on simple functions. (Contributed by Mario Carneiro, 26-Jun-2014.)
(𝐹 ∈ dom ∫1 → (∫1𝐹) ∈ ℝ)

Theoremitg1ge0 23259 Closure of the integral on positive simple functions. (Contributed by Mario Carneiro, 19-Jun-2014.)
((𝐹 ∈ dom ∫1 ∧ 0𝑝𝑟𝐹) → 0 ≤ (∫1𝐹))

Theoremi1f0 23260 The zero function is simple. (Contributed by Mario Carneiro, 18-Jun-2014.)
(ℝ × {0}) ∈ dom ∫1

Theoremitg10 23261 The zero function has zero integral. (Contributed by Mario Carneiro, 18-Jun-2014.)
(∫1‘(ℝ × {0})) = 0

Theoremi1f1lem 23262* Lemma for i1f1 23263 and itg11 23264. (Contributed by Mario Carneiro, 18-Jun-2014.)
𝐹 = (𝑥 ∈ ℝ ↦ if(𝑥𝐴, 1, 0))       (𝐹:ℝ⟶{0, 1} ∧ (𝐴 ∈ dom vol → (𝐹 “ {1}) = 𝐴))

Theoremi1f1 23263* Base case simple functions are indicator functions of measurable sets. (Contributed by Mario Carneiro, 18-Jun-2014.)
𝐹 = (𝑥 ∈ ℝ ↦ if(𝑥𝐴, 1, 0))       ((𝐴 ∈ dom vol ∧ (vol‘𝐴) ∈ ℝ) → 𝐹 ∈ dom ∫1)

Theoremitg11 23264* The integral of an indicator function is the volume of the set. (Contributed by Mario Carneiro, 18-Jun-2014.) (Revised by Mario Carneiro, 23-Aug-2014.)
𝐹 = (𝑥 ∈ ℝ ↦ if(𝑥𝐴, 1, 0))       ((𝐴 ∈ dom vol ∧ (vol‘𝐴) ∈ ℝ) → (∫1𝐹) = (vol‘𝐴))

Theoremitg1addlem1 23265* Decompose a preimage, which is always a disjoint union. (Contributed by Mario Carneiro, 25-Jun-2014.) (Proof shortened by Mario Carneiro, 11-Dec-2016.)
(𝜑𝐹:𝑋𝑌)    &   (𝜑𝐴 ∈ Fin)    &   ((𝜑𝑘𝐴) → 𝐵 ⊆ (𝐹 “ {𝑘}))    &   ((𝜑𝑘𝐴) → 𝐵 ∈ dom vol)    &   ((𝜑𝑘𝐴) → (vol‘𝐵) ∈ ℝ)       (𝜑 → (vol‘ 𝑘𝐴 𝐵) = Σ𝑘𝐴 (vol‘𝐵))

Theoremi1faddlem 23266* Decompose the preimage of a sum. (Contributed by Mario Carneiro, 19-Jun-2014.)
(𝜑𝐹 ∈ dom ∫1)    &   (𝜑𝐺 ∈ dom ∫1)       ((𝜑𝐴 ∈ ℂ) → ((𝐹𝑓 + 𝐺) “ {𝐴}) = 𝑦 ∈ ran 𝐺((𝐹 “ {(𝐴𝑦)}) ∩ (𝐺 “ {𝑦})))

Theoremi1fmullem 23267* Decompose the preimage of a product. (Contributed by Mario Carneiro, 19-Jun-2014.)
(𝜑𝐹 ∈ dom ∫1)    &   (𝜑𝐺 ∈ dom ∫1)       ((𝜑𝐴 ∈ (ℂ ∖ {0})) → ((𝐹𝑓 · 𝐺) “ {𝐴}) = 𝑦 ∈ (ran 𝐺 ∖ {0})((𝐹 “ {(𝐴 / 𝑦)}) ∩ (𝐺 “ {𝑦})))

Theoremi1fadd 23268 The sum of two simple functions is a simple function. (Contributed by Mario Carneiro, 18-Jun-2014.)
(𝜑𝐹 ∈ dom ∫1)    &   (𝜑𝐺 ∈ dom ∫1)       (𝜑 → (𝐹𝑓 + 𝐺) ∈ dom ∫1)

Theoremi1fmul 23269 The pointwise product of two simple functions is a simple function. (Contributed by Mario Carneiro, 5-Sep-2014.)
(𝜑𝐹 ∈ dom ∫1)    &   (𝜑𝐺 ∈ dom ∫1)       (𝜑 → (𝐹𝑓 · 𝐺) ∈ dom ∫1)

Theoremitg1addlem2 23270* Lemma for itg1add 23274. The function 𝐼 represents the pieces into which we will break up the domain of the sum. Since it is infinite only when both 𝑖 and 𝑗 are zero, we arbitrarily define it to be zero there to simplify the sums that are manipulated in itg1addlem4 23272 and itg1addlem5 23273. (Contributed by Mario Carneiro, 26-Jun-2014.)
(𝜑𝐹 ∈ dom ∫1)    &   (𝜑𝐺 ∈ dom ∫1)    &   𝐼 = (𝑖 ∈ ℝ, 𝑗 ∈ ℝ ↦ if((𝑖 = 0 ∧ 𝑗 = 0), 0, (vol‘((𝐹 “ {𝑖}) ∩ (𝐺 “ {𝑗})))))       (𝜑𝐼:(ℝ × ℝ)⟶ℝ)

(𝜑𝐹 ∈ dom ∫1)    &   (𝜑𝐺 ∈ dom ∫1)    &   𝐼 = (𝑖 ∈ ℝ, 𝑗 ∈ ℝ ↦ if((𝑖 = 0 ∧ 𝑗 = 0), 0, (vol‘((𝐹 “ {𝑖}) ∩ (𝐺 “ {𝑗})))))       (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ ¬ (𝐴 = 0 ∧ 𝐵 = 0)) → (𝐴𝐼𝐵) = (vol‘((𝐹 “ {𝐴}) ∩ (𝐺 “ {𝐵}))))

(𝜑𝐹 ∈ dom ∫1)    &   (𝜑𝐺 ∈ dom ∫1)    &   𝐼 = (𝑖 ∈ ℝ, 𝑗 ∈ ℝ ↦ if((𝑖 = 0 ∧ 𝑗 = 0), 0, (vol‘((𝐹 “ {𝑖}) ∩ (𝐺 “ {𝑗})))))    &   𝑃 = ( + ↾ (ran 𝐹 × ran 𝐺))       (𝜑 → (∫1‘(𝐹𝑓 + 𝐺)) = Σ𝑦 ∈ ran 𝐹Σ𝑧 ∈ ran 𝐺((𝑦 + 𝑧) · (𝑦𝐼𝑧)))

(𝜑𝐹 ∈ dom ∫1)    &   (𝜑𝐺 ∈ dom ∫1)    &   𝐼 = (𝑖 ∈ ℝ, 𝑗 ∈ ℝ ↦ if((𝑖 = 0 ∧ 𝑗 = 0), 0, (vol‘((𝐹 “ {𝑖}) ∩ (𝐺 “ {𝑗})))))    &   𝑃 = ( + ↾ (ran 𝐹 × ran 𝐺))       (𝜑 → (∫1‘(𝐹𝑓 + 𝐺)) = ((∫1𝐹) + (∫1𝐺)))

Theoremitg1add 23274 The integral of a sum of simple functions is the sum of the integrals. (Contributed by Mario Carneiro, 28-Jun-2014.)
(𝜑𝐹 ∈ dom ∫1)    &   (𝜑𝐺 ∈ dom ∫1)       (𝜑 → (∫1‘(𝐹𝑓 + 𝐺)) = ((∫1𝐹) + (∫1𝐺)))

Theoremi1fmulclem 23275 Decompose the preimage of a constant times a function. (Contributed by Mario Carneiro, 25-Jun-2014.)
(𝜑𝐹 ∈ dom ∫1)    &   (𝜑𝐴 ∈ ℝ)       (((𝜑𝐴 ≠ 0) ∧ 𝐵 ∈ ℝ) → (((ℝ × {𝐴}) ∘𝑓 · 𝐹) “ {𝐵}) = (𝐹 “ {(𝐵 / 𝐴)}))

Theoremi1fmulc 23276 A nonnegative constant times a simple function gives another simple function. (Contributed by Mario Carneiro, 25-Jun-2014.)
(𝜑𝐹 ∈ dom ∫1)    &   (𝜑𝐴 ∈ ℝ)       (𝜑 → ((ℝ × {𝐴}) ∘𝑓 · 𝐹) ∈ dom ∫1)

Theoremitg1mulc 23277 The integral of a constant times a simple function is the constant times the original integral. (Contributed by Mario Carneiro, 25-Jun-2014.)
(𝜑𝐹 ∈ dom ∫1)    &   (𝜑𝐴 ∈ ℝ)       (𝜑 → (∫1‘((ℝ × {𝐴}) ∘𝑓 · 𝐹)) = (𝐴 · (∫1𝐹)))

Theoremi1fres 23278* The "restriction" of a simple function to a measurable subset is simple. (It's not actually a restriction because it is zero instead of undefined outside 𝐴.) (Contributed by Mario Carneiro, 29-Jun-2014.)
𝐺 = (𝑥 ∈ ℝ ↦ if(𝑥𝐴, (𝐹𝑥), 0))       ((𝐹 ∈ dom ∫1𝐴 ∈ dom vol) → 𝐺 ∈ dom ∫1)

Theoremi1fpos 23279* The positive part of a simple function is simple. (Contributed by Mario Carneiro, 28-Jun-2014.)
𝐺 = (𝑥 ∈ ℝ ↦ if(0 ≤ (𝐹𝑥), (𝐹𝑥), 0))       (𝐹 ∈ dom ∫1𝐺 ∈ dom ∫1)

Theoremi1fposd 23280* Deduction form of i1fposd 23280. (Contributed by Mario Carneiro, 6-Aug-2014.)
(𝜑 → (𝑥 ∈ ℝ ↦ 𝐴) ∈ dom ∫1)       (𝜑 → (𝑥 ∈ ℝ ↦ if(0 ≤ 𝐴, 𝐴, 0)) ∈ dom ∫1)

Theoremi1fsub 23281 The difference of two simple functions is a simple function. (Contributed by Mario Carneiro, 6-Aug-2014.)
((𝐹 ∈ dom ∫1𝐺 ∈ dom ∫1) → (𝐹𝑓𝐺) ∈ dom ∫1)

Theoremitg1sub 23282 The integral of a difference of two simple functions. (Contributed by Mario Carneiro, 6-Aug-2014.)
((𝐹 ∈ dom ∫1𝐺 ∈ dom ∫1) → (∫1‘(𝐹𝑓𝐺)) = ((∫1𝐹) − (∫1𝐺)))

Theoremitg10a 23283* The integral of a simple function supported on a nullset is zero. (Contributed by Mario Carneiro, 11-Aug-2014.)
(𝜑𝐹 ∈ dom ∫1)    &   (𝜑𝐴 ⊆ ℝ)    &   (𝜑 → (vol*‘𝐴) = 0)    &   ((𝜑𝑥 ∈ (ℝ ∖ 𝐴)) → (𝐹𝑥) = 0)       (𝜑 → (∫1𝐹) = 0)

Theoremitg1ge0a 23284* The integral of an almost positive simple function is positive. (Contributed by Mario Carneiro, 11-Aug-2014.)
(𝜑𝐹 ∈ dom ∫1)    &   (𝜑𝐴 ⊆ ℝ)    &   (𝜑 → (vol*‘𝐴) = 0)    &   ((𝜑𝑥 ∈ (ℝ ∖ 𝐴)) → 0 ≤ (𝐹𝑥))       (𝜑 → 0 ≤ (∫1𝐹))

Theoremitg1lea 23285* Approximate version of itg1le 23286. If 𝐹𝐺 for almost all 𝑥, then 1𝐹 ≤ ∫1𝐺. (Contributed by Mario Carneiro, 28-Jun-2014.) (Revised by Mario Carneiro, 6-Aug-2014.)
(𝜑𝐹 ∈ dom ∫1)    &   (𝜑𝐴 ⊆ ℝ)    &   (𝜑 → (vol*‘𝐴) = 0)    &   (𝜑𝐺 ∈ dom ∫1)    &   ((𝜑𝑥 ∈ (ℝ ∖ 𝐴)) → (𝐹𝑥) ≤ (𝐺𝑥))       (𝜑 → (∫1𝐹) ≤ (∫1𝐺))

Theoremitg1le 23286 If one simple function dominates another, then the integral of the larger is also larger. (Contributed by Mario Carneiro, 28-Jun-2014.) (Revised by Mario Carneiro, 6-Aug-2014.)
((𝐹 ∈ dom ∫1𝐺 ∈ dom ∫1𝐹𝑟𝐺) → (∫1𝐹) ≤ (∫1𝐺))

Theoremitg1climres 23287* Restricting the simple function 𝐹 to the increasing sequence 𝐴(𝑛) of measurable sets whose union is yields a sequence of simple functions whose integrals approach the integral of 𝐹. (Contributed by Mario Carneiro, 15-Aug-2014.)
(𝜑𝐴:ℕ⟶dom vol)    &   ((𝜑𝑛 ∈ ℕ) → (𝐴𝑛) ⊆ (𝐴‘(𝑛 + 1)))    &   (𝜑 ran 𝐴 = ℝ)    &   (𝜑𝐹 ∈ dom ∫1)    &   𝐺 = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ (𝐴𝑛), (𝐹𝑥), 0))       (𝜑 → (𝑛 ∈ ℕ ↦ (∫1𝐺)) ⇝ (∫1𝐹))

Theoremmbfi1fseqlem1 23288* Lemma for mbfi1fseq 23294. (Contributed by Mario Carneiro, 16-Aug-2014.)
(𝜑𝐹 ∈ MblFn)    &   (𝜑𝐹:ℝ⟶(0[,)+∞))    &   𝐽 = (𝑚 ∈ ℕ, 𝑦 ∈ ℝ ↦ ((⌊‘((𝐹𝑦) · (2↑𝑚))) / (2↑𝑚)))       (𝜑𝐽:(ℕ × ℝ)⟶(0[,)+∞))

Theoremmbfi1fseqlem2 23289* Lemma for mbfi1fseq 23294. (Contributed by Mario Carneiro, 16-Aug-2014.) (Revised by Mario Carneiro, 23-Aug-2014.)
(𝜑𝐹 ∈ MblFn)    &   (𝜑𝐹:ℝ⟶(0[,)+∞))    &   𝐽 = (𝑚 ∈ ℕ, 𝑦 ∈ ℝ ↦ ((⌊‘((𝐹𝑦) · (2↑𝑚))) / (2↑𝑚)))    &   𝐺 = (𝑚 ∈ ℕ ↦ (𝑥 ∈ ℝ ↦ if(𝑥 ∈ (-𝑚[,]𝑚), if((𝑚𝐽𝑥) ≤ 𝑚, (𝑚𝐽𝑥), 𝑚), 0)))       (𝐴 ∈ ℕ → (𝐺𝐴) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ (-𝐴[,]𝐴), if((𝐴𝐽𝑥) ≤ 𝐴, (𝐴𝐽𝑥), 𝐴), 0)))

Theoremmbfi1fseqlem3 23290* Lemma for mbfi1fseq 23294. (Contributed by Mario Carneiro, 16-Aug-2014.)
(𝜑𝐹 ∈ MblFn)    &   (𝜑𝐹:ℝ⟶(0[,)+∞))    &   𝐽 = (𝑚 ∈ ℕ, 𝑦 ∈ ℝ ↦ ((⌊‘((𝐹𝑦) · (2↑𝑚))) / (2↑𝑚)))    &   𝐺 = (𝑚 ∈ ℕ ↦ (𝑥 ∈ ℝ ↦ if(𝑥 ∈ (-𝑚[,]𝑚), if((𝑚𝐽𝑥) ≤ 𝑚, (𝑚𝐽𝑥), 𝑚), 0)))       ((𝜑𝐴 ∈ ℕ) → (𝐺𝐴):ℝ⟶ran (𝑚 ∈ (0...(𝐴 · (2↑𝐴))) ↦ (𝑚 / (2↑𝐴))))

Theoremmbfi1fseqlem4 23291* Lemma for mbfi1fseq 23294. This lemma is not as interesting as it is long - it is simply checking that 𝐺 is in fact a sequence of simple functions, by verifying that its range is in (0...𝑛2↑𝑛) / (2↑𝑛) (which is to say, the numbers from 0 to 𝑛 in increments of 1 / (2↑𝑛)), and also that the preimage of each point 𝑘 is measurable, because it is equal to (-𝑛[,]𝑛) ∩ (𝐹 “ (𝑘[,)𝑘 + 1 / (2↑𝑛))) for 𝑘 < 𝑛 and (-𝑛[,]𝑛) ∩ (𝐹 “ (𝑘[,)+∞)) for 𝑘 = 𝑛. (Contributed by Mario Carneiro, 16-Aug-2014.)
(𝜑𝐹 ∈ MblFn)    &   (𝜑𝐹:ℝ⟶(0[,)+∞))    &   𝐽 = (𝑚 ∈ ℕ, 𝑦 ∈ ℝ ↦ ((⌊‘((𝐹𝑦) · (2↑𝑚))) / (2↑𝑚)))    &   𝐺 = (𝑚 ∈ ℕ ↦ (𝑥 ∈ ℝ ↦ if(𝑥 ∈ (-𝑚[,]𝑚), if((𝑚𝐽𝑥) ≤ 𝑚, (𝑚𝐽𝑥), 𝑚), 0)))       (𝜑𝐺:ℕ⟶dom ∫1)

Theoremmbfi1fseqlem5 23292* Lemma for mbfi1fseq 23294. Verify that 𝐺 describes an increasing sequence of positive functions. (Contributed by Mario Carneiro, 16-Aug-2014.)
(𝜑𝐹 ∈ MblFn)    &   (𝜑𝐹:ℝ⟶(0[,)+∞))    &   𝐽 = (𝑚 ∈ ℕ, 𝑦 ∈ ℝ ↦ ((⌊‘((𝐹𝑦) · (2↑𝑚))) / (2↑𝑚)))    &   𝐺 = (𝑚 ∈ ℕ ↦ (𝑥 ∈ ℝ ↦ if(𝑥 ∈ (-𝑚[,]𝑚), if((𝑚𝐽𝑥) ≤ 𝑚, (𝑚𝐽𝑥), 𝑚), 0)))       ((𝜑𝐴 ∈ ℕ) → (0𝑝𝑟 ≤ (𝐺𝐴) ∧ (𝐺𝐴) ∘𝑟 ≤ (𝐺‘(𝐴 + 1))))

Theoremmbfi1fseqlem6 23293* Lemma for mbfi1fseq 23294. Verify that 𝐺 converges pointwise to 𝐹, and wrap up the existence quantifier. (Contributed by Mario Carneiro, 16-Aug-2014.) (Revised by Mario Carneiro, 23-Aug-2014.)
(𝜑𝐹 ∈ MblFn)    &   (𝜑𝐹:ℝ⟶(0[,)+∞))    &   𝐽 = (𝑚 ∈ ℕ, 𝑦 ∈ ℝ ↦ ((⌊‘((𝐹𝑦) · (2↑𝑚))) / (2↑𝑚)))    &   𝐺 = (𝑚 ∈ ℕ ↦ (𝑥 ∈ ℝ ↦ if(𝑥 ∈ (-𝑚[,]𝑚), if((𝑚𝐽𝑥) ≤ 𝑚, (𝑚𝐽𝑥), 𝑚), 0)))       (𝜑 → ∃𝑔(𝑔:ℕ⟶dom ∫1 ∧ ∀𝑛 ∈ ℕ (0𝑝𝑟 ≤ (𝑔𝑛) ∧ (𝑔𝑛) ∘𝑟 ≤ (𝑔‘(𝑛 + 1))) ∧ ∀𝑥 ∈ ℝ (𝑛 ∈ ℕ ↦ ((𝑔𝑛)‘𝑥)) ⇝ (𝐹𝑥)))

Theoremmbfi1fseq 23294* A characterization of measurability in terms of simple functions (this is an if and only if for nonnegative functions, although we don't prove it). Any nonnegative measurable function is the limit of an increasing sequence of nonnegative simple functions. This proof is an example of a poor de Bruijn factor - the formalized proof is much longer than an average hand proof, which usually just describes the function 𝐺 and "leaves the details as an exercise to the reader". (Contributed by Mario Carneiro, 16-Aug-2014.) (Revised by Mario Carneiro, 23-Aug-2014.)
(𝜑𝐹 ∈ MblFn)    &   (𝜑𝐹:ℝ⟶(0[,)+∞))       (𝜑 → ∃𝑔(𝑔:ℕ⟶dom ∫1 ∧ ∀𝑛 ∈ ℕ (0𝑝𝑟 ≤ (𝑔𝑛) ∧ (𝑔𝑛) ∘𝑟 ≤ (𝑔‘(𝑛 + 1))) ∧ ∀𝑥 ∈ ℝ (𝑛 ∈ ℕ ↦ ((𝑔𝑛)‘𝑥)) ⇝ (𝐹𝑥)))

Theoremmbfi1flimlem 23295* Lemma for mbfi1flim 23296. (Contributed by Mario Carneiro, 5-Sep-2014.)
(𝜑𝐹 ∈ MblFn)    &   (𝜑𝐹:ℝ⟶ℝ)       (𝜑 → ∃𝑔(𝑔:ℕ⟶dom ∫1 ∧ ∀𝑥 ∈ ℝ (𝑛 ∈ ℕ ↦ ((𝑔𝑛)‘𝑥)) ⇝ (𝐹𝑥)))

Theoremmbfi1flim 23296* Any real measurable function has a sequence of simple functions that converges to it. (Contributed by Mario Carneiro, 5-Sep-2014.)
(𝜑𝐹 ∈ MblFn)    &   (𝜑𝐹:𝐴⟶ℝ)       (𝜑 → ∃𝑔(𝑔:ℕ⟶dom ∫1 ∧ ∀𝑥𝐴 (𝑛 ∈ ℕ ↦ ((𝑔𝑛)‘𝑥)) ⇝ (𝐹𝑥)))

Theoremmbfmullem2 23297* Lemma for mbfmul 23299. (Contributed by Mario Carneiro, 7-Sep-2014.)
(𝜑𝐹 ∈ MblFn)    &   (𝜑𝐺 ∈ MblFn)    &   (𝜑𝐹:𝐴⟶ℝ)    &   (𝜑𝐺:𝐴⟶ℝ)    &   (𝜑𝑃:ℕ⟶dom ∫1)    &   ((𝜑𝑥𝐴) → (𝑛 ∈ ℕ ↦ ((𝑃𝑛)‘𝑥)) ⇝ (𝐹𝑥))    &   (𝜑𝑄:ℕ⟶dom ∫1)    &   ((𝜑𝑥𝐴) → (𝑛 ∈ ℕ ↦ ((𝑄𝑛)‘𝑥)) ⇝ (𝐺𝑥))       (𝜑 → (𝐹𝑓 · 𝐺) ∈ MblFn)

Theoremmbfmullem 23298 Lemma for mbfmul 23299. (Contributed by Mario Carneiro, 7-Sep-2014.)
(𝜑𝐹 ∈ MblFn)    &   (𝜑𝐺 ∈ MblFn)    &   (𝜑𝐹:𝐴⟶ℝ)    &   (𝜑𝐺:𝐴⟶ℝ)       (𝜑 → (𝐹𝑓 · 𝐺) ∈ MblFn)

Theoremmbfmul 23299 The product of two measurable functions is measurable. (Contributed by Mario Carneiro, 7-Sep-2014.)
(𝜑𝐹 ∈ MblFn)    &   (𝜑𝐺 ∈ MblFn)       (𝜑 → (𝐹𝑓 · 𝐺) ∈ MblFn)

Theoremitg2lcl 23300* The set of lower sums is a set of extended reals. (Contributed by Mario Carneiro, 28-Jun-2014.)
𝐿 = {𝑥 ∣ ∃𝑔 ∈ dom ∫1(𝑔𝑟𝐹𝑥 = (∫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-42360
 Copyright terms: Public domain < Previous  Next >