Theorem sge0reuzb 42107

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.)

Hypotheses

Ref	Expression
sge0reuzb.k	⊢ Ⅎ𝑘𝜑
sge0reuzb.p	⊢ Ⅎ𝑥𝜑
sge0reuzb.m	⊢ (𝜑 → 𝑀 ∈ ℤ)
sge0reuzb.z	⊢ 𝑍 = (ℤ≥‘𝑀)
sge0reuzb.b	⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 𝐵 ∈ (0[,)+∞))
sge0reuzb.x	⊢ (𝜑 → ∃𝑥 ∈ ℝ ∀𝑛 ∈ 𝑍 Σ𝑘 ∈ (𝑀...𝑛)𝐵 ≤ 𝑥)

Assertion

Ref	Expression
sge0reuzb	⊢ (𝜑 → (Σ^‘(𝑘 ∈ 𝑍 ↦ 𝐵)) = sup(ran (𝑛 ∈ 𝑍 ↦ Σ𝑘 ∈ (𝑀...𝑛)𝐵), ℝ, < ))

Distinct variable groups:   𝐵,𝑛,𝑥   𝑘,𝑀,𝑛,𝑥   𝑘,𝑍,𝑛,𝑥   𝜑,𝑛

Allowed substitution hints:   𝜑(𝑥,𝑘)   𝐵(𝑘)

