sge0seq - Mathbox for Glauco Siliprandi

	Mathbox for Glauco Siliprandi		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > sge0seq		Structured version Visualization version GIF version

Theorem sge0seq 45162

Description: A series of nonnegative reals agrees with the generalized sum of nonnegative reals. (Contributed by Glauco Siliprandi, 3-Mar-2021.)

**Hypotheses**
Ref	Expression
sge0seq.m	⊢ (𝜑 → 𝑀 ∈ ℤ)
sge0seq.z	⊢ 𝑍 = (ℤ_≥‘𝑀)
sge0seq.f	⊢ (𝜑 → 𝐹:𝑍⟶(0[,)+∞))
sge0seq.g	⊢ 𝐺 = seq𝑀( + , 𝐹)

**Assertion**
Ref	Expression
sge0seq	⊢ (𝜑 → (Σ^{^}‘𝐹) = sup(ran 𝐺, ℝ^*, < ))

Proof of Theorem sge0seq Dummy variables 𝑖 𝑘 𝑗 𝑤 𝑧 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		sge0seq.z	. . . . . . 7 ⊢ 𝑍 = (ℤ_≥‘𝑀)
2		sge0seq.m	. . . . . . 7 ⊢ (𝜑 → 𝑀 ∈ ℤ)
3		rge0ssre 13433	. . . . . . . 8 ⊢ (0[,)+∞) ⊆ ℝ
4		sge0seq.f	. . . . . . . . 9 ⊢ (𝜑 → 𝐹:𝑍⟶(0[,)+∞))
5	4	ffvelcdmda 7087	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ (0[,)+∞))
6	3, 5	sselid 3981	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ ℝ)
7		readdcl 11193	. . . . . . . 8 ⊢ ((𝑘 ∈ ℝ ∧ 𝑖 ∈ ℝ) → (𝑘 + 𝑖) ∈ ℝ)
8	7	adantl 483	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑘 ∈ ℝ ∧ 𝑖 ∈ ℝ)) → (𝑘 + 𝑖) ∈ ℝ)
9	1, 2, 6, 8	seqf 13989	. . . . . 6 ⊢ (𝜑 → seq𝑀( + , 𝐹):𝑍⟶ℝ)
10		sge0seq.g	. . . . . . . 8 ⊢ 𝐺 = seq𝑀( + , 𝐹)
11	10	a1i 11	. . . . . . 7 ⊢ (𝜑 → 𝐺 = seq𝑀( + , 𝐹))
12	11	feq1d 6703	. . . . . 6 ⊢ (𝜑 → (𝐺:𝑍⟶ℝ ↔ seq𝑀( + , 𝐹):𝑍⟶ℝ))
13	9, 12	mpbird 257	. . . . 5 ⊢ (𝜑 → 𝐺:𝑍⟶ℝ)
14	13	frnd 6726	. . . 4 ⊢ (𝜑 → ran 𝐺 ⊆ ℝ)
15		ressxr 11258	. . . . 5 ⊢ ℝ ⊆ ℝ^*
16	15	a1i 11	. . . 4 ⊢ (𝜑 → ℝ ⊆ ℝ^*)
17	14, 16	sstrd 3993	. . 3 ⊢ (𝜑 → ran 𝐺 ⊆ ℝ^*)
18	1	fvexi 6906	. . . . 5 ⊢ 𝑍 ∈ V
19	18	a1i 11	. . . 4 ⊢ (𝜑 → 𝑍 ∈ V)
20		icossicc 13413	. . . . . 6 ⊢ (0[,)+∞) ⊆ (0[,]+∞)
21	20	a1i 11	. . . . 5 ⊢ (𝜑 → (0[,)+∞) ⊆ (0[,]+∞))
22	4, 21	fssd 6736	. . . 4 ⊢ (𝜑 → 𝐹:𝑍⟶(0[,]+∞))
23	19, 22	sge0xrcl 45101	. . 3 ⊢ (𝜑 → (Σ^{^}‘𝐹) ∈ ℝ^*)
24		simpr 486	. . . . . 6 ⊢ ((𝜑 ∧ 𝑧 ∈ ran 𝐺) → 𝑧 ∈ ran 𝐺)
25	13	ffnd 6719	. . . . . . . 8 ⊢ (𝜑 → 𝐺 Fn 𝑍)
26		fvelrnb 6953	. . . . . . . 8 ⊢ (𝐺 Fn 𝑍 → (𝑧 ∈ ran 𝐺 ↔ ∃𝑗 ∈ 𝑍 (𝐺‘𝑗) = 𝑧))
27	25, 26	syl 17	. . . . . . 7 ⊢ (𝜑 → (𝑧 ∈ ran 𝐺 ↔ ∃𝑗 ∈ 𝑍 (𝐺‘𝑗) = 𝑧))
28	27	adantr 482	. . . . . 6 ⊢ ((𝜑 ∧ 𝑧 ∈ ran 𝐺) → (𝑧 ∈ ran 𝐺 ↔ ∃𝑗 ∈ 𝑍 (𝐺‘𝑗) = 𝑧))
29	24, 28	mpbid 231	. . . . 5 ⊢ ((𝜑 ∧ 𝑧 ∈ ran 𝐺) → ∃𝑗 ∈ 𝑍 (𝐺‘𝑗) = 𝑧)
30	20, 5	sselid 3981	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ (0[,]+∞))
31		elfzuz 13497	. . . . . . . . . . . . . 14 ⊢ (𝑘 ∈ (𝑀...𝑗) → 𝑘 ∈ (ℤ_≥‘𝑀))
32	31, 1	eleqtrrdi 2845	. . . . . . . . . . . . 13 ⊢ (𝑘 ∈ (𝑀...𝑗) → 𝑘 ∈ 𝑍)
33	32	ssriv 3987	. . . . . . . . . . . 12 ⊢ (𝑀...𝑗) ⊆ 𝑍
34	33	a1i 11	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑀...𝑗) ⊆ 𝑍)
35	19, 30, 34	sge0lessmpt 45115	. . . . . . . . . 10 ⊢ (𝜑 → (Σ^{^}‘(𝑘 ∈ (𝑀...𝑗) ↦ (𝐹‘𝑘))) ≤ (Σ^{^}‘(𝑘 ∈ 𝑍 ↦ (𝐹‘𝑘))))
36	35	3ad2ant1 1134	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍 ∧ (𝐺‘𝑗) = 𝑧) → (Σ^{^}‘(𝑘 ∈ (𝑀...𝑗) ↦ (𝐹‘𝑘))) ≤ (Σ^{^}‘(𝑘 ∈ 𝑍 ↦ (𝐹‘𝑘))))
37		fzfid 13938	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝑀...𝑗) ∈ Fin)
38	32, 5	sylan2 594	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑗)) → (𝐹‘𝑘) ∈ (0[,)+∞))
39	37, 38	sge0fsummpt 45106	. . . . . . . . . . . . 13 ⊢ (𝜑 → (Σ^{^}‘(𝑘 ∈ (𝑀...𝑗) ↦ (𝐹‘𝑘))) = Σ𝑘 ∈ (𝑀...𝑗)(𝐹‘𝑘))
40	39	3ad2ant1 1134	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍 ∧ (𝐺‘𝑗) = 𝑧) → (Σ^{^}‘(𝑘 ∈ (𝑀...𝑗) ↦ (𝐹‘𝑘))) = Σ𝑘 ∈ (𝑀...𝑗)(𝐹‘𝑘))
41		simpll 766	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (𝑀...𝑗)) → 𝜑)
42	32	adantl 483	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (𝑀...𝑗)) → 𝑘 ∈ 𝑍)
43		eqidd 2734	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) = (𝐹‘𝑘))
44	41, 42, 43	syl2anc 585	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (𝑀...𝑗)) → (𝐹‘𝑘) = (𝐹‘𝑘))
45	1	eleq2i 2826	. . . . . . . . . . . . . . . 16 ⊢ (𝑗 ∈ 𝑍 ↔ 𝑗 ∈ (ℤ_≥‘𝑀))
46	45	biimpi 215	. . . . . . . . . . . . . . 15 ⊢ (𝑗 ∈ 𝑍 → 𝑗 ∈ (ℤ_≥‘𝑀))
47	46	adantl 483	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → 𝑗 ∈ (ℤ_≥‘𝑀))
48	6	recnd 11242	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ ℂ)
49	41, 42, 48	syl2anc 585	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (𝑀...𝑗)) → (𝐹‘𝑘) ∈ ℂ)
50	44, 47, 49	fsumser 15676	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → Σ𝑘 ∈ (𝑀...𝑗)(𝐹‘𝑘) = (seq𝑀( + , 𝐹)‘𝑗))
51	50	3adant3 1133	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍 ∧ (𝐺‘𝑗) = 𝑧) → Σ𝑘 ∈ (𝑀...𝑗)(𝐹‘𝑘) = (seq𝑀( + , 𝐹)‘𝑗))
52	40, 51	eqtrd 2773	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍 ∧ (𝐺‘𝑗) = 𝑧) → (Σ^{^}‘(𝑘 ∈ (𝑀...𝑗) ↦ (𝐹‘𝑘))) = (seq𝑀( + , 𝐹)‘𝑗))
53	10	eqcomi 2742	. . . . . . . . . . . . 13 ⊢ seq𝑀( + , 𝐹) = 𝐺
54	53	fveq1i 6893	. . . . . . . . . . . 12 ⊢ (seq𝑀( + , 𝐹)‘𝑗) = (𝐺‘𝑗)
55	54	a1i 11	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍 ∧ (𝐺‘𝑗) = 𝑧) → (seq𝑀( + , 𝐹)‘𝑗) = (𝐺‘𝑗))
56		simp3 1139	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍 ∧ (𝐺‘𝑗) = 𝑧) → (𝐺‘𝑗) = 𝑧)
57	52, 55, 56	3eqtrrd 2778	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍 ∧ (𝐺‘𝑗) = 𝑧) → 𝑧 = (Σ^{^}‘(𝑘 ∈ (𝑀...𝑗) ↦ (𝐹‘𝑘))))
58	4	feqmptd 6961	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐹 = (𝑘 ∈ 𝑍 ↦ (𝐹‘𝑘)))
59	58	fveq2d 6896	. . . . . . . . . . 11 ⊢ (𝜑 → (Σ^{^}‘𝐹) = (Σ^{^}‘(𝑘 ∈ 𝑍 ↦ (𝐹‘𝑘))))
60	59	3ad2ant1 1134	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍 ∧ (𝐺‘𝑗) = 𝑧) → (Σ^{^}‘𝐹) = (Σ^{^}‘(𝑘 ∈ 𝑍 ↦ (𝐹‘𝑘))))
61	57, 60	breq12d 5162	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍 ∧ (𝐺‘𝑗) = 𝑧) → (𝑧 ≤ (Σ^{^}‘𝐹) ↔ (Σ^{^}‘(𝑘 ∈ (𝑀...𝑗) ↦ (𝐹‘𝑘))) ≤ (Σ^{^}‘(𝑘 ∈ 𝑍 ↦ (𝐹‘𝑘)))))
62	36, 61	mpbird 257	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍 ∧ (𝐺‘𝑗) = 𝑧) → 𝑧 ≤ (Σ^{^}‘𝐹))
63	62	3exp 1120	. . . . . . 7 ⊢ (𝜑 → (𝑗 ∈ 𝑍 → ((𝐺‘𝑗) = 𝑧 → 𝑧 ≤ (Σ^{^}‘𝐹))))
64	63	adantr 482	. . . . . 6 ⊢ ((𝜑 ∧ 𝑧 ∈ ran 𝐺) → (𝑗 ∈ 𝑍 → ((𝐺‘𝑗) = 𝑧 → 𝑧 ≤ (Σ^{^}‘𝐹))))
65	64	rexlimdv 3154	. . . . 5 ⊢ ((𝜑 ∧ 𝑧 ∈ ran 𝐺) → (∃𝑗 ∈ 𝑍 (𝐺‘𝑗) = 𝑧 → 𝑧 ≤ (Σ^{^}‘𝐹)))
66	29, 65	mpd 15	. . . 4 ⊢ ((𝜑 ∧ 𝑧 ∈ ran 𝐺) → 𝑧 ≤ (Σ^{^}‘𝐹))
67	66	ralrimiva 3147	. . 3 ⊢ (𝜑 → ∀𝑧 ∈ ran 𝐺 𝑧 ≤ (Σ^{^}‘𝐹))
68		nfv 1918	. . . . . . . 8 ⊢ Ⅎ𝑘((𝜑 ∧ 𝑧 ∈ ℝ) ∧ 𝑧 < (Σ^{^}‘𝐹))
69	18	a1i 11	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑧 ∈ ℝ) ∧ 𝑧 < (Σ^{^}‘𝐹)) → 𝑍 ∈ V)
70	5	ad4ant14 751	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑧 ∈ ℝ) ∧ 𝑧 < (Σ^{^}‘𝐹)) ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ (0[,)+∞))
71		simplr 768	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑧 ∈ ℝ) ∧ 𝑧 < (Σ^{^}‘𝐹)) → 𝑧 ∈ ℝ)
72		simpr 486	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑧 < (Σ^{^}‘𝐹)) → 𝑧 < (Σ^{^}‘𝐹))
73	59	adantr 482	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑧 < (Σ^{^}‘𝐹)) → (Σ^{^}‘𝐹) = (Σ^{^}‘(𝑘 ∈ 𝑍 ↦ (𝐹‘𝑘))))
74	72, 73	breqtrd 5175	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑧 < (Σ^{^}‘𝐹)) → 𝑧 < (Σ^{^}‘(𝑘 ∈ 𝑍 ↦ (𝐹‘𝑘))))
75	74	adantlr 714	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑧 ∈ ℝ) ∧ 𝑧 < (Σ^{^}‘𝐹)) → 𝑧 < (Σ^{^}‘(𝑘 ∈ 𝑍 ↦ (𝐹‘𝑘))))
76	68, 69, 70, 71, 75	sge0gtfsumgt 45159	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑧 ∈ ℝ) ∧ 𝑧 < (Σ^{^}‘𝐹)) → ∃𝑤 ∈ (𝒫 𝑍 ∩ Fin)𝑧 < Σ𝑘 ∈ 𝑤 (𝐹‘𝑘))
77	2	3ad2ant1 1134	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑤 ∈ (𝒫 𝑍 ∩ Fin) ∧ 𝑧 < Σ𝑘 ∈ 𝑤 (𝐹‘𝑘)) → 𝑀 ∈ ℤ)
78		elpwinss 43736	. . . . . . . . . . . . . 14 ⊢ (𝑤 ∈ (𝒫 𝑍 ∩ Fin) → 𝑤 ⊆ 𝑍)
79	78	3ad2ant2 1135	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑤 ∈ (𝒫 𝑍 ∩ Fin) ∧ 𝑧 < Σ𝑘 ∈ 𝑤 (𝐹‘𝑘)) → 𝑤 ⊆ 𝑍)
80		elinel2 4197	. . . . . . . . . . . . . 14 ⊢ (𝑤 ∈ (𝒫 𝑍 ∩ Fin) → 𝑤 ∈ Fin)
81	80	3ad2ant2 1135	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑤 ∈ (𝒫 𝑍 ∩ Fin) ∧ 𝑧 < Σ𝑘 ∈ 𝑤 (𝐹‘𝑘)) → 𝑤 ∈ Fin)
82	77, 1, 79, 81	uzfissfz 44036	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑤 ∈ (𝒫 𝑍 ∩ Fin) ∧ 𝑧 < Σ𝑘 ∈ 𝑤 (𝐹‘𝑘)) → ∃𝑗 ∈ 𝑍 𝑤 ⊆ (𝑀...𝑗))
83	82	3adant1r 1178	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑧 ∈ ℝ) ∧ 𝑤 ∈ (𝒫 𝑍 ∩ Fin) ∧ 𝑧 < Σ𝑘 ∈ 𝑤 (𝐹‘𝑘)) → ∃𝑗 ∈ 𝑍 𝑤 ⊆ (𝑀...𝑗))
84		simpl1r 1226	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑧 ∈ ℝ) ∧ 𝑤 ∈ (𝒫 𝑍 ∩ Fin) ∧ 𝑧 < Σ𝑘 ∈ 𝑤 (𝐹‘𝑘)) ∧ 𝑤 ⊆ (𝑀...𝑗)) → 𝑧 ∈ ℝ)
85	80	adantl 483	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑤 ∈ (𝒫 𝑍 ∩ Fin)) → 𝑤 ∈ Fin)
86	58, 6	fmpt3d 7116	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → 𝐹:𝑍⟶ℝ)
87	86	ad2antrr 725	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑤 ∈ (𝒫 𝑍 ∩ Fin)) ∧ 𝑘 ∈ 𝑤) → 𝐹:𝑍⟶ℝ)
88	78	sselda 3983	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑤 ∈ (𝒫 𝑍 ∩ Fin) ∧ 𝑘 ∈ 𝑤) → 𝑘 ∈ 𝑍)
89	88	adantll 713	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑤 ∈ (𝒫 𝑍 ∩ Fin)) ∧ 𝑘 ∈ 𝑤) → 𝑘 ∈ 𝑍)
90	87, 89	ffvelcdmd 7088	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑤 ∈ (𝒫 𝑍 ∩ Fin)) ∧ 𝑘 ∈ 𝑤) → (𝐹‘𝑘) ∈ ℝ)
91	85, 90	fsumrecl 15680	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑤 ∈ (𝒫 𝑍 ∩ Fin)) → Σ𝑘 ∈ 𝑤 (𝐹‘𝑘) ∈ ℝ)
92	91	ad4ant13 750	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑧 ∈ ℝ) ∧ 𝑤 ∈ (𝒫 𝑍 ∩ Fin)) ∧ 𝑤 ⊆ (𝑀...𝑗)) → Σ𝑘 ∈ 𝑤 (𝐹‘𝑘) ∈ ℝ)
93	92	3adantl3 1169	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑧 ∈ ℝ) ∧ 𝑤 ∈ (𝒫 𝑍 ∩ Fin) ∧ 𝑧 < Σ𝑘 ∈ 𝑤 (𝐹‘𝑘)) ∧ 𝑤 ⊆ (𝑀...𝑗)) → Σ𝑘 ∈ 𝑤 (𝐹‘𝑘) ∈ ℝ)
94	32, 6	sylan2 594	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑗)) → (𝐹‘𝑘) ∈ ℝ)
95	37, 94	fsumrecl 15680	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → Σ𝑘 ∈ (𝑀...𝑗)(𝐹‘𝑘) ∈ ℝ)
96	95	ad3antrrr 729	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑧 ∈ ℝ) ∧ 𝑤 ∈ (𝒫 𝑍 ∩ Fin)) ∧ 𝑤 ⊆ (𝑀...𝑗)) → Σ𝑘 ∈ (𝑀...𝑗)(𝐹‘𝑘) ∈ ℝ)
97	96	3adantl3 1169	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑧 ∈ ℝ) ∧ 𝑤 ∈ (𝒫 𝑍 ∩ Fin) ∧ 𝑧 < Σ𝑘 ∈ 𝑤 (𝐹‘𝑘)) ∧ 𝑤 ⊆ (𝑀...𝑗)) → Σ𝑘 ∈ (𝑀...𝑗)(𝐹‘𝑘) ∈ ℝ)
98		simpl3 1194	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑧 ∈ ℝ) ∧ 𝑤 ∈ (𝒫 𝑍 ∩ Fin) ∧ 𝑧 < Σ𝑘 ∈ 𝑤 (𝐹‘𝑘)) ∧ 𝑤 ⊆ (𝑀...𝑗)) → 𝑧 < Σ𝑘 ∈ 𝑤 (𝐹‘𝑘))
99	37	adantr 482	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑤 ⊆ (𝑀...𝑗)) → (𝑀...𝑗) ∈ Fin)
100	94	adantlr 714	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑤 ⊆ (𝑀...𝑗)) ∧ 𝑘 ∈ (𝑀...𝑗)) → (𝐹‘𝑘) ∈ ℝ)
101		0xr 11261	. . . . . . . . . . . . . . . . . . . . 21 ⊢ 0 ∈ ℝ^*
102	101	a1i 11	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 0 ∈ ℝ^*)
103		pnfxr 11268	. . . . . . . . . . . . . . . . . . . . 21 ⊢ +∞ ∈ ℝ^*
104	103	a1i 11	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → +∞ ∈ ℝ^*)
105		icogelb 13375	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((0 ∈ ℝ^* ∧ +∞ ∈ ℝ^* ∧ (𝐹‘𝑘) ∈ (0[,)+∞)) → 0 ≤ (𝐹‘𝑘))
106	102, 104, 5, 105	syl3anc 1372	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 0 ≤ (𝐹‘𝑘))
107	32, 106	sylan2 594	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑗)) → 0 ≤ (𝐹‘𝑘))
108	107	adantlr 714	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑤 ⊆ (𝑀...𝑗)) ∧ 𝑘 ∈ (𝑀...𝑗)) → 0 ≤ (𝐹‘𝑘))
109		simpr 486	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑤 ⊆ (𝑀...𝑗)) → 𝑤 ⊆ (𝑀...𝑗))
110	99, 100, 108, 109	fsumless 15742	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑤 ⊆ (𝑀...𝑗)) → Σ𝑘 ∈ 𝑤 (𝐹‘𝑘) ≤ Σ𝑘 ∈ (𝑀...𝑗)(𝐹‘𝑘))
111	110	adantlr 714	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑧 ∈ ℝ) ∧ 𝑤 ⊆ (𝑀...𝑗)) → Σ𝑘 ∈ 𝑤 (𝐹‘𝑘) ≤ Σ𝑘 ∈ (𝑀...𝑗)(𝐹‘𝑘))
112	111	3ad2antl1 1186	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑧 ∈ ℝ) ∧ 𝑤 ∈ (𝒫 𝑍 ∩ Fin) ∧ 𝑧 < Σ𝑘 ∈ 𝑤 (𝐹‘𝑘)) ∧ 𝑤 ⊆ (𝑀...𝑗)) → Σ𝑘 ∈ 𝑤 (𝐹‘𝑘) ≤ Σ𝑘 ∈ (𝑀...𝑗)(𝐹‘𝑘))
113	84, 93, 97, 98, 112	ltletrd 11374	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑧 ∈ ℝ) ∧ 𝑤 ∈ (𝒫 𝑍 ∩ Fin) ∧ 𝑧 < Σ𝑘 ∈ 𝑤 (𝐹‘𝑘)) ∧ 𝑤 ⊆ (𝑀...𝑗)) → 𝑧 < Σ𝑘 ∈ (𝑀...𝑗)(𝐹‘𝑘))
114	113	ex 414	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑧 ∈ ℝ) ∧ 𝑤 ∈ (𝒫 𝑍 ∩ Fin) ∧ 𝑧 < Σ𝑘 ∈ 𝑤 (𝐹‘𝑘)) → (𝑤 ⊆ (𝑀...𝑗) → 𝑧 < Σ𝑘 ∈ (𝑀...𝑗)(𝐹‘𝑘)))
115	114	reximdv 3171	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑧 ∈ ℝ) ∧ 𝑤 ∈ (𝒫 𝑍 ∩ Fin) ∧ 𝑧 < Σ𝑘 ∈ 𝑤 (𝐹‘𝑘)) → (∃𝑗 ∈ 𝑍 𝑤 ⊆ (𝑀...𝑗) → ∃𝑗 ∈ 𝑍 𝑧 < Σ𝑘 ∈ (𝑀...𝑗)(𝐹‘𝑘)))
116	83, 115	mpd 15	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑧 ∈ ℝ) ∧ 𝑤 ∈ (𝒫 𝑍 ∩ Fin) ∧ 𝑧 < Σ𝑘 ∈ 𝑤 (𝐹‘𝑘)) → ∃𝑗 ∈ 𝑍 𝑧 < Σ𝑘 ∈ (𝑀...𝑗)(𝐹‘𝑘))
117	116	3exp 1120	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑧 ∈ ℝ) → (𝑤 ∈ (𝒫 𝑍 ∩ Fin) → (𝑧 < Σ𝑘 ∈ 𝑤 (𝐹‘𝑘) → ∃𝑗 ∈ 𝑍 𝑧 < Σ𝑘 ∈ (𝑀...𝑗)(𝐹‘𝑘))))
118	117	adantr 482	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑧 ∈ ℝ) ∧ 𝑧 < (Σ^{^}‘𝐹)) → (𝑤 ∈ (𝒫 𝑍 ∩ Fin) → (𝑧 < Σ𝑘 ∈ 𝑤 (𝐹‘𝑘) → ∃𝑗 ∈ 𝑍 𝑧 < Σ𝑘 ∈ (𝑀...𝑗)(𝐹‘𝑘))))
119	118	rexlimdv 3154	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑧 ∈ ℝ) ∧ 𝑧 < (Σ^{^}‘𝐹)) → (∃𝑤 ∈ (𝒫 𝑍 ∩ Fin)𝑧 < Σ𝑘 ∈ 𝑤 (𝐹‘𝑘) → ∃𝑗 ∈ 𝑍 𝑧 < Σ𝑘 ∈ (𝑀...𝑗)(𝐹‘𝑘)))
120	76, 119	mpd 15	. . . . . 6 ⊢ (((𝜑 ∧ 𝑧 ∈ ℝ) ∧ 𝑧 < (Σ^{^}‘𝐹)) → ∃𝑗 ∈ 𝑍 𝑧 < Σ𝑘 ∈ (𝑀...𝑗)(𝐹‘𝑘))
121	9	ffnd 6719	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → seq𝑀( + , 𝐹) Fn 𝑍)
122	121	adantr 482	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → seq𝑀( + , 𝐹) Fn 𝑍)
123	47, 45	sylibr 233	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → 𝑗 ∈ 𝑍)
124		fnfvelrn 7083	. . . . . . . . . . . . . 14 ⊢ ((seq𝑀( + , 𝐹) Fn 𝑍 ∧ 𝑗 ∈ 𝑍) → (seq𝑀( + , 𝐹)‘𝑗) ∈ ran seq𝑀( + , 𝐹))
125	122, 123, 124	syl2anc 585	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → (seq𝑀( + , 𝐹)‘𝑗) ∈ ran seq𝑀( + , 𝐹))
126	10	a1i 11	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → 𝐺 = seq𝑀( + , 𝐹))
127	126	rneqd 5938	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → ran 𝐺 = ran seq𝑀( + , 𝐹))
128	50, 127	eleq12d 2828	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → (Σ𝑘 ∈ (𝑀...𝑗)(𝐹‘𝑘) ∈ ran 𝐺 ↔ (seq𝑀( + , 𝐹)‘𝑗) ∈ ran seq𝑀( + , 𝐹)))
129	125, 128	mpbird 257	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → Σ𝑘 ∈ (𝑀...𝑗)(𝐹‘𝑘) ∈ ran 𝐺)
130	129	adantlr 714	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑧 ∈ ℝ) ∧ 𝑗 ∈ 𝑍) → Σ𝑘 ∈ (𝑀...𝑗)(𝐹‘𝑘) ∈ ran 𝐺)
131	130	3adant3 1133	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑧 ∈ ℝ) ∧ 𝑗 ∈ 𝑍 ∧ 𝑧 < Σ𝑘 ∈ (𝑀...𝑗)(𝐹‘𝑘)) → Σ𝑘 ∈ (𝑀...𝑗)(𝐹‘𝑘) ∈ ran 𝐺)
132		simp3 1139	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑧 ∈ ℝ) ∧ 𝑗 ∈ 𝑍 ∧ 𝑧 < Σ𝑘 ∈ (𝑀...𝑗)(𝐹‘𝑘)) → 𝑧 < Σ𝑘 ∈ (𝑀...𝑗)(𝐹‘𝑘))
133		breq2 5153	. . . . . . . . . . 11 ⊢ (𝑦 = Σ𝑘 ∈ (𝑀...𝑗)(𝐹‘𝑘) → (𝑧 < 𝑦 ↔ 𝑧 < Σ𝑘 ∈ (𝑀...𝑗)(𝐹‘𝑘)))
134	133	rspcev 3613	. . . . . . . . . 10 ⊢ ((Σ𝑘 ∈ (𝑀...𝑗)(𝐹‘𝑘) ∈ ran 𝐺 ∧ 𝑧 < Σ𝑘 ∈ (𝑀...𝑗)(𝐹‘𝑘)) → ∃𝑦 ∈ ran 𝐺 𝑧 < 𝑦)
135	131, 132, 134	syl2anc 585	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑧 ∈ ℝ) ∧ 𝑗 ∈ 𝑍 ∧ 𝑧 < Σ𝑘 ∈ (𝑀...𝑗)(𝐹‘𝑘)) → ∃𝑦 ∈ ran 𝐺 𝑧 < 𝑦)
136	135	3exp 1120	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑧 ∈ ℝ) → (𝑗 ∈ 𝑍 → (𝑧 < Σ𝑘 ∈ (𝑀...𝑗)(𝐹‘𝑘) → ∃𝑦 ∈ ran 𝐺 𝑧 < 𝑦)))
137	136	rexlimdv 3154	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑧 ∈ ℝ) → (∃𝑗 ∈ 𝑍 𝑧 < Σ𝑘 ∈ (𝑀...𝑗)(𝐹‘𝑘) → ∃𝑦 ∈ ran 𝐺 𝑧 < 𝑦))
138	137	adantr 482	. . . . . 6 ⊢ (((𝜑 ∧ 𝑧 ∈ ℝ) ∧ 𝑧 < (Σ^{^}‘𝐹)) → (∃𝑗 ∈ 𝑍 𝑧 < Σ𝑘 ∈ (𝑀...𝑗)(𝐹‘𝑘) → ∃𝑦 ∈ ran 𝐺 𝑧 < 𝑦))
139	120, 138	mpd 15	. . . . 5 ⊢ (((𝜑 ∧ 𝑧 ∈ ℝ) ∧ 𝑧 < (Σ^{^}‘𝐹)) → ∃𝑦 ∈ ran 𝐺 𝑧 < 𝑦)
140	139	ex 414	. . . 4 ⊢ ((𝜑 ∧ 𝑧 ∈ ℝ) → (𝑧 < (Σ^{^}‘𝐹) → ∃𝑦 ∈ ran 𝐺 𝑧 < 𝑦))
141	140	ralrimiva 3147	. . 3 ⊢ (𝜑 → ∀𝑧 ∈ ℝ (𝑧 < (Σ^{^}‘𝐹) → ∃𝑦 ∈ ran 𝐺 𝑧 < 𝑦))
142		supxr2 13293	. . 3 ⊢ (((ran 𝐺 ⊆ ℝ^* ∧ (Σ^{^}‘𝐹) ∈ ℝ^) ∧ (∀𝑧 ∈ ran 𝐺 𝑧 ≤ (Σ^{^}‘𝐹) ∧ ∀𝑧 ∈ ℝ (𝑧 < (Σ^{^}‘𝐹) → ∃𝑦 ∈ ran 𝐺 𝑧 < 𝑦))) → sup(ran 𝐺, ℝ^, < ) = (Σ^{^}‘𝐹))
143	17, 23, 67, 141, 142	syl22anc 838	. 2 ⊢ (𝜑 → sup(ran 𝐺, ℝ^*, < ) = (Σ^{^}‘𝐹))
144	143	eqcomd 2739	1 ⊢ (𝜑 → (Σ^{^}‘𝐹) = sup(ran 𝐺, ℝ^*, < ))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 397 ∧ w3a 1088 = wceq 1542 ∈ wcel 2107 ∀wral 3062 ∃wrex 3071 Vcvv 3475 ∩ cin 3948 ⊆ wss 3949 𝒫 cpw 4603 class class class wbr 5149 ↦ cmpt 5232 ran crn 5678 Fn wfn 6539 ⟶wf 6540 ‘cfv 6544 (class class class)co 7409 Fincfn 8939 supcsup 9435 ℂcc 11108 ℝcr 11109 0cc0 11110 + caddc 11113 +∞cpnf 11245 ℝ^*cxr 11247 < clt 11248 ≤ cle 11249 ℤcz 12558 ℤ_≥cuz 12822 [,)cico 13326 [,]cicc 13327 ...cfz 13484 seqcseq 13966 Σcsu 15632 Σ^{^}csumge0 45078

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-rep 5286 ax-sep 5300 ax-nul 5307 ax-pow 5364 ax-pr 5428 ax-un 7725 ax-inf2 9636 ax-cnex 11166 ax-resscn 11167 ax-1cn 11168 ax-icn 11169 ax-addcl 11170 ax-addrcl 11171 ax-mulcl 11172 ax-mulrcl 11173 ax-mulcom 11174 ax-addass 11175 ax-mulass 11176 ax-distr 11177 ax-i2m1 11178 ax-1ne0 11179 ax-1rid 11180 ax-rnegex 11181 ax-rrecex 11182 ax-cnre 11183 ax-pre-lttri 11184 ax-pre-lttrn 11185 ax-pre-ltadd 11186 ax-pre-mulgt0 11187 ax-pre-sup 11188

