Theorem sge0sup 47402

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 2762	. . 3 ⊢ ((𝜑 ∧ +∞ ∈ ran 𝐹) → +∞ = +∞)
2		sge0sup.x	. . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝑉)
3	2	adantr 486	. . . 4 ⊢ ((𝜑 ∧ +∞ ∈ ran 𝐹) → 𝑋 ∈ 𝑉)
4		sge0sup.f	. . . . 5 ⊢ (𝜑 → 𝐹:𝑋⟶(0[,]+∞))
5	4	adantr 486	. . . 4 ⊢ ((𝜑 ∧ +∞ ∈ ran 𝐹) → 𝐹:𝑋⟶(0[,]+∞))
6		simpr 490	. . . 4 ⊢ ((𝜑 ∧ +∞ ∈ ran 𝐹) → +∞ ∈ ran 𝐹)
7	3, 5, 6	sge0pnfval 47384	. . 3 ⊢ ((𝜑 ∧ +∞ ∈ ran 𝐹) → (Σ^‘𝐹) = +∞)
8		vex 3455	. . . . . . . . 9 ⊢ 𝑥 ∈ V
9	8	a1i 11	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝒫 𝑋 ∩ Fin)) → 𝑥 ∈ V)
10	4	adantr 486	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝒫 𝑋 ∩ Fin)) → 𝐹:𝑋⟶(0[,]+∞))
11		elinel1 4147	. . . . . . . . . . 11 ⊢ (𝑥 ∈ (𝒫 𝑋 ∩ Fin) → 𝑥 ∈ 𝒫 𝑋)
12		elpwi 4564	. . . . . . . . . . 11 ⊢ (𝑥 ∈ 𝒫 𝑋 → 𝑥 ⊆ 𝑋)
13	11, 12	syl 18	. . . . . . . . . 10 ⊢ (𝑥 ∈ (𝒫 𝑋 ∩ Fin) → 𝑥 ⊆ 𝑋)
14	13	adantl 487	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝒫 𝑋 ∩ Fin)) → 𝑥 ⊆ 𝑋)
15	10, 14	fssresd 6750	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝒫 𝑋 ∩ Fin)) → (𝐹 ↾ 𝑥):𝑥⟶(0[,]+∞))
16	9, 15	sge0xrcl 47396	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝒫 𝑋 ∩ Fin)) → (Σ^‘(𝐹 ↾ 𝑥)) ∈ ℝ*)
17	16	adantlr 728	. . . . . 6 ⊢ (((𝜑 ∧ +∞ ∈ ran 𝐹) ∧ 𝑥 ∈ (𝒫 𝑋 ∩ Fin)) → (Σ^‘(𝐹 ↾ 𝑥)) ∈ ℝ*)
18	17	ralrimiva 3155	. . . . 5 ⊢ ((𝜑 ∧ +∞ ∈ ran 𝐹) → ∀𝑥 ∈ (𝒫 𝑋 ∩ Fin)(Σ^‘(𝐹 ↾ 𝑥)) ∈ ℝ*)
19		eqid 2761	. . . . . 6 ⊢ (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ (Σ^‘(𝐹 ↾ 𝑥))) = (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ (Σ^‘(𝐹 ↾ 𝑥)))
20	19	rnmptss 7124	. . . . 5 ⊢ (∀𝑥 ∈ (𝒫 𝑋 ∩ Fin)(Σ^‘(𝐹 ↾ 𝑥)) ∈ ℝ* → ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ (Σ^‘(𝐹 ↾ 𝑥))) ⊆ ℝ*)
21	18, 20	syl 18	. . . 4 ⊢ ((𝜑 ∧ +∞ ∈ ran 𝐹) → ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ (Σ^‘(𝐹 ↾ 𝑥))) ⊆ ℝ*)
22	4	ffnd 6711	. . . . . . . 8 ⊢ (𝜑 → 𝐹 Fn 𝑋)
23		fvelrnb 6946	. . . . . . . 8 ⊢ (𝐹 Fn 𝑋 → (+∞ ∈ ran 𝐹 ↔ ∃𝑦 ∈ 𝑋 (𝐹‘𝑦) = +∞))
24	22, 23	syl 18	. . . . . . 7 ⊢ (𝜑 → (+∞ ∈ ran 𝐹 ↔ ∃𝑦 ∈ 𝑋 (𝐹‘𝑦) = +∞))
25	24	adantr 486	. . . . . 6 ⊢ ((𝜑 ∧ +∞ ∈ ran 𝐹) → (+∞ ∈ ran 𝐹 ↔ ∃𝑦 ∈ 𝑋 (𝐹‘𝑦) = +∞))
26	6, 25	mpbid 235	. . . . 5 ⊢ ((𝜑 ∧ +∞ ∈ ran 𝐹) → ∃𝑦 ∈ 𝑋 (𝐹‘𝑦) = +∞)
27		snelpwi 5412	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ 𝑋 → {𝑦} ∈ 𝒫 𝑋)
28		snfi 9072	. . . . . . . . . . . . 13 ⊢ {𝑦} ∈ Fin
29	28	a1i 11	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ 𝑋 → {𝑦} ∈ Fin)
30	27, 29	elind 4146	. . . . . . . . . . 11 ⊢ (𝑦 ∈ 𝑋 → {𝑦} ∈ (𝒫 𝑋 ∩ Fin))
31	30	3ad2ant2 1152	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑋 ∧ (𝐹‘𝑦) = +∞) → {𝑦} ∈ (𝒫 𝑋 ∩ Fin))
32		simp2 1155	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑋 ∧ (𝐹‘𝑦) = +∞) → 𝑦 ∈ 𝑋)
33	4	3ad2ant1 1151	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑋 ∧ (𝐹‘𝑦) = +∞) → 𝐹:𝑋⟶(0[,]+∞))
34	32	snssd 4747	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑋 ∧ (𝐹‘𝑦) = +∞) → {𝑦} ⊆ 𝑋)
35	33, 34	fssresd 6750	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑋 ∧ (𝐹‘𝑦) = +∞) → (𝐹 ↾ {𝑦}):{𝑦}⟶(0[,]+∞))
36	32, 35	sge0sn 47390	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑋 ∧ (𝐹‘𝑦) = +∞) → (Σ^‘(𝐹 ↾ {𝑦})) = ((𝐹 ↾ {𝑦})‘𝑦))
37		vsnid 4624	. . . . . . . . . . . . 13 ⊢ 𝑦 ∈ {𝑦}
38		fvres 6905	. . . . . . . . . . . . 13 ⊢ (𝑦 ∈ {𝑦} → ((𝐹 ↾ {𝑦})‘𝑦) = (𝐹‘𝑦))
39	37, 38	ax-mp 5	. . . . . . . . . . . 12 ⊢ ((𝐹 ↾ {𝑦})‘𝑦) = (𝐹‘𝑦)
40	39	a1i 11	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑋 ∧ (𝐹‘𝑦) = +∞) → ((𝐹 ↾ {𝑦})‘𝑦) = (𝐹‘𝑦))
41		simp3 1156	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑋 ∧ (𝐹‘𝑦) = +∞) → (𝐹‘𝑦) = +∞)
42	36, 40, 41	3eqtrrd 2801	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑋 ∧ (𝐹‘𝑦) = +∞) → +∞ = (Σ^‘(𝐹 ↾ {𝑦})))
43		reseq2 5965	. . . . . . . . . . . 12 ⊢ (𝑥 = {𝑦} → (𝐹 ↾ 𝑥) = (𝐹 ↾ {𝑦}))
44	43	fveq2d 6890	. . . . . . . . . . 11 ⊢ (𝑥 = {𝑦} → (Σ^‘(𝐹 ↾ 𝑥)) = (Σ^‘(𝐹 ↾ {𝑦})))
45	44	rspceeqv 3599	. . . . . . . . . 10 ⊢ (({𝑦} ∈ (𝒫 𝑋 ∩ Fin) ∧ +∞ = (Σ^‘(𝐹 ↾ {𝑦}))) → ∃𝑥 ∈ (𝒫 𝑋 ∩ Fin)+∞ = (Σ^‘(𝐹 ↾ 𝑥)))
46	31, 42, 45	syl2anc 596	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑋 ∧ (𝐹‘𝑦) = +∞) → ∃𝑥 ∈ (𝒫 𝑋 ∩ Fin)+∞ = (Σ^‘(𝐹 ↾ 𝑥)))
47		pnfex 11363	. . . . . . . . . 10 ⊢ +∞ ∈ V
48	47	a1i 11	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑋 ∧ (𝐹‘𝑦) = +∞) → +∞ ∈ V)
49	19, 46, 48	elrnmptd 5945	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑋 ∧ (𝐹‘𝑦) = +∞) → +∞ ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ (Σ^‘(𝐹 ↾ 𝑥))))
50	49	3exp 1137	. . . . . . 7 ⊢ (𝜑 → (𝑦 ∈ 𝑋 → ((𝐹‘𝑦) = +∞ → +∞ ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ (Σ^‘(𝐹 ↾ 𝑥))))))
51	50	rexlimdv 3162	. . . . . 6 ⊢ (𝜑 → (∃𝑦 ∈ 𝑋 (𝐹‘𝑦) = +∞ → +∞ ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ (Σ^‘(𝐹 ↾ 𝑥)))))
52	51	adantr 486	. . . . 5 ⊢ ((𝜑 ∧ +∞ ∈ ran 𝐹) → (∃𝑦 ∈ 𝑋 (𝐹‘𝑦) = +∞ → +∞ ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ (Σ^‘(𝐹 ↾ 𝑥)))))
53	26, 52	mpd 16	. . . 4 ⊢ ((𝜑 ∧ +∞ ∈ ran 𝐹) → +∞ ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ (Σ^‘(𝐹 ↾ 𝑥))))
54		supxrpnf 13449	. . . 4 ⊢ ((ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ (Σ^‘(𝐹 ↾ 𝑥))) ⊆ ℝ* ∧ +∞ ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ (Σ^‘(𝐹 ↾ 𝑥)))) → sup(ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ (Σ^‘(𝐹 ↾ 𝑥))), ℝ*, < ) = +∞)
55	21, 53, 54	syl2anc 596	. . 3 ⊢ ((𝜑 ∧ +∞ ∈ ran 𝐹) → sup(ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ (Σ^‘(𝐹 ↾ 𝑥))), ℝ*, < ) = +∞)
56	1, 7, 55	3eqtr4d 2806	. 2 ⊢ ((𝜑 ∧ +∞ ∈ ran 𝐹) → (Σ^‘𝐹) = sup(ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ (Σ^‘(𝐹 ↾ 𝑥))), ℝ*, < ))
57	2	adantr 486	. . . 4 ⊢ ((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) → 𝑋 ∈ 𝑉)
58	4	adantr 486	. . . . 5 ⊢ ((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) → 𝐹:𝑋⟶(0[,]+∞))
59		simpr 490	. . . . 5 ⊢ ((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) → ¬ +∞ ∈ ran 𝐹)
60	58, 59	fge0iccico 47381	. . . 4 ⊢ ((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) → 𝐹:𝑋⟶(0[,)+∞))
61	57, 60	sge0reval 47383	. . 3 ⊢ ((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) → (Σ^‘𝐹) = sup(ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦 ∈ 𝑥 (𝐹‘𝑦)), ℝ*, < ))
62		elinel2 4148	. . . . . . . . 9 ⊢ (𝑥 ∈ (𝒫 𝑋 ∩ Fin) → 𝑥 ∈ Fin)
63	62	adantl 487	. . . . . . . 8 ⊢ (((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) ∧ 𝑥 ∈ (𝒫 𝑋 ∩ Fin)) → 𝑥 ∈ Fin)
64	15	adantlr 728	. . . . . . . . 9 ⊢ (((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) ∧ 𝑥 ∈ (𝒫 𝑋 ∩ Fin)) → (𝐹 ↾ 𝑥):𝑥⟶(0[,]+∞))
65		nelrnres 46203	. . . . . . . . . 10 ⊢ (¬ +∞ ∈ ran 𝐹 → ¬ +∞ ∈ ran (𝐹 ↾ 𝑥))
66	65	ad2antlr 740	. . . . . . . . 9 ⊢ (((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) ∧ 𝑥 ∈ (𝒫 𝑋 ∩ Fin)) → ¬ +∞ ∈ ran (𝐹 ↾ 𝑥))
67	64, 66	fge0iccico 47381	. . . . . . . 8 ⊢ (((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) ∧ 𝑥 ∈ (𝒫 𝑋 ∩ Fin)) → (𝐹 ↾ 𝑥):𝑥⟶(0[,)+∞))
68	63, 67	sge0fsum 47398	. . . . . . 7 ⊢ (((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) ∧ 𝑥 ∈ (𝒫 𝑋 ∩ Fin)) → (Σ^‘(𝐹 ↾ 𝑥)) = Σ𝑦 ∈ 𝑥 ((𝐹 ↾ 𝑥)‘𝑦))
69		simpr 490	. . . . . . . . . 10 ⊢ ((𝑥 ∈ (𝒫 𝑋 ∩ Fin) ∧ 𝑦 ∈ 𝑥) → 𝑦 ∈ 𝑥)
70		fvres 6905	. . . . . . . . . 10 ⊢ (𝑦 ∈ 𝑥 → ((𝐹 ↾ 𝑥)‘𝑦) = (𝐹‘𝑦))
71	69, 70	syl 18	. . . . . . . . 9 ⊢ ((𝑥 ∈ (𝒫 𝑋 ∩ Fin) ∧ 𝑦 ∈ 𝑥) → ((𝐹 ↾ 𝑥)‘𝑦) = (𝐹‘𝑦))
72	71	sumeq2dv 15870	. . . . . . . 8 ⊢ (𝑥 ∈ (𝒫 𝑋 ∩ Fin) → Σ𝑦 ∈ 𝑥 ((𝐹 ↾ 𝑥)‘𝑦) = Σ𝑦 ∈ 𝑥 (𝐹‘𝑦))
73	72	adantl 487	. . . . . . 7 ⊢ (((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) ∧ 𝑥 ∈ (𝒫 𝑋 ∩ Fin)) → Σ𝑦 ∈ 𝑥 ((𝐹 ↾ 𝑥)‘𝑦) = Σ𝑦 ∈ 𝑥 (𝐹‘𝑦))
74	68, 73	eqtrd 2796	. . . . . 6 ⊢ (((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) ∧ 𝑥 ∈ (𝒫 𝑋 ∩ Fin)) → (Σ^‘(𝐹 ↾ 𝑥)) = Σ𝑦 ∈ 𝑥 (𝐹‘𝑦))
75	74	mpteq2dva 5198	. . . . 5 ⊢ ((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) → (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ (Σ^‘(𝐹 ↾ 𝑥))) = (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦 ∈ 𝑥 (𝐹‘𝑦)))
76	75	rneqd 5920	. . . 4 ⊢ ((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) → ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ (Σ^‘(𝐹 ↾ 𝑥))) = ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦 ∈ 𝑥 (𝐹‘𝑦)))
77	76	supeq1d 9439	. . 3 ⊢ ((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) → sup(ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ (Σ^‘(𝐹 ↾ 𝑥))), ℝ*, < ) = sup(ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦 ∈ 𝑥 (𝐹‘𝑦)), ℝ*, < ))
78	61, 77	eqtr4d 2799	. 2 ⊢ ((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) → (Σ^‘𝐹) = sup(ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ (Σ^‘(𝐹 ↾ 𝑥))), ℝ*, < ))
79	56, 78	pm2.61dan 825	1 ⊢ (𝜑 → (Σ^‘𝐹) = sup(ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ (Σ^‘(𝐹 ↾ 𝑥))), ℝ*, < ))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ∀wral 3077  ∃wrex 3087  Vcvv 3451   ∩ cin 3898   ⊆ wss 3914  𝒫 cpw 4557  {csn 4584   ↦ cmpt 5186  ran crn 5652   ↾ cres 5653   Fn wfn 6534  ⟶wf 6535  ‘cfv 6539  (class class class)co 7421  Fincfn 8974  supcsup 9433  0cc0 11201  +∞cpnf 11341  ℝ^*cxr 11343   < clt 11344  [,]cicc 13480  Σcsu 15854  Σ^{^}csumge0 47373

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 7752  ax-inf2 9643  ax-cnex 11257  ax-resscn 11258  ax-1cn 11259  ax-icn 11260  ax-addcl 11261  ax-addrcl 11262  ax-mulcl 11263  ax-mulrcl 11264  ax-mulcom 11265  ax-addass 11266  ax-mulass 11267  ax-distr 11268  ax-i2m1 11269  ax-1ne0 11270  ax-1rid 11271  ax-rnegex 11272  ax-rrecex 11273  ax-cnre 11274  ax-pre-lttri 11275  ax-pre-lttrn 11276  ax-pre-ltadd 11277  ax-pre-mulgt0 11278  ax-pre-sup 11279

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 3900  df-un 3902  df-in 3904  df-ss 3915  df-pss 4035  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 6305  df-ord 6366  df-on 6367  df-lim 6368  df-suc 6369  df-iota 6495  df-fun 6541  df-fn 6542  df-f 6543  df-f1 6544  df-fo 6545  df-f1o 6546  df-fv 6547  df-isom 6548  df-riota 7378  df-ov 7424  df-oprab 7425  df-mpo 7426  df-om 7879  df-1st 8002  df-2nd 8003  df-frecs 8300  df-wrecs 8331  df-recs 8380  df-rdg 8419  df-1o 8477  df-er 8718  df-en 8975  df-dom 8976  df-sdom 8977  df-fin 8978  df-sup 9435  df-oi 9505  df-card 10021  df-pnf 11346  df-mnf 11347  df-xr 11348  df-ltxr 11349  df-le 11350  df-sub 11544  df-neg 11545  df-div 11975  df-nn 12337  df-2 12406  df-3 12407  df-n0 12608  df-z 12695  df-uz 12967  df-rp 13122  df-ico 13483  df-icc 13484  df-fz 13641  df-fzo 13790  df-seq 14146  df-exp 14206  df-hash 14476  df-cj 15267  df-re 15268  df-im 15269  df-sqrt 15403  df-abs 15404  df-clim 15656  df-sum 15855  df-sumge0 47374

This theorem is used by:  sge0gerp  47406  sge0pnffigt  47407  sge0lefi  47409