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 45460

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 13437	. . . . . . . 8 ⊢ (0[,)+∞) ⊆ ℝ
4		sge0seq.f	. . . . . . . . 9 ⊢ (𝜑 → 𝐹:𝑍⟶(0[,)+∞))
5	4	ffvelcdmda 7085	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ (0[,)+∞))
6	3, 5	sselid 3979	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ ℝ)
7		readdcl 11195	. . . . . . . 8 ⊢ ((𝑘 ∈ ℝ ∧ 𝑖 ∈ ℝ) → (𝑘 + 𝑖) ∈ ℝ)
8	7	adantl 480	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑘 ∈ ℝ ∧ 𝑖 ∈ ℝ)) → (𝑘 + 𝑖) ∈ ℝ)
9	1, 2, 6, 8	seqf 13993	. . . . . 6 ⊢ (𝜑 → seq𝑀( + , 𝐹):𝑍⟶ℝ)
10		sge0seq.g	. . . . . . . 8 ⊢ 𝐺 = seq𝑀( + , 𝐹)
11	10	a1i 11	. . . . . . 7 ⊢ (𝜑 → 𝐺 = seq𝑀( + , 𝐹))
12	11	feq1d 6701	. . . . . 6 ⊢ (𝜑 → (𝐺:𝑍⟶ℝ ↔ seq𝑀( + , 𝐹):𝑍⟶ℝ))
13	9, 12	mpbird 256	. . . . 5 ⊢ (𝜑 → 𝐺:𝑍⟶ℝ)
14	13	frnd 6724	. . . 4 ⊢ (𝜑 → ran 𝐺 ⊆ ℝ)
15		ressxr 11262	. . . . 5 ⊢ ℝ ⊆ ℝ^*
16	15	a1i 11	. . . 4 ⊢ (𝜑 → ℝ ⊆ ℝ^*)
17	14, 16	sstrd 3991	. . 3 ⊢ (𝜑 → ran 𝐺 ⊆ ℝ^*)
18	1	fvexi 6904	. . . . 5 ⊢ 𝑍 ∈ V
19	18	a1i 11	. . . 4 ⊢ (𝜑 → 𝑍 ∈ V)
20		icossicc 13417	. . . . . 6 ⊢ (0[,)+∞) ⊆ (0[,]+∞)
21	20	a1i 11	. . . . 5 ⊢ (𝜑 → (0[,)+∞) ⊆ (0[,]+∞))
22	4, 21	fssd 6734	. . . 4 ⊢ (𝜑 → 𝐹:𝑍⟶(0[,]+∞))
23	19, 22	sge0xrcl 45399	. . 3 ⊢ (𝜑 → (Σ^{^}‘𝐹) ∈ ℝ^*)
24		simpr 483	. . . . . 6 ⊢ ((𝜑 ∧ 𝑧 ∈ ran 𝐺) → 𝑧 ∈ ran 𝐺)
25	13	ffnd 6717	. . . . . . . 8 ⊢ (𝜑 → 𝐺 Fn 𝑍)
26		fvelrnb 6951	. . . . . . . 8 ⊢ (𝐺 Fn 𝑍 → (𝑧 ∈ ran 𝐺 ↔ ∃𝑗 ∈ 𝑍 (𝐺‘𝑗) = 𝑧))
27	25, 26	syl 17	. . . . . . 7 ⊢ (𝜑 → (𝑧 ∈ ran 𝐺 ↔ ∃𝑗 ∈ 𝑍 (𝐺‘𝑗) = 𝑧))
28	27	adantr 479	. . . . . 6 ⊢ ((𝜑 ∧ 𝑧 ∈ ran 𝐺) → (𝑧 ∈ ran 𝐺 ↔ ∃𝑗 ∈ 𝑍 (𝐺‘𝑗) = 𝑧))
29	24, 28	mpbid 231	. . . . 5 ⊢ ((𝜑 ∧ 𝑧 ∈ ran 𝐺) → ∃𝑗 ∈ 𝑍 (𝐺‘𝑗) = 𝑧)
30	20, 5	sselid 3979	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ (0[,]+∞))
31		elfzuz 13501	. . . . . . . . . . . . . 14 ⊢ (𝑘 ∈ (𝑀...𝑗) → 𝑘 ∈ (ℤ_≥‘𝑀))
32	31, 1	eleqtrrdi 2842	. . . . . . . . . . . . 13 ⊢ (𝑘 ∈ (𝑀...𝑗) → 𝑘 ∈ 𝑍)
33	32	ssriv 3985	. . . . . . . . . . . 12 ⊢ (𝑀...𝑗) ⊆ 𝑍
34	33	a1i 11	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑀...𝑗) ⊆ 𝑍)
35	19, 30, 34	sge0lessmpt 45413	. . . . . . . . . 10 ⊢ (𝜑 → (Σ^{^}‘(𝑘 ∈ (𝑀...𝑗) ↦ (𝐹‘𝑘))) ≤ (Σ^{^}‘(𝑘 ∈ 𝑍 ↦ (𝐹‘𝑘))))
36	35	3ad2ant1 1131	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍 ∧ (𝐺‘𝑗) = 𝑧) → (Σ^{^}‘(𝑘 ∈ (𝑀...𝑗) ↦ (𝐹‘𝑘))) ≤ (Σ^{^}‘(𝑘 ∈ 𝑍 ↦ (𝐹‘𝑘))))
37		fzfid 13942	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝑀...𝑗) ∈ Fin)
38	32, 5	sylan2 591	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑗)) → (𝐹‘𝑘) ∈ (0[,)+∞))
39	37, 38	sge0fsummpt 45404	. . . . . . . . . . . . 13 ⊢ (𝜑 → (Σ^{^}‘(𝑘 ∈ (𝑀...𝑗) ↦ (𝐹‘𝑘))) = Σ𝑘 ∈ (𝑀...𝑗)(𝐹‘𝑘))
40	39	3ad2ant1 1131	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍 ∧ (𝐺‘𝑗) = 𝑧) → (Σ^{^}‘(𝑘 ∈ (𝑀...𝑗) ↦ (𝐹‘𝑘))) = Σ𝑘 ∈ (𝑀...𝑗)(𝐹‘𝑘))
41		simpll 763	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (𝑀...𝑗)) → 𝜑)
42	32	adantl 480	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (𝑀...𝑗)) → 𝑘 ∈ 𝑍)
43		eqidd 2731	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) = (𝐹‘𝑘))
44	41, 42, 43	syl2anc 582	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (𝑀...𝑗)) → (𝐹‘𝑘) = (𝐹‘𝑘))
45	1	eleq2i 2823	. . . . . . . . . . . . . . . 16 ⊢ (𝑗 ∈ 𝑍 ↔ 𝑗 ∈ (ℤ_≥‘𝑀))
46	45	biimpi 215	. . . . . . . . . . . . . . 15 ⊢ (𝑗 ∈ 𝑍 → 𝑗 ∈ (ℤ_≥‘𝑀))
47	46	adantl 480	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → 𝑗 ∈ (ℤ_≥‘𝑀))
48	6	recnd 11246	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ ℂ)
49	41, 42, 48	syl2anc 582	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (𝑀...𝑗)) → (𝐹‘𝑘) ∈ ℂ)
50	44, 47, 49	fsumser 15680	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → Σ𝑘 ∈ (𝑀...𝑗)(𝐹‘𝑘) = (seq𝑀( + , 𝐹)‘𝑗))
51	50	3adant3 1130	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍 ∧ (𝐺‘𝑗) = 𝑧) → Σ𝑘 ∈ (𝑀...𝑗)(𝐹‘𝑘) = (seq𝑀( + , 𝐹)‘𝑗))
52	40, 51	eqtrd 2770	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍 ∧ (𝐺‘𝑗) = 𝑧) → (Σ^{^}‘(𝑘 ∈ (𝑀...𝑗) ↦ (𝐹‘𝑘))) = (seq𝑀( + , 𝐹)‘𝑗))
53	10	eqcomi 2739	. . . . . . . . . . . . 13 ⊢ seq𝑀( + , 𝐹) = 𝐺
54	53	fveq1i 6891	. . . . . . . . . . . 12 ⊢ (seq𝑀( + , 𝐹)‘𝑗) = (𝐺‘𝑗)
55	54	a1i 11	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍 ∧ (𝐺‘𝑗) = 𝑧) → (seq𝑀( + , 𝐹)‘𝑗) = (𝐺‘𝑗))
56		simp3 1136	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍 ∧ (𝐺‘𝑗) = 𝑧) → (𝐺‘𝑗) = 𝑧)
57	52, 55, 56	3eqtrrd 2775	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍 ∧ (𝐺‘𝑗) = 𝑧) → 𝑧 = (Σ^{^}‘(𝑘 ∈ (𝑀...𝑗) ↦ (𝐹‘𝑘))))
58	4	feqmptd 6959	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐹 = (𝑘 ∈ 𝑍 ↦ (𝐹‘𝑘)))
59	58	fveq2d 6894	. . . . . . . . . . 11 ⊢ (𝜑 → (Σ^{^}‘𝐹) = (Σ^{^}‘(𝑘 ∈ 𝑍 ↦ (𝐹‘𝑘))))
60	59	3ad2ant1 1131	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍 ∧ (𝐺‘𝑗) = 𝑧) → (Σ^{^}‘𝐹) = (Σ^{^}‘(𝑘 ∈ 𝑍 ↦ (𝐹‘𝑘))))
61	57, 60	breq12d 5160	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍 ∧ (𝐺‘𝑗) = 𝑧) → (𝑧 ≤ (Σ^{^}‘𝐹) ↔ (Σ^{^}‘(𝑘 ∈ (𝑀...𝑗) ↦ (𝐹‘𝑘))) ≤ (Σ^{^}‘(𝑘 ∈ 𝑍 ↦ (𝐹‘𝑘)))))
62	36, 61	mpbird 256	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍 ∧ (𝐺‘𝑗) = 𝑧) → 𝑧 ≤ (Σ^{^}‘𝐹))
63	62	3exp 1117	. . . . . . 7 ⊢ (𝜑 → (𝑗 ∈ 𝑍 → ((𝐺‘𝑗) = 𝑧 → 𝑧 ≤ (Σ^{^}‘𝐹))))
64	63	adantr 479	. . . . . 6 ⊢ ((𝜑 ∧ 𝑧 ∈ ran 𝐺) → (𝑗 ∈ 𝑍 → ((𝐺‘𝑗) = 𝑧 → 𝑧 ≤ (Σ^{^}‘𝐹))))
65	64	rexlimdv 3151	. . . . 5 ⊢ ((𝜑 ∧ 𝑧 ∈ ran 𝐺) → (∃𝑗 ∈ 𝑍 (𝐺‘𝑗) = 𝑧 → 𝑧 ≤ (Σ^{^}‘𝐹)))
66	29, 65	mpd 15	. . . 4 ⊢ ((𝜑 ∧ 𝑧 ∈ ran 𝐺) → 𝑧 ≤ (Σ^{^}‘𝐹))
67	66	ralrimiva 3144	. . 3 ⊢ (𝜑 → ∀𝑧 ∈ ran 𝐺 𝑧 ≤ (Σ^{^}‘𝐹))
68		nfv 1915	. . . . . . . 8 ⊢ Ⅎ𝑘((𝜑 ∧ 𝑧 ∈ ℝ) ∧ 𝑧 < (Σ^{^}‘𝐹))
69	18	a1i 11	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑧 ∈ ℝ) ∧ 𝑧 < (Σ^{^}‘𝐹)) → 𝑍 ∈ V)
70	5	ad4ant14 748	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑧 ∈ ℝ) ∧ 𝑧 < (Σ^{^}‘𝐹)) ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ (0[,)+∞))
71		simplr 765	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑧 ∈ ℝ) ∧ 𝑧 < (Σ^{^}‘𝐹)) → 𝑧 ∈ ℝ)
72		simpr 483	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑧 < (Σ^{^}‘𝐹)) → 𝑧 < (Σ^{^}‘𝐹))
73	59	adantr 479	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑧 < (Σ^{^}‘𝐹)) → (Σ^{^}‘𝐹) = (Σ^{^}‘(𝑘 ∈ 𝑍 ↦ (𝐹‘𝑘))))
74	72, 73	breqtrd 5173	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑧 < (Σ^{^}‘𝐹)) → 𝑧 < (Σ^{^}‘(𝑘 ∈ 𝑍 ↦ (𝐹‘𝑘))))
75	74	adantlr 711	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑧 ∈ ℝ) ∧ 𝑧 < (Σ^{^}‘𝐹)) → 𝑧 < (Σ^{^}‘(𝑘 ∈ 𝑍 ↦ (𝐹‘𝑘))))
76	68, 69, 70, 71, 75	sge0gtfsumgt 45457	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑧 ∈ ℝ) ∧ 𝑧 < (Σ^{^}‘𝐹)) → ∃𝑤 ∈ (𝒫 𝑍 ∩ Fin)𝑧 < Σ𝑘 ∈ 𝑤 (𝐹‘𝑘))
77	2	3ad2ant1 1131	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑤 ∈ (𝒫 𝑍 ∩ Fin) ∧ 𝑧 < Σ𝑘 ∈ 𝑤 (𝐹‘𝑘)) → 𝑀 ∈ ℤ)
78		elpwinss 44037	. . . . . . . . . . . . . 14 ⊢ (𝑤 ∈ (𝒫 𝑍 ∩ Fin) → 𝑤 ⊆ 𝑍)
79	78	3ad2ant2 1132	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑤 ∈ (𝒫 𝑍 ∩ Fin) ∧ 𝑧 < Σ𝑘 ∈ 𝑤 (𝐹‘𝑘)) → 𝑤 ⊆ 𝑍)
80		elinel2 4195	. . . . . . . . . . . . . 14 ⊢ (𝑤 ∈ (𝒫 𝑍 ∩ Fin) → 𝑤 ∈ Fin)
81	80	3ad2ant2 1132	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑤 ∈ (𝒫 𝑍 ∩ Fin) ∧ 𝑧 < Σ𝑘 ∈ 𝑤 (𝐹‘𝑘)) → 𝑤 ∈ Fin)
82	77, 1, 79, 81	uzfissfz 44334	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑤 ∈ (𝒫 𝑍 ∩ Fin) ∧ 𝑧 < Σ𝑘 ∈ 𝑤 (𝐹‘𝑘)) → ∃𝑗 ∈ 𝑍 𝑤 ⊆ (𝑀...𝑗))
83	82	3adant1r 1175	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑧 ∈ ℝ) ∧ 𝑤 ∈ (𝒫 𝑍 ∩ Fin) ∧ 𝑧 < Σ𝑘 ∈ 𝑤 (𝐹‘𝑘)) → ∃𝑗 ∈ 𝑍 𝑤 ⊆ (𝑀...𝑗))
84		simpl1r 1223	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑧 ∈ ℝ) ∧ 𝑤 ∈ (𝒫 𝑍 ∩ Fin) ∧ 𝑧 < Σ𝑘 ∈ 𝑤 (𝐹‘𝑘)) ∧ 𝑤 ⊆ (𝑀...𝑗)) → 𝑧 ∈ ℝ)
85	80	adantl 480	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑤 ∈ (𝒫 𝑍 ∩ Fin)) → 𝑤 ∈ Fin)
86	58, 6	fmpt3d 7116	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → 𝐹:𝑍⟶ℝ)
87	86	ad2antrr 722	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑤 ∈ (𝒫 𝑍 ∩ Fin)) ∧ 𝑘 ∈ 𝑤) → 𝐹:𝑍⟶ℝ)
88	78	sselda 3981	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑤 ∈ (𝒫 𝑍 ∩ Fin) ∧ 𝑘 ∈ 𝑤) → 𝑘 ∈ 𝑍)
89	88	adantll 710	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑤 ∈ (𝒫 𝑍 ∩ Fin)) ∧ 𝑘 ∈ 𝑤) → 𝑘 ∈ 𝑍)
90	87, 89	ffvelcdmd 7086	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑤 ∈ (𝒫 𝑍 ∩ Fin)) ∧ 𝑘 ∈ 𝑤) → (𝐹‘𝑘) ∈ ℝ)
91	85, 90	fsumrecl 15684	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑤 ∈ (𝒫 𝑍 ∩ Fin)) → Σ𝑘 ∈ 𝑤 (𝐹‘𝑘) ∈ ℝ)
92	91	ad4ant13 747	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑧 ∈ ℝ) ∧ 𝑤 ∈ (𝒫 𝑍 ∩ Fin)) ∧ 𝑤 ⊆ (𝑀...𝑗)) → Σ𝑘 ∈ 𝑤 (𝐹‘𝑘) ∈ ℝ)
93	92	3adantl3 1166	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑧 ∈ ℝ) ∧ 𝑤 ∈ (𝒫 𝑍 ∩ Fin) ∧ 𝑧 < Σ𝑘 ∈ 𝑤 (𝐹‘𝑘)) ∧ 𝑤 ⊆ (𝑀...𝑗)) → Σ𝑘 ∈ 𝑤 (𝐹‘𝑘) ∈ ℝ)
94	32, 6	sylan2 591	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑗)) → (𝐹‘𝑘) ∈ ℝ)
95	37, 94	fsumrecl 15684	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → Σ𝑘 ∈ (𝑀...𝑗)(𝐹‘𝑘) ∈ ℝ)
96	95	ad3antrrr 726	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑧 ∈ ℝ) ∧ 𝑤 ∈ (𝒫 𝑍 ∩ Fin)) ∧ 𝑤 ⊆ (𝑀...𝑗)) → Σ𝑘 ∈ (𝑀...𝑗)(𝐹‘𝑘) ∈ ℝ)
97	96	3adantl3 1166	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑧 ∈ ℝ) ∧ 𝑤 ∈ (𝒫 𝑍 ∩ Fin) ∧ 𝑧 < Σ𝑘 ∈ 𝑤 (𝐹‘𝑘)) ∧ 𝑤 ⊆ (𝑀...𝑗)) → Σ𝑘 ∈ (𝑀...𝑗)(𝐹‘𝑘) ∈ ℝ)
98		simpl3 1191	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑧 ∈ ℝ) ∧ 𝑤 ∈ (𝒫 𝑍 ∩ Fin) ∧ 𝑧 < Σ𝑘 ∈ 𝑤 (𝐹‘𝑘)) ∧ 𝑤 ⊆ (𝑀...𝑗)) → 𝑧 < Σ𝑘 ∈ 𝑤 (𝐹‘𝑘))
99	37	adantr 479	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑤 ⊆ (𝑀...𝑗)) → (𝑀...𝑗) ∈ Fin)
100	94	adantlr 711	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑤 ⊆ (𝑀...𝑗)) ∧ 𝑘 ∈ (𝑀...𝑗)) → (𝐹‘𝑘) ∈ ℝ)
101		0xr 11265	. . . . . . . . . . . . . . . . . . . . 21 ⊢ 0 ∈ ℝ^*
102	101	a1i 11	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 0 ∈ ℝ^*)
103		pnfxr 11272	. . . . . . . . . . . . . . . . . . . . 21 ⊢ +∞ ∈ ℝ^*
104	103	a1i 11	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → +∞ ∈ ℝ^*)
105		icogelb 13379	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((0 ∈ ℝ^* ∧ +∞ ∈ ℝ^* ∧ (𝐹‘𝑘) ∈ (0[,)+∞)) → 0 ≤ (𝐹‘𝑘))
106	102, 104, 5, 105	syl3anc 1369	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 0 ≤ (𝐹‘𝑘))
107	32, 106	sylan2 591	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑗)) → 0 ≤ (𝐹‘𝑘))
108	107	adantlr 711	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑤 ⊆ (𝑀...𝑗)) ∧ 𝑘 ∈ (𝑀...𝑗)) → 0 ≤ (𝐹‘𝑘))
109		simpr 483	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑤 ⊆ (𝑀...𝑗)) → 𝑤 ⊆ (𝑀...𝑗))
110	99, 100, 108, 109	fsumless 15746	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑤 ⊆ (𝑀...𝑗)) → Σ𝑘 ∈ 𝑤 (𝐹‘𝑘) ≤ Σ𝑘 ∈ (𝑀...𝑗)(𝐹‘𝑘))
111	110	adantlr 711	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑧 ∈ ℝ) ∧ 𝑤 ⊆ (𝑀...𝑗)) → Σ𝑘 ∈ 𝑤 (𝐹‘𝑘) ≤ Σ𝑘 ∈ (𝑀...𝑗)(𝐹‘𝑘))
112	111	3ad2antl1 1183	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑧 ∈ ℝ) ∧ 𝑤 ∈ (𝒫 𝑍 ∩ Fin) ∧ 𝑧 < Σ𝑘 ∈ 𝑤 (𝐹‘𝑘)) ∧ 𝑤 ⊆ (𝑀...𝑗)) → Σ𝑘 ∈ 𝑤 (𝐹‘𝑘) ≤ Σ𝑘 ∈ (𝑀...𝑗)(𝐹‘𝑘))
113	84, 93, 97, 98, 112	ltletrd 11378	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑧 ∈ ℝ) ∧ 𝑤 ∈ (𝒫 𝑍 ∩ Fin) ∧ 𝑧 < Σ𝑘 ∈ 𝑤 (𝐹‘𝑘)) ∧ 𝑤 ⊆ (𝑀...𝑗)) → 𝑧 < Σ𝑘 ∈ (𝑀...𝑗)(𝐹‘𝑘))
114	113	ex 411	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑧 ∈ ℝ) ∧ 𝑤 ∈ (𝒫 𝑍 ∩ Fin) ∧ 𝑧 < Σ𝑘 ∈ 𝑤 (𝐹‘𝑘)) → (𝑤 ⊆ (𝑀...𝑗) → 𝑧 < Σ𝑘 ∈ (𝑀...𝑗)(𝐹‘𝑘)))
115	114	reximdv 3168	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑧 ∈ ℝ) ∧ 𝑤 ∈ (𝒫 𝑍 ∩ Fin) ∧ 𝑧 < Σ𝑘 ∈ 𝑤 (𝐹‘𝑘)) → (∃𝑗 ∈ 𝑍 𝑤 ⊆ (𝑀...𝑗) → ∃𝑗 ∈ 𝑍 𝑧 < Σ𝑘 ∈ (𝑀...𝑗)(𝐹‘𝑘)))
116	83, 115	mpd 15	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑧 ∈ ℝ) ∧ 𝑤 ∈ (𝒫 𝑍 ∩ Fin) ∧ 𝑧 < Σ𝑘 ∈ 𝑤 (𝐹‘𝑘)) → ∃𝑗 ∈ 𝑍 𝑧 < Σ𝑘 ∈ (𝑀...𝑗)(𝐹‘𝑘))
117	116	3exp 1117	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑧 ∈ ℝ) → (𝑤 ∈ (𝒫 𝑍 ∩ Fin) → (𝑧 < Σ𝑘 ∈ 𝑤 (𝐹‘𝑘) → ∃𝑗 ∈ 𝑍 𝑧 < Σ𝑘 ∈ (𝑀...𝑗)(𝐹‘𝑘))))
118	117	adantr 479	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑧 ∈ ℝ) ∧ 𝑧 < (Σ^{^}‘𝐹)) → (𝑤 ∈ (𝒫 𝑍 ∩ Fin) → (𝑧 < Σ𝑘 ∈ 𝑤 (𝐹‘𝑘) → ∃𝑗 ∈ 𝑍 𝑧 < Σ𝑘 ∈ (𝑀...𝑗)(𝐹‘𝑘))))
119	118	rexlimdv 3151	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑧 ∈ ℝ) ∧ 𝑧 < (Σ^{^}‘𝐹)) → (∃𝑤 ∈ (𝒫 𝑍 ∩ Fin)𝑧 < Σ𝑘 ∈ 𝑤 (𝐹‘𝑘) → ∃𝑗 ∈ 𝑍 𝑧 < Σ𝑘 ∈ (𝑀...𝑗)(𝐹‘𝑘)))
120	76, 119	mpd 15	. . . . . 6 ⊢ (((𝜑 ∧ 𝑧 ∈ ℝ) ∧ 𝑧 < (Σ^{^}‘𝐹)) → ∃𝑗 ∈ 𝑍 𝑧 < Σ𝑘 ∈ (𝑀...𝑗)(𝐹‘𝑘))
121	9	ffnd 6717	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → seq𝑀( + , 𝐹) Fn 𝑍)
122	121	adantr 479	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → seq𝑀( + , 𝐹) Fn 𝑍)
123	47, 45	sylibr 233	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → 𝑗 ∈ 𝑍)
124		fnfvelrn 7081	. . . . . . . . . . . . . 14 ⊢ ((seq𝑀( + , 𝐹) Fn 𝑍 ∧ 𝑗 ∈ 𝑍) → (seq𝑀( + , 𝐹)‘𝑗) ∈ ran seq𝑀( + , 𝐹))
125	122, 123, 124	syl2anc 582	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → (seq𝑀( + , 𝐹)‘𝑗) ∈ ran seq𝑀( + , 𝐹))
126	10	a1i 11	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → 𝐺 = seq𝑀( + , 𝐹))
127	126	rneqd 5936	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → ran 𝐺 = ran seq𝑀( + , 𝐹))
128	50, 127	eleq12d 2825	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → (Σ𝑘 ∈ (𝑀...𝑗)(𝐹‘𝑘) ∈ ran 𝐺 ↔ (seq𝑀( + , 𝐹)‘𝑗) ∈ ran seq𝑀( + , 𝐹)))
129	125, 128	mpbird 256	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → Σ𝑘 ∈ (𝑀...𝑗)(𝐹‘𝑘) ∈ ran 𝐺)
130	129	adantlr 711	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑧 ∈ ℝ) ∧ 𝑗 ∈ 𝑍) → Σ𝑘 ∈ (𝑀...𝑗)(𝐹‘𝑘) ∈ ran 𝐺)
131	130	3adant3 1130	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑧 ∈ ℝ) ∧ 𝑗 ∈ 𝑍 ∧ 𝑧 < Σ𝑘 ∈ (𝑀...𝑗)(𝐹‘𝑘)) → Σ𝑘 ∈ (𝑀...𝑗)(𝐹‘𝑘) ∈ ran 𝐺)
132		simp3 1136	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑧 ∈ ℝ) ∧ 𝑗 ∈ 𝑍 ∧ 𝑧 < Σ𝑘 ∈ (𝑀...𝑗)(𝐹‘𝑘)) → 𝑧 < Σ𝑘 ∈ (𝑀...𝑗)(𝐹‘𝑘))
133		breq2 5151	. . . . . . . . . . 11 ⊢ (𝑦 = Σ𝑘 ∈ (𝑀...𝑗)(𝐹‘𝑘) → (𝑧 < 𝑦 ↔ 𝑧 < Σ𝑘 ∈ (𝑀...𝑗)(𝐹‘𝑘)))
134	133	rspcev 3611	. . . . . . . . . 10 ⊢ ((Σ𝑘 ∈ (𝑀...𝑗)(𝐹‘𝑘) ∈ ran 𝐺 ∧ 𝑧 < Σ𝑘 ∈ (𝑀...𝑗)(𝐹‘𝑘)) → ∃𝑦 ∈ ran 𝐺 𝑧 < 𝑦)
135	131, 132, 134	syl2anc 582	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑧 ∈ ℝ) ∧ 𝑗 ∈ 𝑍 ∧ 𝑧 < Σ𝑘 ∈ (𝑀...𝑗)(𝐹‘𝑘)) → ∃𝑦 ∈ ran 𝐺 𝑧 < 𝑦)
136	135	3exp 1117	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑧 ∈ ℝ) → (𝑗 ∈ 𝑍 → (𝑧 < Σ𝑘 ∈ (𝑀...𝑗)(𝐹‘𝑘) → ∃𝑦 ∈ ran 𝐺 𝑧 < 𝑦)))
137	136	rexlimdv 3151	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑧 ∈ ℝ) → (∃𝑗 ∈ 𝑍 𝑧 < Σ𝑘 ∈ (𝑀...𝑗)(𝐹‘𝑘) → ∃𝑦 ∈ ran 𝐺 𝑧 < 𝑦))
138	137	adantr 479	. . . . . 6 ⊢ (((𝜑 ∧ 𝑧 ∈ ℝ) ∧ 𝑧 < (Σ^{^}‘𝐹)) → (∃𝑗 ∈ 𝑍 𝑧 < Σ𝑘 ∈ (𝑀...𝑗)(𝐹‘𝑘) → ∃𝑦 ∈ ran 𝐺 𝑧 < 𝑦))
139	120, 138	mpd 15	. . . . 5 ⊢ (((𝜑 ∧ 𝑧 ∈ ℝ) ∧ 𝑧 < (Σ^{^}‘𝐹)) → ∃𝑦 ∈ ran 𝐺 𝑧 < 𝑦)
140	139	ex 411	. . . 4 ⊢ ((𝜑 ∧ 𝑧 ∈ ℝ) → (𝑧 < (Σ^{^}‘𝐹) → ∃𝑦 ∈ ran 𝐺 𝑧 < 𝑦))
141	140	ralrimiva 3144	. . 3 ⊢ (𝜑 → ∀𝑧 ∈ ℝ (𝑧 < (Σ^{^}‘𝐹) → ∃𝑦 ∈ ran 𝐺 𝑧 < 𝑦))
142		supxr2 13297	. . 3 ⊢ (((ran 𝐺 ⊆ ℝ^* ∧ (Σ^{^}‘𝐹) ∈ ℝ^) ∧ (∀𝑧 ∈ ran 𝐺 𝑧 ≤ (Σ^{^}‘𝐹) ∧ ∀𝑧 ∈ ℝ (𝑧 < (Σ^{^}‘𝐹) → ∃𝑦 ∈ ran 𝐺 𝑧 < 𝑦))) → sup(ran 𝐺, ℝ^, < ) = (Σ^{^}‘𝐹))
143	17, 23, 67, 141, 142	syl22anc 835	. 2 ⊢ (𝜑 → sup(ran 𝐺, ℝ^*, < ) = (Σ^{^}‘𝐹))
144	143	eqcomd 2736	1 ⊢ (𝜑 → (Σ^{^}‘𝐹) = sup(ran 𝐺, ℝ^*, < ))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 394 ∧ w3a 1085 = wceq 1539 ∈ wcel 2104 ∀wral 3059 ∃wrex 3068 Vcvv 3472 ∩ cin 3946 ⊆ wss 3947 𝒫 cpw 4601 class class class wbr 5147 ↦ cmpt 5230 ran crn 5676 Fn wfn 6537 ⟶wf 6538 ‘cfv 6542 (class class class)co 7411 Fincfn 8941 supcsup 9437 ℂcc 11110 ℝcr 11111 0cc0 11112 + caddc 11115 +∞cpnf 11249 ℝ^*cxr 11251 < clt 11252 ≤ cle 11253 ℤcz 12562 ℤ_≥cuz 12826 [,)cico 13330 [,]cicc 13331 ...cfz 13488 seqcseq 13970 Σcsu 15636 Σ^{^}csumge0 45376

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1911 ax-6 1969 ax-7 2009 ax-8 2106 ax-9 2114 ax-10 2135 ax-11 2152 ax-12 2169 ax-ext 2701 ax-rep 5284 ax-sep 5298 ax-nul 5305 ax-pow 5362 ax-pr 5426 ax-un 7727 ax-inf2 9638 ax-cnex 11168 ax-resscn 11169 ax-1cn 11170 ax-icn 11171 ax-addcl 11172 ax-addrcl 11173 ax-mulcl 11174 ax-mulrcl 11175 ax-mulcom 11176 ax-addass 11177 ax-mulass 11178 ax-distr 11179 ax-i2m1 11180 ax-1ne0 11181 ax-1rid 11182 ax-rnegex 11183 ax-rrecex 11184 ax-cnre 11185 ax-pre-lttri 11186 ax-pre-lttrn 11187 ax-pre-ltadd 11188 ax-pre-mulgt0 11189 ax-pre-sup 11190

