Metamath Proof Explorer


Theorem sge0reuzb

Description: Value of the generalized sum of uniformly bounded nonnegative reals, when the domain is a set of upper integers. (Contributed by Glauco Siliprandi, 8-Apr-2021)

Ref Expression
Hypotheses sge0reuzb.k ⊢ Ⅎ k φ
sge0reuzb.p ⊢ Ⅎ x φ
sge0reuzb.m ⊢ φ → M ∈ ℤ
sge0reuzb.z ⊢ Z = ℤ ≥ M
sge0reuzb.b ⊢ φ ∧ k ∈ Z → B ∈ 0 +∞
sge0reuzb.x ⊢ φ → ∃ x ∈ ℝ ∀ n ∈ Z ∑ k = M n B ≤ x
Assertion sge0reuzb ⊢ φ → sum^ ⁡ k ∈ Z ⟼ B = sup ran ⁡ n ∈ Z ⟼ ∑ k = M n B ℝ <

Proof

Step Hyp Ref Expression
1 sge0reuzb.k ⊢ Ⅎ k φ
2 sge0reuzb.p ⊢ Ⅎ x φ
3 sge0reuzb.m ⊢ φ → M ∈ ℤ
4 sge0reuzb.z ⊢ Z = ℤ ≥ M
5 sge0reuzb.b ⊢ φ ∧ k ∈ Z → B ∈ 0 +∞
6 sge0reuzb.x ⊢ φ → ∃ x ∈ ℝ ∀ n ∈ Z ∑ k = M n B ≤ x
7 1 3 4 5 sge0reuz ⊢ φ → sum^ ⁡ k ∈ Z ⟼ B = sup ran ⁡ n ∈ Z ⟼ ∑ k = M n B ℝ * <
8 nfv ⊢ Ⅎ n φ
9 eqid ⊢ n ∈ Z ⟼ ∑ k = M n B = n ∈ Z ⟼ ∑ k = M n B
10 nfv ⊢ Ⅎ k n ∈ Z
11 1 10 nfan ⊢ Ⅎ k φ ∧ n ∈ Z
12 fzfid ⊢ φ ∧ n ∈ Z → M … n ∈ Fin
13 elfzuz ⊢ k ∈ M … n → k ∈ ℤ ≥ M
14 13 4 eleqtrrdi ⊢ k ∈ M … n → k ∈ Z
15 14 adantl ⊢ φ ∧ k ∈ M … n → k ∈ Z
16 rge0ssre ⊢ 0 +∞ ⊆ ℝ
17 16 5 sselid ⊢ φ ∧ k ∈ Z → B ∈ ℝ
18 15 17 syldan ⊢ φ ∧ k ∈ M … n → B ∈ ℝ
19 18 adantlr ⊢ φ ∧ n ∈ Z ∧ k ∈ M … n → B ∈ ℝ
20 11 12 19 fsumreclf ⊢ φ ∧ n ∈ Z → ∑ k = M n B ∈ ℝ
21 8 9 20 rnmptssd ⊢ φ → ran ⁡ n ∈ Z ⟼ ∑ k = M n B ⊆ ℝ
22 uzid ⊢ M ∈ ℤ → M ∈ ℤ ≥ M
23 3 22 syl ⊢ φ → M ∈ ℤ ≥ M
24 23 4 eleqtrrdi ⊢ φ → M ∈ Z
25 eqidd ⊢ φ → ∑ k = M M B = ∑ k = M M B
26 oveq2 ⊢ n = M → M … n = M … M
27 26 sumeq1d ⊢ n = M → ∑ k = M n B = ∑ k = M M B
28 27 rspceeqv ⊢ M ∈ Z ∧ ∑ k = M M B = ∑ k = M M B → ∃ n ∈ Z ∑ k = M M B = ∑ k = M n B
29 24 25 28 syl2anc ⊢ φ → ∃ n ∈ Z ∑ k = M M B = ∑ k = M n B
30 sumex ⊢ ∑ k = M M B ∈ V
31 30 a1i ⊢ φ → ∑ k = M M B ∈ V
32 9 29 31 elrnmptd ⊢ φ → ∑ k = M M B ∈ ran ⁡ n ∈ Z ⟼ ∑ k = M n B
33 32 ne0d ⊢ φ → ran ⁡ n ∈ Z ⟼ ∑ k = M n B ≠ ∅
34 vex ⊢ y ∈ V
35 9 elrnmpt ⊢ y ∈ V → y ∈ ran ⁡ n ∈ Z ⟼ ∑ k = M n B ↔ ∃ n ∈ Z y = ∑ k = M n B
36 34 35 ax-mp ⊢ y ∈ ran ⁡ n ∈ Z ⟼ ∑ k = M n B ↔ ∃ n ∈ Z y = ∑ k = M n B
37 36 bilani ⊢ φ ∧ x ∈ ℝ ∧ ∀ n ∈ Z ∑ k = M n B ≤ x ∧ y ∈ ran ⁡ n ∈ Z ⟼ ∑ k = M n B → ∃ n ∈ Z y = ∑ k = M n B
38 nfv ⊢ Ⅎ n φ ∧ x ∈ ℝ
39 nfra1 ⊢ Ⅎ n ∀ n ∈ Z ∑ k = M n B ≤ x
40 38 39 nfan ⊢ Ⅎ n φ ∧ x ∈ ℝ ∧ ∀ n ∈ Z ∑ k = M n B ≤ x
41 nfv ⊢ Ⅎ n y ≤ x
42 rspa ⊢ ∀ n ∈ Z ∑ k = M n B ≤ x ∧ n ∈ Z → ∑ k = M n B ≤ x
43 simpr ⊢ ∑ k = M n B ≤ x ∧ y = ∑ k = M n B → y = ∑ k = M n B
44 simpl ⊢ ∑ k = M n B ≤ x ∧ y = ∑ k = M n B → ∑ k = M n B ≤ x
45 43 44 eqbrtrd ⊢ ∑ k = M n B ≤ x ∧ y = ∑ k = M n B → y ≤ x
46 45 ex ⊢ ∑ k = M n B ≤ x → y = ∑ k = M n B → y ≤ x
47 42 46 syl ⊢ ∀ n ∈ Z ∑ k = M n B ≤ x ∧ n ∈ Z → y = ∑ k = M n B → y ≤ x
48 47 ex ⊢ ∀ n ∈ Z ∑ k = M n B ≤ x → n ∈ Z → y = ∑ k = M n B → y ≤ x
49 48 adantl ⊢ φ ∧ x ∈ ℝ ∧ ∀ n ∈ Z ∑ k = M n B ≤ x → n ∈ Z → y = ∑ k = M n B → y ≤ x
50 40 41 49 rexlimd ⊢ φ ∧ x ∈ ℝ ∧ ∀ n ∈ Z ∑ k = M n B ≤ x → ∃ n ∈ Z y = ∑ k = M n B → y ≤ x
51 50 adantr ⊢ φ ∧ x ∈ ℝ ∧ ∀ n ∈ Z ∑ k = M n B ≤ x ∧ y ∈ ran ⁡ n ∈ Z ⟼ ∑ k = M n B → ∃ n ∈ Z y = ∑ k = M n B → y ≤ x
52 37 51 mpd ⊢ φ ∧ x ∈ ℝ ∧ ∀ n ∈ Z ∑ k = M n B ≤ x ∧ y ∈ ran ⁡ n ∈ Z ⟼ ∑ k = M n B → y ≤ x
53 52 ralrimiva ⊢ φ ∧ x ∈ ℝ ∧ ∀ n ∈ Z ∑ k = M n B ≤ x → ∀ y ∈ ran ⁡ n ∈ Z ⟼ ∑ k = M n B y ≤ x
54 53 ex ⊢ φ ∧ x ∈ ℝ → ∀ n ∈ Z ∑ k = M n B ≤ x → ∀ y ∈ ran ⁡ n ∈ Z ⟼ ∑ k = M n B y ≤ x
55 54 ex ⊢ φ → x ∈ ℝ → ∀ n ∈ Z ∑ k = M n B ≤ x → ∀ y ∈ ran ⁡ n ∈ Z ⟼ ∑ k = M n B y ≤ x
56 2 55 reximdai ⊢ φ → ∃ x ∈ ℝ ∀ n ∈ Z ∑ k = M n B ≤ x → ∃ x ∈ ℝ ∀ y ∈ ran ⁡ n ∈ Z ⟼ ∑ k = M n B y ≤ x
57 6 56 mpd ⊢ φ → ∃ x ∈ ℝ ∀ y ∈ ran ⁡ n ∈ Z ⟼ ∑ k = M n B y ≤ x
58 supxrre ⊢ ran ⁡ n ∈ Z ⟼ ∑ k = M n B ⊆ ℝ ∧ ran ⁡ n ∈ Z ⟼ ∑ k = M n B ≠ ∅ ∧ ∃ x ∈ ℝ ∀ y ∈ ran ⁡ n ∈ Z ⟼ ∑ k = M n B y ≤ x → sup ran ⁡ n ∈ Z ⟼ ∑ k = M n B ℝ * < = sup ran ⁡ n ∈ Z ⟼ ∑ k = M n B ℝ <
59 21 33 57 58 syl3anc ⊢ φ → sup ran ⁡ n ∈ Z ⟼ ∑ k = M n B ℝ * < = sup ran ⁡ n ∈ Z ⟼ ∑ k = M n B ℝ <
60 7 59 eqtrd ⊢ φ → sum^ ⁡ k ∈ Z ⟼ B = sup ran ⁡ n ∈ Z ⟼ ∑ k = M n B ℝ <