Proof of Theorem sge0reuzb

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		sge0reuzb.k	. . 3 ⊢ Ⅎ𝑘𝜑
2		sge0reuzb.m	. . 3 ⊢ (𝜑 → 𝑀 ∈ ℤ)
3		sge0reuzb.z	. . 3 ⊢ 𝑍 = (ℤ≥‘𝑀)
4		sge0reuzb.b	. . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 𝐵 ∈ (0[,)+∞))
5	1, 2, 3, 4	sge0reuz 42106	. 2 ⊢ (𝜑 → (Σ^‘(𝑘 ∈ 𝑍 ↦ 𝐵)) = sup(ran (𝑛 ∈ 𝑍 ↦ Σ𝑘 ∈ (𝑀...𝑛)𝐵), ℝ*, < ))
6		nfv 1873	. . . 4 ⊢ Ⅎ𝑛𝜑
7		eqid 2772	. . . 4 ⊢ (𝑛 ∈ 𝑍 ↦ Σ𝑘 ∈ (𝑀...𝑛)𝐵) = (𝑛 ∈ 𝑍 ↦ Σ𝑘 ∈ (𝑀...𝑛)𝐵)
8		nfv 1873	. . . . . 6 ⊢ Ⅎ𝑘 𝑛 ∈ 𝑍
9	1, 8	nfan 1862	. . . . 5 ⊢ Ⅎ𝑘(𝜑 ∧ 𝑛 ∈ 𝑍)
10		fzfid 13149	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝑀...𝑛) ∈ Fin)
11		elfzuz 12713	. . . . . . . . 9 ⊢ (𝑘 ∈ (𝑀...𝑛) → 𝑘 ∈ (ℤ≥‘𝑀))
12	11, 3	syl6eleqr 2871	. . . . . . . 8 ⊢ (𝑘 ∈ (𝑀...𝑛) → 𝑘 ∈ 𝑍)
13	12	adantl 474	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑛)) → 𝑘 ∈ 𝑍)
14		rge0ssre 12653	. . . . . . . 8 ⊢ (0[,)+∞) ⊆ ℝ
15	14, 4	sseldi 3852	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 𝐵 ∈ ℝ)
16	13, 15	syldan 582	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑛)) → 𝐵 ∈ ℝ)
17	16	adantlr 702	. . . . 5 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ 𝑘 ∈ (𝑀...𝑛)) → 𝐵 ∈ ℝ)
18	9, 10, 17	fsumreclf 41234	. . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → Σ𝑘 ∈ (𝑀...𝑛)𝐵 ∈ ℝ)
19	6, 7, 18	rnmptssd 40829	. . 3 ⊢ (𝜑 → ran (𝑛 ∈ 𝑍 ↦ Σ𝑘 ∈ (𝑀...𝑛)𝐵) ⊆ ℝ)
20		uzid 12066	. . . . . . . 8 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ (ℤ≥‘𝑀))
21	2, 20	syl 17	. . . . . . 7 ⊢ (𝜑 → 𝑀 ∈ (ℤ≥‘𝑀))
22	21, 3	syl6eleqr 2871	. . . . . 6 ⊢ (𝜑 → 𝑀 ∈ 𝑍)
23		eqidd 2773	. . . . . 6 ⊢ (𝜑 → Σ𝑘 ∈ (𝑀...𝑀)𝐵 = Σ𝑘 ∈ (𝑀...𝑀)𝐵)
24		oveq2 6978	. . . . . . . 8 ⊢ (𝑛 = 𝑀 → (𝑀...𝑛) = (𝑀...𝑀))
25	24	sumeq1d 14908	. . . . . . 7 ⊢ (𝑛 = 𝑀 → Σ𝑘 ∈ (𝑀...𝑛)𝐵 = Σ𝑘 ∈ (𝑀...𝑀)𝐵)
26	25	rspceeqv 3547	. . . . . 6 ⊢ ((𝑀 ∈ 𝑍 ∧ Σ𝑘 ∈ (𝑀...𝑀)𝐵 = Σ𝑘 ∈ (𝑀...𝑀)𝐵) → ∃𝑛 ∈ 𝑍 Σ𝑘 ∈ (𝑀...𝑀)𝐵 = Σ𝑘 ∈ (𝑀...𝑛)𝐵)
27	22, 23, 26	syl2anc 576	. . . . 5 ⊢ (𝜑 → ∃𝑛 ∈ 𝑍 Σ𝑘 ∈ (𝑀...𝑀)𝐵 = Σ𝑘 ∈ (𝑀...𝑛)𝐵)
28		sumex 14895	. . . . . 6 ⊢ Σ𝑘 ∈ (𝑀...𝑀)𝐵 ∈ V
29	28	a1i 11	. . . . 5 ⊢ (𝜑 → Σ𝑘 ∈ (𝑀...𝑀)𝐵 ∈ V)
30	7, 27, 29	elrnmptd 40810	. . . 4 ⊢ (𝜑 → Σ𝑘 ∈ (𝑀...𝑀)𝐵 ∈ ran (𝑛 ∈ 𝑍 ↦ Σ𝑘 ∈ (𝑀...𝑛)𝐵))
31	30	ne0d 4182	. . 3 ⊢ (𝜑 → ran (𝑛 ∈ 𝑍 ↦ Σ𝑘 ∈ (𝑀...𝑛)𝐵) ≠ ∅)
32		sge0reuzb.x	. . . 4 ⊢ (𝜑 → ∃𝑥 ∈ ℝ ∀𝑛 ∈ 𝑍 Σ𝑘 ∈ (𝑀...𝑛)𝐵 ≤ 𝑥)
33		sge0reuzb.p	. . . . 5 ⊢ Ⅎ𝑥𝜑
34		vex 3412	. . . . . . . . . . . 12 ⊢ 𝑦 ∈ V
35	7	elrnmpt 5664	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ V → (𝑦 ∈ ran (𝑛 ∈ 𝑍 ↦ Σ𝑘 ∈ (𝑀...𝑛)𝐵) ↔ ∃𝑛 ∈ 𝑍 𝑦 = Σ𝑘 ∈ (𝑀...𝑛)𝐵))
36	34, 35	ax-mp 5	. . . . . . . . . . 11 ⊢ (𝑦 ∈ ran (𝑛 ∈ 𝑍 ↦ Σ𝑘 ∈ (𝑀...𝑛)𝐵) ↔ ∃𝑛 ∈ 𝑍 𝑦 = Σ𝑘 ∈ (𝑀...𝑛)𝐵)
37	36	biimpi 208	. . . . . . . . . 10 ⊢ (𝑦 ∈ ran (𝑛 ∈ 𝑍 ↦ Σ𝑘 ∈ (𝑀...𝑛)𝐵) → ∃𝑛 ∈ 𝑍 𝑦 = Σ𝑘 ∈ (𝑀...𝑛)𝐵)
38	37	adantl 474	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ ∀𝑛 ∈ 𝑍 Σ𝑘 ∈ (𝑀...𝑛)𝐵 ≤ 𝑥) ∧ 𝑦 ∈ ran (𝑛 ∈ 𝑍 ↦ Σ𝑘 ∈ (𝑀...𝑛)𝐵)) → ∃𝑛 ∈ 𝑍 𝑦 = Σ𝑘 ∈ (𝑀...𝑛)𝐵)
39		nfv 1873	. . . . . . . . . . . 12 ⊢ Ⅎ𝑛(𝜑 ∧ 𝑥 ∈ ℝ)
40		nfra1 3163	. . . . . . . . . . . 12 ⊢ Ⅎ𝑛∀𝑛 ∈ 𝑍 Σ𝑘 ∈ (𝑀...𝑛)𝐵 ≤ 𝑥
41	39, 40	nfan 1862	. . . . . . . . . . 11 ⊢ Ⅎ𝑛((𝜑 ∧ 𝑥 ∈ ℝ) ∧ ∀𝑛 ∈ 𝑍 Σ𝑘 ∈ (𝑀...𝑛)𝐵 ≤ 𝑥)
42		nfv 1873	. . . . . . . . . . 11 ⊢ Ⅎ𝑛 𝑦 ≤ 𝑥
43		rspa 3150	. . . . . . . . . . . . . 14 ⊢ ((∀𝑛 ∈ 𝑍 Σ𝑘 ∈ (𝑀...𝑛)𝐵 ≤ 𝑥 ∧ 𝑛 ∈ 𝑍) → Σ𝑘 ∈ (𝑀...𝑛)𝐵 ≤ 𝑥)
44		simpr 477	. . . . . . . . . . . . . . . 16 ⊢ ((Σ𝑘 ∈ (𝑀...𝑛)𝐵 ≤ 𝑥 ∧ 𝑦 = Σ𝑘 ∈ (𝑀...𝑛)𝐵) → 𝑦 = Σ𝑘 ∈ (𝑀...𝑛)𝐵)
45		simpl 475	. . . . . . . . . . . . . . . 16 ⊢ ((Σ𝑘 ∈ (𝑀...𝑛)𝐵 ≤ 𝑥 ∧ 𝑦 = Σ𝑘 ∈ (𝑀...𝑛)𝐵) → Σ𝑘 ∈ (𝑀...𝑛)𝐵 ≤ 𝑥)
46	44, 45	eqbrtrd 4945	. . . . . . . . . . . . . . 15 ⊢ ((Σ𝑘 ∈ (𝑀...𝑛)𝐵 ≤ 𝑥 ∧ 𝑦 = Σ𝑘 ∈ (𝑀...𝑛)𝐵) → 𝑦 ≤ 𝑥)
47	46	ex 405	. . . . . . . . . . . . . 14 ⊢ (Σ𝑘 ∈ (𝑀...𝑛)𝐵 ≤ 𝑥 → (𝑦 = Σ𝑘 ∈ (𝑀...𝑛)𝐵 → 𝑦 ≤ 𝑥))
48	43, 47	syl 17	. . . . . . . . . . . . 13 ⊢ ((∀𝑛 ∈ 𝑍 Σ𝑘 ∈ (𝑀...𝑛)𝐵 ≤ 𝑥 ∧ 𝑛 ∈ 𝑍) → (𝑦 = Σ𝑘 ∈ (𝑀...𝑛)𝐵 → 𝑦 ≤ 𝑥))
49	48	ex 405	. . . . . . . . . . . 12 ⊢ (∀𝑛 ∈ 𝑍 Σ𝑘 ∈ (𝑀...𝑛)𝐵 ≤ 𝑥 → (𝑛 ∈ 𝑍 → (𝑦 = Σ𝑘 ∈ (𝑀...𝑛)𝐵 → 𝑦 ≤ 𝑥)))
50	49	adantl 474	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ ∀𝑛 ∈ 𝑍 Σ𝑘 ∈ (𝑀...𝑛)𝐵 ≤ 𝑥) → (𝑛 ∈ 𝑍 → (𝑦 = Σ𝑘 ∈ (𝑀...𝑛)𝐵 → 𝑦 ≤ 𝑥)))
51	41, 42, 50	rexlimd 3254	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ ∀𝑛 ∈ 𝑍 Σ𝑘 ∈ (𝑀...𝑛)𝐵 ≤ 𝑥) → (∃𝑛 ∈ 𝑍 𝑦 = Σ𝑘 ∈ (𝑀...𝑛)𝐵 → 𝑦 ≤ 𝑥))
52	51	adantr 473	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ ∀𝑛 ∈ 𝑍 Σ𝑘 ∈ (𝑀...𝑛)𝐵 ≤ 𝑥) ∧ 𝑦 ∈ ran (𝑛 ∈ 𝑍 ↦ Σ𝑘 ∈ (𝑀...𝑛)𝐵)) → (∃𝑛 ∈ 𝑍 𝑦 = Σ𝑘 ∈ (𝑀...𝑛)𝐵 → 𝑦 ≤ 𝑥))
53	38, 52	mpd 15	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ ∀𝑛 ∈ 𝑍 Σ𝑘 ∈ (𝑀...𝑛)𝐵 ≤ 𝑥) ∧ 𝑦 ∈ ran (𝑛 ∈ 𝑍 ↦ Σ𝑘 ∈ (𝑀...𝑛)𝐵)) → 𝑦 ≤ 𝑥)
54	53	ralrimiva 3126	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ ∀𝑛 ∈ 𝑍 Σ𝑘 ∈ (𝑀...𝑛)𝐵 ≤ 𝑥) → ∀𝑦 ∈ ran (𝑛 ∈ 𝑍 ↦ Σ𝑘 ∈ (𝑀...𝑛)𝐵)𝑦 ≤ 𝑥)
55	54	ex 405	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (∀𝑛 ∈ 𝑍 Σ𝑘 ∈ (𝑀...𝑛)𝐵 ≤ 𝑥 → ∀𝑦 ∈ ran (𝑛 ∈ 𝑍 ↦ Σ𝑘 ∈ (𝑀...𝑛)𝐵)𝑦 ≤ 𝑥))
56	55	ex 405	. . . . 5 ⊢ (𝜑 → (𝑥 ∈ ℝ → (∀𝑛 ∈ 𝑍 Σ𝑘 ∈ (𝑀...𝑛)𝐵 ≤ 𝑥 → ∀𝑦 ∈ ran (𝑛 ∈ 𝑍 ↦ Σ𝑘 ∈ (𝑀...𝑛)𝐵)𝑦 ≤ 𝑥)))
57	33, 56	reximdai 3248	. . . 4 ⊢ (𝜑 → (∃𝑥 ∈ ℝ ∀𝑛 ∈ 𝑍 Σ𝑘 ∈ (𝑀...𝑛)𝐵 ≤ 𝑥 → ∃𝑥 ∈ ℝ ∀𝑦 ∈ ran (𝑛 ∈ 𝑍 ↦ Σ𝑘 ∈ (𝑀...𝑛)𝐵)𝑦 ≤ 𝑥))
58	32, 57	mpd 15	. . 3 ⊢ (𝜑 → ∃𝑥 ∈ ℝ ∀𝑦 ∈ ran (𝑛 ∈ 𝑍 ↦ Σ𝑘 ∈ (𝑀...𝑛)𝐵)𝑦 ≤ 𝑥)
59		supxrre 12529	. . 3 ⊢ ((ran (𝑛 ∈ 𝑍 ↦ Σ𝑘 ∈ (𝑀...𝑛)𝐵) ⊆ ℝ ∧ ran (𝑛 ∈ 𝑍 ↦ Σ𝑘 ∈ (𝑀...𝑛)𝐵) ≠ ∅ ∧ ∃𝑥 ∈ ℝ ∀𝑦 ∈ ran (𝑛 ∈ 𝑍 ↦ Σ𝑘 ∈ (𝑀...𝑛)𝐵)𝑦 ≤ 𝑥) → sup(ran (𝑛 ∈ 𝑍 ↦ Σ𝑘 ∈ (𝑀...𝑛)𝐵), ℝ*, < ) = sup(ran (𝑛 ∈ 𝑍 ↦ Σ𝑘 ∈ (𝑀...𝑛)𝐵), ℝ, < ))
60	19, 31, 58, 59	syl3anc 1351	. 2 ⊢ (𝜑 → sup(ran (𝑛 ∈ 𝑍 ↦ Σ𝑘 ∈ (𝑀...𝑛)𝐵), ℝ*, < ) = sup(ran (𝑛 ∈ 𝑍 ↦ Σ𝑘 ∈ (𝑀...𝑛)𝐵), ℝ, < ))
61	5, 60	eqtrd 2808	1 ⊢ (𝜑 → (Σ^‘(𝑘 ∈ 𝑍 ↦ 𝐵)) = sup(ran (𝑛 ∈ 𝑍 ↦ Σ𝑘 ∈ (𝑀...𝑛)𝐵), ℝ, < ))

