| Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > fsumlesge0 | Structured version Visualization version GIF version | ||
| Description: Every finite subsum of nonnegative reals is less than or equal to the extended sum over the whole (possibly infinite) domain. (Contributed by Glauco Siliprandi, 17-Aug-2020.) |
| Ref | Expression |
|---|---|
| fsumlesge0.x | ⊢ (𝜑 → 𝑋 ∈ 𝑉) |
| fsumlesge0.f | ⊢ (𝜑 → 𝐹:𝑋⟶(0[,)+∞)) |
| fsumlesge0.y | ⊢ (𝜑 → 𝑌 ⊆ 𝑋) |
| fsumlesge0.fi | ⊢ (𝜑 → 𝑌 ∈ Fin) |
| Ref | Expression |
|---|---|
| fsumlesge0 | ⊢ (𝜑 → Σ𝑥 ∈ 𝑌 (𝐹‘𝑥) ≤ (Σ^‘𝐹)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fsumlesge0.f | . . . . 5 ⊢ (𝜑 → 𝐹:𝑋⟶(0[,)+∞)) | |
| 2 | 1 | sge0rnre 47193 | . . . 4 ⊢ (𝜑 → ran (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑧 ∈ 𝑦 (𝐹‘𝑧)) ⊆ ℝ) |
| 3 | ressxr 11278 | . . . . 5 ⊢ ℝ ⊆ ℝ* | |
| 4 | 3 | a1i 11 | . . . 4 ⊢ (𝜑 → ℝ ⊆ ℝ*) |
| 5 | 2, 4 | sstrd 3941 | . . 3 ⊢ (𝜑 → ran (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑧 ∈ 𝑦 (𝐹‘𝑧)) ⊆ ℝ*) |
| 6 | fsumlesge0.y | . . . . . . 7 ⊢ (𝜑 → 𝑌 ⊆ 𝑋) | |
| 7 | fsumlesge0.x | . . . . . . . . 9 ⊢ (𝜑 → 𝑋 ∈ 𝑉) | |
| 8 | 7, 6 | ssexd 5289 | . . . . . . . 8 ⊢ (𝜑 → 𝑌 ∈ V) |
| 9 | elpwg 4560 | . . . . . . . 8 ⊢ (𝑌 ∈ V → (𝑌 ∈ 𝒫 𝑋 ↔ 𝑌 ⊆ 𝑋)) | |
| 10 | 8, 9 | syl 18 | . . . . . . 7 ⊢ (𝜑 → (𝑌 ∈ 𝒫 𝑋 ↔ 𝑌 ⊆ 𝑋)) |
| 11 | 6, 10 | mpbird 260 | . . . . . 6 ⊢ (𝜑 → 𝑌 ∈ 𝒫 𝑋) |
| 12 | fsumlesge0.fi | . . . . . 6 ⊢ (𝜑 → 𝑌 ∈ Fin) | |
| 13 | 11, 12 | elind 4146 | . . . . 5 ⊢ (𝜑 → 𝑌 ∈ (𝒫 𝑋 ∩ Fin)) |
| 14 | fveq2 6879 | . . . . . . 7 ⊢ (𝑥 = 𝑧 → (𝐹‘𝑥) = (𝐹‘𝑧)) | |
| 15 | 14 | cbvsumv 15784 | . . . . . 6 ⊢ Σ𝑥 ∈ 𝑌 (𝐹‘𝑥) = Σ𝑧 ∈ 𝑌 (𝐹‘𝑧) |
| 16 | 15 | a1i 11 | . . . . 5 ⊢ (𝜑 → Σ𝑥 ∈ 𝑌 (𝐹‘𝑥) = Σ𝑧 ∈ 𝑌 (𝐹‘𝑧)) |
| 17 | sumeq1 15777 | . . . . . 6 ⊢ (𝑦 = 𝑌 → Σ𝑧 ∈ 𝑦 (𝐹‘𝑧) = Σ𝑧 ∈ 𝑌 (𝐹‘𝑧)) | |
| 18 | 17 | rspceeqv 3599 | . . . . 5 ⊢ ((𝑌 ∈ (𝒫 𝑋 ∩ Fin) ∧ Σ𝑥 ∈ 𝑌 (𝐹‘𝑥) = Σ𝑧 ∈ 𝑌 (𝐹‘𝑧)) → ∃𝑦 ∈ (𝒫 𝑋 ∩ Fin)Σ𝑥 ∈ 𝑌 (𝐹‘𝑥) = Σ𝑧 ∈ 𝑦 (𝐹‘𝑧)) |
| 19 | 13, 16, 18 | syl2anc 596 | . . . 4 ⊢ (𝜑 → ∃𝑦 ∈ (𝒫 𝑋 ∩ Fin)Σ𝑥 ∈ 𝑌 (𝐹‘𝑥) = Σ𝑧 ∈ 𝑦 (𝐹‘𝑧)) |
| 20 | sumex 15776 | . . . . . 6 ⊢ Σ𝑥 ∈ 𝑌 (𝐹‘𝑥) ∈ V | |
| 21 | 20 | a1i 11 | . . . . 5 ⊢ (𝜑 → Σ𝑥 ∈ 𝑌 (𝐹‘𝑥) ∈ V) |
| 22 | eqid 2760 | . . . . . 6 ⊢ (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑧 ∈ 𝑦 (𝐹‘𝑧)) = (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑧 ∈ 𝑦 (𝐹‘𝑧)) | |
| 23 | 22 | elrnmpt 5942 | . . . . 5 ⊢ (Σ𝑥 ∈ 𝑌 (𝐹‘𝑥) ∈ V → (Σ𝑥 ∈ 𝑌 (𝐹‘𝑥) ∈ ran (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑧 ∈ 𝑦 (𝐹‘𝑧)) ↔ ∃𝑦 ∈ (𝒫 𝑋 ∩ Fin)Σ𝑥 ∈ 𝑌 (𝐹‘𝑥) = Σ𝑧 ∈ 𝑦 (𝐹‘𝑧))) |
| 24 | 21, 23 | syl 18 | . . . 4 ⊢ (𝜑 → (Σ𝑥 ∈ 𝑌 (𝐹‘𝑥) ∈ ran (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑧 ∈ 𝑦 (𝐹‘𝑧)) ↔ ∃𝑦 ∈ (𝒫 𝑋 ∩ Fin)Σ𝑥 ∈ 𝑌 (𝐹‘𝑥) = Σ𝑧 ∈ 𝑦 (𝐹‘𝑧))) |
| 25 | 19, 24 | mpbird 260 | . . 3 ⊢ (𝜑 → Σ𝑥 ∈ 𝑌 (𝐹‘𝑥) ∈ ran (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑧 ∈ 𝑦 (𝐹‘𝑧))) |
| 26 | supxrub 13377 | . . 3 ⊢ ((ran (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑧 ∈ 𝑦 (𝐹‘𝑧)) ⊆ ℝ* ∧ Σ𝑥 ∈ 𝑌 (𝐹‘𝑥) ∈ ran (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑧 ∈ 𝑦 (𝐹‘𝑧))) → Σ𝑥 ∈ 𝑌 (𝐹‘𝑥) ≤ sup(ran (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑧 ∈ 𝑦 (𝐹‘𝑧)), ℝ*, < )) | |
| 27 | 5, 25, 26 | syl2anc 596 | . 2 ⊢ (𝜑 → Σ𝑥 ∈ 𝑌 (𝐹‘𝑥) ≤ sup(ran (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑧 ∈ 𝑦 (𝐹‘𝑧)), ℝ*, < )) |
| 28 | 7, 1 | sge0reval 47201 | . . 3 ⊢ (𝜑 → (Σ^‘𝐹) = sup(ran (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑧 ∈ 𝑦 (𝐹‘𝑧)), ℝ*, < )) |
| 29 | 28 | eqcomd 2766 | . 2 ⊢ (𝜑 → sup(ran (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑧 ∈ 𝑦 (𝐹‘𝑧)), ℝ*, < ) = (Σ^‘𝐹)) |
| 30 | 27, 29 | breqtrd 5131 | 1 ⊢ (𝜑 → Σ𝑥 ∈ 𝑌 (𝐹‘𝑥) ≤ (Σ^‘𝐹)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 = wceq 1570 ∈ wcel 2145 ∃wrex 3086 Vcvv 3450 ∩ cin 3898 ⊆ wss 3899 𝒫 cpw 4557 class class class wbr 5103 ↦ cmpt 5186 ran crn 5656 ⟶wf 6529 ‘cfv 6533 (class class class)co 7414 Fincfn 8953 supcsup 9411 ℝcr 11124 0cc0 11125 +∞cpnf 11265 ℝ*cxr 11267 < clt 11268 ≤ cle 11269 [,)cico 13401 Σcsu 15774 Σ^csumge0 47191 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7737 ax-inf2 9621 ax-cnex 11181 ax-resscn 11182 ax-1cn 11183 ax-icn 11184 ax-addcl 11185 ax-addrcl 11186 ax-mulcl 11187 ax-mulrcl 11188 ax-mulcom 11189 ax-addass 11190 ax-mulass 11191 ax-distr 11192 ax-i2m1 11193 ax-1ne0 11194 ax-1rid 11195 ax-rnegex 11196 ax-rrecex 11197 ax-cnre 11198 ax-pre-lttri 11199 ax-pre-lttrn 11200 ax-pre-ltadd 11201 ax-pre-mulgt0 11202 ax-pre-sup 11203 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-se 5609 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-isom 6542 df-riota 7371 df-ov 7417 df-oprab 7418 df-mpo 7419 df-om 7864 df-1st 7987 df-2nd 7988 df-frecs 8281 df-wrecs 8312 df-recs 8361 df-rdg 8400 df-1o 8456 df-er 8697 df-en 8954 df-dom 8955 df-sdom 8956 df-fin 8957 df-sup 9413 df-oi 9483 df-card 9945 df-pnf 11270 df-mnf 11271 df-xr 11272 df-ltxr 11273 df-le 11274 df-sub 11468 df-neg 11469 df-div 11897 df-nn 12259 df-2 12328 df-3 12329 df-n0 12530 df-z 12617 df-uz 12889 df-rp 13044 df-ico 13405 df-icc 13406 df-fz 13563 df-fzo 13711 df-seq 14067 df-exp 14127 df-hash 14396 df-cj 15187 df-re 15188 df-im 15189 df-sqrt 15323 df-abs 15324 df-clim 15576 df-sum 15775 df-sumge0 47192 |
| This theorem is used by: sge0fsum 47216 sge0rnbnd 47222 sge0split 47238 |
| Copyright terms: Public domain | W3C validator |