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 43028
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 43030, 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 484 . . . . . 6 ((𝜑 ∧ +∞ ∈ ran 𝐹) → 𝑋𝑉)
42adantr 484 . . . . . 6 ((𝜑 ∧ +∞ ∈ ran 𝐹) → 𝐹:𝑋⟶(0[,]+∞))
5 simpr 488 . . . . . 6 ((𝜑 ∧ +∞ ∈ ran 𝐹) → +∞ ∈ ran 𝐹)
63, 4, 5sge0pnfval 43012 . . . . 5 ((𝜑 ∧ +∞ ∈ ran 𝐹) → (Σ^𝐹) = +∞)
7 sge0supre.re . . . . . . 7 (𝜑 → (Σ^𝐹) ∈ ℝ)
81, 2sge0repnf 43025 . . . . . . 7 (𝜑 → ((Σ^𝐹) ∈ ℝ ↔ ¬ (Σ^𝐹) = +∞))
97, 8mpbid 235 . . . . . 6 (𝜑 → ¬ (Σ^𝐹) = +∞)
109adantr 484 . . . . 5 ((𝜑 ∧ +∞ ∈ ran 𝐹) → ¬ (Σ^𝐹) = +∞)
116, 10pm2.65da 816 . . . 4 (𝜑 → ¬ +∞ ∈ ran 𝐹)
122, 11fge0iccico 43009 . . 3 (𝜑𝐹:𝑋⟶(0[,)+∞))
131, 12sge0reval 43011 . 2 (𝜑 → (Σ^𝐹) = sup(ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)), ℝ*, < ))
1412sge0rnre 43003 . . 3 (𝜑 → ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)) ⊆ ℝ)
15 sge0rnn0 43007 . . . 4 ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)) ≠ ∅
1615a1i 11 . . 3 (𝜑 → ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)) ≠ ∅)
17 simpr 488 . . . . . . 7 ((𝜑𝑤 ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦))) → 𝑤 ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)))
18 eqid 2798 . . . . . . . . 9 (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)) = (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦))
1918elrnmpt 5792 . . . . . . . 8 (𝑤 ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)) → (𝑤 ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)) ↔ ∃𝑥 ∈ (𝒫 𝑋 ∩ Fin)𝑤 = Σ𝑦𝑥 (𝐹𝑦)))
2019adantl 485 . . . . . . 7 ((𝜑𝑤 ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦))) → (𝑤 ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)) ↔ ∃𝑥 ∈ (𝒫 𝑋 ∩ Fin)𝑤 = Σ𝑦𝑥 (𝐹𝑦)))
2117, 20mpbid 235 . . . . . 6 ((𝜑𝑤 ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦))) → ∃𝑥 ∈ (𝒫 𝑋 ∩ Fin)𝑤 = Σ𝑦𝑥 (𝐹𝑦))
22 simp3 1135 . . . . . . . . . 10 ((𝜑𝑥 ∈ (𝒫 𝑋 ∩ Fin) ∧ 𝑤 = Σ𝑦𝑥 (𝐹𝑦)) → 𝑤 = Σ𝑦𝑥 (𝐹𝑦))
23 ressxr 10674 . . . . . . . . . . . . . . . 16 ℝ ⊆ ℝ*
2423a1i 11 . . . . . . . . . . . . . . 15 (𝜑 → ℝ ⊆ ℝ*)
2514, 24sstrd 3925 . . . . . . . . . . . . . 14 (𝜑 → ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)) ⊆ ℝ*)
2625adantr 484 . . . . . . . . . . . . 13 ((𝜑𝑥 ∈ (𝒫 𝑋 ∩ Fin)) → ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)) ⊆ ℝ*)
27 id 22 . . . . . . . . . . . . . . 15 (𝑥 ∈ (𝒫 𝑋 ∩ Fin) → 𝑥 ∈ (𝒫 𝑋 ∩ Fin))
28 sumex 15036 . . . . . . . . . . . . . . . 16 Σ𝑦𝑥 (𝐹𝑦) ∈ V
2928a1i 11 . . . . . . . . . . . . . . 15 (𝑥 ∈ (𝒫 𝑋 ∩ Fin) → Σ𝑦𝑥 (𝐹𝑦) ∈ V)
3018elrnmpt1 5794 . . . . . . . . . . . . . . 15 ((𝑥 ∈ (𝒫 𝑋 ∩ Fin) ∧ Σ𝑦𝑥 (𝐹𝑦) ∈ V) → Σ𝑦𝑥 (𝐹𝑦) ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)))
3127, 29, 30syl2anc 587 . . . . . . . . . . . . . 14 (𝑥 ∈ (𝒫 𝑋 ∩ Fin) → Σ𝑦𝑥 (𝐹𝑦) ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)))
3231adantl 485 . . . . . . . . . . . . 13 ((𝜑𝑥 ∈ (𝒫 𝑋 ∩ Fin)) → Σ𝑦𝑥 (𝐹𝑦) ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)))
33 supxrub 12705 . . . . . . . . . . . . 13 ((ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)) ⊆ ℝ* ∧ Σ𝑦𝑥 (𝐹𝑦) ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦))) → Σ𝑦𝑥 (𝐹𝑦) ≤ sup(ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)), ℝ*, < ))
3426, 32, 33syl2anc 587 . . . . . . . . . . . 12 ((𝜑𝑥 ∈ (𝒫 𝑋 ∩ Fin)) → Σ𝑦𝑥 (𝐹𝑦) ≤ sup(ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)), ℝ*, < ))
3513eqcomd 2804 . . . . . . . . . . . . 13 (𝜑 → sup(ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)), ℝ*, < ) = (Σ^𝐹))
3635adantr 484 . . . . . . . . . . . 12 ((𝜑𝑥 ∈ (𝒫 𝑋 ∩ Fin)) → sup(ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)), ℝ*, < ) = (Σ^𝐹))
3734, 36breqtrd 5056 . . . . . . . . . . 11 ((𝜑𝑥 ∈ (𝒫 𝑋 ∩ Fin)) → Σ𝑦𝑥 (𝐹𝑦) ≤ (Σ^𝐹))
38373adant3 1129 . . . . . . . . . 10 ((𝜑𝑥 ∈ (𝒫 𝑋 ∩ Fin) ∧ 𝑤 = Σ𝑦𝑥 (𝐹𝑦)) → Σ𝑦𝑥 (𝐹𝑦) ≤ (Σ^𝐹))
3922, 38eqbrtrd 5052 . . . . . . . . 9 ((𝜑𝑥 ∈ (𝒫 𝑋 ∩ Fin) ∧ 𝑤 = Σ𝑦𝑥 (𝐹𝑦)) → 𝑤 ≤ (Σ^𝐹))
40393exp 1116 . . . . . . . 8 (𝜑 → (𝑥 ∈ (𝒫 𝑋 ∩ Fin) → (𝑤 = Σ𝑦𝑥 (𝐹𝑦) → 𝑤 ≤ (Σ^𝐹))))
4140rexlimdv 3242 . . . . . . 7 (𝜑 → (∃𝑥 ∈ (𝒫 𝑋 ∩ Fin)𝑤 = Σ𝑦𝑥 (𝐹𝑦) → 𝑤 ≤ (Σ^𝐹)))
4241adantr 484 . . . . . 6 ((𝜑𝑤 ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦))) → (∃𝑥 ∈ (𝒫 𝑋 ∩ Fin)𝑤 = Σ𝑦𝑥 (𝐹𝑦) → 𝑤 ≤ (Σ^𝐹)))
4321, 42mpd 15 . . . . 5 ((𝜑𝑤 ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦))) → 𝑤 ≤ (Σ^𝐹))
4443ralrimiva 3149 . . . 4 (𝜑 → ∀𝑤 ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦))𝑤 ≤ (Σ^𝐹))
45 brralrspcev 5090 . . . 4 (((Σ^𝐹) ∈ ℝ ∧ ∀𝑤 ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦))𝑤 ≤ (Σ^𝐹)) → ∃𝑧 ∈ ℝ ∀𝑤 ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦))𝑤𝑧)
467, 44, 45syl2anc 587 . . 3 (𝜑 → ∃𝑧 ∈ ℝ ∀𝑤 ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦))𝑤𝑧)
47 supxrre 12708 . . 3 ((ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)) ⊆ ℝ ∧ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)) ≠ ∅ ∧ ∃𝑧 ∈ ℝ ∀𝑤 ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦))𝑤𝑧) → sup(ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)), ℝ*, < ) = sup(ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)), ℝ, < ))
4814, 16, 46, 47syl3anc 1368 . 2 (𝜑 → sup(ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)), ℝ*, < ) = sup(ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)), ℝ, < ))
4913, 48eqtrd 2833 1 (𝜑 → (Σ^𝐹) = sup(ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)), ℝ, < ))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 209  wa 399  w3a 1084   = wceq 1538  wcel 2111  wne 2987  wral 3106  wrex 3107  Vcvv 3441  cin 3880  wss 3881  c0 4243  𝒫 cpw 4497   class class class wbr 5030  cmpt 5110  ran crn 5520  wf 6320  cfv 6324  (class class class)co 7135  Fincfn 8492  supcsup 8888  cr 10525  0cc0 10526  +∞cpnf 10661  *cxr 10663   < clt 10664  cle 10665  [,]cicc 12729  Σcsu 15034  Σ^csumge0 43001
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-rep 5154  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441  ax-inf2 9088  ax-cnex 10582  ax-resscn 10583  ax-1cn 10584  ax-icn 10585  ax-addcl 10586  ax-addrcl 10587  ax-mulcl 10588  ax-mulrcl 10589  ax-mulcom 10590  ax-addass 10591  ax-mulass 10592  ax-distr 10593  ax-i2m1 10594  ax-1ne0 10595  ax-1rid 10596  ax-rnegex 10597  ax-rrecex 10598  ax-cnre 10599  ax-pre-lttri 10600  ax-pre-lttrn 10601  ax-pre-ltadd 10602  ax-pre-mulgt0 10603  ax-pre-sup 10604
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-fal 1551  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-nel 3092  df-ral 3111  df-rex 3112  df-reu 3113  df-rmo 3114  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-pss 3900  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-tp 4530  df-op 4532  df-uni 4801  df-int 4839  df-iun 4883  df-br 5031  df-opab 5093  df-mpt 5111  df-tr 5137  df-id 5425  df-eprel 5430  df-po 5438  df-so 5439  df-fr 5478  df-se 5479  df-we 5480  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-pred 6116  df-ord 6162  df-on 6163  df-lim 6164  df-suc 6165  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331  df-fv 6332  df-isom 6333  df-riota 7093  df-ov 7138  df-oprab 7139  df-mpo 7140  df-om 7561  df-1st 7671  df-2nd 7672  df-wrecs 7930  df-recs 7991  df-rdg 8029  df-1o 8085  df-oadd 8089  df-er 8272  df-en 8493  df-dom 8494  df-sdom 8495  df-fin 8496  df-sup 8890  df-oi 8958  df-card 9352  df-pnf 10666  df-mnf 10667  df-xr 10668  df-ltxr 10669  df-le 10670  df-sub 10861  df-neg 10862  df-div 11287  df-nn 11626  df-2 11688  df-3 11689  df-n0 11886  df-z 11970  df-uz 12232  df-rp 12378  df-ico 12732  df-icc 12733  df-fz 12886  df-fzo 13029  df-seq 13365  df-exp 13426  df-hash 13687  df-cj 14450  df-re 14451  df-im 14452  df-sqrt 14586  df-abs 14587  df-clim 14837  df-sum 15035  df-sumge0 43002
This theorem is referenced by:  sge0ltfirp  43039  sge0resplit  43045
  Copyright terms: Public domain W3C validator