Theorem sge0cl 47360

Description: The arbitrary sum of nonnegative extended reals is a nonnegative extended real. (Contributed by Glauco Siliprandi, 17-Aug-2020.)

Hypotheses

Ref	Expression
sge0cl.x	⊢ (𝜑 → 𝑋 ∈ 𝑉)
sge0cl.f	⊢ (𝜑 → 𝐹:𝑋⟶(0[,]+∞))

Assertion

Ref	Expression
sge0cl	⊢ (𝜑 → (Σ^‘𝐹) ∈ (0[,]+∞))

Proof of Theorem sge0cl

Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		fveq2 6883	. . . . 5 ⊢ (𝐹 = ∅ → (Σ^‘𝐹) = (Σ^‘∅))
2		sge00 47355	. . . . . 6 ⊢ (Σ^‘∅) = 0
3	2	a1i 11	. . . . 5 ⊢ (𝐹 = ∅ → (Σ^‘∅) = 0)
4	1, 3	eqtrd 2796	. . . 4 ⊢ (𝐹 = ∅ → (Σ^‘𝐹) = 0)
5		0e0iccpnf 13583	. . . . 5 ⊢ 0 ∈ (0[,]+∞)
6	5	a1i 11	. . . 4 ⊢ (𝐹 = ∅ → 0 ∈ (0[,]+∞))
7	4, 6	eqeltrd 2861	. . 3 ⊢ (𝐹 = ∅ → (Σ^‘𝐹) ∈ (0[,]+∞))
8	7	adantl 487	. 2 ⊢ ((𝜑 ∧ 𝐹 = ∅) → (Σ^‘𝐹) ∈ (0[,]+∞))
9		sge0cl.x	. . . . . . 7 ⊢ (𝜑 → 𝑋 ∈ 𝑉)
10	9	adantr 486	. . . . . 6 ⊢ ((𝜑 ∧ +∞ ∈ ran 𝐹) → 𝑋 ∈ 𝑉)
11		sge0cl.f	. . . . . . 7 ⊢ (𝜑 → 𝐹:𝑋⟶(0[,]+∞))
12	11	adantr 486	. . . . . 6 ⊢ ((𝜑 ∧ +∞ ∈ ran 𝐹) → 𝐹:𝑋⟶(0[,]+∞))
13		simpr 490	. . . . . 6 ⊢ ((𝜑 ∧ +∞ ∈ ran 𝐹) → +∞ ∈ ran 𝐹)
14	10, 12, 13	sge0pnfval 47352	. . . . 5 ⊢ ((𝜑 ∧ +∞ ∈ ran 𝐹) → (Σ^‘𝐹) = +∞)
15		pnfel0pnf 46509	. . . . . 6 ⊢ +∞ ∈ (0[,]+∞)
16	15	a1i 11	. . . . 5 ⊢ ((𝜑 ∧ +∞ ∈ ran 𝐹) → +∞ ∈ (0[,]+∞))
17	14, 16	eqeltrd 2861	. . . 4 ⊢ ((𝜑 ∧ +∞ ∈ ran 𝐹) → (Σ^‘𝐹) ∈ (0[,]+∞))
18	17	adantlr 728	. . 3 ⊢ (((𝜑 ∧ ¬ 𝐹 = ∅) ∧ +∞ ∈ ran 𝐹) → (Σ^‘𝐹) ∈ (0[,]+∞))
19		simpll 779	. . . 4 ⊢ (((𝜑 ∧ ¬ 𝐹 = ∅) ∧ ¬ +∞ ∈ ran 𝐹) → 𝜑)
20		neqne 2964	. . . . 5 ⊢ (¬ 𝐹 = ∅ → 𝐹 ≠ ∅)
21	20	ad2antlr 740	. . . 4 ⊢ (((𝜑 ∧ ¬ 𝐹 = ∅) ∧ ¬ +∞ ∈ ran 𝐹) → 𝐹 ≠ ∅)
22		simpr 490	. . . 4 ⊢ (((𝜑 ∧ ¬ 𝐹 = ∅) ∧ ¬ +∞ ∈ ran 𝐹) → ¬ +∞ ∈ ran 𝐹)
23		0xr 11349	. . . . . 6 ⊢ 0 ∈ ℝ*
24	23	a1i 11	. . . . 5 ⊢ (((𝜑 ∧ 𝐹 ≠ ∅) ∧ ¬ +∞ ∈ ran 𝐹) → 0 ∈ ℝ*)
25		pnfxr 11356	. . . . . 6 ⊢ +∞ ∈ ℝ*
26	25	a1i 11	. . . . 5 ⊢ (((𝜑 ∧ 𝐹 ≠ ∅) ∧ ¬ +∞ ∈ ran 𝐹) → +∞ ∈ ℝ*)
27	9	adantr 486	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) → 𝑋 ∈ 𝑉)
28	11	adantr 486	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) → 𝐹:𝑋⟶(0[,]+∞))
29		simpr 490	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) → ¬ +∞ ∈ ran 𝐹)
30	28, 29	fge0iccico 47349	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) → 𝐹:𝑋⟶(0[,)+∞))
31	27, 30	sge0reval 47351	. . . . . . 7 ⊢ ((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) → (Σ^‘𝐹) = sup(ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦 ∈ 𝑥 (𝐹‘𝑦)), ℝ*, < ))
32		elinel2 4148	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ (𝒫 𝑋 ∩ Fin) → 𝑥 ∈ Fin)
33	32	adantl 487	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) ∧ 𝑥 ∈ (𝒫 𝑋 ∩ Fin)) → 𝑥 ∈ Fin)
34	11	ad2antrr 739	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝒫 𝑋 ∩ Fin)) ∧ 𝑦 ∈ 𝑥) → 𝐹:𝑋⟶(0[,]+∞))
35		elinel1 4147	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑥 ∈ (𝒫 𝑋 ∩ Fin) → 𝑥 ∈ 𝒫 𝑋)
36		elpwi 4564	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑥 ∈ 𝒫 𝑋 → 𝑥 ⊆ 𝑋)
37	35, 36	syl 18	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 ∈ (𝒫 𝑋 ∩ Fin) → 𝑥 ⊆ 𝑋)
38	37	adantl 487	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝒫 𝑋 ∩ Fin)) → 𝑥 ⊆ 𝑋)
39	38	adantr 486	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝒫 𝑋 ∩ Fin)) ∧ 𝑦 ∈ 𝑥) → 𝑥 ⊆ 𝑋)
40		simpr 490	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝒫 𝑋 ∩ Fin)) ∧ 𝑦 ∈ 𝑥) → 𝑦 ∈ 𝑥)
41	39, 40	sseldd 3932	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝒫 𝑋 ∩ Fin)) ∧ 𝑦 ∈ 𝑥) → 𝑦 ∈ 𝑋)
42	34, 41	ffvelcdmd 7083	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝒫 𝑋 ∩ Fin)) ∧ 𝑦 ∈ 𝑥) → (𝐹‘𝑦) ∈ (0[,]+∞))
43	42	adantllr 732	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) ∧ 𝑥 ∈ (𝒫 𝑋 ∩ Fin)) ∧ 𝑦 ∈ 𝑥) → (𝐹‘𝑦) ∈ (0[,]+∞))
44		nne 2960	. . . . . . . . . . . . . . . . . 18 ⊢ (¬ (𝐹‘𝑦) ≠ +∞ ↔ (𝐹‘𝑦) = +∞)
45	44	biimpi 219	. . . . . . . . . . . . . . . . 17 ⊢ (¬ (𝐹‘𝑦) ≠ +∞ → (𝐹‘𝑦) = +∞)
46	45	eqcomd 2767	. . . . . . . . . . . . . . . 16 ⊢ (¬ (𝐹‘𝑦) ≠ +∞ → +∞ = (𝐹‘𝑦))
47	46	adantl 487	. . . . . . . . . . . . . . 15 ⊢ (((((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) ∧ 𝑥 ∈ (𝒫 𝑋 ∩ Fin)) ∧ 𝑦 ∈ 𝑥) ∧ ¬ (𝐹‘𝑦) ≠ +∞) → +∞ = (𝐹‘𝑦))
48	11	ffund 6712	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → Fun 𝐹)
49	48	3ad2ant1 1151	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝒫 𝑋 ∩ Fin) ∧ 𝑦 ∈ 𝑥) → Fun 𝐹)
50	41	3impa 1127	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝒫 𝑋 ∩ Fin) ∧ 𝑦 ∈ 𝑥) → 𝑦 ∈ 𝑋)
51	11	fdmd 6718	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝜑 → dom 𝐹 = 𝑋)
52	51	eqcomd 2767	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → 𝑋 = dom 𝐹)
53	52	3ad2ant1 1151	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝒫 𝑋 ∩ Fin) ∧ 𝑦 ∈ 𝑥) → 𝑋 = dom 𝐹)
54	50, 53	eleqtrd 2863	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝒫 𝑋 ∩ Fin) ∧ 𝑦 ∈ 𝑥) → 𝑦 ∈ dom 𝐹)
55		fvelrn 7074	. . . . . . . . . . . . . . . . 17 ⊢ ((Fun 𝐹 ∧ 𝑦 ∈ dom 𝐹) → (𝐹‘𝑦) ∈ ran 𝐹)
56	49, 54, 55	syl2anc 596	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝒫 𝑋 ∩ Fin) ∧ 𝑦 ∈ 𝑥) → (𝐹‘𝑦) ∈ ran 𝐹)
57	56	ad5ant134 1392	. . . . . . . . . . . . . . 15 ⊢ (((((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) ∧ 𝑥 ∈ (𝒫 𝑋 ∩ Fin)) ∧ 𝑦 ∈ 𝑥) ∧ ¬ (𝐹‘𝑦) ≠ +∞) → (𝐹‘𝑦) ∈ ran 𝐹)
58	47, 57	eqeltrd 2861	. . . . . . . . . . . . . 14 ⊢ (((((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) ∧ 𝑥 ∈ (𝒫 𝑋 ∩ Fin)) ∧ 𝑦 ∈ 𝑥) ∧ ¬ (𝐹‘𝑦) ≠ +∞) → +∞ ∈ ran 𝐹)
59	29	ad3antrrr 743	. . . . . . . . . . . . . 14 ⊢ (((((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) ∧ 𝑥 ∈ (𝒫 𝑋 ∩ Fin)) ∧ 𝑦 ∈ 𝑥) ∧ ¬ (𝐹‘𝑦) ≠ +∞) → ¬ +∞ ∈ ran 𝐹)
60	58, 59	condan 830	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) ∧ 𝑥 ∈ (𝒫 𝑋 ∩ Fin)) ∧ 𝑦 ∈ 𝑥) → (𝐹‘𝑦) ≠ +∞)
61		ge0xrre 46512	. . . . . . . . . . . . 13 ⊢ (((𝐹‘𝑦) ∈ (0[,]+∞) ∧ (𝐹‘𝑦) ≠ +∞) → (𝐹‘𝑦) ∈ ℝ)
62	43, 60, 61	syl2anc 596	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) ∧ 𝑥 ∈ (𝒫 𝑋 ∩ Fin)) ∧ 𝑦 ∈ 𝑥) → (𝐹‘𝑦) ∈ ℝ)
63	33, 62	fsumrecl 15893	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) ∧ 𝑥 ∈ (𝒫 𝑋 ∩ Fin)) → Σ𝑦 ∈ 𝑥 (𝐹‘𝑦) ∈ ℝ)
64	63	ralrimiva 3155	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) → ∀𝑥 ∈ (𝒫 𝑋 ∩ Fin)Σ𝑦 ∈ 𝑥 (𝐹‘𝑦) ∈ ℝ)
65		eqid 2761	. . . . . . . . . . 11 ⊢ (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦 ∈ 𝑥 (𝐹‘𝑦)) = (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦 ∈ 𝑥 (𝐹‘𝑦))
66	65	rnmptss 7121	. . . . . . . . . 10 ⊢ (∀𝑥 ∈ (𝒫 𝑋 ∩ Fin)Σ𝑦 ∈ 𝑥 (𝐹‘𝑦) ∈ ℝ → ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦 ∈ 𝑥 (𝐹‘𝑦)) ⊆ ℝ)
67	64, 66	syl 18	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) → ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦 ∈ 𝑥 (𝐹‘𝑦)) ⊆ ℝ)
68		ressxr 11346	. . . . . . . . . 10 ⊢ ℝ ⊆ ℝ*
69	68	a1i 11	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) → ℝ ⊆ ℝ*)
70	67, 69	sstrd 3941	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) → ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦 ∈ 𝑥 (𝐹‘𝑦)) ⊆ ℝ*)
71		supxrcl 13438	. . . . . . . 8 ⊢ (ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦 ∈ 𝑥 (𝐹‘𝑦)) ⊆ ℝ* → sup(ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦 ∈ 𝑥 (𝐹‘𝑦)), ℝ*, < ) ∈ ℝ*)
72	70, 71	syl 18	. . . . . . 7 ⊢ ((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) → sup(ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦 ∈ 𝑥 (𝐹‘𝑦)), ℝ*, < ) ∈ ℝ*)
73	31, 72	eqeltrd 2861	. . . . . 6 ⊢ ((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) → (Σ^‘𝐹) ∈ ℝ*)
74	73	adantlr 728	. . . . 5 ⊢ (((𝜑 ∧ 𝐹 ≠ ∅) ∧ ¬ +∞ ∈ ran 𝐹) → (Σ^‘𝐹) ∈ ℝ*)
75	52	adantr 486	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐹 ≠ ∅) → 𝑋 = dom 𝐹)
76		neneq 2962	. . . . . . . . . . . 12 ⊢ (𝐹 ≠ ∅ → ¬ 𝐹 = ∅)
77	76	adantl 487	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐹 ≠ ∅) → ¬ 𝐹 = ∅)
78		frel 6713	. . . . . . . . . . . . . 14 ⊢ (𝐹:𝑋⟶(0[,]+∞) → Rel 𝐹)
79	11, 78	syl 18	. . . . . . . . . . . . 13 ⊢ (𝜑 → Rel 𝐹)
80	79	adantr 486	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝐹 ≠ ∅) → Rel 𝐹)
81		reldm0 5910	. . . . . . . . . . . 12 ⊢ (Rel 𝐹 → (𝐹 = ∅ ↔ dom 𝐹 = ∅))
82	80, 81	syl 18	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐹 ≠ ∅) → (𝐹 = ∅ ↔ dom 𝐹 = ∅))
83	77, 82	mtbid 327	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐹 ≠ ∅) → ¬ dom 𝐹 = ∅)
84	83	neqned 2963	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐹 ≠ ∅) → dom 𝐹 ≠ ∅)
85	75, 84	eqnetrd 3023	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐹 ≠ ∅) → 𝑋 ≠ ∅)
86		n0 4300	. . . . . . . 8 ⊢ (𝑋 ≠ ∅ ↔ ∃𝑧 𝑧 ∈ 𝑋)
87	85, 86	sylib 221	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐹 ≠ ∅) → ∃𝑧 𝑧 ∈ 𝑋)
88	87	adantr 486	. . . . . 6 ⊢ (((𝜑 ∧ 𝐹 ≠ ∅) ∧ ¬ +∞ ∈ ran 𝐹) → ∃𝑧 𝑧 ∈ 𝑋)
89	23	a1i 11	. . . . . . . . . 10 ⊢ (((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) ∧ 𝑧 ∈ 𝑋) → 0 ∈ ℝ*)
90	11	ffvelcdmda 7082	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑋) → (𝐹‘𝑧) ∈ (0[,]+∞))
91	90	adantlr 728	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) ∧ 𝑧 ∈ 𝑋) → (𝐹‘𝑧) ∈ (0[,]+∞))
92		nne 2960	. . . . . . . . . . . . . . . . 17 ⊢ (¬ (𝐹‘𝑧) ≠ +∞ ↔ (𝐹‘𝑧) = +∞)
93	92	biimpi 219	. . . . . . . . . . . . . . . 16 ⊢ (¬ (𝐹‘𝑧) ≠ +∞ → (𝐹‘𝑧) = +∞)
94	93	eqcomd 2767	. . . . . . . . . . . . . . 15 ⊢ (¬ (𝐹‘𝑧) ≠ +∞ → +∞ = (𝐹‘𝑧))
95	94	adantl 487	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) ∧ 𝑧 ∈ 𝑋) ∧ ¬ (𝐹‘𝑧) ≠ +∞) → +∞ = (𝐹‘𝑧))
96	11	adantr 486	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑋) → 𝐹:𝑋⟶(0[,]+∞))
97	96	ffund 6712	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑋) → Fun 𝐹)
98		simpr 490	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑋) → 𝑧 ∈ 𝑋)
99	52	adantr 486	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑋) → 𝑋 = dom 𝐹)
100	98, 99	eleqtrd 2863	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑋) → 𝑧 ∈ dom 𝐹)
101		fvelrn 7074	. . . . . . . . . . . . . . . . 17 ⊢ ((Fun 𝐹 ∧ 𝑧 ∈ dom 𝐹) → (𝐹‘𝑧) ∈ ran 𝐹)
102	97, 100, 101	syl2anc 596	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑋) → (𝐹‘𝑧) ∈ ran 𝐹)
103	102	adantlr 728	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) ∧ 𝑧 ∈ 𝑋) → (𝐹‘𝑧) ∈ ran 𝐹)
104	103	adantr 486	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) ∧ 𝑧 ∈ 𝑋) ∧ ¬ (𝐹‘𝑧) ≠ +∞) → (𝐹‘𝑧) ∈ ran 𝐹)
105	95, 104	eqeltrd 2861	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) ∧ 𝑧 ∈ 𝑋) ∧ ¬ (𝐹‘𝑧) ≠ +∞) → +∞ ∈ ran 𝐹)
106	29	ad2antrr 739	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) ∧ 𝑧 ∈ 𝑋) ∧ ¬ (𝐹‘𝑧) ≠ +∞) → ¬ +∞ ∈ ran 𝐹)
107	105, 106	condan 830	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) ∧ 𝑧 ∈ 𝑋) → (𝐹‘𝑧) ≠ +∞)
108		ge0xrre 46512	. . . . . . . . . . . 12 ⊢ (((𝐹‘𝑧) ∈ (0[,]+∞) ∧ (𝐹‘𝑧) ≠ +∞) → (𝐹‘𝑧) ∈ ℝ)
109	91, 107, 108	syl2anc 596	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) ∧ 𝑧 ∈ 𝑋) → (𝐹‘𝑧) ∈ ℝ)
110	109	rexrd 11352	. . . . . . . . . 10 ⊢ (((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) ∧ 𝑧 ∈ 𝑋) → (𝐹‘𝑧) ∈ ℝ*)
111	73	adantr 486	. . . . . . . . . 10 ⊢ (((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) ∧ 𝑧 ∈ 𝑋) → (Σ^‘𝐹) ∈ ℝ*)
112	23	a1i 11	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑋) → 0 ∈ ℝ*)
113	25	a1i 11	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑋) → +∞ ∈ ℝ*)
114		iccgelb 13526	. . . . . . . . . . . 12 ⊢ ((0 ∈ ℝ* ∧ +∞ ∈ ℝ* ∧ (𝐹‘𝑧) ∈ (0[,]+∞)) → 0 ≤ (𝐹‘𝑧))
115	112, 113, 90, 114	syl3anc 1398	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑋) → 0 ≤ (𝐹‘𝑧))
116	115	adantlr 728	. . . . . . . . . 10 ⊢ (((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) ∧ 𝑧 ∈ 𝑋) → 0 ≤ (𝐹‘𝑧))
117	70	adantr 486	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) ∧ 𝑧 ∈ 𝑋) → ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦 ∈ 𝑥 (𝐹‘𝑦)) ⊆ ℝ*)
118		snelpwi 5412	. . . . . . . . . . . . . . . 16 ⊢ (𝑧 ∈ 𝑋 → {𝑧} ∈ 𝒫 𝑋)
119		snfi 9064	. . . . . . . . . . . . . . . . 17 ⊢ {𝑧} ∈ Fin
120	119	a1i 11	. . . . . . . . . . . . . . . 16 ⊢ (𝑧 ∈ 𝑋 → {𝑧} ∈ Fin)
121	118, 120	elind 4146	. . . . . . . . . . . . . . 15 ⊢ (𝑧 ∈ 𝑋 → {𝑧} ∈ (𝒫 𝑋 ∩ Fin))
122	121	adantl 487	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) ∧ 𝑧 ∈ 𝑋) → {𝑧} ∈ (𝒫 𝑋 ∩ Fin))
123		simpr 490	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) ∧ 𝑧 ∈ 𝑋) → 𝑧 ∈ 𝑋)
124	109	recnd 11330	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) ∧ 𝑧 ∈ 𝑋) → (𝐹‘𝑧) ∈ ℂ)
125		fveq2 6883	. . . . . . . . . . . . . . . . 17 ⊢ (𝑦 = 𝑧 → (𝐹‘𝑦) = (𝐹‘𝑧))
126	125	sumsn 15905	. . . . . . . . . . . . . . . 16 ⊢ ((𝑧 ∈ 𝑋 ∧ (𝐹‘𝑧) ∈ ℂ) → Σ𝑦 ∈ {𝑧} (𝐹‘𝑦) = (𝐹‘𝑧))
127	123, 124, 126	syl2anc 596	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) ∧ 𝑧 ∈ 𝑋) → Σ𝑦 ∈ {𝑧} (𝐹‘𝑦) = (𝐹‘𝑧))
128	127	eqcomd 2767	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) ∧ 𝑧 ∈ 𝑋) → (𝐹‘𝑧) = Σ𝑦 ∈ {𝑧} (𝐹‘𝑦))
129		sumeq1 15849	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = {𝑧} → Σ𝑦 ∈ 𝑥 (𝐹‘𝑦) = Σ𝑦 ∈ {𝑧} (𝐹‘𝑦))
130	129	rspceeqv 3599	. . . . . . . . . . . . . 14 ⊢ (({𝑧} ∈ (𝒫 𝑋 ∩ Fin) ∧ (𝐹‘𝑧) = Σ𝑦 ∈ {𝑧} (𝐹‘𝑦)) → ∃𝑥 ∈ (𝒫 𝑋 ∩ Fin)(𝐹‘𝑧) = Σ𝑦 ∈ 𝑥 (𝐹‘𝑦))
131	122, 128, 130	syl2anc 596	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) ∧ 𝑧 ∈ 𝑋) → ∃𝑥 ∈ (𝒫 𝑋 ∩ Fin)(𝐹‘𝑧) = Σ𝑦 ∈ 𝑥 (𝐹‘𝑦))
132	65	elrnmpt 5940	. . . . . . . . . . . . . 14 ⊢ ((𝐹‘𝑧) ∈ (0[,]+∞) → ((𝐹‘𝑧) ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦 ∈ 𝑥 (𝐹‘𝑦)) ↔ ∃𝑥 ∈ (𝒫 𝑋 ∩ Fin)(𝐹‘𝑧) = Σ𝑦 ∈ 𝑥 (𝐹‘𝑦)))
133	91, 132	syl 18	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) ∧ 𝑧 ∈ 𝑋) → ((𝐹‘𝑧) ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦 ∈ 𝑥 (𝐹‘𝑦)) ↔ ∃𝑥 ∈ (𝒫 𝑋 ∩ Fin)(𝐹‘𝑧) = Σ𝑦 ∈ 𝑥 (𝐹‘𝑦)))
134	131, 133	mpbird 260	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) ∧ 𝑧 ∈ 𝑋) → (𝐹‘𝑧) ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦 ∈ 𝑥 (𝐹‘𝑦)))
135		supxrub 13447	. . . . . . . . . . . 12 ⊢ ((ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦 ∈ 𝑥 (𝐹‘𝑦)) ⊆ ℝ* ∧ (𝐹‘𝑧) ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦 ∈ 𝑥 (𝐹‘𝑦))) → (𝐹‘𝑧) ≤ sup(ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦 ∈ 𝑥 (𝐹‘𝑦)), ℝ*, < ))
136	117, 134, 135	syl2anc 596	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) ∧ 𝑧 ∈ 𝑋) → (𝐹‘𝑧) ≤ sup(ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦 ∈ 𝑥 (𝐹‘𝑦)), ℝ*, < ))
137	31	eqcomd 2767	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) → sup(ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦 ∈ 𝑥 (𝐹‘𝑦)), ℝ*, < ) = (Σ^‘𝐹))
138	137	adantr 486	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) ∧ 𝑧 ∈ 𝑋) → sup(ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦 ∈ 𝑥 (𝐹‘𝑦)), ℝ*, < ) = (Σ^‘𝐹))
139	136, 138	breqtrd 5131	. . . . . . . . . 10 ⊢ (((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) ∧ 𝑧 ∈ 𝑋) → (𝐹‘𝑧) ≤ (Σ^‘𝐹))
140	89, 110, 111, 116, 139	xrletrd 13284	. . . . . . . . 9 ⊢ (((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) ∧ 𝑧 ∈ 𝑋) → 0 ≤ (Σ^‘𝐹))
141	140	ex 418	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) → (𝑧 ∈ 𝑋 → 0 ≤ (Σ^‘𝐹)))
142	141	adantlr 728	. . . . . . 7 ⊢ (((𝜑 ∧ 𝐹 ≠ ∅) ∧ ¬ +∞ ∈ ran 𝐹) → (𝑧 ∈ 𝑋 → 0 ≤ (Σ^‘𝐹)))
143	142	exlimdv 1966	. . . . . 6 ⊢ (((𝜑 ∧ 𝐹 ≠ ∅) ∧ ¬ +∞ ∈ ran 𝐹) → (∃𝑧 𝑧 ∈ 𝑋 → 0 ≤ (Σ^‘𝐹)))
144	88, 143	mpd 16	. . . . 5 ⊢ (((𝜑 ∧ 𝐹 ≠ ∅) ∧ ¬ +∞ ∈ ran 𝐹) → 0 ≤ (Σ^‘𝐹))
145		pnfge 13252	. . . . . . 7 ⊢ ((Σ^‘𝐹) ∈ ℝ* → (Σ^‘𝐹) ≤ +∞)
146	73, 145	syl 18	. . . . . 6 ⊢ ((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) → (Σ^‘𝐹) ≤ +∞)
147	146	adantlr 728	. . . . 5 ⊢ (((𝜑 ∧ 𝐹 ≠ ∅) ∧ ¬ +∞ ∈ ran 𝐹) → (Σ^‘𝐹) ≤ +∞)
148	24, 26, 74, 144, 147	eliccxrd 46508	. . . 4 ⊢ (((𝜑 ∧ 𝐹 ≠ ∅) ∧ ¬ +∞ ∈ ran 𝐹) → (Σ^‘𝐹) ∈ (0[,]+∞))
149	19, 21, 22, 148	syl21anc 851	. . 3 ⊢ (((𝜑 ∧ ¬ 𝐹 = ∅) ∧ ¬ +∞ ∈ ran 𝐹) → (Σ^‘𝐹) ∈ (0[,]+∞))
150	18, 149	pm2.61dan 825	. 2 ⊢ ((𝜑 ∧ ¬ 𝐹 = ∅) → (Σ^‘𝐹) ∈ (0[,]+∞))
151	8, 150	pm2.61dan 825	1 ⊢ (𝜑 → (Σ^‘𝐹) ∈ (0[,]+∞))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570  ∃wex 1812   ∈ wcel 2145   ≠ wne 2956  ∀wral 3077  ∃wrex 3087   ∩ cin 3898   ⊆ wss 3899  ∅c0 4279  𝒫 cpw 4557  {csn 4584   class class class wbr 5103   ↦ cmpt 5186  dom cdm 5651  ran crn 5652  Rel wrel 5656  Fun wfun 6531  ⟶wf 6533  ‘cfv 6537  (class class class)co 7418  Fincfn 8966  supcsup 9425  ℂcc 11191  ℝcr 11192  0cc0 11193  +∞cpnf 11333  ℝ^*cxr 11335   < clt 11336   ≤ cle 11337  [,]cicc 13472  Σcsu 15846  Σ^{^}csumge0 47341

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7749  ax-inf2 9635  ax-cnex 11249  ax-resscn 11250  ax-1cn 11251  ax-icn 11252  ax-addcl 11253  ax-addrcl 11254  ax-mulcl 11255  ax-mulrcl 11256  ax-mulcom 11257  ax-addass 11258  ax-mulass 11259  ax-distr 11260  ax-i2m1 11261  ax-1ne0 11262  ax-1rid 11263  ax-rnegex 11264  ax-rrecex 11265  ax-cnre 11266  ax-pre-lttri 11267  ax-pre-lttrn 11268  ax-pre-ltadd 11269  ax-pre-mulgt0 11270  ax-pre-sup 11271

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-nel 3063  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-int 4908  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-se 5605  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-isom 6546  df-riota 7375  df-ov 7421  df-oprab 7422  df-mpo 7423  df-om 7876  df-1st 7999  df-2nd 8000  df-frecs 8292  df-wrecs 8323  df-recs 8372  df-rdg 8411  df-1o 8469  df-er 8710  df-en 8967  df-dom 8968  df-sdom 8969  df-fin 8970  df-sup 9427  df-oi 9497  df-card 10013  df-pnf 11338  df-mnf 11339  df-xr 11340  df-ltxr 11341  df-le 11342  df-sub 11536  df-neg 11537  df-div 11967  df-nn 12329  df-2 12398  df-3 12399  df-n0 12600  df-z 12687  df-uz 12959  df-rp 13114  df-ico 13475  df-icc 13476  df-fz 13633  df-fzo 13782  df-seq 14138  df-exp 14198  df-hash 14468  df-cj 15259  df-re 15260  df-im 15261  df-sqrt 15395  df-abs 15396  df-clim 15648  df-sum 15847  df-sumge0 47342

This theorem is used by:  sge0ge0  47363  sge0xrcl  47364  sge0split  47388  sge0iunmptlemre  47394  sge0iunmpt  47397  sge0nemnf  47399  sge0clmpt  47404  sge0isum  47406  psmeasure  47450  ovnsupge0  47536  ovnsubaddlem1  47549  sge0hsphoire  47568  hoidmvlelem1  47574  hspmbllem2  47606