Theorem sge0le 47104

Description: If all of the terms of sums compare, so do the sums. (Contributed by Glauco Siliprandi, 17-Aug-2020.)

Hypotheses

Ref	Expression
sge0le.x	⊢ (𝜑 → 𝑋 ∈ 𝑉)
sge0le.F	⊢ (𝜑 → 𝐹:𝑋⟶(0[,]+∞))
sge0le.g	⊢ (𝜑 → 𝐺:𝑋⟶(0[,]+∞))
sge0le.le	⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (𝐹‘𝑥) ≤ (𝐺‘𝑥))

Assertion

Ref	Expression
sge0le	⊢ (𝜑 → (Σ^‘𝐹) ≤ (Σ^‘𝐺))

Distinct variable groups:   𝑥,𝐹   𝑥,𝐺   𝑥,𝑋   𝜑,𝑥

Allowed substitution hint:   𝑉(𝑥)

Proof of Theorem sge0le

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		sge0le.x	. . . . . 6 ⊢ (𝜑 → 𝑋 ∈ 𝑉)
2		sge0le.F	. . . . . 6 ⊢ (𝜑 → 𝐹:𝑋⟶(0[,]+∞))
3	1, 2	sge0xrcl 47082	. . . . 5 ⊢ (𝜑 → (Σ^‘𝐹) ∈ ℝ*)
4		pnfge 13156	. . . . 5 ⊢ ((Σ^‘𝐹) ∈ ℝ* → (Σ^‘𝐹) ≤ +∞)
5	3, 4	syl 18	. . . 4 ⊢ (𝜑 → (Σ^‘𝐹) ≤ +∞)
6	5	adantr 485	. . 3 ⊢ ((𝜑 ∧ (Σ^‘𝐺) = +∞) → (Σ^‘𝐹) ≤ +∞)
7		id 23	. . . . 5 ⊢ ((Σ^‘𝐺) = +∞ → (Σ^‘𝐺) = +∞)
8	7	eqcomd 2769	. . . 4 ⊢ ((Σ^‘𝐺) = +∞ → +∞ = (Σ^‘𝐺))
9	8	adantl 486	. . 3 ⊢ ((𝜑 ∧ (Σ^‘𝐺) = +∞) → +∞ = (Σ^‘𝐺))
10	6, 9	breqtrd 5138	. 2 ⊢ ((𝜑 ∧ (Σ^‘𝐺) = +∞) → (Σ^‘𝐹) ≤ (Σ^‘𝐺))
11		elinel2 4156	. . . . . . . 8 ⊢ (𝑦 ∈ (𝒫 𝑋 ∩ Fin) → 𝑦 ∈ Fin)
12	11	adantl 486	. . . . . . 7 ⊢ (((𝜑 ∧ ¬ (Σ^‘𝐺) = +∞) ∧ 𝑦 ∈ (𝒫 𝑋 ∩ Fin)) → 𝑦 ∈ Fin)
13	2	adantr 485	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ¬ (Σ^‘𝐺) = +∞) → 𝐹:𝑋⟶(0[,]+∞))
14	1	adantr 485	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ +∞ ∈ ran 𝐹) → 𝑋 ∈ 𝑉)
15		sge0le.g	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝐺:𝑋⟶(0[,]+∞))
16	15	adantr 485	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ +∞ ∈ ran 𝐹) → 𝐺:𝑋⟶(0[,]+∞))
17		simpr 489	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ +∞ ∈ ran 𝐹) → +∞ ∈ ran 𝐹)
18	2	ffnd 6708	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → 𝐹 Fn 𝑋)
19		fvelrnb 6943	. . . . . . . . . . . . . . . . 17 ⊢ (𝐹 Fn 𝑋 → (+∞ ∈ ran 𝐹 ↔ ∃𝑥 ∈ 𝑋 (𝐹‘𝑥) = +∞))
20	18, 19	syl 18	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (+∞ ∈ ran 𝐹 ↔ ∃𝑥 ∈ 𝑋 (𝐹‘𝑥) = +∞))
21	20	adantr 485	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ +∞ ∈ ran 𝐹) → (+∞ ∈ ran 𝐹 ↔ ∃𝑥 ∈ 𝑋 (𝐹‘𝑥) = +∞))
22	17, 21	mpbid 235	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ +∞ ∈ ran 𝐹) → ∃𝑥 ∈ 𝑋 (𝐹‘𝑥) = +∞)
23		iccssxr 13458	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (0[,]+∞) ⊆ ℝ*
24	15	ffvelcdmda 7081	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (𝐺‘𝑥) ∈ (0[,]+∞))
25	23, 24	sselid 3936	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (𝐺‘𝑥) ∈ ℝ*)
26	25	adantr 485	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑋) ∧ (𝐹‘𝑥) = +∞) → (𝐺‘𝑥) ∈ ℝ*)
27		id 23	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝐹‘𝑥) = +∞ → (𝐹‘𝑥) = +∞)
28	27	eqcomd 2769	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝐹‘𝑥) = +∞ → +∞ = (𝐹‘𝑥))
29	28	adantl 486	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑋) ∧ (𝐹‘𝑥) = +∞) → +∞ = (𝐹‘𝑥))
30		sge0le.le	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (𝐹‘𝑥) ≤ (𝐺‘𝑥))
31	30	adantr 485	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑋) ∧ (𝐹‘𝑥) = +∞) → (𝐹‘𝑥) ≤ (𝐺‘𝑥))
32	29, 31	eqbrtrd 5134	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑋) ∧ (𝐹‘𝑥) = +∞) → +∞ ≤ (𝐺‘𝑥))
33	26, 32	xrgepnfd 46030	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑋) ∧ (𝐹‘𝑥) = +∞) → (𝐺‘𝑥) = +∞)
34	33	eqcomd 2769	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑋) ∧ (𝐹‘𝑥) = +∞) → +∞ = (𝐺‘𝑥))
35	15	ffnd 6708	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝜑 → 𝐺 Fn 𝑋)
36	35	adantr 485	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐺 Fn 𝑋)
37		simpr 489	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝑥 ∈ 𝑋)
38		fnfvelrn 7077	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝐺 Fn 𝑋 ∧ 𝑥 ∈ 𝑋) → (𝐺‘𝑥) ∈ ran 𝐺)
39	36, 37, 38	syl2anc 595	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (𝐺‘𝑥) ∈ ran 𝐺)
40	39	adantr 485	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑋) ∧ (𝐹‘𝑥) = +∞) → (𝐺‘𝑥) ∈ ran 𝐺)
41	34, 40	eqeltrd 2863	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑋) ∧ (𝐹‘𝑥) = +∞) → +∞ ∈ ran 𝐺)
42	41	ex 417	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → ((𝐹‘𝑥) = +∞ → +∞ ∈ ran 𝐺))
43	42	adantlr 727	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ +∞ ∈ ran 𝐹) ∧ 𝑥 ∈ 𝑋) → ((𝐹‘𝑥) = +∞ → +∞ ∈ ran 𝐺))
44	43	rexlimdva 3166	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ +∞ ∈ ran 𝐹) → (∃𝑥 ∈ 𝑋 (𝐹‘𝑥) = +∞ → +∞ ∈ ran 𝐺))
45	22, 44	mpd 16	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ +∞ ∈ ran 𝐹) → +∞ ∈ ran 𝐺)
46	14, 16, 45	sge0pnfval 47070	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ +∞ ∈ ran 𝐹) → (Σ^‘𝐺) = +∞)
47	46	adantlr 727	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ ¬ (Σ^‘𝐺) = +∞) ∧ +∞ ∈ ran 𝐹) → (Σ^‘𝐺) = +∞)
48		simplr 780	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ ¬ (Σ^‘𝐺) = +∞) ∧ +∞ ∈ ran 𝐹) → ¬ (Σ^‘𝐺) = +∞)
49	47, 48	pm2.65da 828	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ¬ (Σ^‘𝐺) = +∞) → ¬ +∞ ∈ ran 𝐹)
50	13, 49	fge0iccico 47067	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ (Σ^‘𝐺) = +∞) → 𝐹:𝑋⟶(0[,)+∞))
51	50	adantr 485	. . . . . . . 8 ⊢ (((𝜑 ∧ ¬ (Σ^‘𝐺) = +∞) ∧ 𝑦 ∈ (𝒫 𝑋 ∩ Fin)) → 𝐹:𝑋⟶(0[,)+∞))
52		elpwinss 45752	. . . . . . . . 9 ⊢ (𝑦 ∈ (𝒫 𝑋 ∩ Fin) → 𝑦 ⊆ 𝑋)
53	52	adantl 486	. . . . . . . 8 ⊢ (((𝜑 ∧ ¬ (Σ^‘𝐺) = +∞) ∧ 𝑦 ∈ (𝒫 𝑋 ∩ Fin)) → 𝑦 ⊆ 𝑋)
54	51, 53	fssresd 6747	. . . . . . 7 ⊢ (((𝜑 ∧ ¬ (Σ^‘𝐺) = +∞) ∧ 𝑦 ∈ (𝒫 𝑋 ∩ Fin)) → (𝐹 ↾ 𝑦):𝑦⟶(0[,)+∞))
55	12, 54	sge0fsum 47084	. . . . . 6 ⊢ (((𝜑 ∧ ¬ (Σ^‘𝐺) = +∞) ∧ 𝑦 ∈ (𝒫 𝑋 ∩ Fin)) → (Σ^‘(𝐹 ↾ 𝑦)) = Σ𝑥 ∈ 𝑦 ((𝐹 ↾ 𝑦)‘𝑥))
56		rge0ssre 13484	. . . . . . . 8 ⊢ (0[,)+∞) ⊆ ℝ
57	54	ffvelcdmda 7081	. . . . . . . 8 ⊢ ((((𝜑 ∧ ¬ (Σ^‘𝐺) = +∞) ∧ 𝑦 ∈ (𝒫 𝑋 ∩ Fin)) ∧ 𝑥 ∈ 𝑦) → ((𝐹 ↾ 𝑦)‘𝑥) ∈ (0[,)+∞))
58	56, 57	sselid 3936	. . . . . . 7 ⊢ ((((𝜑 ∧ ¬ (Σ^‘𝐺) = +∞) ∧ 𝑦 ∈ (𝒫 𝑋 ∩ Fin)) ∧ 𝑥 ∈ 𝑦) → ((𝐹 ↾ 𝑦)‘𝑥) ∈ ℝ)
59	12, 58	fsumrecl 15787	. . . . . 6 ⊢ (((𝜑 ∧ ¬ (Σ^‘𝐺) = +∞) ∧ 𝑦 ∈ (𝒫 𝑋 ∩ Fin)) → Σ𝑥 ∈ 𝑦 ((𝐹 ↾ 𝑦)‘𝑥) ∈ ℝ)
60	55, 59	eqeltrd 2863	. . . . 5 ⊢ (((𝜑 ∧ ¬ (Σ^‘𝐺) = +∞) ∧ 𝑦 ∈ (𝒫 𝑋 ∩ Fin)) → (Σ^‘(𝐹 ↾ 𝑦)) ∈ ℝ)
61	15	adantr 485	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ¬ (Σ^‘𝐺) = +∞) → 𝐺:𝑋⟶(0[,]+∞))
62	1	adantr 485	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ¬ (Σ^‘𝐺) = +∞) → 𝑋 ∈ 𝑉)
63		simpr 489	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ ¬ (Σ^‘𝐺) = +∞) → ¬ (Σ^‘𝐺) = +∞)
64	62, 61	sge0repnf 47083	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ ¬ (Σ^‘𝐺) = +∞) → ((Σ^‘𝐺) ∈ ℝ ↔ ¬ (Σ^‘𝐺) = +∞))
65	63, 64	mpbird 260	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ¬ (Σ^‘𝐺) = +∞) → (Σ^‘𝐺) ∈ ℝ)
66	62, 61, 65	sge0rern 47085	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ¬ (Σ^‘𝐺) = +∞) → ¬ +∞ ∈ ran 𝐺)
67	61, 66	fge0iccico 47067	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ (Σ^‘𝐺) = +∞) → 𝐺:𝑋⟶(0[,)+∞))
68	67	adantr 485	. . . . . . . 8 ⊢ (((𝜑 ∧ ¬ (Σ^‘𝐺) = +∞) ∧ 𝑦 ∈ (𝒫 𝑋 ∩ Fin)) → 𝐺:𝑋⟶(0[,)+∞))
69	68, 53	fssresd 6747	. . . . . . 7 ⊢ (((𝜑 ∧ ¬ (Σ^‘𝐺) = +∞) ∧ 𝑦 ∈ (𝒫 𝑋 ∩ Fin)) → (𝐺 ↾ 𝑦):𝑦⟶(0[,)+∞))
70	12, 69	sge0fsum 47084	. . . . . 6 ⊢ (((𝜑 ∧ ¬ (Σ^‘𝐺) = +∞) ∧ 𝑦 ∈ (𝒫 𝑋 ∩ Fin)) → (Σ^‘(𝐺 ↾ 𝑦)) = Σ𝑥 ∈ 𝑦 ((𝐺 ↾ 𝑦)‘𝑥))
71	69	ffvelcdmda 7081	. . . . . . . 8 ⊢ ((((𝜑 ∧ ¬ (Σ^‘𝐺) = +∞) ∧ 𝑦 ∈ (𝒫 𝑋 ∩ Fin)) ∧ 𝑥 ∈ 𝑦) → ((𝐺 ↾ 𝑦)‘𝑥) ∈ (0[,)+∞))
72	56, 71	sselid 3936	. . . . . . 7 ⊢ ((((𝜑 ∧ ¬ (Σ^‘𝐺) = +∞) ∧ 𝑦 ∈ (𝒫 𝑋 ∩ Fin)) ∧ 𝑥 ∈ 𝑦) → ((𝐺 ↾ 𝑦)‘𝑥) ∈ ℝ)
73	12, 72	fsumrecl 15787	. . . . . 6 ⊢ (((𝜑 ∧ ¬ (Σ^‘𝐺) = +∞) ∧ 𝑦 ∈ (𝒫 𝑋 ∩ Fin)) → Σ𝑥 ∈ 𝑦 ((𝐺 ↾ 𝑦)‘𝑥) ∈ ℝ)
74	70, 73	eqeltrd 2863	. . . . 5 ⊢ (((𝜑 ∧ ¬ (Σ^‘𝐺) = +∞) ∧ 𝑦 ∈ (𝒫 𝑋 ∩ Fin)) → (Σ^‘(𝐺 ↾ 𝑦)) ∈ ℝ)
75	65	adantr 485	. . . . 5 ⊢ (((𝜑 ∧ ¬ (Σ^‘𝐺) = +∞) ∧ 𝑦 ∈ (𝒫 𝑋 ∩ Fin)) → (Σ^‘𝐺) ∈ ℝ)
76		simplll 786	. . . . . . . . 9 ⊢ ((((𝜑 ∧ ¬ (Σ^‘𝐺) = +∞) ∧ 𝑦 ∈ (𝒫 𝑋 ∩ Fin)) ∧ 𝑥 ∈ 𝑦) → 𝜑)
77	53	sselda 3938	. . . . . . . . 9 ⊢ ((((𝜑 ∧ ¬ (Σ^‘𝐺) = +∞) ∧ 𝑦 ∈ (𝒫 𝑋 ∩ Fin)) ∧ 𝑥 ∈ 𝑦) → 𝑥 ∈ 𝑋)
78	76, 77, 30	syl2anc 595	. . . . . . . 8 ⊢ ((((𝜑 ∧ ¬ (Σ^‘𝐺) = +∞) ∧ 𝑦 ∈ (𝒫 𝑋 ∩ Fin)) ∧ 𝑥 ∈ 𝑦) → (𝐹‘𝑥) ≤ (𝐺‘𝑥))
79		fvres 6902	. . . . . . . . . 10 ⊢ (𝑥 ∈ 𝑦 → ((𝐹 ↾ 𝑦)‘𝑥) = (𝐹‘𝑥))
80	79	adantl 486	. . . . . . . . 9 ⊢ ((((𝜑 ∧ ¬ (Σ^‘𝐺) = +∞) ∧ 𝑦 ∈ (𝒫 𝑋 ∩ Fin)) ∧ 𝑥 ∈ 𝑦) → ((𝐹 ↾ 𝑦)‘𝑥) = (𝐹‘𝑥))
81		fvres 6902	. . . . . . . . . 10 ⊢ (𝑥 ∈ 𝑦 → ((𝐺 ↾ 𝑦)‘𝑥) = (𝐺‘𝑥))
82	81	adantl 486	. . . . . . . . 9 ⊢ ((((𝜑 ∧ ¬ (Σ^‘𝐺) = +∞) ∧ 𝑦 ∈ (𝒫 𝑋 ∩ Fin)) ∧ 𝑥 ∈ 𝑦) → ((𝐺 ↾ 𝑦)‘𝑥) = (𝐺‘𝑥))
83	80, 82	breq12d 5123	. . . . . . . 8 ⊢ ((((𝜑 ∧ ¬ (Σ^‘𝐺) = +∞) ∧ 𝑦 ∈ (𝒫 𝑋 ∩ Fin)) ∧ 𝑥 ∈ 𝑦) → (((𝐹 ↾ 𝑦)‘𝑥) ≤ ((𝐺 ↾ 𝑦)‘𝑥) ↔ (𝐹‘𝑥) ≤ (𝐺‘𝑥)))
84	78, 83	mpbird 260	. . . . . . 7 ⊢ ((((𝜑 ∧ ¬ (Σ^‘𝐺) = +∞) ∧ 𝑦 ∈ (𝒫 𝑋 ∩ Fin)) ∧ 𝑥 ∈ 𝑦) → ((𝐹 ↾ 𝑦)‘𝑥) ≤ ((𝐺 ↾ 𝑦)‘𝑥))
85	12, 58, 72, 84	fsumle 15853	. . . . . 6 ⊢ (((𝜑 ∧ ¬ (Σ^‘𝐺) = +∞) ∧ 𝑦 ∈ (𝒫 𝑋 ∩ Fin)) → Σ𝑥 ∈ 𝑦 ((𝐹 ↾ 𝑦)‘𝑥) ≤ Σ𝑥 ∈ 𝑦 ((𝐺 ↾ 𝑦)‘𝑥))
86	55, 70	breq12d 5123	. . . . . 6 ⊢ (((𝜑 ∧ ¬ (Σ^‘𝐺) = +∞) ∧ 𝑦 ∈ (𝒫 𝑋 ∩ Fin)) → ((Σ^‘(𝐹 ↾ 𝑦)) ≤ (Σ^‘(𝐺 ↾ 𝑦)) ↔ Σ𝑥 ∈ 𝑦 ((𝐹 ↾ 𝑦)‘𝑥) ≤ Σ𝑥 ∈ 𝑦 ((𝐺 ↾ 𝑦)‘𝑥)))
87	85, 86	mpbird 260	. . . . 5 ⊢ (((𝜑 ∧ ¬ (Σ^‘𝐺) = +∞) ∧ 𝑦 ∈ (𝒫 𝑋 ∩ Fin)) → (Σ^‘(𝐹 ↾ 𝑦)) ≤ (Σ^‘(𝐺 ↾ 𝑦)))
88	1	adantr 485	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝒫 𝑋 ∩ Fin)) → 𝑋 ∈ 𝑉)
89	15	adantr 485	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝒫 𝑋 ∩ Fin)) → 𝐺:𝑋⟶(0[,]+∞))
90	88, 89	sge0less 47089	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝒫 𝑋 ∩ Fin)) → (Σ^‘(𝐺 ↾ 𝑦)) ≤ (Σ^‘𝐺))
91	90	adantlr 727	. . . . 5 ⊢ (((𝜑 ∧ ¬ (Σ^‘𝐺) = +∞) ∧ 𝑦 ∈ (𝒫 𝑋 ∩ Fin)) → (Σ^‘(𝐺 ↾ 𝑦)) ≤ (Σ^‘𝐺))
92	60, 74, 75, 87, 91	letrd 11368	. . . 4 ⊢ (((𝜑 ∧ ¬ (Σ^‘𝐺) = +∞) ∧ 𝑦 ∈ (𝒫 𝑋 ∩ Fin)) → (Σ^‘(𝐹 ↾ 𝑦)) ≤ (Σ^‘𝐺))
93	92	ralrimiva 3157	. . 3 ⊢ ((𝜑 ∧ ¬ (Σ^‘𝐺) = +∞) → ∀𝑦 ∈ (𝒫 𝑋 ∩ Fin)(Σ^‘(𝐹 ↾ 𝑦)) ≤ (Σ^‘𝐺))
94	62, 61	sge0xrcl 47082	. . . 4 ⊢ ((𝜑 ∧ ¬ (Σ^‘𝐺) = +∞) → (Σ^‘𝐺) ∈ ℝ*)
95	62, 13, 94	sge0lefi 47095	. . 3 ⊢ ((𝜑 ∧ ¬ (Σ^‘𝐺) = +∞) → ((Σ^‘𝐹) ≤ (Σ^‘𝐺) ↔ ∀𝑦 ∈ (𝒫 𝑋 ∩ Fin)(Σ^‘(𝐹 ↾ 𝑦)) ≤ (Σ^‘𝐺)))
96	93, 95	mpbird 260	. 2 ⊢ ((𝜑 ∧ ¬ (Σ^‘𝐺) = +∞) → (Σ^‘𝐹) ≤ (Σ^‘𝐺))
97	10, 96	pm2.61dan 824	1 ⊢ (𝜑 → (Σ^‘𝐹) ≤ (Σ^‘𝐺))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 400   = wceq 1570   ∈ wcel 2143  ∀wral 3079  ∃wrex 3089   ∩ cin 3905   ⊆ wss 3906  𝒫 cpw 4563   class class class wbr 5110  ran crn 5664   ↾ cres 5665   Fn wfn 6533  ⟶wf 6534  ‘cfv 6538  (class class class)co 7412  Fincfn 8944  ℝcr 11100  0cc0 11101  +∞cpnf 11241  ℝ^*cxr 11243   ≤ cle 11245  [,)cico 13375  [,]cicc 13376  Σcsu 15739  Σ^{^}csumge0 47059

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5239  ax-sep 5258  ax-nul 5270  ax-pow 5338  ax-pr 5406  ax-un 7734  ax-inf2 9611  ax-cnex 11157  ax-resscn 11158  ax-1cn 11159  ax-icn 11160  ax-addcl 11161  ax-addrcl 11162  ax-mulcl 11163  ax-mulrcl 11164  ax-mulcom 11165  ax-addass 11166  ax-mulass 11167  ax-distr 11168  ax-i2m1 11169  ax-1ne0 11170  ax-1rid 11171  ax-rnegex 11172  ax-rrecex 11173  ax-cnre 11174  ax-pre-lttri 11175  ax-pre-lttrn 11176  ax-pre-ltadd 11177  ax-pre-mulgt0 11178  ax-pre-sup 11179

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-nel 3065  df-ral 3080  df-rex 3090  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3746  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4288  df-if 4489  df-pw 4565  df-sn 4591  df-pr 4593  df-op 4597  df-uni 4874  df-int 4914  df-iun 4959  df-br 5111  df-opab 5175  df-mpt 5194  df-tr 5220  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-se 5617  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-pred 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-isom 6547  df-riota 7369  df-ov 7415  df-oprab 7416  df-mpo 7417  df-om 7864  df-1st 7987  df-2nd 7988  df-frecs 8279  df-wrecs 8310  df-recs 8359  df-rdg 8398  df-1o 8454  df-er 8695  df-en 8945  df-dom 8946  df-sdom 8947  df-fin 8948  df-sup 9403  df-oi 9473  df-card 9926  df-pnf 11246  df-mnf 11247  df-xr 11248  df-ltxr 11249  df-le 11250  df-sub 11444  df-neg 11445  df-div 11873  df-nn 12235  df-2 12304  df-3 12305  df-n0 12506  df-z 12593  df-uz 12864  df-rp 13018  df-ico 13379  df-icc 13380  df-fz 13537  df-fzo 13685  df-seq 14040  df-exp 14100  df-hash 14369  df-cj 15152  df-re 15153  df-im 15154  df-sqrt 15288  df-abs 15289  df-clim 15541  df-sum 15740  df-sumge0 47060

This theorem is referenced by:  sge0lempt  47107