| 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 46807 | . . . 4 ⊢ (𝜑 → ran (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑧 ∈ 𝑦 (𝐹‘𝑧)) ⊆ ℝ) |
| 3 | ressxr 11180 | . . . . 5 ⊢ ℝ ⊆ ℝ* | |
| 4 | 3 | a1i 11 | . . . 4 ⊢ (𝜑 → ℝ ⊆ ℝ*) |
| 5 | 2, 4 | sstrd 3925 | . . 3 ⊢ (𝜑 → ran (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑧 ∈ 𝑦 (𝐹‘𝑧)) ⊆ ℝ*) |
| 6 | fsumlesge0.y | . . . . . . 7 ⊢ (𝜑 → 𝑌 ⊆ 𝑋) | |
| 7 | fsumlesge0.x | . . . . . . . . 9 ⊢ (𝜑 → 𝑋 ∈ 𝑉) | |
| 8 | 7, 6 | ssexd 5252 | . . . . . . . 8 ⊢ (𝜑 → 𝑌 ∈ V) |
| 9 | elpwg 4532 | . . . . . . . 8 ⊢ (𝑌 ∈ V → (𝑌 ∈ 𝒫 𝑋 ↔ 𝑌 ⊆ 𝑋)) | |
| 10 | 8, 9 | syl 17 | . . . . . . 7 ⊢ (𝜑 → (𝑌 ∈ 𝒫 𝑋 ↔ 𝑌 ⊆ 𝑋)) |
| 11 | 6, 10 | mpbird 258 | . . . . . 6 ⊢ (𝜑 → 𝑌 ∈ 𝒫 𝑋) |
| 12 | fsumlesge0.fi | . . . . . 6 ⊢ (𝜑 → 𝑌 ∈ Fin) | |
| 13 | 11, 12 | elind 4129 | . . . . 5 ⊢ (𝜑 → 𝑌 ∈ (𝒫 𝑋 ∩ Fin)) |
| 14 | fveq2 6827 | . . . . . . 7 ⊢ (𝑥 = 𝑧 → (𝐹‘𝑥) = (𝐹‘𝑧)) | |
| 15 | 14 | cbvsumv 15649 | . . . . . 6 ⊢ Σ𝑥 ∈ 𝑌 (𝐹‘𝑥) = Σ𝑧 ∈ 𝑌 (𝐹‘𝑧) |
| 16 | 15 | a1i 11 | . . . . 5 ⊢ (𝜑 → Σ𝑥 ∈ 𝑌 (𝐹‘𝑥) = Σ𝑧 ∈ 𝑌 (𝐹‘𝑧)) |
| 17 | sumeq1 15642 | . . . . . 6 ⊢ (𝑦 = 𝑌 → Σ𝑧 ∈ 𝑦 (𝐹‘𝑧) = Σ𝑧 ∈ 𝑌 (𝐹‘𝑧)) | |
| 18 | 17 | rspceeqv 3583 | . . . . 5 ⊢ ((𝑌 ∈ (𝒫 𝑋 ∩ Fin) ∧ Σ𝑥 ∈ 𝑌 (𝐹‘𝑥) = Σ𝑧 ∈ 𝑌 (𝐹‘𝑧)) → ∃𝑦 ∈ (𝒫 𝑋 ∩ Fin)Σ𝑥 ∈ 𝑌 (𝐹‘𝑥) = Σ𝑧 ∈ 𝑦 (𝐹‘𝑧)) |
| 19 | 13, 16, 18 | syl2anc 590 | . . . 4 ⊢ (𝜑 → ∃𝑦 ∈ (𝒫 𝑋 ∩ Fin)Σ𝑥 ∈ 𝑌 (𝐹‘𝑥) = Σ𝑧 ∈ 𝑦 (𝐹‘𝑧)) |
| 20 | sumex 15641 | . . . . . 6 ⊢ Σ𝑥 ∈ 𝑌 (𝐹‘𝑥) ∈ V | |
| 21 | 20 | a1i 11 | . . . . 5 ⊢ (𝜑 → Σ𝑥 ∈ 𝑌 (𝐹‘𝑥) ∈ V) |
| 22 | eqid 2739 | . . . . . 6 ⊢ (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑧 ∈ 𝑦 (𝐹‘𝑧)) = (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑧 ∈ 𝑦 (𝐹‘𝑧)) | |
| 23 | 22 | elrnmpt 5900 | . . . . 5 ⊢ (Σ𝑥 ∈ 𝑌 (𝐹‘𝑥) ∈ V → (Σ𝑥 ∈ 𝑌 (𝐹‘𝑥) ∈ ran (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑧 ∈ 𝑦 (𝐹‘𝑧)) ↔ ∃𝑦 ∈ (𝒫 𝑋 ∩ Fin)Σ𝑥 ∈ 𝑌 (𝐹‘𝑥) = Σ𝑧 ∈ 𝑦 (𝐹‘𝑧))) |
| 24 | 21, 23 | syl 17 | . . . 4 ⊢ (𝜑 → (Σ𝑥 ∈ 𝑌 (𝐹‘𝑥) ∈ ran (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑧 ∈ 𝑦 (𝐹‘𝑧)) ↔ ∃𝑦 ∈ (𝒫 𝑋 ∩ Fin)Σ𝑥 ∈ 𝑌 (𝐹‘𝑥) = Σ𝑧 ∈ 𝑦 (𝐹‘𝑧))) |
| 25 | 19, 24 | mpbird 258 | . . 3 ⊢ (𝜑 → Σ𝑥 ∈ 𝑌 (𝐹‘𝑥) ∈ ran (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑧 ∈ 𝑦 (𝐹‘𝑧))) |
| 26 | supxrub 13267 | . . 3 ⊢ ((ran (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑧 ∈ 𝑦 (𝐹‘𝑧)) ⊆ ℝ* ∧ Σ𝑥 ∈ 𝑌 (𝐹‘𝑥) ∈ ran (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑧 ∈ 𝑦 (𝐹‘𝑧))) → Σ𝑥 ∈ 𝑌 (𝐹‘𝑥) ≤ sup(ran (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑧 ∈ 𝑦 (𝐹‘𝑧)), ℝ*, < )) | |
| 27 | 5, 25, 26 | syl2anc 590 | . 2 ⊢ (𝜑 → Σ𝑥 ∈ 𝑌 (𝐹‘𝑥) ≤ sup(ran (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑧 ∈ 𝑦 (𝐹‘𝑧)), ℝ*, < )) |
| 28 | 7, 1 | sge0reval 46815 | . . 3 ⊢ (𝜑 → (Σ^‘𝐹) = sup(ran (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑧 ∈ 𝑦 (𝐹‘𝑧)), ℝ*, < )) |
| 29 | 28 | eqcomd 2745 | . 2 ⊢ (𝜑 → sup(ran (𝑦 ∈ (𝒫 𝑋 ∩ Fin) ↦ Σ𝑧 ∈ 𝑦 (𝐹‘𝑧)), ℝ*, < ) = (Σ^‘𝐹)) |
| 30 | 27, 29 | breqtrd 5098 | 1 ⊢ (𝜑 → Σ𝑥 ∈ 𝑌 (𝐹‘𝑥) ≤ (Σ^‘𝐹)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 207 = wceq 1547 ∈ wcel 2119 ∃wrex 3063 Vcvv 3431 ∩ cin 3882 ⊆ wss 3883 𝒫 cpw 4529 class class class wbr 5072 ↦ cmpt 5153 ran crn 5619 ⟶wf 6481 ‘cfv 6485 (class class class)co 7356 Fincfn 8883 supcsup 9343 ℝcr 11028 0cc0 11029 +∞cpnf 11167 ℝ*cxr 11169 < clt 11170 ≤ cle 11171 [,)cico 13291 Σcsu 15639 Σ^csumge0 46805 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2711 ax-rep 5199 ax-sep 5218 ax-nul 5228 ax-pow 5294 ax-pr 5362 ax-un 7678 ax-inf2 9553 ax-cnex 11085 ax-resscn 11086 ax-1cn 11087 ax-icn 11088 ax-addcl 11089 ax-addrcl 11090 ax-mulcl 11091 ax-mulrcl 11092 ax-mulcom 11093 ax-addass 11094 ax-mulass 11095 ax-distr 11096 ax-i2m1 11097 ax-1ne0 11098 ax-1rid 11099 ax-rnegex 11100 ax-rrecex 11101 ax-cnre 11102 ax-pre-lttri 11103 ax-pre-lttrn 11104 ax-pre-ltadd 11105 ax-pre-mulgt0 11106 ax-pre-sup 11107 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2718 df-cleq 2731 df-clel 2814 df-nfc 2888 df-ne 2935 df-nel 3039 df-ral 3054 df-rex 3064 df-rmo 3344 df-reu 3345 df-rab 3392 df-v 3433 df-sbc 3724 df-csb 3832 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3903 df-nul 4262 df-if 4455 df-pw 4531 df-sn 4556 df-pr 4558 df-op 4562 df-uni 4839 df-int 4878 df-iun 4923 df-br 5073 df-opab 5135 df-mpt 5154 df-tr 5180 df-id 5513 df-eprel 5518 df-po 5526 df-so 5527 df-fr 5571 df-se 5572 df-we 5573 df-xp 5624 df-rel 5625 df-cnv 5626 df-co 5627 df-dm 5628 df-rn 5629 df-res 5630 df-ima 5631 df-pred 6252 df-ord 6313 df-on 6314 df-lim 6315 df-suc 6316 df-iota 6441 df-fun 6487 df-fn 6488 df-f 6489 df-f1 6490 df-fo 6491 df-f1o 6492 df-fv 6493 df-isom 6494 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 8884 df-dom 8885 df-sdom 8886 df-fin 8887 df-sup 9345 df-oi 9415 df-card 9854 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-div 11799 df-nn 12166 df-2 12235 df-3 12236 df-n0 12429 df-z 12516 df-uz 12780 df-rp 12934 df-ico 13295 df-icc 13296 df-fz 13453 df-fzo 13600 df-seq 13955 df-exp 14015 df-hash 14284 df-cj 15052 df-re 15053 df-im 15054 df-sqrt 15188 df-abs 15189 df-clim 15441 df-sum 15640 df-sumge0 46806 |
| This theorem is referenced by: sge0fsum 46830 sge0rnbnd 46836 sge0split 46852 |
| Copyright terms: Public domain | W3C validator |