Users' Mathboxes Mathbox for Glauco Siliprandi < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  sge0val Structured version   Visualization version   GIF version

Theorem sge0val 47063
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.
StepHypRef Expression
1 df-sumge0 47060 . . 3 Σ^ = (𝑥 ∈ V ↦ if(+∞ ∈ ran 𝑥, +∞, sup(ran (𝑦 ∈ (𝒫 dom 𝑥 ∩ Fin) ↦ Σ𝑤𝑦 (𝑥𝑤)), ℝ*, < )))
21a1i 11 . 2 ((𝑋𝑉𝐹:𝑋⟶(0[,]+∞)) → Σ^ = (𝑥 ∈ V ↦ if(+∞ ∈ ran 𝑥, +∞, sup(ran (𝑦 ∈ (𝒫 dom 𝑥 ∩ Fin) ↦ Σ𝑤𝑦 (𝑥𝑤)), ℝ*, < ))))
3 rneq 5928 . . . . 5 (𝑥 = 𝐹 → ran 𝑥 = ran 𝐹)
43eleq2d 2849 . . . 4 (𝑥 = 𝐹 → (+∞ ∈ ran 𝑥 ↔ +∞ ∈ ran 𝐹))
54adantl 486 . . 3 (((𝑋𝑉𝐹:𝑋⟶(0[,]+∞)) ∧ 𝑥 = 𝐹) → (+∞ ∈ ran 𝑥 ↔ +∞ ∈ ran 𝐹))
6 dmeq 5895 . . . . . . . . . . . 12 (𝑥 = 𝐹 → dom 𝑥 = dom 𝐹)
76adantl 486 . . . . . . . . . . 11 ((𝐹:𝑋⟶(0[,]+∞) ∧ 𝑥 = 𝐹) → dom 𝑥 = dom 𝐹)
8 fdm 6717 . . . . . . . . . . . 12 (𝐹:𝑋⟶(0[,]+∞) → dom 𝐹 = 𝑋)
98adantr 485 . . . . . . . . . . 11 ((𝐹:𝑋⟶(0[,]+∞) ∧ 𝑥 = 𝐹) → dom 𝐹 = 𝑋)
107, 9eqtrd 2798 . . . . . . . . . 10 ((𝐹:𝑋⟶(0[,]+∞) ∧ 𝑥 = 𝐹) → dom 𝑥 = 𝑋)
1110pweqd 4580 . . . . . . . . 9 ((𝐹:𝑋⟶(0[,]+∞) ∧ 𝑥 = 𝐹) → 𝒫 dom 𝑥 = 𝒫 𝑋)
1211ineq1d 4173 . . . . . . . 8 ((𝐹:𝑋⟶(0[,]+∞) ∧ 𝑥 = 𝐹) → (𝒫 dom 𝑥 ∩ Fin) = (𝒫 𝑋 ∩ Fin))
1312mpteq1d 5202 . . . . . . 7 ((𝐹:𝑋⟶(0[,]+∞) ∧ 𝑥 = 𝐹) → (𝑦 ∈ (𝒫 dom 𝑥 ∩ Fin) ↦ Σ𝑤𝑦 (𝑥𝑤)) = (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑤𝑦 (𝑥𝑤)))
1413adantll 726 . . . . . 6 (((𝑋𝑉𝐹:𝑋⟶(0[,]+∞)) ∧ 𝑥 = 𝐹) → (𝑦 ∈ (𝒫 dom 𝑥 ∩ Fin) ↦ Σ𝑤𝑦 (𝑥𝑤)) = (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑤𝑦 (𝑥𝑤)))
15 fveq1 6882 . . . . . . . . 9 (𝑥 = 𝐹 → (𝑥𝑤) = (𝐹𝑤))
1615sumeq2sdv 15756 . . . . . . . 8 (𝑥 = 𝐹 → Σ𝑤𝑦 (𝑥𝑤) = Σ𝑤𝑦 (𝐹𝑤))
1716mpteq2dv 5206 . . . . . . 7 (𝑥 = 𝐹 → (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑤𝑦 (𝑥𝑤)) = (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑤𝑦 (𝐹𝑤)))
1817adantl 486 . . . . . 6 (((𝑋𝑉𝐹:𝑋⟶(0[,]+∞)) ∧ 𝑥 = 𝐹) → (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑤𝑦 (𝑥𝑤)) = (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑤𝑦 (𝐹𝑤)))
1914, 18eqtrd 2798 . . . . 5 (((𝑋𝑉𝐹:𝑋⟶(0[,]+∞)) ∧ 𝑥 = 𝐹) → (𝑦 ∈ (𝒫 dom 𝑥 ∩ Fin) ↦ Σ𝑤𝑦 (𝑥𝑤)) = (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑤𝑦 (𝐹𝑤)))
2019rneqd 5930 . . . 4 (((𝑋𝑉𝐹:𝑋⟶(0[,]+∞)) ∧ 𝑥 = 𝐹) → ran (𝑦 ∈ (𝒫 dom 𝑥 ∩ Fin) ↦ Σ𝑤𝑦 (𝑥𝑤)) = ran (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑤𝑦 (𝐹𝑤)))
2120supeq1d 9407 . . 3 (((𝑋𝑉𝐹:𝑋⟶(0[,]+∞)) ∧ 𝑥 = 𝐹) → sup(ran (𝑦 ∈ (𝒫 dom 𝑥 ∩ Fin) ↦ Σ𝑤𝑦 (𝑥𝑤)), ℝ*, < ) = sup(ran (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑤𝑦 (𝐹𝑤)), ℝ*, < ))
225, 21ifbieq2d 4515 . 2 (((𝑋𝑉𝐹:𝑋⟶(0[,]+∞)) ∧ 𝑥 = 𝐹) → if(+∞ ∈ ran 𝑥, +∞, sup(ran (𝑦 ∈ (𝒫 dom 𝑥 ∩ Fin) ↦ Σ𝑤𝑦 (𝑥𝑤)), ℝ*, < )) = if(+∞ ∈ ran 𝐹, +∞, sup(ran (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑤𝑦 (𝐹𝑤)), ℝ*, < )))
23 simpr 489 . . 3 ((𝑋𝑉𝐹:𝑋⟶(0[,]+∞)) → 𝐹:𝑋⟶(0[,]+∞))
24 simpl 487 . . 3 ((𝑋𝑉𝐹:𝑋⟶(0[,]+∞)) → 𝑋𝑉)
2523, 24fexd 7227 . 2 ((𝑋𝑉𝐹:𝑋⟶(0[,]+∞)) → 𝐹 ∈ V)
26 pnfxr 11264 . . . 4 +∞ ∈ ℝ*
2726a1i 11 . . 3 ((𝑋𝑉𝐹:𝑋⟶(0[,]+∞)) → +∞ ∈ ℝ*)
28 xrltso 13167 . . . . 5 < Or ℝ*
2928supex 9425 . . . 4 sup(ran (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑤𝑦 (𝐹𝑤)), ℝ*, < ) ∈ V
3029a1i 11 . . 3 ((𝑋𝑉𝐹:𝑋⟶(0[,]+∞)) → sup(ran (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑤𝑦 (𝐹𝑤)), ℝ*, < ) ∈ V)
3127, 30ifexd 4537 . 2 ((𝑋𝑉𝐹:𝑋⟶(0[,]+∞)) → if(+∞ ∈ ran 𝐹, +∞, sup(ran (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑤𝑦 (𝐹𝑤)), ℝ*, < )) ∈ V)
322, 22, 25, 31fvmptd 6999 1 ((𝑋𝑉𝐹:𝑋⟶(0[,]+∞)) → (Σ^𝐹) = if(+∞ ∈ ran 𝐹, +∞, sup(ran (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑤𝑦 (𝐹𝑤)), ℝ*, < )))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400   = wceq 1570  wcel 2143  Vcvv 3455  cin 3905  ifcif 4488  𝒫 cpw 4563  cmpt 5193  dom cdm 5663  ran crn 5664  wf 6534  cfv 6538  (class class class)co 7412  Fincfn 8944  supcsup 9401  0cc0 11101  +∞cpnf 11241  *cxr 11243   < clt 11244  [,]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-cnex 11157  ax-resscn 11158  ax-pre-lttri 11175  ax-pre-lttrn 11176
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-nul 4288  df-if 4489  df-pw 4565  df-sn 4591  df-pr 4593  df-op 4597  df-uni 4874  df-iun 4959  df-br 5111  df-opab 5175  df-mpt 5194  df-id 5558  df-po 5571  df-so 5572  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-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7415  df-oprab 7416  df-mpo 7417  df-frecs 8279  df-wrecs 8310  df-recs 8359  df-rdg 8398  df-er 8695  df-en 8945  df-dom 8946  df-sdom 8947  df-sup 9403  df-pnf 11246  df-mnf 11247  df-xr 11248  df-ltxr 11249  df-seq 14040  df-sum 15740  df-sumge0 47060
This theorem is referenced by:  sge0vald  47066
  Copyright terms: Public domain W3C validator