| 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 4077 | . . . . 5 ⊢ (𝐴 ∖ 𝐶) ⊆ 𝐴 | |
| 3 | ssfi 9098 | . . . . 5 ⊢ ((𝐴 ∈ Fin ∧ (𝐴 ∖ 𝐶) ⊆ 𝐴) → (𝐴 ∖ 𝐶) ∈ Fin) | |
| 4 | 1, 2, 3 | sylancl 587 | . . . 4 ⊢ (𝜑 → (𝐴 ∖ 𝐶) ∈ Fin) |
| 5 | eldifi 4072 | . . . . 5 ⊢ (𝑘 ∈ (𝐴 ∖ 𝐶) → 𝑘 ∈ 𝐴) | |
| 6 | fsumge0.2 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℝ) | |
| 7 | 5, 6 | sylan2 594 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐴 ∖ 𝐶)) → 𝐵 ∈ ℝ) |
| 8 | fsumge0.3 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 0 ≤ 𝐵) | |
| 9 | 5, 8 | sylan2 594 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐴 ∖ 𝐶)) → 0 ≤ 𝐵) |
| 10 | 4, 7, 9 | fsumge0 15719 | . . 3 ⊢ (𝜑 → 0 ≤ Σ𝑘 ∈ (𝐴 ∖ 𝐶)𝐵) |
| 11 | fsumless.4 | . . . . . 6 ⊢ (𝜑 → 𝐶 ⊆ 𝐴) | |
| 12 | 1, 11 | ssfid 9170 | . . . . 5 ⊢ (𝜑 → 𝐶 ∈ Fin) |
| 13 | 11 | sselda 3922 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐶) → 𝑘 ∈ 𝐴) |
| 14 | 13, 6 | syldan 592 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐶) → 𝐵 ∈ ℝ) |
| 15 | 12, 14 | fsumrecl 15658 | . . . 4 ⊢ (𝜑 → Σ𝑘 ∈ 𝐶 𝐵 ∈ ℝ) |
| 16 | 4, 7 | fsumrecl 15658 | . . . 4 ⊢ (𝜑 → Σ𝑘 ∈ (𝐴 ∖ 𝐶)𝐵 ∈ ℝ) |
| 17 | 15, 16 | addge01d 11726 | . . 3 ⊢ (𝜑 → (0 ≤ Σ𝑘 ∈ (𝐴 ∖ 𝐶)𝐵 ↔ Σ𝑘 ∈ 𝐶 𝐵 ≤ (Σ𝑘 ∈ 𝐶 𝐵 + Σ𝑘 ∈ (𝐴 ∖ 𝐶)𝐵))) |
| 18 | 10, 17 | mpbid 232 | . 2 ⊢ (𝜑 → Σ𝑘 ∈ 𝐶 𝐵 ≤ (Σ𝑘 ∈ 𝐶 𝐵 + Σ𝑘 ∈ (𝐴 ∖ 𝐶)𝐵)) |
| 19 | disjdif 4413 | . . . 4 ⊢ (𝐶 ∩ (𝐴 ∖ 𝐶)) = ∅ | |
| 20 | 19 | a1i 11 | . . 3 ⊢ (𝜑 → (𝐶 ∩ (𝐴 ∖ 𝐶)) = ∅) |
| 21 | undif 4423 | . . . . 5 ⊢ (𝐶 ⊆ 𝐴 ↔ (𝐶 ∪ (𝐴 ∖ 𝐶)) = 𝐴) | |
| 22 | 11, 21 | sylib 218 | . . . 4 ⊢ (𝜑 → (𝐶 ∪ (𝐴 ∖ 𝐶)) = 𝐴) |
| 23 | 22 | eqcomd 2743 | . . 3 ⊢ (𝜑 → 𝐴 = (𝐶 ∪ (𝐴 ∖ 𝐶))) |
| 24 | 6 | recnd 11161 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℂ) |
| 25 | 20, 23, 1, 24 | fsumsplit 15665 | . 2 ⊢ (𝜑 → Σ𝑘 ∈ 𝐴 𝐵 = (Σ𝑘 ∈ 𝐶 𝐵 + Σ𝑘 ∈ (𝐴 ∖ 𝐶)𝐵)) |
| 26 | 18, 25 | breqtrrd 5114 | 1 ⊢ (𝜑 → Σ𝑘 ∈ 𝐶 𝐵 ≤ Σ𝑘 ∈ 𝐴 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ∖ cdif 3887 ∪ cun 3888 ∩ cin 3889 ⊆ wss 3890 ∅c0 4274 class class class wbr 5086 (class class class)co 7358 Fincfn 8884 ℝcr 11026 0cc0 11027 + caddc 11030 ≤ cle 11168 Σcsu 15610 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5300 ax-pr 5368 ax-un 7680 ax-inf2 9551 ax-cnex 11083 ax-resscn 11084 ax-1cn 11085 ax-icn 11086 ax-addcl 11087 ax-addrcl 11088 ax-mulcl 11089 ax-mulrcl 11090 ax-mulcom 11091 ax-addass 11092 ax-mulass 11093 ax-distr 11094 ax-i2m1 11095 ax-1ne0 11096 ax-1rid 11097 ax-rnegex 11098 ax-rrecex 11099 ax-cnre 11100 ax-pre-lttri 11101 ax-pre-lttrn 11102 ax-pre-ltadd 11103 ax-pre-mulgt0 11104 ax-pre-sup 11105 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-int 4891 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 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 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-1st 7933 df-2nd 7934 df-frecs 8222 df-wrecs 8253 df-recs 8302 df-rdg 8340 df-1o 8396 df-er 8634 df-en 8885 df-dom 8886 df-sdom 8887 df-fin 8888 df-sup 9346 df-oi 9416 df-card 9852 df-pnf 11169 df-mnf 11170 df-xr 11171 df-ltxr 11172 df-le 11173 df-sub 11367 df-neg 11368 df-div 11796 df-nn 12147 df-2 12209 df-3 12210 df-n0 12403 df-z 12490 df-uz 12753 df-rp 12907 df-ico 13268 df-fz 13425 df-fzo 13572 df-seq 13926 df-exp 13986 df-hash 14255 df-cj 15023 df-re 15024 df-im 15025 df-sqrt 15159 df-abs 15160 df-clim 15412 df-sum 15611 |
| This theorem is referenced by: fsumge1 15721 fsum00 15722 ovolicc2lem4 25465 fsumharmonic 26962 chtwordi 27106 chpwordi 27107 chtlepsi 27157 chtublem 27162 perfectlem2 27181 chtppilimlem1 27424 vmadivsumb 27434 rplogsumlem2 27436 rpvmasumlem 27438 dchrvmasumiflem1 27452 rplogsum 27478 dirith2 27479 mulog2sumlem2 27486 selbergb 27500 selberg2b 27503 chpdifbndlem1 27504 logdivbnd 27507 selberg3lem2 27509 pntrsumbnd 27517 pntlemf 27556 fsumiunle 32893 esumpcvgval 34228 eulerpartlemgc 34512 reprinfz1 34772 hgt750lemb 34806 fsumlessf 46011 sge0fsum 46819 sge0xaddlem1 46865 sge0seq 46878 carageniuncllem2 46954 perfectALTVlem2 48156 |
| Copyright terms: Public domain | W3C validator |