Metamath Proof Explorer


Theorem itg2i1fseq2

Description: In an extension to the results of itg2i1fseq , if there is an upper bound on the integrals of the simple functions approaching F , then S.2 F is real and the standard limit relation applies. (Contributed by Mario Carneiro, 17-Aug-2014)

Ref Expression
Hypotheses itg2i1fseq.1 ⊢ φ → F ∈ MblFn
itg2i1fseq.2 ⊢ φ → F : ℝ ⟶ 0 +∞
itg2i1fseq.3 ⊢ φ → P : ℕ ⟶ dom ⁡ ∫ 1
itg2i1fseq.4 ⊢ φ → ∀ n ∈ ℕ 0 𝑝 ≤ f P ⁡ n ∧ P ⁡ n ≤ f P ⁡ n + 1
itg2i1fseq.5 ⊢ φ → ∀ x ∈ ℝ n ∈ ℕ ⟼ P ⁡ n ⁡ x ⇝ F ⁡ x
itg2i1fseq.6 ⊢ S = m ∈ ℕ ⟼ ∫ 1 ⁡ P ⁡ m
itg2i1fseq2.7 ⊢ φ → M ∈ ℝ
itg2i1fseq2.8 ⊢ φ ∧ k ∈ ℕ → ∫ 1 ⁡ P ⁡ k ≤ M
Assertion itg2i1fseq2 ⊢ φ → S ⇝ ∫ 2 ⁡ F

Proof

