| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fsumless | Structured version Visualization version GIF version | ||
| Description: A shorter sum of nonnegative terms is smaller than a longer one. (Contributed by NM, 26-Dec-2005.) (Proof shortened by Mario Carneiro, 24-Apr-2014.) |
| Ref | Expression |
|---|---|
| fsumge0.1 | ⊢ (𝜑 → 𝐴 ∈ Fin) |
| fsumge0.2 | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℝ) |
| fsumge0.3 | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 0 ≤ 𝐵) |
| fsumless.4 | ⊢ (𝜑 → 𝐶 ⊆ 𝐴) |
| Ref | Expression |
|---|---|
| fsumless | ⊢ (𝜑 → Σ𝑘 ∈ 𝐶 𝐵 ≤ Σ𝑘 ∈ 𝐴 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fsumge0.1 | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ Fin) | |
| 2 | difss 4098 | . . . . 5 ⊢ (𝐴 ∖ 𝐶) ⊆ 𝐴 | |
| 3 | ssfi 9153 | . . . . 5 ⊢ ((𝐴 ∈ Fin ∧ (𝐴 ∖ 𝐶) ⊆ 𝐴) → (𝐴 ∖ 𝐶) ∈ Fin) | |
| 4 | 1, 2, 3 | sylancl 597 | . . . 4 ⊢ (𝜑 → (𝐴 ∖ 𝐶) ∈ Fin) |
| 5 | eldifi 4093 | . . . . 5 ⊢ (𝑘 ∈ (𝐴 ∖ 𝐶) → 𝑘 ∈ 𝐴) | |
| 6 | fsumge0.2 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℝ) | |
| 7 | 5, 6 | sylan2 604 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐴 ∖ 𝐶)) → 𝐵 ∈ ℝ) |
| 8 | fsumge0.3 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 0 ≤ 𝐵) | |
| 9 | 5, 8 | sylan2 604 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐴 ∖ 𝐶)) → 0 ≤ 𝐵) |
| 10 | 4, 7, 9 | fsumge0 15843 | . . 3 ⊢ (𝜑 → 0 ≤ Σ𝑘 ∈ (𝐴 ∖ 𝐶)𝐵) |
| 11 | fsumless.4 | . . . . . 6 ⊢ (𝜑 → 𝐶 ⊆ 𝐴) | |
| 12 | 1, 11 | ssfid 9225 | . . . . 5 ⊢ (𝜑 → 𝐶 ∈ Fin) |
| 13 | 11 | sselda 3945 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐶) → 𝑘 ∈ 𝐴) |
| 14 | 13, 6 | syldan 602 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐶) → 𝐵 ∈ ℝ) |
| 15 | 12, 14 | fsumrecl 15781 | . . . 4 ⊢ (𝜑 → Σ𝑘 ∈ 𝐶 𝐵 ∈ ℝ) |
| 16 | 4, 7 | fsumrecl 15781 | . . . 4 ⊢ (𝜑 → Σ𝑘 ∈ (𝐴 ∖ 𝐶)𝐵 ∈ ℝ) |
| 17 | 15, 16 | addge01d 11798 | . . 3 ⊢ (𝜑 → (0 ≤ Σ𝑘 ∈ (𝐴 ∖ 𝐶)𝐵 ↔ Σ𝑘 ∈ 𝐶 𝐵 ≤ (Σ𝑘 ∈ 𝐶 𝐵 + Σ𝑘 ∈ (𝐴 ∖ 𝐶)𝐵))) |
| 18 | 10, 17 | mpbid 235 | . 2 ⊢ (𝜑 → Σ𝑘 ∈ 𝐶 𝐵 ≤ (Σ𝑘 ∈ 𝐶 𝐵 + Σ𝑘 ∈ (𝐴 ∖ 𝐶)𝐵)) |
| 19 | disjdif 4435 | . . . 4 ⊢ (𝐶 ∩ (𝐴 ∖ 𝐶)) = ∅ | |
| 20 | 19 | a1i 11 | . . 3 ⊢ (𝜑 → (𝐶 ∩ (𝐴 ∖ 𝐶)) = ∅) |
| 21 | undif 4445 | . . . . 5 ⊢ (𝐶 ⊆ 𝐴 ↔ (𝐶 ∪ (𝐴 ∖ 𝐶)) = 𝐴) | |
| 22 | 11, 21 | sylib 221 | . . . 4 ⊢ (𝜑 → (𝐶 ∪ (𝐴 ∖ 𝐶)) = 𝐴) |
| 23 | 22 | eqcomd 2775 | . . 3 ⊢ (𝜑 → 𝐴 = (𝐶 ∪ (𝐴 ∖ 𝐶))) |
| 24 | 6 | recnd 11233 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℂ) |
| 25 | 20, 23, 1, 24 | fsumsplit 15788 | . 2 ⊢ (𝜑 → Σ𝑘 ∈ 𝐴 𝐵 = (Σ𝑘 ∈ 𝐶 𝐵 + Σ𝑘 ∈ (𝐴 ∖ 𝐶)𝐵)) |
| 26 | 18, 25 | breqtrrd 5140 | 1 ⊢ (𝜑 → Σ𝑘 ∈ 𝐶 𝐵 ≤ Σ𝑘 ∈ 𝐴 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1567 ∈ wcel 2149 ∖ cdif 3910 ∪ cun 3911 ∩ cin 3912 ⊆ wss 3913 ∅c0 4294 class class class wbr 5110 (class class class)co 7408 Fincfn 8939 ℝcr 11095 0cc0 11096 + caddc 11099 ≤ cle 11240 Σcsu 15733 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-rep 5239 ax-sep 5258 ax-nul 5268 ax-pow 5334 ax-pr 5402 ax-un 7730 ax-inf2 9606 ax-cnex 11152 ax-resscn 11153 ax-1cn 11154 ax-icn 11155 ax-addcl 11156 ax-addrcl 11157 ax-mulcl 11158 ax-mulrcl 11159 ax-mulcom 11160 ax-addass 11161 ax-mulass 11162 ax-distr 11163 ax-i2m1 11164 ax-1ne0 11165 ax-1rid 11166 ax-rnegex 11167 ax-rrecex 11168 ax-cnre 11169 ax-pre-lttri 11170 ax-pre-lttrn 11171 ax-pre-ltadd 11172 ax-pre-mulgt0 11173 ax-pre-sup 11174 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-rmo 3376 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4874 df-int 4914 df-iun 4959 df-br 5111 df-opab 5175 df-mpt 5194 df-tr 5220 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-se 5613 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 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 7365 df-ov 7411 df-oprab 7412 df-mpo 7413 df-om 7859 df-1st 7982 df-2nd 7983 df-frecs 8274 df-wrecs 8305 df-recs 8354 df-rdg 8393 df-1o 8449 df-er 8690 df-en 8940 df-dom 8941 df-sdom 8942 df-fin 8943 df-sup 9398 df-oi 9468 df-card 9921 df-pnf 11241 df-mnf 11242 df-xr 11243 df-ltxr 11244 df-le 11245 df-sub 11439 df-neg 11440 df-div 11868 df-nn 12230 df-2 12299 df-3 12300 df-n0 12501 df-z 12588 df-uz 12859 df-rp 13013 df-ico 13374 df-fz 13532 df-fzo 13679 df-seq 14034 df-exp 14094 df-hash 14363 df-cj 15146 df-re 15147 df-im 15148 df-sqrt 15282 df-abs 15283 df-clim 15535 df-sum 15734 |
| This theorem is referenced by: fsumge1 15845 fsum00 15846 ovolicc2lem4 25644 fsumharmonic 27138 chtwordi 27282 chpwordi 27283 chtlepsi 27332 chtublem 27337 perfectlem2 27356 chtppilimlem1 27599 vmadivsumb 27609 rplogsumlem2 27611 rpvmasumlem 27613 dchrvmasumiflem1 27627 rplogsum 27653 dirith2 27654 mulog2sumlem2 27661 selbergb 27675 selberg2b 27678 chpdifbndlem1 27679 logdivbnd 27682 selberg3lem2 27684 pntrsumbnd 27692 pntlemf 27731 fsumiunle 33110 esumpcvgval 34409 eulerpartlemgc 34693 reprinfz1 34950 hgt750lemb 34984 fsumlessf 46178 sge0fsum 46986 sge0xaddlem1 47032 sge0seq 47045 carageniuncllem2 47121 perfectALTVlem2 48369 |
| Copyright terms: Public domain | W3C validator |