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

Theorem sge0sup 43929
Description: The arbitrary sum of nonnegative extended reals is the supremum of finite subsums. (Contributed by Glauco Siliprandi, 17-Aug-2020.)
Hypotheses
Ref Expression
sge0sup.x (𝜑𝑋𝑉)
sge0sup.f (𝜑𝐹:𝑋⟶(0[,]+∞))
Assertion
Ref Expression
sge0sup (𝜑 → (Σ^𝐹) = sup(ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ (Σ^‘(𝐹𝑥))), ℝ*, < ))
Distinct variable groups:   𝑥,𝐹   𝑥,𝑋   𝜑,𝑥
Allowed substitution hint:   𝑉(𝑥)

Proof of Theorem sge0sup
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 eqidd 2739 . . 3 ((𝜑 ∧ +∞ ∈ ran 𝐹) → +∞ = +∞)
2 sge0sup.x . . . . 5 (𝜑𝑋𝑉)
32adantr 481 . . . 4 ((𝜑 ∧ +∞ ∈ ran 𝐹) → 𝑋𝑉)
4 sge0sup.f . . . . 5 (𝜑𝐹:𝑋⟶(0[,]+∞))
54adantr 481 . . . 4 ((𝜑 ∧ +∞ ∈ ran 𝐹) → 𝐹:𝑋⟶(0[,]+∞))
6 simpr 485 . . . 4 ((𝜑 ∧ +∞ ∈ ran 𝐹) → +∞ ∈ ran 𝐹)
73, 5, 6sge0pnfval 43911 . . 3 ((𝜑 ∧ +∞ ∈ ran 𝐹) → (Σ^𝐹) = +∞)
8 vex 3436 . . . . . . . . 9 𝑥 ∈ V
98a1i 11 . . . . . . . 8 ((𝜑𝑥 ∈ (𝒫 𝑋 ∩ Fin)) → 𝑥 ∈ V)
104adantr 481 . . . . . . . . 9 ((𝜑𝑥 ∈ (𝒫 𝑋 ∩ Fin)) → 𝐹:𝑋⟶(0[,]+∞))
11 elinel1 4129 . . . . . . . . . . 11 (𝑥 ∈ (𝒫 𝑋 ∩ Fin) → 𝑥 ∈ 𝒫 𝑋)
12 elpwi 4542 . . . . . . . . . . 11 (𝑥 ∈ 𝒫 𝑋𝑥𝑋)
1311, 12syl 17 . . . . . . . . . 10 (𝑥 ∈ (𝒫 𝑋 ∩ Fin) → 𝑥𝑋)
1413adantl 482 . . . . . . . . 9 ((𝜑𝑥 ∈ (𝒫 𝑋 ∩ Fin)) → 𝑥𝑋)
1510, 14fssresd 6641 . . . . . . . 8 ((𝜑𝑥 ∈ (𝒫 𝑋 ∩ Fin)) → (𝐹𝑥):𝑥⟶(0[,]+∞))
169, 15sge0xrcl 43923 . . . . . . 7 ((𝜑𝑥 ∈ (𝒫 𝑋 ∩ Fin)) → (Σ^‘(𝐹𝑥)) ∈ ℝ*)
1716adantlr 712 . . . . . 6 (((𝜑 ∧ +∞ ∈ ran 𝐹) ∧ 𝑥 ∈ (𝒫 𝑋 ∩ Fin)) → (Σ^‘(𝐹𝑥)) ∈ ℝ*)
1817ralrimiva 3103 . . . . 5 ((𝜑 ∧ +∞ ∈ ran 𝐹) → ∀𝑥 ∈ (𝒫 𝑋 ∩ Fin)(Σ^‘(𝐹𝑥)) ∈ ℝ*)
19 eqid 2738 . . . . . 6 (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ (Σ^‘(𝐹𝑥))) = (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ (Σ^‘(𝐹𝑥)))
2019rnmptss 6996 . . . . 5 (∀𝑥 ∈ (𝒫 𝑋 ∩ Fin)(Σ^‘(𝐹𝑥)) ∈ ℝ* → ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ (Σ^‘(𝐹𝑥))) ⊆ ℝ*)
2118, 20syl 17 . . . 4 ((𝜑 ∧ +∞ ∈ ran 𝐹) → ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ (Σ^‘(𝐹𝑥))) ⊆ ℝ*)
224ffnd 6601 . . . . . . . 8 (𝜑𝐹 Fn 𝑋)
23 fvelrnb 6830 . . . . . . . 8 (𝐹 Fn 𝑋 → (+∞ ∈ ran 𝐹 ↔ ∃𝑦𝑋 (𝐹𝑦) = +∞))
2422, 23syl 17 . . . . . . 7 (𝜑 → (+∞ ∈ ran 𝐹 ↔ ∃𝑦𝑋 (𝐹𝑦) = +∞))
2524adantr 481 . . . . . 6 ((𝜑 ∧ +∞ ∈ ran 𝐹) → (+∞ ∈ ran 𝐹 ↔ ∃𝑦𝑋 (𝐹𝑦) = +∞))
266, 25mpbid 231 . . . . 5 ((𝜑 ∧ +∞ ∈ ran 𝐹) → ∃𝑦𝑋 (𝐹𝑦) = +∞)
27 snelpwi 5360 . . . . . . . . . . . 12 (𝑦𝑋 → {𝑦} ∈ 𝒫 𝑋)
28 snfi 8834 . . . . . . . . . . . . 13 {𝑦} ∈ Fin
2928a1i 11 . . . . . . . . . . . 12 (𝑦𝑋 → {𝑦} ∈ Fin)
3027, 29elind 4128 . . . . . . . . . . 11 (𝑦𝑋 → {𝑦} ∈ (𝒫 𝑋 ∩ Fin))
31303ad2ant2 1133 . . . . . . . . . 10 ((𝜑𝑦𝑋 ∧ (𝐹𝑦) = +∞) → {𝑦} ∈ (𝒫 𝑋 ∩ Fin))
32 simp2 1136 . . . . . . . . . . . 12 ((𝜑𝑦𝑋 ∧ (𝐹𝑦) = +∞) → 𝑦𝑋)
3343ad2ant1 1132 . . . . . . . . . . . . 13 ((𝜑𝑦𝑋 ∧ (𝐹𝑦) = +∞) → 𝐹:𝑋⟶(0[,]+∞))
3432snssd 4742 . . . . . . . . . . . . 13 ((𝜑𝑦𝑋 ∧ (𝐹𝑦) = +∞) → {𝑦} ⊆ 𝑋)
3533, 34fssresd 6641 . . . . . . . . . . . 12 ((𝜑𝑦𝑋 ∧ (𝐹𝑦) = +∞) → (𝐹 ↾ {𝑦}):{𝑦}⟶(0[,]+∞))
3632, 35sge0sn 43917 . . . . . . . . . . 11 ((𝜑𝑦𝑋 ∧ (𝐹𝑦) = +∞) → (Σ^‘(𝐹 ↾ {𝑦})) = ((𝐹 ↾ {𝑦})‘𝑦))
37 vsnid 4598 . . . . . . . . . . . . 13 𝑦 ∈ {𝑦}
38 fvres 6793 . . . . . . . . . . . . 13 (𝑦 ∈ {𝑦} → ((𝐹 ↾ {𝑦})‘𝑦) = (𝐹𝑦))
3937, 38ax-mp 5 . . . . . . . . . . . 12 ((𝐹 ↾ {𝑦})‘𝑦) = (𝐹𝑦)
4039a1i 11 . . . . . . . . . . 11 ((𝜑𝑦𝑋 ∧ (𝐹𝑦) = +∞) → ((𝐹 ↾ {𝑦})‘𝑦) = (𝐹𝑦))
41 simp3 1137 . . . . . . . . . . 11 ((𝜑𝑦𝑋 ∧ (𝐹𝑦) = +∞) → (𝐹𝑦) = +∞)
4236, 40, 413eqtrrd 2783 . . . . . . . . . 10 ((𝜑𝑦𝑋 ∧ (𝐹𝑦) = +∞) → +∞ = (Σ^‘(𝐹 ↾ {𝑦})))
43 reseq2 5886 . . . . . . . . . . . 12 (𝑥 = {𝑦} → (𝐹𝑥) = (𝐹 ↾ {𝑦}))
4443fveq2d 6778 . . . . . . . . . . 11 (𝑥 = {𝑦} → (Σ^‘(𝐹𝑥)) = (Σ^‘(𝐹 ↾ {𝑦})))
4544rspceeqv 3575 . . . . . . . . . 10 (({𝑦} ∈ (𝒫 𝑋 ∩ Fin) ∧ +∞ = (Σ^‘(𝐹 ↾ {𝑦}))) → ∃𝑥 ∈ (𝒫 𝑋 ∩ Fin)+∞ = (Σ^‘(𝐹𝑥)))
4631, 42, 45syl2anc 584 . . . . . . . . 9 ((𝜑𝑦𝑋 ∧ (𝐹𝑦) = +∞) → ∃𝑥 ∈ (𝒫 𝑋 ∩ Fin)+∞ = (Σ^‘(𝐹𝑥)))
47 pnfex 11028 . . . . . . . . . 10 +∞ ∈ V
4847a1i 11 . . . . . . . . 9 ((𝜑𝑦𝑋 ∧ (𝐹𝑦) = +∞) → +∞ ∈ V)
4919, 46, 48elrnmptd 5870 . . . . . . . 8 ((𝜑𝑦𝑋 ∧ (𝐹𝑦) = +∞) → +∞ ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ (Σ^‘(𝐹𝑥))))
50493exp 1118 . . . . . . 7 (𝜑 → (𝑦𝑋 → ((𝐹𝑦) = +∞ → +∞ ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ (Σ^‘(𝐹𝑥))))))
5150rexlimdv 3212 . . . . . 6 (𝜑 → (∃𝑦𝑋 (𝐹𝑦) = +∞ → +∞ ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ (Σ^‘(𝐹𝑥)))))
5251adantr 481 . . . . 5 ((𝜑 ∧ +∞ ∈ ran 𝐹) → (∃𝑦𝑋 (𝐹𝑦) = +∞ → +∞ ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ (Σ^‘(𝐹𝑥)))))
5326, 52mpd 15 . . . 4 ((𝜑 ∧ +∞ ∈ ran 𝐹) → +∞ ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ (Σ^‘(𝐹𝑥))))
54 supxrpnf 13052 . . . 4 ((ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ (Σ^‘(𝐹𝑥))) ⊆ ℝ* ∧ +∞ ∈ ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ (Σ^‘(𝐹𝑥)))) → sup(ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ (Σ^‘(𝐹𝑥))), ℝ*, < ) = +∞)
5521, 53, 54syl2anc 584 . . 3 ((𝜑 ∧ +∞ ∈ ran 𝐹) → sup(ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ (Σ^‘(𝐹𝑥))), ℝ*, < ) = +∞)
561, 7, 553eqtr4d 2788 . 2 ((𝜑 ∧ +∞ ∈ ran 𝐹) → (Σ^𝐹) = sup(ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ (Σ^‘(𝐹𝑥))), ℝ*, < ))
572adantr 481 . . . 4 ((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) → 𝑋𝑉)
584adantr 481 . . . . 5 ((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) → 𝐹:𝑋⟶(0[,]+∞))
59 simpr 485 . . . . 5 ((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) → ¬ +∞ ∈ ran 𝐹)
6058, 59fge0iccico 43908 . . . 4 ((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) → 𝐹:𝑋⟶(0[,)+∞))
6157, 60sge0reval 43910 . . 3 ((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) → (Σ^𝐹) = sup(ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)), ℝ*, < ))
62 elinel2 4130 . . . . . . . . 9 (𝑥 ∈ (𝒫 𝑋 ∩ Fin) → 𝑥 ∈ Fin)
6362adantl 482 . . . . . . . 8 (((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) ∧ 𝑥 ∈ (𝒫 𝑋 ∩ Fin)) → 𝑥 ∈ Fin)
6415adantlr 712 . . . . . . . . 9 (((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) ∧ 𝑥 ∈ (𝒫 𝑋 ∩ Fin)) → (𝐹𝑥):𝑥⟶(0[,]+∞))
65 nelrnres 42725 . . . . . . . . . 10 (¬ +∞ ∈ ran 𝐹 → ¬ +∞ ∈ ran (𝐹𝑥))
6665ad2antlr 724 . . . . . . . . 9 (((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) ∧ 𝑥 ∈ (𝒫 𝑋 ∩ Fin)) → ¬ +∞ ∈ ran (𝐹𝑥))
6764, 66fge0iccico 43908 . . . . . . . 8 (((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) ∧ 𝑥 ∈ (𝒫 𝑋 ∩ Fin)) → (𝐹𝑥):𝑥⟶(0[,)+∞))
6863, 67sge0fsum 43925 . . . . . . 7 (((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) ∧ 𝑥 ∈ (𝒫 𝑋 ∩ Fin)) → (Σ^‘(𝐹𝑥)) = Σ𝑦𝑥 ((𝐹𝑥)‘𝑦))
69 simpr 485 . . . . . . . . . 10 ((𝑥 ∈ (𝒫 𝑋 ∩ Fin) ∧ 𝑦𝑥) → 𝑦𝑥)
70 fvres 6793 . . . . . . . . . 10 (𝑦𝑥 → ((𝐹𝑥)‘𝑦) = (𝐹𝑦))
7169, 70syl 17 . . . . . . . . 9 ((𝑥 ∈ (𝒫 𝑋 ∩ Fin) ∧ 𝑦𝑥) → ((𝐹𝑥)‘𝑦) = (𝐹𝑦))
7271sumeq2dv 15415 . . . . . . . 8 (𝑥 ∈ (𝒫 𝑋 ∩ Fin) → Σ𝑦𝑥 ((𝐹𝑥)‘𝑦) = Σ𝑦𝑥 (𝐹𝑦))
7372adantl 482 . . . . . . 7 (((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) ∧ 𝑥 ∈ (𝒫 𝑋 ∩ Fin)) → Σ𝑦𝑥 ((𝐹𝑥)‘𝑦) = Σ𝑦𝑥 (𝐹𝑦))
7468, 73eqtrd 2778 . . . . . 6 (((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) ∧ 𝑥 ∈ (𝒫 𝑋 ∩ Fin)) → (Σ^‘(𝐹𝑥)) = Σ𝑦𝑥 (𝐹𝑦))
7574mpteq2dva 5174 . . . . 5 ((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) → (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ (Σ^‘(𝐹𝑥))) = (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)))
7675rneqd 5847 . . . 4 ((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) → ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ (Σ^‘(𝐹𝑥))) = ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)))
7776supeq1d 9205 . . 3 ((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) → sup(ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ (Σ^‘(𝐹𝑥))), ℝ*, < ) = sup(ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑦𝑥 (𝐹𝑦)), ℝ*, < ))
7861, 77eqtr4d 2781 . 2 ((𝜑 ∧ ¬ +∞ ∈ ran 𝐹) → (Σ^𝐹) = sup(ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ (Σ^‘(𝐹𝑥))), ℝ*, < ))
7956, 78pm2.61dan 810 1 (𝜑 → (Σ^𝐹) = sup(ran (𝑥 ∈ (𝒫 𝑋 ∩ Fin) ↦ (Σ^‘(𝐹𝑥))), ℝ*, < ))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 205  wa 396  w3a 1086   = wceq 1539  wcel 2106  wral 3064  wrex 3065  Vcvv 3432  cin 3886  wss 3887  𝒫 cpw 4533  {csn 4561  cmpt 5157  ran crn 5590  cres 5591   Fn wfn 6428  wf 6429  cfv 6433  (class class class)co 7275  Fincfn 8733  supcsup 9199  0cc0 10871  +∞cpnf 11006  *cxr 11008   < clt 11009  [,]cicc 13082  Σcsu 15397  Σ^csumge0 43900
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-rep 5209  ax-sep 5223  ax-nul 5230  ax-pow 5288  ax-pr 5352  ax-un 7588  ax-inf2 9399  ax-cnex 10927  ax-resscn 10928  ax-1cn 10929  ax-icn 10930  ax-addcl 10931  ax-addrcl 10932  ax-mulcl 10933  ax-mulrcl 10934  ax-mulcom 10935  ax-addass 10936  ax-mulass 10937  ax-distr 10938  ax-i2m1 10939  ax-1ne0 10940  ax-1rid 10941  ax-rnegex 10942  ax-rrecex 10943  ax-cnre 10944  ax-pre-lttri 10945  ax-pre-lttrn 10946  ax-pre-ltadd 10947  ax-pre-mulgt0 10948  ax-pre-sup 10949
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-nel 3050  df-ral 3069  df-rex 3070  df-rmo 3071  df-reu 3072  df-rab 3073  df-v 3434  df-sbc 3717  df-csb 3833  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-pss 3906  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-int 4880  df-iun 4926  df-br 5075  df-opab 5137  df-mpt 5158  df-tr 5192  df-id 5489  df-eprel 5495  df-po 5503  df-so 5504  df-fr 5544  df-se 5545  df-we 5546  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-pred 6202  df-ord 6269  df-on 6270  df-lim 6271  df-suc 6272  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-f1 6438  df-fo 6439  df-f1o 6440  df-fv 6441  df-isom 6442  df-riota 7232  df-ov 7278  df-oprab 7279  df-mpo 7280  df-om 7713  df-1st 7831  df-2nd 7832  df-frecs 8097  df-wrecs 8128  df-recs 8202  df-rdg 8241  df-1o 8297  df-er 8498  df-en 8734  df-dom 8735  df-sdom 8736  df-fin 8737  df-sup 9201  df-oi 9269  df-card 9697  df-pnf 11011  df-mnf 11012  df-xr 11013  df-ltxr 11014  df-le 11015  df-sub 11207  df-neg 11208  df-div 11633  df-nn 11974  df-2 12036  df-3 12037  df-n0 12234  df-z 12320  df-uz 12583  df-rp 12731  df-ico 13085  df-icc 13086  df-fz 13240  df-fzo 13383  df-seq 13722  df-exp 13783  df-hash 14045  df-cj 14810  df-re 14811  df-im 14812  df-sqrt 14946  df-abs 14947  df-clim 15197  df-sum 15398  df-sumge0 43901
This theorem is referenced by:  sge0gerp  43933  sge0pnffigt  43934  sge0lefi  43936
  Copyright terms: Public domain W3C validator