Theorem sge0val 47108

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 47105	. . 3 ⊢ Σ^ = (𝑥 ∈ V ↦ if(+∞ ∈ ran 𝑥, +∞, sup(ran (𝑦 ∈ (𝒫 dom 𝑥 ∩ Fin) ↦ Σ𝑤 ∈ 𝑦 (𝑥‘𝑤)), ℝ*, < )))
2	1	a1i 11	. 2 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝐹:𝑋⟶(0[,]+∞)) → Σ^ = (𝑥 ∈ V ↦ if(+∞ ∈ ran 𝑥, +∞, sup(ran (𝑦 ∈ (𝒫 dom 𝑥 ∩ Fin) ↦ Σ𝑤 ∈ 𝑦 (𝑥‘𝑤)), ℝ*, < ))))
3		rneq 5926	. . . . 5 ⊢ (𝑥 = 𝐹 → ran 𝑥 = ran 𝐹)
4	3	eleq2d 2849	. . . 4 ⊢ (𝑥 = 𝐹 → (+∞ ∈ ran 𝑥 ↔ +∞ ∈ ran 𝐹))
5	4	adantl 486	. . 3 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝐹:𝑋⟶(0[,]+∞)) ∧ 𝑥 = 𝐹) → (+∞ ∈ ran 𝑥 ↔ +∞ ∈ ran 𝐹))
6		dmeq 5893	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝐹 → dom 𝑥 = dom 𝐹)
7	6	adantl 486	. . . . . . . . . . 11 ⊢ ((𝐹:𝑋⟶(0[,]+∞) ∧ 𝑥 = 𝐹) → dom 𝑥 = dom 𝐹)
8		fdm 6715	. . . . . . . . . . . 12 ⊢ (𝐹:𝑋⟶(0[,]+∞) → dom 𝐹 = 𝑋)
9	8	adantr 485	. . . . . . . . . . 11 ⊢ ((𝐹:𝑋⟶(0[,]+∞) ∧ 𝑥 = 𝐹) → dom 𝐹 = 𝑋)
10	7, 9	eqtrd 2798	. . . . . . . . . 10 ⊢ ((𝐹:𝑋⟶(0[,]+∞) ∧ 𝑥 = 𝐹) → dom 𝑥 = 𝑋)
11	10	pweqd 4579	. . . . . . . . 9 ⊢ ((𝐹:𝑋⟶(0[,]+∞) ∧ 𝑥 = 𝐹) → 𝒫 dom 𝑥 = 𝒫 𝑋)
12	11	ineq1d 4172	. . . . . . . 8 ⊢ ((𝐹:𝑋⟶(0[,]+∞) ∧ 𝑥 = 𝐹) → (𝒫 dom 𝑥 ∩ Fin) = (𝒫 𝑋 ∩ Fin))
13	12	mpteq1d 5201	. . . . . . 7 ⊢ ((𝐹:𝑋⟶(0[,]+∞) ∧ 𝑥 = 𝐹) → (𝑦 ∈ (𝒫 dom 𝑥 ∩ Fin) ↦ Σ𝑤 ∈ 𝑦 (𝑥‘𝑤)) = (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑤 ∈ 𝑦 (𝑥‘𝑤)))
14	13	adantll 726	. . . . . 6 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝐹:𝑋⟶(0[,]+∞)) ∧ 𝑥 = 𝐹) → (𝑦 ∈ (𝒫 dom 𝑥 ∩ Fin) ↦ Σ𝑤 ∈ 𝑦 (𝑥‘𝑤)) = (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑤 ∈ 𝑦 (𝑥‘𝑤)))
15		fveq1 6880	. . . . . . . . 9 ⊢ (𝑥 = 𝐹 → (𝑥‘𝑤) = (𝐹‘𝑤))
16	15	sumeq2sdv 15759	. . . . . . . 8 ⊢ (𝑥 = 𝐹 → Σ𝑤 ∈ 𝑦 (𝑥‘𝑤) = Σ𝑤 ∈ 𝑦 (𝐹‘𝑤))
17	16	mpteq2dv 5205	. . . . . . 7 ⊢ (𝑥 = 𝐹 → (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑤 ∈ 𝑦 (𝑥‘𝑤)) = (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑤 ∈ 𝑦 (𝐹‘𝑤)))
18	17	adantl 486	. . . . . 6 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝐹:𝑋⟶(0[,]+∞)) ∧ 𝑥 = 𝐹) → (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑤 ∈ 𝑦 (𝑥‘𝑤)) = (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑤 ∈ 𝑦 (𝐹‘𝑤)))
19	14, 18	eqtrd 2798	. . . . 5 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝐹:𝑋⟶(0[,]+∞)) ∧ 𝑥 = 𝐹) → (𝑦 ∈ (𝒫 dom 𝑥 ∩ Fin) ↦ Σ𝑤 ∈ 𝑦 (𝑥‘𝑤)) = (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑤 ∈ 𝑦 (𝐹‘𝑤)))
20	19	rneqd 5928	. . . 4 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝐹:𝑋⟶(0[,]+∞)) ∧ 𝑥 = 𝐹) → ran (𝑦 ∈ (𝒫 dom 𝑥 ∩ Fin) ↦ Σ𝑤 ∈ 𝑦 (𝑥‘𝑤)) = ran (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑤 ∈ 𝑦 (𝐹‘𝑤)))
21	20	supeq1d 9402	. . 3 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝐹:𝑋⟶(0[,]+∞)) ∧ 𝑥 = 𝐹) → sup(ran (𝑦 ∈ (𝒫 dom 𝑥 ∩ Fin) ↦ Σ𝑤 ∈ 𝑦 (𝑥‘𝑤)), ℝ*, < ) = sup(ran (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑤 ∈ 𝑦 (𝐹‘𝑤)), ℝ*, < ))
22	5, 21	ifbieq2d 4514	. 2 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝐹:𝑋⟶(0[,]+∞)) ∧ 𝑥 = 𝐹) → if(+∞ ∈ ran 𝑥, +∞, sup(ran (𝑦 ∈ (𝒫 dom 𝑥 ∩ Fin) ↦ Σ𝑤 ∈ 𝑦 (𝑥‘𝑤)), ℝ*, < )) = if(+∞ ∈ ran 𝐹, +∞, sup(ran (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑤 ∈ 𝑦 (𝐹‘𝑤)), ℝ*, < )))
23		simpr 489	. . 3 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝐹:𝑋⟶(0[,]+∞)) → 𝐹:𝑋⟶(0[,]+∞))
24		simpl 487	. . 3 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝐹:𝑋⟶(0[,]+∞)) → 𝑋 ∈ 𝑉)
25	23, 24	fexd 7225	. 2 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝐹:𝑋⟶(0[,]+∞)) → 𝐹 ∈ V)
26		pnfxr 11267	. . . 4 ⊢ +∞ ∈ ℝ*
27	26	a1i 11	. . 3 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝐹:𝑋⟶(0[,]+∞)) → +∞ ∈ ℝ*)
28		xrltso 13170	. . . . 5 ⊢ < Or ℝ*
29	28	supex 9420	. . . 4 ⊢ sup(ran (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑤 ∈ 𝑦 (𝐹‘𝑤)), ℝ*, < ) ∈ V
30	29	a1i 11	. . 3 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝐹:𝑋⟶(0[,]+∞)) → sup(ran (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑤 ∈ 𝑦 (𝐹‘𝑤)), ℝ*, < ) ∈ V)
31	27, 30	ifexd 4536	. 2 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝐹:𝑋⟶(0[,]+∞)) → if(+∞ ∈ ran 𝐹, +∞, sup(ran (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑤 ∈ 𝑦 (𝐹‘𝑤)), ℝ*, < )) ∈ V)
32	2, 22, 25, 31	fvmptd 6997	1 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝐹:𝑋⟶(0[,]+∞)) → (Σ^‘𝐹) = if(+∞ ∈ ran 𝐹, +∞, sup(ran (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑤 ∈ 𝑦 (𝐹‘𝑤)), ℝ*, < )))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 400   = wceq 1570   ∈ wcel 2143  Vcvv 3455   ∩ cin 3904  ifcif 4487  𝒫 cpw 4562   ↦ cmpt 5192  dom cdm 5661  ran crn 5662  ⟶wf 6532  ‘cfv 6536  (class class class)co 7410  Fincfn 8939  supcsup 9396  0cc0 11104  +∞cpnf 11244  ℝ^*cxr 11246   < clt 11247  [,]cicc 13379  Σcsu 15742  Σ^{^}csumge0 47104

This proof depends on 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 5238  ax-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404  ax-un 7732  ax-cnex 11160  ax-resscn 11161  ax-pre-lttri 11178  ax-pre-lttrn 11179

This proof 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 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-iun 4958  df-br 5110  df-opab 5174  df-mpt 5193  df-id 5556  df-po 5569  df-so 5570  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-pred 6302  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-ov 7413  df-oprab 7414  df-mpo 7415  df-frecs 8274  df-wrecs 8305  df-recs 8354  df-rdg 8393  df-er 8690  df-en 8940  df-dom 8941  df-sdom 8942  df-sup 9398  df-pnf 11249  df-mnf 11250  df-xr 11251  df-ltxr 11252  df-seq 14043  df-sum 15743  df-sumge0 47105

This theorem is used by:  sge0vald  47111