Theorem sge0sup 46631

Description: The arbitrary sum of nonnegative extended reals is the supremum of finite subsums. (Contributed by Glauco Siliprandi, 17-Aug-2020.)

Hypotheses

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

Assertion

Ref	Expression
sge0sup	⊢ (𝜑 → (Σ^‘𝐹) = sup(ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ (Σ^‘(𝐹 ↾ 𝑥))), ℝ*, < ))

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

Allowed substitution hint:   𝑉(𝑥)

Proof of Theorem sge0sup

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqidd 2737	. . 3 ⊢ ((𝜑 ∧ +∞ ∈ ran 𝐹) → +∞ = +∞)
2		sge0sup.x	. . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝑉)
3	2	adantr 480	. . . 4 ⊢ ((𝜑 ∧ +∞ ∈ ran 𝐹) → 𝑋 ∈ 𝑉)
4		sge0sup.f	. . . . 5 ⊢ (𝜑 → 𝐹:𝑋⟶(0[,]+∞))
5	4	adantr 480	. . . 4 ⊢ ((𝜑 ∧ +∞ ∈ ran 𝐹) → 𝐹:𝑋⟶(0[,]+∞))
6		simpr 484	. . . 4 ⊢ ((𝜑 ∧ +∞ ∈ ran 𝐹) → +∞ ∈ ran 𝐹)
7	3, 5, 6	sge0pnfval 46613	. . 3 ⊢ ((𝜑 ∧ +∞ ∈ ran 𝐹) → (Σ^‘𝐹) = +∞)
8		vex 3444	. . . . . . . . 9 ⊢ 𝑥 ∈ V
9	8	a1i 11	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝒫 𝑋 ∩ Fin)) → 𝑥 ∈ V)
10	4	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝒫 𝑋 ∩ Fin)) → 𝐹:𝑋⟶(0[,]+∞))
11		elinel1 4153	. . . . . . . . . . 11 ⊢ (𝑥 ∈ (𝒫 𝑋 ∩ Fin) → 𝑥 ∈ 𝒫 𝑋)
12		elpwi 4561	. . . . . . . . . . 11 ⊢ (𝑥 ∈ 𝒫 𝑋 → 𝑥 ⊆ 𝑋)
13	11, 12	syl 17	. . . . . . . . . 10 ⊢ (𝑥 ∈ (𝒫 𝑋 ∩ Fin) → 𝑥 ⊆ 𝑋)
14	13	adantl 481	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝒫 𝑋 ∩ Fin)) → 𝑥 ⊆ 𝑋)
15	10, 14	fssresd 6701	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝒫 𝑋 ∩ Fin)) → (𝐹 ↾ 𝑥):𝑥⟶(0[,]+∞))
16	9, 15	sge0xrcl 46625	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝒫 𝑋 ∩ Fin)) → (Σ^‘(𝐹 ↾ 𝑥)) ∈ ℝ*)
17	16	adantlr 715	. . . . . 6 ⊢ (((𝜑 ∧ +∞ ∈ ran 𝐹) ∧ 𝑥 ∈ (𝒫 𝑋 ∩ Fin)) → (Σ^‘(𝐹 ↾ 𝑥)) ∈ ℝ*)
18	17	ralrimiva 3128	. . . . 5 ⊢ ((𝜑 ∧ +∞ ∈ ran 𝐹) → ∀𝑥 ∈ (𝒫 𝑋 ∩ Fin)(Σ^‘(𝐹 ↾ 𝑥)) ∈ ℝ*)
19		eqid 2736	. . . . . 6 ⊢ (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ (Σ^‘(𝐹 ↾ 𝑥))) = (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ (Σ^‘(𝐹 ↾ 𝑥)))
20	19	rnmptss 7068	. . . . 5 ⊢ (∀𝑥 ∈ (𝒫 𝑋 ∩ Fin)(Σ^‘(𝐹 ↾ 𝑥)) ∈ ℝ* → ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ (Σ^‘(𝐹 ↾ 𝑥))) ⊆ ℝ*)
21	18, 20	syl 17	. . . 4 ⊢ ((𝜑 ∧ +∞ ∈ ran 𝐹) → ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ (Σ^‘(𝐹 ↾ 𝑥))) ⊆ ℝ*)
22	4	ffnd 6663	. . . . . . . 8 ⊢ (𝜑 → 𝐹 Fn 𝑋)
23		fvelrnb 6894	. . . . . . . 8 ⊢ (𝐹 Fn 𝑋 → (+∞ ∈ ran 𝐹 ↔ ∃𝑦 ∈ 𝑋 (𝐹‘𝑦) = +∞))
24	22, 23	syl 17	. . . . . . 7 ⊢ (𝜑 → (+∞ ∈ ran 𝐹 ↔ ∃𝑦 ∈ 𝑋 (𝐹‘𝑦) = +∞))
25	24	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ +∞ ∈ ran 𝐹) → (+∞ ∈ ran 𝐹 ↔ ∃𝑦 ∈ 𝑋 (𝐹‘𝑦) = +∞))
26	6, 25	mpbid 232	. . . . 5 ⊢ ((𝜑 ∧ +∞ ∈ ran 𝐹) → ∃𝑦 ∈ 𝑋 (𝐹‘𝑦) = +∞)
27		snelpwi 5392	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ 𝑋 → {𝑦} ∈ 𝒫 𝑋)
28		snfi 8980	. . . . . . . . . . . . 13 ⊢ {𝑦} ∈ Fin
29	28	a1i 11	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ 𝑋 → {𝑦} ∈ Fin)
30	27, 29	elind 4152	. . . . . . . . . . 11 ⊢ (𝑦 ∈ 𝑋 → {𝑦} ∈ (𝒫 𝑋 ∩ Fin))
31	30	3ad2ant2 1134	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑋 ∧ (𝐹‘𝑦) = +∞) → {𝑦} ∈ (𝒫 𝑋 ∩ Fin))
32		simp2 1137	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑋 ∧ (𝐹‘𝑦) = +∞) → 𝑦 ∈ 𝑋)
33	4	3ad2ant1 1133	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑋 ∧ (𝐹‘𝑦) = +∞) → 𝐹:𝑋⟶(0[,]+∞))
34	32	snssd 4765	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑋 ∧ (𝐹‘𝑦) = +∞) → {𝑦} ⊆ 𝑋)
35	33, 34	fssresd 6701	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑋 ∧ (𝐹‘𝑦) = +∞) → (𝐹 ↾ {𝑦}):{𝑦}⟶(0[,]+∞))
36	32, 35	sge0sn 46619	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑋 ∧ (𝐹‘𝑦) = +∞) → (Σ^‘(𝐹 ↾ {𝑦})) = ((𝐹 ↾ {𝑦})‘𝑦))
37		vsnid 4620	. . . . . . . . . . . . 13 ⊢ 𝑦 ∈ {𝑦}
38		fvres 6853	. . . . . . . . . . . . 13 ⊢ (𝑦 ∈ {𝑦} → ((𝐹 ↾ {𝑦})‘𝑦) = (𝐹‘𝑦))
39	37, 38	ax-mp 5	. . . . . . . . . . . 12 ⊢ ((𝐹 ↾ {𝑦})‘𝑦) = (𝐹‘𝑦)
40	39	a1i 11	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑋 ∧ (𝐹‘𝑦) = +∞) → ((𝐹 ↾ {𝑦})‘𝑦) = (𝐹‘𝑦))
41		simp3 1138	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑋 ∧ (𝐹‘𝑦) = +∞) → (𝐹‘𝑦) = +∞)
42	36, 40, 41	3eqtrrd 2776	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑋 ∧ (𝐹‘𝑦) = +∞) → +∞ = (Σ^‘(𝐹 ↾ {𝑦})))
43		reseq2 5933	. . . . . . . . . . . 12 ⊢ (𝑥 = {𝑦} → (𝐹 ↾ 𝑥) = (𝐹 ↾ {𝑦}))
44	43	fveq2d 6838	. . . . . . . . . . 11 ⊢ (𝑥 = {𝑦} → (Σ^‘(𝐹 ↾ 𝑥)) = (Σ^‘(𝐹 ↾ {𝑦})))
45	44	rspceeqv 3599	. . . . . . . . . 10 ⊢ (({𝑦} ∈ (𝒫 𝑋 ∩ Fin) ∧ +∞ = (Σ^‘(𝐹 ↾ {𝑦}))) → ∃𝑥 ∈ (𝒫 𝑋 ∩ Fin)+∞ = (Σ^‘(𝐹 ↾ 𝑥)))
46	31, 42, 45	syl2anc 584	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑋 ∧ (𝐹‘𝑦) = +∞) → ∃𝑥 ∈ (𝒫 𝑋 ∩ Fin)+∞ = (Σ^‘(𝐹 ↾ 𝑥)))
47		pnfex 11185	. . . . . . . . . 10 ⊢ +∞ ∈ V
48	47	a1i 11	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑋 ∧ (𝐹‘𝑦) = +∞) → +∞ ∈ V)
49	19, 46, 48	elrnmptd 5912	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑋 ∧ (𝐹‘𝑦) = +∞) → +∞ ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ (Σ^‘(𝐹 ↾ 𝑥))))
50	49	3exp 1119	. . . . . . 7 ⊢ (𝜑 → (𝑦 ∈ 𝑋 → ((𝐹‘𝑦) = +∞ → +∞ ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ (Σ^‘(𝐹 ↾ 𝑥))))))
51	50	rexlimdv 3135	. . . . . 6 ⊢ (𝜑 → (∃𝑦 ∈ 𝑋 (𝐹‘𝑦) = +∞ → +∞ ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ (Σ^‘(𝐹 ↾ 𝑥)))))
52	51	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ +∞ ∈ ran 𝐹) → (∃𝑦 ∈ 𝑋 (𝐹‘𝑦) = +∞ → +∞ ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ (Σ^‘(𝐹 ↾ 𝑥)))))
53	26, 52	mpd 15	. . . 4 ⊢ ((𝜑 ∧ +∞ ∈ ran 𝐹) → +∞ ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ (Σ^‘(𝐹 ↾ 𝑥))))
54		supxrpnf 13233	. . . 4 ⊢ ((ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ (Σ^‘(𝐹 ↾ 𝑥))) ⊆ ℝ* ∧ +∞ ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ (Σ^‘(𝐹 ↾ 𝑥)))) → sup(ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ (Σ^‘(𝐹 ↾ 𝑥))), ℝ*, < ) = +∞)
55	21, 53, 54	syl2anc 584	. . 3 ⊢ ((𝜑 ∧ +∞ ∈ ran 𝐹) → sup(ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ (Σ^‘(𝐹 ↾ 𝑥))), ℝ*, < ) = +∞)
56	1, 7, 55	3eqtr4d 2781	. 2 ⊢ ((𝜑 ∧ +∞ ∈ ran 𝐹) → (Σ^‘𝐹) = sup(ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ (Σ^‘(𝐹 ↾ 𝑥))), ℝ*, < ))
57	2	adantr 480	. . . 4 ⊢ ((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) → 𝑋 ∈ 𝑉)
58	4	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) → 𝐹:𝑋⟶(0[,]+∞))
59		simpr 484	. . . . 5 ⊢ ((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) → ¬ +∞ ∈ ran 𝐹)
60	58, 59	fge0iccico 46610	. . . 4 ⊢ ((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) → 𝐹:𝑋⟶(0[,)+∞))
61	57, 60	sge0reval 46612	. . 3 ⊢ ((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) → (Σ^‘𝐹) = sup(ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦 ∈ 𝑥 (𝐹‘𝑦)), ℝ*, < ))
62		elinel2 4154	. . . . . . . . 9 ⊢ (𝑥 ∈ (𝒫 𝑋 ∩ Fin) → 𝑥 ∈ Fin)
63	62	adantl 481	. . . . . . . 8 ⊢ (((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) ∧ 𝑥 ∈ (𝒫 𝑋 ∩ Fin)) → 𝑥 ∈ Fin)
64	15	adantlr 715	. . . . . . . . 9 ⊢ (((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) ∧ 𝑥 ∈ (𝒫 𝑋 ∩ Fin)) → (𝐹 ↾ 𝑥):𝑥⟶(0[,]+∞))
65		nelrnres 45427	. . . . . . . . . 10 ⊢ (¬ +∞ ∈ ran 𝐹 → ¬ +∞ ∈ ran (𝐹 ↾ 𝑥))
66	65	ad2antlr 727	. . . . . . . . 9 ⊢ (((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) ∧ 𝑥 ∈ (𝒫 𝑋 ∩ Fin)) → ¬ +∞ ∈ ran (𝐹 ↾ 𝑥))
67	64, 66	fge0iccico 46610	. . . . . . . 8 ⊢ (((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) ∧ 𝑥 ∈ (𝒫 𝑋 ∩ Fin)) → (𝐹 ↾ 𝑥):𝑥⟶(0[,)+∞))
68	63, 67	sge0fsum 46627	. . . . . . 7 ⊢ (((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) ∧ 𝑥 ∈ (𝒫 𝑋 ∩ Fin)) → (Σ^‘(𝐹 ↾ 𝑥)) = Σ𝑦 ∈ 𝑥 ((𝐹 ↾ 𝑥)‘𝑦))
69		simpr 484	. . . . . . . . . 10 ⊢ ((𝑥 ∈ (𝒫 𝑋 ∩ Fin) ∧ 𝑦 ∈ 𝑥) → 𝑦 ∈ 𝑥)
70		fvres 6853	. . . . . . . . . 10 ⊢ (𝑦 ∈ 𝑥 → ((𝐹 ↾ 𝑥)‘𝑦) = (𝐹‘𝑦))
71	69, 70	syl 17	. . . . . . . . 9 ⊢ ((𝑥 ∈ (𝒫 𝑋 ∩ Fin) ∧ 𝑦 ∈ 𝑥) → ((𝐹 ↾ 𝑥)‘𝑦) = (𝐹‘𝑦))
72	71	sumeq2dv 15625	. . . . . . . 8 ⊢ (𝑥 ∈ (𝒫 𝑋 ∩ Fin) → Σ𝑦 ∈ 𝑥 ((𝐹 ↾ 𝑥)‘𝑦) = Σ𝑦 ∈ 𝑥 (𝐹‘𝑦))
73	72	adantl 481	. . . . . . 7 ⊢ (((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) ∧ 𝑥 ∈ (𝒫 𝑋 ∩ Fin)) → Σ𝑦 ∈ 𝑥 ((𝐹 ↾ 𝑥)‘𝑦) = Σ𝑦 ∈ 𝑥 (𝐹‘𝑦))
74	68, 73	eqtrd 2771	. . . . . 6 ⊢ (((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) ∧ 𝑥 ∈ (𝒫 𝑋 ∩ Fin)) → (Σ^‘(𝐹 ↾ 𝑥)) = Σ𝑦 ∈ 𝑥 (𝐹‘𝑦))
75	74	mpteq2dva 5191	. . . . 5 ⊢ ((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) → (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ (Σ^‘(𝐹 ↾ 𝑥))) = (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦 ∈ 𝑥 (𝐹‘𝑦)))
76	75	rneqd 5887	. . . 4 ⊢ ((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) → ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ (Σ^‘(𝐹 ↾ 𝑥))) = ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦 ∈ 𝑥 (𝐹‘𝑦)))
77	76	supeq1d 9349	. . 3 ⊢ ((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) → sup(ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ (Σ^‘(𝐹 ↾ 𝑥))), ℝ*, < ) = sup(ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦 ∈ 𝑥 (𝐹‘𝑦)), ℝ*, < ))
78	61, 77	eqtr4d 2774	. 2 ⊢ ((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) → (Σ^‘𝐹) = sup(ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ (Σ^‘(𝐹 ↾ 𝑥))), ℝ*, < ))
79	56, 78	pm2.61dan 812	1 ⊢ (𝜑 → (Σ^‘𝐹) = sup(ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ (Σ^‘(𝐹 ↾ 𝑥))), ℝ*, < ))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1541   ∈ wcel 2113  ∀wral 3051  ∃wrex 3060  Vcvv 3440   ∩ cin 3900   ⊆ wss 3901  𝒫 cpw 4554  {csn 4580   ↦ cmpt 5179  ran crn 5625   ↾ cres 5626   Fn wfn 6487  ⟶wf 6488  ‘cfv 6492  (class class class)co 7358  Fincfn 8883  supcsup 9343  0cc0 11026  +∞cpnf 11163  ℝ^*cxr 11165   < clt 11166  [,]cicc 13264  Σcsu 15609  Σ^{^}csumge0 46602

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2184  ax-ext 2708  ax-rep 5224  ax-sep 5241  ax-nul 5251  ax-pow 5310  ax-pr 5377  ax-un 7680  ax-inf2 9550  ax-cnex 11082  ax-resscn 11083  ax-1cn 11084  ax-icn 11085  ax-addcl 11086  ax-addrcl 11087  ax-mulcl 11088  ax-mulrcl 11089  ax-mulcom 11090  ax-addass 11091  ax-mulass 11092  ax-distr 11093  ax-i2m1 11094  ax-1ne0 11095  ax-1rid 11096  ax-rnegex 11097  ax-rrecex 11098  ax-cnre 11099  ax-pre-lttri 11100  ax-pre-lttrn 11101  ax-pre-ltadd 11102  ax-pre-mulgt0 11103  ax-pre-sup 11104

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-nel 3037  df-ral 3052  df-rex 3061  df-rmo 3350  df-reu 3351  df-rab 3400  df-v 3442  df-sbc 3741  df-csb 3850  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-pss 3921  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-int 4903  df-iun 4948  df-br 5099  df-opab 5161  df-mpt 5180  df-tr 5206  df-id 5519  df-eprel 5524  df-po 5532  df-so 5533  df-fr 5577  df-se 5578  df-we 5579  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-pred 6259  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-isom 6501  df-riota 7315  df-ov 7361  df-oprab 7362  df-mpo 7363  df-om 7809  df-1st 7933  df-2nd 7934  df-frecs 8223  df-wrecs 8254  df-recs 8303  df-rdg 8341  df-1o 8397  df-er 8635  df-en 8884  df-dom 8885  df-sdom 8886  df-fin 8887  df-sup 9345  df-oi 9415  df-card 9851  df-pnf 11168  df-mnf 11169  df-xr 11170  df-ltxr 11171  df-le 11172  df-sub 11366  df-neg 11367  df-div 11795  df-nn 12146  df-2 12208  df-3 12209  df-n0 12402  df-z 12489  df-uz 12752  df-rp 12906  df-ico 13267  df-icc 13268  df-fz 13424  df-fzo 13571  df-seq 13925  df-exp 13985  df-hash 14254  df-cj 15022  df-re 15023  df-im 15024  df-sqrt 15158  df-abs 15159  df-clim 15411  df-sum 15610  df-sumge0 46603

This theorem is referenced by:  sge0gerp  46635  sge0pnffigt  46636  sge0lefi  46638