This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-rmo 3377 df-reu 3378 df-rab 3434 df-v 3477 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-pss 3968 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4910 df-int 4952 df-iun 5000 df-br 5150 df-opab 5212 df-mpt 5233 df-tr 5267 df-id 5575 df-eprel 5581 df-po 5589 df-so 5590 df-fr 5632 df-se 5633 df-we 5634 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 df-pred 6301 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6496 df-fun 6546 df-fn 6547 df-f 6548 df-f1 6549 df-fo 6550 df-f1o 6551 df-fv 6552 df-isom 6553 df-riota 7365 df-ov 7412 df-oprab 7413 df-mpo 7414 df-om 7856 df-1st 7975 df-2nd 7976 df-frecs 8266 df-wrecs 8297 df-recs 8371 df-rdg 8410 df-1o 8466 df-er 8703 df-en 8940 df-dom 8941 df-sdom 8942 df-fin 8943 df-sup 9437 df-oi 9505 df-card 9934 df-pnf 11250 df-mnf 11251 df-xr 11252 df-ltxr 11253 df-le 11254 df-sub 11446 df-neg 11447 df-div 11872 df-nn 12213 df-2 12275 df-3 12276 df-n0 12473 df-z 12559 df-uz 12823 df-rp 12975 df-ico 13330 df-icc 13331 df-fz 13485 df-fzo 13628 df-seq 13967 df-exp 14028 df-hash 14291 df-cj 15046 df-re 15047 df-im 15048 df-sqrt 15182 df-abs 15183 df-clim 15432 df-sum 15633 df-sumge0 45079

This theorem is referenced by: voliunsge0lem 45188 ovolval2 45360

W3C validator