Theorem sge0val 47194

Description: The value of the sum of nonnegative extended reals. (Contributed by Glauco Siliprandi, 17-Aug-2020.)

Assertion

Ref	Expression
sge0val	⊢ ((𝑋 ∈ 𝑉 ∧ 𝐹:𝑋⟶(0[,]+∞)) → (Σ^‘𝐹) = if(+∞ ∈ ran 𝐹, +∞, sup(ran (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑤 ∈ 𝑦 (𝐹‘𝑤)), ℝ*, < )))

Distinct variable groups:   𝑤,𝐹,𝑦   𝑦,𝑋

Allowed substitution hints:   𝑉(𝑦, 𝑤)   𝑋(𝑤)

Proof of Theorem sge0val

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-sumge0 47191	. . 3 ⊢ Σ^ = (𝑥 ∈ V ↦ if(+∞ ∈ ran 𝑥, +∞, sup(ran (𝑦 ∈ (𝒫 dom 𝑥 ∩ Fin) ↦ Σ𝑤 ∈ 𝑦 (𝑥‘𝑤)), ℝ*, < )))
2	1	a1i 11	. 2 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝐹:𝑋⟶(0[,]+∞)) → Σ^ = (𝑥 ∈ V ↦ if(+∞ ∈ ran 𝑥, +∞, sup(ran (𝑦 ∈ (𝒫 dom 𝑥 ∩ Fin) ↦ Σ𝑤 ∈ 𝑦 (𝑥‘𝑤)), ℝ*, < ))))
3		rneq 5920	. . . . 5 ⊢ (𝑥 = 𝐹 → ran 𝑥 = ran 𝐹)
4	3	eleq2d 2846	. . . 4 ⊢ (𝑥 = 𝐹 → (+∞ ∈ ran 𝑥 ↔ +∞ ∈ ran 𝐹))
5	4	adantl 487	. . 3 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝐹:𝑋⟶(0[,]+∞)) ∧ 𝑥 = 𝐹) → (+∞ ∈ ran 𝑥 ↔ +∞ ∈ ran 𝐹))
6		dmeq 5887	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝐹 → dom 𝑥 = dom 𝐹)
7	6	adantl 487	. . . . . . . . . . 11 ⊢ ((𝐹:𝑋⟶(0[,]+∞) ∧ 𝑥 = 𝐹) → dom 𝑥 = dom 𝐹)
8		fdm 6712	. . . . . . . . . . . 12 ⊢ (𝐹:𝑋⟶(0[,]+∞) → dom 𝐹 = 𝑋)
9	8	adantr 486	. . . . . . . . . . 11 ⊢ ((𝐹:𝑋⟶(0[,]+∞) ∧ 𝑥 = 𝐹) → dom 𝐹 = 𝑋)
10	7, 9	eqtrd 2795	. . . . . . . . . 10 ⊢ ((𝐹:𝑋⟶(0[,]+∞) ∧ 𝑥 = 𝐹) → dom 𝑥 = 𝑋)
11	10	pweqd 4574	. . . . . . . . 9 ⊢ ((𝐹:𝑋⟶(0[,]+∞) ∧ 𝑥 = 𝐹) → 𝒫 dom 𝑥 = 𝒫 𝑋)
12	11	ineq1d 4165	. . . . . . . 8 ⊢ ((𝐹:𝑋⟶(0[,]+∞) ∧ 𝑥 = 𝐹) → (𝒫 dom 𝑥 ∩ Fin) = (𝒫 𝑋 ∩ Fin))
13	12	mpteq1d 5195	. . . . . . 7 ⊢ ((𝐹:𝑋⟶(0[,]+∞) ∧ 𝑥 = 𝐹) → (𝑦 ∈ (𝒫 dom 𝑥 ∩ Fin) ↦ Σ𝑤 ∈ 𝑦 (𝑥‘𝑤)) = (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑤 ∈ 𝑦 (𝑥‘𝑤)))
14	13	adantll 727	. . . . . 6 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝐹:𝑋⟶(0[,]+∞)) ∧ 𝑥 = 𝐹) → (𝑦 ∈ (𝒫 dom 𝑥 ∩ Fin) ↦ Σ𝑤 ∈ 𝑦 (𝑥‘𝑤)) = (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑤 ∈ 𝑦 (𝑥‘𝑤)))
15		fveq1 6877	. . . . . . . . 9 ⊢ (𝑥 = 𝐹 → (𝑥‘𝑤) = (𝐹‘𝑤))
16	15	sumeq2sdv 15790	. . . . . . . 8 ⊢ (𝑥 = 𝐹 → Σ𝑤 ∈ 𝑦 (𝑥‘𝑤) = Σ𝑤 ∈ 𝑦 (𝐹‘𝑤))
17	16	mpteq2dv 5199	. . . . . . 7 ⊢ (𝑥 = 𝐹 → (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑤 ∈ 𝑦 (𝑥‘𝑤)) = (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑤 ∈ 𝑦 (𝐹‘𝑤)))
18	17	adantl 487	. . . . . 6 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝐹:𝑋⟶(0[,]+∞)) ∧ 𝑥 = 𝐹) → (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑤 ∈ 𝑦 (𝑥‘𝑤)) = (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑤 ∈ 𝑦 (𝐹‘𝑤)))
19	14, 18	eqtrd 2795	. . . . 5 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝐹:𝑋⟶(0[,]+∞)) ∧ 𝑥 = 𝐹) → (𝑦 ∈ (𝒫 dom 𝑥 ∩ Fin) ↦ Σ𝑤 ∈ 𝑦 (𝑥‘𝑤)) = (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑤 ∈ 𝑦 (𝐹‘𝑤)))
20	19	rneqd 5922	. . . 4 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝐹:𝑋⟶(0[,]+∞)) ∧ 𝑥 = 𝐹) → ran (𝑦 ∈ (𝒫 dom 𝑥 ∩ Fin) ↦ Σ𝑤 ∈ 𝑦 (𝑥‘𝑤)) = ran (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑤 ∈ 𝑦 (𝐹‘𝑤)))
21	20	supeq1d 9416	. . 3 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝐹:𝑋⟶(0[,]+∞)) ∧ 𝑥 = 𝐹) → sup(ran (𝑦 ∈ (𝒫 dom 𝑥 ∩ Fin) ↦ Σ𝑤 ∈ 𝑦 (𝑥‘𝑤)), ℝ*, < ) = sup(ran (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑤 ∈ 𝑦 (𝐹‘𝑤)), ℝ*, < ))
22	5, 21	ifbieq2d 4509	. 2 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝐹:𝑋⟶(0[,]+∞)) ∧ 𝑥 = 𝐹) → if(+∞ ∈ ran 𝑥, +∞, sup(ran (𝑦 ∈ (𝒫 dom 𝑥 ∩ Fin) ↦ Σ𝑤 ∈ 𝑦 (𝑥‘𝑤)), ℝ*, < )) = if(+∞ ∈ ran 𝐹, +∞, sup(ran (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑤 ∈ 𝑦 (𝐹‘𝑤)), ℝ*, < )))
23		simpr 490	. . 3 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝐹:𝑋⟶(0[,]+∞)) → 𝐹:𝑋⟶(0[,]+∞))
24		simpl 488	. . 3 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝐹:𝑋⟶(0[,]+∞)) → 𝑋 ∈ 𝑉)
25	23, 24	fexd 7226	. 2 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝐹:𝑋⟶(0[,]+∞)) → 𝐹 ∈ V)
26		pnfxr 11287	. . . 4 ⊢ +∞ ∈ ℝ*
27	26	a1i 11	. . 3 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝐹:𝑋⟶(0[,]+∞)) → +∞ ∈ ℝ*)
28		xrltso 13192	. . . . 5 ⊢ < Or ℝ*
29	28	supex 9434	. . . 4 ⊢ sup(ran (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑤 ∈ 𝑦 (𝐹‘𝑤)), ℝ*, < ) ∈ V
30	29	a1i 11	. . 3 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝐹:𝑋⟶(0[,]+∞)) → sup(ran (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑤 ∈ 𝑦 (𝐹‘𝑤)), ℝ*, < ) ∈ V)
31	27, 30	ifexd 4531	. 2 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝐹:𝑋⟶(0[,]+∞)) → if(+∞ ∈ ran 𝐹, +∞, sup(ran (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑤 ∈ 𝑦 (𝐹‘𝑤)), ℝ*, < )) ∈ V)
32	2, 22, 25, 31	fvmptd 6994	1 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝐹:𝑋⟶(0[,]+∞)) → (Σ^‘𝐹) = if(+∞ ∈ ran 𝐹, +∞, sup(ran (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑤 ∈ 𝑦 (𝐹‘𝑤)), ℝ*, < )))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  Vcvv 3450   ∩ cin 3898  ifcif 4482  𝒫 cpw 4557   ↦ cmpt 5186  dom cdm 5655  ran crn 5656  ⟶wf 6529  ‘cfv 6533  (class class class)co 7413  Fincfn 8952  supcsup 9410  0cc0 11124  +∞cpnf 11264  ℝ^*cxr 11266   < clt 11267  [,]cicc 13401  Σcsu 15773  Σ^{^}csumge0 47190

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 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7736  ax-cnex 11180  ax-resscn 11181  ax-pre-lttri 11198  ax-pre-lttrn 11199

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 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-po 5563  df-so 5564  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6299  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-ov 7416  df-oprab 7417  df-mpo 7418  df-frecs 8280  df-wrecs 8311  df-recs 8360  df-rdg 8399  df-er 8696  df-en 8953  df-dom 8954  df-sdom 8955  df-sup 9412  df-pnf 11269  df-mnf 11270  df-xr 11271  df-ltxr 11272  df-seq 14066  df-sum 15774  df-sumge0 47191

This theorem is used by:  sge0vald  47197