![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > fsumge1 | Structured version Visualization version GIF version |
Description: A sum of nonnegative numbers is greater than or equal to any one of its terms. (Contributed by Jeff Madsen, 2-Sep-2009.) (Proof shortened by Mario Carneiro, 4-Jun-2014.) |
Ref | Expression |
---|---|
fsumge0.1 | ⊢ (𝜑 → 𝐴 ∈ Fin) |
fsumge0.2 | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℝ) |
fsumge0.3 | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 0 ≤ 𝐵) |
fsumge1.4 | ⊢ (𝑘 = 𝑀 → 𝐵 = 𝐶) |
fsumge1.5 | ⊢ (𝜑 → 𝑀 ∈ 𝐴) |
Ref | Expression |
---|---|
fsumge1 | ⊢ (𝜑 → 𝐶 ≤ Σ𝑘 ∈ 𝐴 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fsumge1.5 | . . 3 ⊢ (𝜑 → 𝑀 ∈ 𝐴) | |
2 | fsumge1.4 | . . . . 5 ⊢ (𝑘 = 𝑀 → 𝐵 = 𝐶) | |
3 | 2 | eleq1d 2812 | . . . 4 ⊢ (𝑘 = 𝑀 → (𝐵 ∈ ℂ ↔ 𝐶 ∈ ℂ)) |
4 | fsumge0.2 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℝ) | |
5 | 4 | recnd 11243 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℂ) |
6 | 5 | ralrimiva 3140 | . . . 4 ⊢ (𝜑 → ∀𝑘 ∈ 𝐴 𝐵 ∈ ℂ) |
7 | 3, 6, 1 | rspcdva 3607 | . . 3 ⊢ (𝜑 → 𝐶 ∈ ℂ) |
8 | 2 | sumsn 15695 | . . 3 ⊢ ((𝑀 ∈ 𝐴 ∧ 𝐶 ∈ ℂ) → Σ𝑘 ∈ {𝑀}𝐵 = 𝐶) |
9 | 1, 7, 8 | syl2anc 583 | . 2 ⊢ (𝜑 → Σ𝑘 ∈ {𝑀}𝐵 = 𝐶) |
10 | fsumge0.1 | . . 3 ⊢ (𝜑 → 𝐴 ∈ Fin) | |
11 | fsumge0.3 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 0 ≤ 𝐵) | |
12 | 1 | snssd 4807 | . . 3 ⊢ (𝜑 → {𝑀} ⊆ 𝐴) |
13 | 10, 4, 11, 12 | fsumless 15745 | . 2 ⊢ (𝜑 → Σ𝑘 ∈ {𝑀}𝐵 ≤ Σ𝑘 ∈ 𝐴 𝐵) |
14 | 9, 13 | eqbrtrrd 5165 | 1 ⊢ (𝜑 → 𝐶 ≤ Σ𝑘 ∈ 𝐴 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1533 ∈ wcel 2098 {csn 4623 class class class wbr 5141 Fincfn 8938 ℂcc 11107 ℝcr 11108 0cc0 11109 ≤ cle 11250 Σcsu 15635 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2163 ax-ext 2697 ax-rep 5278 ax-sep 5292 ax-nul 5299 ax-pow 5356 ax-pr 5420 ax-un 7721 ax-inf2 9635 ax-cnex 11165 ax-resscn 11166 ax-1cn 11167 ax-icn 11168 ax-addcl 11169 ax-addrcl 11170 ax-mulcl 11171 ax-mulrcl 11172 ax-mulcom 11173 ax-addass 11174 ax-mulass 11175 ax-distr 11176 ax-i2m1 11177 ax-1ne0 11178 ax-1rid 11179 ax-rnegex 11180 ax-rrecex 11181 ax-cnre 11182 ax-pre-lttri 11183 ax-pre-lttrn 11184 ax-pre-ltadd 11185 ax-pre-mulgt0 11186 ax-pre-sup 11187 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2528 df-eu 2557 df-clab 2704 df-cleq 2718 df-clel 2804 df-nfc 2879 df-ne 2935 df-nel 3041 df-ral 3056 df-rex 3065 df-rmo 3370 df-reu 3371 df-rab 3427 df-v 3470 df-sbc 3773 df-csb 3889 df-dif 3946 df-un 3948 df-in 3950 df-ss 3960 df-pss 3962 df-nul 4318 df-if 4524 df-pw 4599 df-sn 4624 df-pr 4626 df-op 4630 df-uni 4903 df-int 4944 df-iun 4992 df-br 5142 df-opab 5204 df-mpt 5225 df-tr 5259 df-id 5567 df-eprel 5573 df-po 5581 df-so 5582 df-fr 5624 df-se 5625 df-we 5626 df-xp 5675 df-rel 5676 df-cnv 5677 df-co 5678 df-dm 5679 df-rn 5680 df-res 5681 df-ima 5682 df-pred 6293 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6488 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-isom 6545 df-riota 7360 df-ov 7407 df-oprab 7408 df-mpo 7409 df-om 7852 df-1st 7971 df-2nd 7972 df-frecs 8264 df-wrecs 8295 df-recs 8369 df-rdg 8408 df-1o 8464 df-er 8702 df-en 8939 df-dom 8940 df-sdom 8941 df-fin 8942 df-sup 9436 df-oi 9504 df-card 9933 df-pnf 11251 df-mnf 11252 df-xr 11253 df-ltxr 11254 df-le 11255 df-sub 11447 df-neg 11448 df-div 11873 df-nn 12214 df-2 12276 df-3 12277 df-n0 12474 df-z 12560 df-uz 12824 df-rp 12978 df-ico 13333 df-fz 13488 df-fzo 13631 df-seq 13970 df-exp 14030 df-hash 14293 df-cj 15049 df-re 15050 df-im 15051 df-sqrt 15185 df-abs 15186 df-clim 15435 df-sum 15636 |
This theorem is referenced by: lebnumlem1 24837 rrxdstprj1 25287 fsumub 32536 eulerpartlemgc 33890 eulerpartlemb 33896 rrndstprj1 37210 dvnprodlem1 45216 |
Copyright terms: Public domain | W3C validator |