This theorem depends on definitions: df-bi 206 df-an 395 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2532 df-eu 2561 df-clab 2708 df-cleq 2722 df-clel 2808 df-nfc 2883 df-ne 2939 df-nel 3045 df-ral 3060 df-rex 3069 df-rmo 3374 df-reu 3375 df-rab 3431 df-v 3474 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4322 df-if 4528 df-pw 4603 df-sn 4628 df-pr 4630 df-op 4634 df-uni 4908 df-int 4950 df-iun 4998 df-br 5148 df-opab 5210 df-mpt 5231 df-tr 5265 df-id 5573 df-eprel 5579 df-po 5587 df-so 5588 df-fr 5630 df-se 5631 df-we 5632 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-rn 5686 df-res 5687 df-ima 5688 df-pred 6299 df-ord 6366 df-on 6367 df-lim 6368 df-suc 6369 df-iota 6494 df-fun 6544 df-fn 6545 df-f 6546 df-f1 6547 df-fo 6548 df-f1o 6549 df-fv 6550 df-isom 6551 df-riota 7367 df-ov 7414 df-oprab 7415 df-mpo 7416 df-om 7858 df-1st 7977 df-2nd 7978 df-frecs 8268 df-wrecs 8299 df-recs 8373 df-rdg 8412 df-1o 8468 df-er 8705 df-en 8942 df-dom 8943 df-sdom 8944 df-fin 8945 df-sup 9439 df-oi 9507 df-card 9936 df-pnf 11254 df-mnf 11255 df-xr 11256 df-ltxr 11257 df-le 11258 df-sub 11450 df-neg 11451 df-div 11876 df-nn 12217 df-2 12279 df-3 12280 df-n0 12477 df-z 12563 df-uz 12827 df-rp 12979 df-ico 13334 df-icc 13335 df-fz 13489 df-fzo 13632 df-seq 13971 df-exp 14032 df-hash 14295 df-cj 15050 df-re 15051 df-im 15052 df-sqrt 15186 df-abs 15187 df-clim 15436 df-sum 15637 df-sumge0 45377

This theorem is referenced by: voliunsge0lem 45486 ovolval2 45658

W3C validator