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

Theorem sge0supre 46418
Description: If the arbitrary sum of nonnegative extended reals is real, then it is the supremum (in the real numbers) of finite subsums. Similar to sge0sup 46420, but here we can use sup with respect to instead of *. (Contributed by Glauco Siliprandi, 17-Aug-2020.)
Hypotheses
Ref Expression
sge0supre.x (𝜑𝑋𝑉)
sge0supre.f (𝜑𝐹:𝑋⟶(0[,]+∞))
sge0supre.re (𝜑 → (Σ^𝐹) ∈ ℝ)
Assertion
Ref Expression
sge0supre (𝜑 → (Σ^𝐹) = sup(ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)), ℝ, < ))
Distinct variable groups:   𝑥,𝐹,𝑦   𝑥,𝑋,𝑦   𝜑,𝑥,𝑦
Allowed substitution hints:   𝑉(𝑥,𝑦)

Proof of Theorem sge0supre
Dummy variables 𝑤 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 sge0supre.x . . 3 (𝜑𝑋𝑉)
2 sge0supre.f . . . 4 (𝜑𝐹:𝑋⟶(0[,]+∞))
31adantr 480 . . . . . 6 ((𝜑 ∧ +∞ ∈ ran 𝐹) → 𝑋𝑉)
42adantr 480 . . . . . 6 ((𝜑 ∧ +∞ ∈ ran 𝐹) → 𝐹:𝑋⟶(0[,]+∞))
5 simpr 484 . . . . . 6 ((𝜑 ∧ +∞ ∈ ran 𝐹) → +∞ ∈ ran 𝐹)
63, 4, 5sge0pnfval 46402 . . . . 5 ((𝜑 ∧ +∞ ∈ ran 𝐹) → (Σ^𝐹) = +∞)
7 sge0supre.re . . . . . . 7 (𝜑 → (Σ^𝐹) ∈ ℝ)
81, 2sge0repnf 46415 . . . . . . 7 (𝜑 → ((Σ^𝐹) ∈ ℝ ↔ ¬ (Σ^𝐹) = +∞))
97, 8mpbid 232 . . . . . 6 (𝜑 → ¬ (Σ^𝐹) = +∞)
109adantr 480 . . . . 5 ((𝜑 ∧ +∞ ∈ ran 𝐹) → ¬ (Σ^𝐹) = +∞)
116, 10pm2.65da 816 . . . 4 (𝜑 → ¬ +∞ ∈ ran 𝐹)
122, 11fge0iccico 46399 . . 3 (𝜑𝐹:𝑋⟶(0[,)+∞))
131, 12sge0reval 46401 . 2 (𝜑 → (Σ^𝐹) = sup(ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)), ℝ*, < ))
1412sge0rnre 46393 . . 3 (𝜑 → ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)) ⊆ ℝ)
15 sge0rnn0 46397 . . . 4 ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)) ≠ ∅
1615a1i 11 . . 3 (𝜑 → ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)) ≠ ∅)
17 simpr 484 . . . . . . 7 ((𝜑𝑤 ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦))) → 𝑤 ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)))
18 eqid 2735 . . . . . . . . 9 (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)) = (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦))
1918elrnmpt 5938 . . . . . . . 8 (𝑤 ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)) → (𝑤 ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)) ↔ ∃𝑥 ∈ (𝒫 𝑋 ∩ Fin)𝑤 = Σ𝑦𝑥 (𝐹𝑦)))
2019adantl 481 . . . . . . 7 ((𝜑𝑤 ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦))) → (𝑤 ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)) ↔ ∃𝑥 ∈ (𝒫 𝑋 ∩ Fin)𝑤 = Σ𝑦𝑥 (𝐹𝑦)))
2117, 20mpbid 232 . . . . . 6 ((𝜑𝑤 ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦))) → ∃𝑥 ∈ (𝒫 𝑋 ∩ Fin)𝑤 = Σ𝑦𝑥 (𝐹𝑦))
22 simp3 1138 . . . . . . . . . 10 ((𝜑𝑥 ∈ (𝒫 𝑋 ∩ Fin) ∧ 𝑤 = Σ𝑦𝑥 (𝐹𝑦)) → 𝑤 = Σ𝑦𝑥 (𝐹𝑦))
23 ressxr 11279 . . . . . . . . . . . . . . . 16 ℝ ⊆ ℝ*
2423a1i 11 . . . . . . . . . . . . . . 15 (𝜑 → ℝ ⊆ ℝ*)
2514, 24sstrd 3969 . . . . . . . . . . . . . 14 (𝜑 → ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)) ⊆ ℝ*)
2625adantr 480 . . . . . . . . . . . . 13 ((𝜑𝑥 ∈ (𝒫 𝑋 ∩ Fin)) → ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)) ⊆ ℝ*)
27 id 22 . . . . . . . . . . . . . . 15 (𝑥 ∈ (𝒫 𝑋 ∩ Fin) → 𝑥 ∈ (𝒫 𝑋 ∩ Fin))
28 sumex 15704 . . . . . . . . . . . . . . . 16 Σ𝑦𝑥 (𝐹𝑦) ∈ V
2928a1i 11 . . . . . . . . . . . . . . 15 (𝑥 ∈ (𝒫 𝑋 ∩ Fin) → Σ𝑦𝑥 (𝐹𝑦) ∈ V)
3018elrnmpt1 5940 . . . . . . . . . . . . . . 15 ((𝑥 ∈ (𝒫 𝑋 ∩ Fin) ∧ Σ𝑦𝑥 (𝐹𝑦) ∈ V) → Σ𝑦𝑥 (𝐹𝑦) ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)))
3127, 29, 30syl2anc 584 . . . . . . . . . . . . . 14 (𝑥 ∈ (𝒫 𝑋 ∩ Fin) → Σ𝑦𝑥 (𝐹𝑦) ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)))
3231adantl 481 . . . . . . . . . . . . 13 ((𝜑𝑥 ∈ (𝒫 𝑋 ∩ Fin)) → Σ𝑦𝑥 (𝐹𝑦) ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)))
33 supxrub 13340 . . . . . . . . . . . . 13 ((ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)) ⊆ ℝ* ∧ Σ𝑦𝑥 (𝐹𝑦) ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦))) → Σ𝑦𝑥 (𝐹𝑦) ≤ sup(ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)), ℝ*, < ))
3426, 32, 33syl2anc 584 . . . . . . . . . . . 12 ((𝜑𝑥 ∈ (𝒫 𝑋 ∩ Fin)) → Σ𝑦𝑥 (𝐹𝑦) ≤ sup(ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)), ℝ*, < ))
3513eqcomd 2741 . . . . . . . . . . . . 13 (𝜑 → sup(ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)), ℝ*, < ) = (Σ^𝐹))
3635adantr 480 . . . . . . . . . . . 12 ((𝜑𝑥 ∈ (𝒫 𝑋 ∩ Fin)) → sup(ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)), ℝ*, < ) = (Σ^𝐹))
3734, 36breqtrd 5145 . . . . . . . . . . 11 ((𝜑𝑥 ∈ (𝒫 𝑋 ∩ Fin)) → Σ𝑦𝑥 (𝐹𝑦) ≤ (Σ^𝐹))
38373adant3 1132 . . . . . . . . . 10 ((𝜑𝑥 ∈ (𝒫 𝑋 ∩ Fin) ∧ 𝑤 = Σ𝑦𝑥 (𝐹𝑦)) → Σ𝑦𝑥 (𝐹𝑦) ≤ (Σ^𝐹))
3922, 38eqbrtrd 5141 . . . . . . . . 9 ((𝜑𝑥 ∈ (𝒫 𝑋 ∩ Fin) ∧ 𝑤 = Σ𝑦𝑥 (𝐹𝑦)) → 𝑤 ≤ (Σ^𝐹))
40393exp 1119 . . . . . . . 8 (𝜑 → (𝑥 ∈ (𝒫 𝑋 ∩ Fin) → (𝑤 = Σ𝑦𝑥 (𝐹𝑦) → 𝑤 ≤ (Σ^𝐹))))
4140rexlimdv 3139 . . . . . . 7 (𝜑 → (∃𝑥 ∈ (𝒫 𝑋 ∩ Fin)𝑤 = Σ𝑦𝑥 (𝐹𝑦) → 𝑤 ≤ (Σ^𝐹)))
4241adantr 480 . . . . . 6 ((𝜑𝑤 ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦))) → (∃𝑥 ∈ (𝒫 𝑋 ∩ Fin)𝑤 = Σ𝑦𝑥 (𝐹𝑦) → 𝑤 ≤ (Σ^𝐹)))
4321, 42mpd 15 . . . . 5 ((𝜑𝑤 ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦))) → 𝑤 ≤ (Σ^𝐹))
4443ralrimiva 3132 . . . 4 (𝜑 → ∀𝑤 ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦))𝑤 ≤ (Σ^𝐹))
45 brralrspcev 5179 . . . 4 (((Σ^𝐹) ∈ ℝ ∧ ∀𝑤 ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦))𝑤 ≤ (Σ^𝐹)) → ∃𝑧 ∈ ℝ ∀𝑤 ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦))𝑤𝑧)
467, 44, 45syl2anc 584 . . 3 (𝜑 → ∃𝑧 ∈ ℝ ∀𝑤 ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦))𝑤𝑧)
47 supxrre 13343 . . 3 ((ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)) ⊆ ℝ ∧ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)) ≠ ∅ ∧ ∃𝑧 ∈ ℝ ∀𝑤 ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦))𝑤𝑧) → sup(ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)), ℝ*, < ) = sup(ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)), ℝ, < ))
4814, 16, 46, 47syl3anc 1373 . 2 (𝜑 → sup(ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)), ℝ*, < ) = sup(ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)), ℝ, < ))
4913, 48eqtrd 2770 1 (𝜑 → (Σ^𝐹) = sup(ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)), ℝ, < ))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395  w3a 1086   = wceq 1540  wcel 2108  wne 2932  wral 3051  wrex 3060  Vcvv 3459  cin 3925  wss 3926  c0 4308  𝒫 cpw 4575   class class class wbr 5119  cmpt 5201  ran crn 5655  wf 6527  cfv 6531  (class class class)co 7405  Fincfn 8959  supcsup 9452  cr 11128  0cc0 11129  +∞cpnf 11266  *cxr 11268   < clt 11269  cle 11270  [,]cicc 13365  Σcsu 15702  Σ^csumge0 46391
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2707  ax-rep 5249  ax-sep 5266  ax-nul 5276  ax-pow 5335  ax-pr 5402  ax-un 7729  ax-inf2 9655  ax-cnex 11185  ax-resscn 11186  ax-1cn 11187  ax-icn 11188  ax-addcl 11189  ax-addrcl 11190  ax-mulcl 11191  ax-mulrcl 11192  ax-mulcom 11193  ax-addass 11194  ax-mulass 11195  ax-distr 11196  ax-i2m1 11197  ax-1ne0 11198  ax-1rid 11199  ax-rnegex 11200  ax-rrecex 11201  ax-cnre 11202  ax-pre-lttri 11203  ax-pre-lttrn 11204  ax-pre-ltadd 11205  ax-pre-mulgt0 11206  ax-pre-sup 11207
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2809  df-nfc 2885  df-ne 2933  df-nel 3037  df-ral 3052  df-rex 3061  df-rmo 3359  df-reu 3360  df-rab 3416  df-v 3461  df-sbc 3766  df-csb 3875  df-dif 3929  df-un 3931  df-in 3933  df-ss 3943  df-pss 3946  df-nul 4309  df-if 4501  df-pw 4577  df-sn 4602  df-pr 4604  df-op 4608  df-uni 4884  df-int 4923  df-iun 4969  df-br 5120  df-opab 5182  df-mpt 5202  df-tr 5230  df-id 5548  df-eprel 5553  df-po 5561  df-so 5562  df-fr 5606  df-se 5607  df-we 5608  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-pred 6290  df-ord 6355  df-on 6356  df-lim 6357  df-suc 6358  df-iota 6484  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-isom 6540  df-riota 7362  df-ov 7408  df-oprab 7409  df-mpo 7410  df-om 7862  df-1st 7988  df-2nd 7989  df-frecs 8280  df-wrecs 8311  df-recs 8385  df-rdg 8424  df-1o 8480  df-er 8719  df-en 8960  df-dom 8961  df-sdom 8962  df-fin 8963  df-sup 9454  df-oi 9524  df-card 9953  df-pnf 11271  df-mnf 11272  df-xr 11273  df-ltxr 11274  df-le 11275  df-sub 11468  df-neg 11469  df-div 11895  df-nn 12241  df-2 12303  df-3 12304  df-n0 12502  df-z 12589  df-uz 12853  df-rp 13009  df-ico 13368  df-icc 13369  df-fz 13525  df-fzo 13672  df-seq 14020  df-exp 14080  df-hash 14349  df-cj 15118  df-re 15119  df-im 15120  df-sqrt 15254  df-abs 15255  df-clim 15504  df-sum 15703  df-sumge0 46392
This theorem is referenced by:  sge0ltfirp  46429  sge0resplit  46435
  Copyright terms: Public domain W3C validator