Syntax hints:   → wi 4   ↔ wb 198   ∧ wa 387   = wceq 1507  Ⅎwnf 1746   ∈ wcel 2048   ≠ wne 2961  ∀wral 3082  ∃wrex 3083  Vcvv 3409   ⊆ wss 3825  ∅c0 4173   class class class wbr 4923   ↦ cmpt 5002  ran crn 5401  ‘cfv 6182  (class class class)co 6970  supcsup 8691  ℝcr 10326  0cc0 10327  +∞cpnf 10463  ℝ^*cxr 10465   < clt 10466   ≤ cle 10467  ℤcz 11786  ℤ_≥cuz 12051  [,)cico 12549  ...cfz 12701  Σcsu 14893  Σ^{^}csumge0 42021

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1758  ax-4 1772  ax-5 1869  ax-6 1928  ax-7 1964  ax-8 2050  ax-9 2057  ax-10 2077  ax-11 2091  ax-12 2104  ax-13 2299  ax-ext 2745  ax-rep 5043  ax-sep 5054  ax-nul 5061  ax-pow 5113  ax-pr 5180  ax-un 7273  ax-inf2 8890  ax-cnex 10383  ax-resscn 10384  ax-1cn 10385  ax-icn 10386  ax-addcl 10387  ax-addrcl 10388  ax-mulcl 10389  ax-mulrcl 10390  ax-mulcom 10391  ax-addass 10392  ax-mulass 10393  ax-distr 10394  ax-i2m1 10395  ax-1ne0 10396  ax-1rid 10397  ax-rnegex 10398  ax-rrecex 10399  ax-cnre 10400  ax-pre-lttri 10401  ax-pre-lttrn 10402  ax-pre-ltadd 10403  ax-pre-mulgt0 10404  ax-pre-sup 10405

