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 46575
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 46577, 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 46559 . . . . 5 ((𝜑 ∧ +∞ ∈ ran 𝐹) → (Σ^𝐹) = +∞)
7 sge0supre.re . . . . . . 7 (𝜑 → (Σ^𝐹) ∈ ℝ)
81, 2sge0repnf 46572 . . . . . . 7 (𝜑 → ((Σ^𝐹) ∈ ℝ ↔ ¬ (Σ^𝐹) = +∞))
97, 8mpbid 232 . . . . . 6 (𝜑 → ¬ (Σ^𝐹) = +∞)
109adantr 480 . . . . 5 ((𝜑 ∧ +∞ ∈ ran 𝐹) → ¬ (Σ^𝐹) = +∞)
116, 10pm2.65da 816 . . . 4 (𝜑 → ¬ +∞ ∈ ran 𝐹)
122, 11fge0iccico 46556 . . 3 (𝜑𝐹:𝑋⟶(0[,)+∞))
131, 12sge0reval 46558 . 2 (𝜑 → (Σ^𝐹) = sup(ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)), ℝ*, < ))
1412sge0rnre 46550 . . 3 (𝜑 → ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)) ⊆ ℝ)
15 sge0rnn0 46554 . . . 4 ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)) ≠ ∅
1615a1i 11 . . 3 (𝜑 → ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)) ≠ ∅)
17 simpr 484 . . . . . . 7 ((𝜑𝑤 ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦))) → 𝑤 ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)))
18 eqid 2734 . . . . . . . . 9 (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)) = (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦))
1918elrnmpt 5905 . . . . . . . 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 11174 . . . . . . . . . . . . . . . 16 ℝ ⊆ ℝ*
2423a1i 11 . . . . . . . . . . . . . . 15 (𝜑 → ℝ ⊆ ℝ*)
2514, 24sstrd 3942 . . . . . . . . . . . . . 14 (𝜑 → ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)) ⊆ ℝ*)
2625adantr 480 . . . . . . . . . . . . 13 ((𝜑𝑥 ∈ (𝒫 𝑋 ∩ Fin)) → ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)) ⊆ ℝ*)
27 id 22 . . . . . . . . . . . . . . 15 (𝑥 ∈ (𝒫 𝑋 ∩ Fin) → 𝑥 ∈ (𝒫 𝑋 ∩ Fin))
28 sumex 15609 . . . . . . . . . . . . . . . 16 Σ𝑦𝑥 (𝐹𝑦) ∈ V
2928a1i 11 . . . . . . . . . . . . . . 15 (𝑥 ∈ (𝒫 𝑋 ∩ Fin) → Σ𝑦𝑥 (𝐹𝑦) ∈ V)
3018elrnmpt1 5907 . . . . . . . . . . . . . . 15 ((𝑥 ∈ (𝒫 𝑋 ∩ Fin) ∧ Σ𝑦𝑥 (𝐹𝑦) ∈ V) → Σ𝑦𝑥 (𝐹𝑦) ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)))
3127, 29, 30syl2anc 584 . . . . . . . . . . . . . 14 (𝑥 ∈ (𝒫 𝑋 ∩ Fin) → Σ𝑦𝑥 (𝐹𝑦) ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)))
3231adantl 481 . . . . . . . . . . . . 13 ((𝜑𝑥 ∈ (𝒫 𝑋 ∩ Fin)) → Σ𝑦𝑥 (𝐹𝑦) ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)))
33 supxrub 13237 . . . . . . . . . . . . 13 ((ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)) ⊆ ℝ* ∧ Σ𝑦𝑥 (𝐹𝑦) ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦))) → Σ𝑦𝑥 (𝐹𝑦) ≤ sup(ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)), ℝ*, < ))
3426, 32, 33syl2anc 584 . . . . . . . . . . . 12 ((𝜑𝑥 ∈ (𝒫 𝑋 ∩ Fin)) → Σ𝑦𝑥 (𝐹𝑦) ≤ sup(ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)), ℝ*, < ))
3513eqcomd 2740 . . . . . . . . . . . . 13 (𝜑 → sup(ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)), ℝ*, < ) = (Σ^𝐹))
3635adantr 480 . . . . . . . . . . . 12 ((𝜑𝑥 ∈ (𝒫 𝑋 ∩ Fin)) → sup(ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)), ℝ*, < ) = (Σ^𝐹))
3734, 36breqtrd 5122 . . . . . . . . . . 11 ((𝜑𝑥 ∈ (𝒫 𝑋 ∩ Fin)) → Σ𝑦𝑥 (𝐹𝑦) ≤ (Σ^𝐹))
38373adant3 1132 . . . . . . . . . 10 ((𝜑𝑥 ∈ (𝒫 𝑋 ∩ Fin) ∧ 𝑤 = Σ𝑦𝑥 (𝐹𝑦)) → Σ𝑦𝑥 (𝐹𝑦) ≤ (Σ^𝐹))
3922, 38eqbrtrd 5118 . . . . . . . . 9 ((𝜑𝑥 ∈ (𝒫 𝑋 ∩ Fin) ∧ 𝑤 = Σ𝑦𝑥 (𝐹𝑦)) → 𝑤 ≤ (Σ^𝐹))
40393exp 1119 . . . . . . . 8 (𝜑 → (𝑥 ∈ (𝒫 𝑋 ∩ Fin) → (𝑤 = Σ𝑦𝑥 (𝐹𝑦) → 𝑤 ≤ (Σ^𝐹))))
4140rexlimdv 3133 . . . . . . 7 (𝜑 → (∃𝑥 ∈ (𝒫 𝑋 ∩ Fin)𝑤 = Σ𝑦𝑥 (𝐹𝑦) → 𝑤 ≤ (Σ^𝐹)))
4241adantr 480 . . . . . 6 ((𝜑𝑤 ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦))) → (∃𝑥 ∈ (𝒫 𝑋 ∩ Fin)𝑤 = Σ𝑦𝑥 (𝐹𝑦) → 𝑤 ≤ (Σ^𝐹)))
4321, 42mpd 15 . . . . 5 ((𝜑𝑤 ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦))) → 𝑤 ≤ (Σ^𝐹))
4443ralrimiva 3126 . . . 4 (𝜑 → ∀𝑤 ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦))𝑤 ≤ (Σ^𝐹))
45 brralrspcev 5156 . . . 4 (((Σ^𝐹) ∈ ℝ ∧ ∀𝑤 ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦))𝑤 ≤ (Σ^𝐹)) → ∃𝑧 ∈ ℝ ∀𝑤 ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦))𝑤𝑧)
467, 44, 45syl2anc 584 . . 3 (𝜑 → ∃𝑧 ∈ ℝ ∀𝑤 ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦))𝑤𝑧)
47 supxrre 13240 . . 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 2769 1 (𝜑 → (Σ^𝐹) = sup(ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)), ℝ, < ))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395  w3a 1086   = wceq 1541  wcel 2113  wne 2930  wral 3049  wrex 3058  Vcvv 3438  cin 3898  wss 3899  c0 4283  𝒫 cpw 4552   class class class wbr 5096  cmpt 5177  ran crn 5623  wf 6486  cfv 6490  (class class class)co 7356  Fincfn 8881  supcsup 9341  cr 11023  0cc0 11024  +∞cpnf 11161  *cxr 11163   < clt 11164  cle 11165  [,]cicc 13262  Σcsu 15607  Σ^csumge0 46548
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2706  ax-rep 5222  ax-sep 5239  ax-nul 5249  ax-pow 5308  ax-pr 5375  ax-un 7678  ax-inf2 9548  ax-cnex 11080  ax-resscn 11081  ax-1cn 11082  ax-icn 11083  ax-addcl 11084  ax-addrcl 11085  ax-mulcl 11086  ax-mulrcl 11087  ax-mulcom 11088  ax-addass 11089  ax-mulass 11090  ax-distr 11091  ax-i2m1 11092  ax-1ne0 11093  ax-1rid 11094  ax-rnegex 11095  ax-rrecex 11096  ax-cnre 11097  ax-pre-lttri 11098  ax-pre-lttrn 11099  ax-pre-ltadd 11100  ax-pre-mulgt0 11101  ax-pre-sup 11102
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2809  df-nfc 2883  df-ne 2931  df-nel 3035  df-ral 3050  df-rex 3059  df-rmo 3348  df-reu 3349  df-rab 3398  df-v 3440  df-sbc 3739  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4579  df-pr 4581  df-op 4585  df-uni 4862  df-int 4901  df-iun 4946  df-br 5097  df-opab 5159  df-mpt 5178  df-tr 5204  df-id 5517  df-eprel 5522  df-po 5530  df-so 5531  df-fr 5575  df-se 5576  df-we 5577  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-rn 5633  df-res 5634  df-ima 5635  df-pred 6257  df-ord 6318  df-on 6319  df-lim 6320  df-suc 6321  df-iota 6446  df-fun 6492  df-fn 6493  df-f 6494  df-f1 6495  df-fo 6496  df-f1o 6497  df-fv 6498  df-isom 6499  df-riota 7313  df-ov 7359  df-oprab 7360  df-mpo 7361  df-om 7807  df-1st 7931  df-2nd 7932  df-frecs 8221  df-wrecs 8252  df-recs 8301  df-rdg 8339  df-1o 8395  df-er 8633  df-en 8882  df-dom 8883  df-sdom 8884  df-fin 8885  df-sup 9343  df-oi 9413  df-card 9849  df-pnf 11166  df-mnf 11167  df-xr 11168  df-ltxr 11169  df-le 11170  df-sub 11364  df-neg 11365  df-div 11793  df-nn 12144  df-2 12206  df-3 12207  df-n0 12400  df-z 12487  df-uz 12750  df-rp 12904  df-ico 13265  df-icc 13266  df-fz 13422  df-fzo 13569  df-seq 13923  df-exp 13983  df-hash 14252  df-cj 15020  df-re 15021  df-im 15022  df-sqrt 15156  df-abs 15157  df-clim 15409  df-sum 15608  df-sumge0 46549
This theorem is referenced by:  sge0ltfirp  46586  sge0resplit  46592
  Copyright terms: Public domain W3C validator