Step Hyp Ref Expression
1 itg2i1fseq.1 ⊢ φ → F ∈ MblFn
2 itg2i1fseq.2 ⊢ φ → F : ℝ ⟶ 0 +∞
3 itg2i1fseq.3 ⊢ φ → P : ℕ ⟶ dom ⁡ ∫ 1
4 itg2i1fseq.4 ⊢ φ → ∀ n ∈ ℕ 0 𝑝 ≤ f P ⁡ n ∧ P ⁡ n ≤ f P ⁡ n + 1
5 itg2i1fseq.5 ⊢ φ → ∀ x ∈ ℝ n ∈ ℕ ⟼ P ⁡ n ⁡ x ⇝ F ⁡ x
6 itg2i1fseq.6 ⊢ S = m ∈ ℕ ⟼ ∫ 1 ⁡ P ⁡ m
7 itg2i1fseq2.7 ⊢ φ → M ∈ ℝ
8 itg2i1fseq2.8 ⊢ φ ∧ k ∈ ℕ → ∫ 1 ⁡ P ⁡ k ≤ M
9 nnuz ⊢ ℕ = ℤ ≥ 1
10 1zzd ⊢ φ → 1 ∈ ℤ
11 3 ffvelcdmda ⊢ φ ∧ m ∈ ℕ → P ⁡ m ∈ dom ⁡ ∫ 1
12 itg1cl ⊢ P ⁡ m ∈ dom ⁡ ∫ 1 → ∫ 1 ⁡ P ⁡ m ∈ ℝ
13 11 12 syl ⊢ φ ∧ m ∈ ℕ → ∫ 1 ⁡ P ⁡ m ∈ ℝ
14 13 6 fmptd ⊢ φ → S : ℕ ⟶ ℝ
15 3 ffvelcdmda ⊢ φ ∧ k ∈ ℕ → P ⁡ k ∈ dom ⁡ ∫ 1
16 peano2nn ⊢ k ∈ ℕ → k + 1 ∈ ℕ
17 ffvelcdm ⊢ P : ℕ ⟶ dom ⁡ ∫ 1 ∧ k + 1 ∈ ℕ → P ⁡ k + 1 ∈ dom ⁡ ∫ 1
18 3 16 17 syl2an ⊢ φ ∧ k ∈ ℕ → P ⁡ k + 1 ∈ dom ⁡ ∫ 1
19 simpr ⊢ 0 𝑝 ≤ f P ⁡ n ∧ P ⁡ n ≤ f P ⁡ n + 1 → P ⁡ n ≤ f P ⁡ n + 1
20 19 ralimi ⊢ ∀ n ∈ ℕ 0 𝑝 ≤ f P ⁡ n ∧ P ⁡ n ≤ f P ⁡ n + 1 → ∀ n ∈ ℕ P ⁡ n ≤ f P ⁡ n + 1
21 4 20 syl ⊢ φ → ∀ n ∈ ℕ P ⁡ n ≤ f P ⁡ n + 1
22 fveq2 ⊢ n = k → P ⁡ n = P ⁡ k
23 fvoveq1 ⊢ n = k → P ⁡ n + 1 = P ⁡ k + 1
24 22 23 breq12d ⊢ n = k → P ⁡ n ≤ f P ⁡ n + 1 ↔ P ⁡ k ≤ f P ⁡ k + 1
25 24 rspccva ⊢ ∀ n ∈ ℕ P ⁡ n ≤ f P ⁡ n + 1 ∧ k ∈ ℕ → P ⁡ k ≤ f P ⁡ k + 1
26 21 25 sylan ⊢ φ ∧ k ∈ ℕ → P ⁡ k ≤ f P ⁡ k + 1
27 itg1le ⊢ P ⁡ k ∈ dom ⁡ ∫ 1 ∧ P ⁡ k + 1 ∈ dom ⁡ ∫ 1 ∧ P ⁡ k ≤ f P ⁡ k + 1 → ∫ 1 ⁡ P ⁡ k ≤ ∫ 1 ⁡ P ⁡ k + 1
28 15 18 26 27 syl3anc ⊢ φ ∧ k ∈ ℕ → ∫ 1 ⁡ P ⁡ k ≤ ∫ 1 ⁡ P ⁡ k + 1
29 2fveq3 ⊢ m = k → ∫ 1 ⁡ P ⁡ m = ∫ 1 ⁡ P ⁡ k
30 fvex ⊢ ∫ 1 ⁡ P ⁡ k ∈ V
31 29 6 30 fvmpt ⊢ k ∈ ℕ → S ⁡ k = ∫ 1 ⁡ P ⁡ k
32 31 adantl ⊢ φ ∧ k ∈ ℕ → S ⁡ k = ∫ 1 ⁡ P ⁡ k
33 2fveq3 ⊢ m = k + 1 → ∫ 1 ⁡ P ⁡ m = ∫ 1 ⁡ P ⁡ k + 1
34 fvex ⊢ ∫ 1 ⁡ P ⁡ k + 1 ∈ V
35 33 6 34 fvmpt ⊢ k + 1 ∈ ℕ → S ⁡ k + 1 = ∫ 1 ⁡ P ⁡ k + 1
36 16 35 syl ⊢ k ∈ ℕ → S ⁡ k + 1 = ∫ 1 ⁡ P ⁡ k + 1
37 36 adantl ⊢ φ ∧ k ∈ ℕ → S ⁡ k + 1 = ∫ 1 ⁡ P ⁡ k + 1
38 28 32 37 3brtr4d ⊢ φ ∧ k ∈ ℕ → S ⁡ k ≤ S ⁡ k + 1
39 32 8 eqbrtrd ⊢ φ ∧ k ∈ ℕ → S ⁡ k ≤ M
40 39 ralrimiva ⊢ φ → ∀ k ∈ ℕ S ⁡ k ≤ M
41 brralrspcev ⊢ M ∈ ℝ ∧ ∀ k ∈ ℕ S ⁡ k ≤ M → ∃ z ∈ ℝ ∀ k ∈ ℕ S ⁡ k ≤ z
42 7 40 41 syl2anc ⊢ φ → ∃ z ∈ ℝ ∀ k ∈ ℕ S ⁡ k ≤ z
43 9 10 14 38 42 climsup ⊢ φ → S ⇝ sup ran ⁡ S ℝ <
44 1 2 3 4 5 6 itg2i1fseq ⊢ φ → ∫ 2 ⁡ F = sup ran ⁡ S ℝ * <
45 14 frnd ⊢ φ → ran ⁡ S ⊆ ℝ
46 6 13 dmmptd ⊢ φ → dom ⁡ S = ℕ
47 1nn ⊢ 1 ∈ ℕ
48 ne0i ⊢ 1 ∈ ℕ → ℕ ≠ ∅
49 47 48 mp1i ⊢ φ → ℕ ≠ ∅
50 46 49 eqnetrd ⊢ φ → dom ⁡ S ≠ ∅
51 dm0rn0 ⊢ dom ⁡ S = ∅ ↔ ran ⁡ S = ∅
52 51 necon3bii ⊢ dom ⁡ S ≠ ∅ ↔ ran ⁡ S ≠ ∅
53 50 52 sylib ⊢ φ → ran ⁡ S ≠ ∅
54 ffn ⊢ S : ℕ ⟶ ℝ → S Fn ℕ
55 breq1 ⊢ y = S ⁡ k → y ≤ z ↔ S ⁡ k ≤ z
56 55 ralrn ⊢ S Fn ℕ → ∀ y ∈ ran ⁡ S y ≤ z ↔ ∀ k ∈ ℕ S ⁡ k ≤ z
57 14 54 56 3syl ⊢ φ → ∀ y ∈ ran ⁡ S y ≤ z ↔ ∀ k ∈ ℕ S ⁡ k ≤ z
58 57 rexbidv ⊢ φ → ∃ z ∈ ℝ ∀ y ∈ ran ⁡ S y ≤ z ↔ ∃ z ∈ ℝ ∀ k ∈ ℕ S ⁡ k ≤ z
59 42 58 mpbird ⊢ φ → ∃ z ∈ ℝ ∀ y ∈ ran ⁡ S y ≤ z
60 supxrre ⊢ ran ⁡ S ⊆ ℝ ∧ ran ⁡ S ≠ ∅ ∧ ∃ z ∈ ℝ ∀ y ∈ ran ⁡ S y ≤ z → sup ran ⁡ S ℝ * < = sup ran ⁡ S ℝ <
61 45 53 59 60 syl3anc ⊢ φ → sup ran ⁡ S ℝ * < = sup ran ⁡ S ℝ <
62 44 61 eqtrd ⊢ φ → ∫ 2 ⁡ F = sup ran ⁡ S ℝ <
63 43 62 breqtrrd ⊢ φ → S ⇝ ∫ 2 ⁡ F