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 ⊢ Ⅎ 𝑘 𝜑
sge0reuzb.p ⊢ Ⅎ 𝑥 𝜑
sge0reuzb.m ⊢ ( 𝜑 → 𝑀 ∈ ℤ )
sge0reuzb.z ⊢ 𝑍 = ( ℤ≥ ‘ 𝑀 )
sge0reuzb.b ⊢ ( ( 𝜑 ∧ 𝑘 ∈ 𝑍 ) → 𝐵 ∈ ( 0 [,) +∞ ) )
sge0reuzb.x ⊢ ( 𝜑 → ∃ 𝑥 ∈ ℝ ∀ 𝑛 ∈ 𝑍 Σ 𝑘 ∈ ( 𝑀 ... 𝑛 ) 𝐵 ≤ 𝑥 )
Assertion sge0reuzb ( 𝜑 → ( Σ^ ‘ ( 𝑘 ∈ 𝑍 ↦ 𝐵 ) ) = sup ( ran ( 𝑛 ∈ 𝑍 ↦ Σ 𝑘 ∈ ( 𝑀 ... 𝑛 ) 𝐵 ) , ℝ , < ) )

Proof

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