This theorem depends on definitions:  df-bi 199  df-an 388  df-or 834  df-3or 1069  df-3an 1070  df-tru 1510  df-fal 1520  df-ex 1743  df-nf 1747  df-sb 2014  df-mo 2544  df-eu 2580  df-clab 2754  df-cleq 2765  df-clel 2840  df-nfc 2912  df-ne 2962  df-nel 3068  df-ral 3087  df-rex 3088  df-reu 3089  df-rmo 3090  df-rab 3091  df-v 3411  df-sbc 3678  df-csb 3783  df-dif 3828  df-un 3830  df-in 3832  df-ss 3839  df-pss 3841  df-nul 4174  df-if 4345  df-pw 4418  df-sn 4436  df-pr 4438  df-tp 4440  df-op 4442  df-uni 4707  df-int 4744  df-iun 4788  df-br 4924  df-opab 4986  df-mpt 5003  df-tr 5025  df-id 5305  df-eprel 5310  df-po 5319  df-so 5320  df-fr 5359  df-se 5360  df-we 5361  df-xp 5406  df-rel 5407  df-cnv 5408  df-co 5409  df-dm 5410  df-rn 5411  df-res 5412  df-ima 5413  df-pred 5980  df-ord 6026  df-on 6027  df-lim 6028  df-suc 6029  df-iota 6146  df-fun 6184  df-fn 6185  df-f 6186  df-f1 6187  df-fo 6188  df-f1o 6189  df-fv 6190  df-isom 6191  df-riota 6931  df-ov 6973  df-oprab 6974  df-mpo 6975  df-om 7391  df-1st 7494  df-2nd 7495  df-wrecs 7743  df-recs 7805  df-rdg 7843  df-1o 7897  df-oadd 7901  df-er 8081  df-en 8299  df-dom 8300  df-sdom 8301  df-fin 8302  df-sup 8693  df-oi 8761  df-card 9154  df-pnf 10468  df-mnf 10469  df-xr 10470  df-ltxr 10471  df-le 10472  df-sub 10664  df-neg 10665  df-div 11091  df-nn 11432  df-2 11496  df-3 11497  df-n0 11701  df-z 11787  df-uz 12052  df-rp 12198  df-ico 12553  df-icc 12554  df-fz 12702  df-fzo 12843  df-seq 13178  df-exp 13238  df-hash 13499  df-cj 14309  df-re 14310  df-im 14311  df-sqrt 14445  df-abs 14446  df-clim 14696  df-sum 14894  df-sumge0 42022

This theorem is referenced by:  meaiuninclem  42139