isumless - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > isumless		Structured version Visualization version GIF version

Theorem isumless 15749

Description: A finite sum of nonnegative numbers is less than or equal to its limit. (Contributed by Mario Carneiro, 24-Apr-2014.)

**Hypotheses**
Ref	Expression
isumless.1	⊢ 𝑍 = (ℤ_≥‘𝑀)
isumless.2	⊢ (𝜑 → 𝑀 ∈ ℤ)
isumless.3	⊢ (𝜑 → 𝐴 ∈ Fin)
isumless.4	⊢ (𝜑 → 𝐴 ⊆ 𝑍)
isumless.5	⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) = 𝐵)
isumless.6	⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 𝐵 ∈ ℝ)
isumless.7	⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 0 ≤ 𝐵)
isumless.8	⊢ (𝜑 → seq𝑀( + , 𝐹) ∈ dom ⇝ )

**Assertion**
Ref	Expression
isumless	⊢ (𝜑 → Σ𝑘 ∈ 𝐴 𝐵 ≤ Σ𝑘 ∈ 𝑍 𝐵)

Distinct variable groups: 𝐴,𝑘 𝑘,𝐹 𝑘,𝑀 𝜑,𝑘 𝑘,𝑍 Allowed substitution hint: 𝐵(𝑘)

Proof of Theorem isumless Dummy variable 𝑗 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		isumless.4	. . 3 ⊢ (𝜑 → 𝐴 ⊆ 𝑍)
2	1	sselda 3934	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝑘 ∈ 𝑍)
3		isumless.6	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 𝐵 ∈ ℝ)
4	3	recnd 11137	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 𝐵 ∈ ℂ)
5	2, 4	syldan 591	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ ℂ)
6	5	ralrimiva 3124	. . 3 ⊢ (𝜑 → ∀𝑘 ∈ 𝐴 𝐵 ∈ ℂ)
7		isumless.1	. . . . . 6 ⊢ 𝑍 = (ℤ_≥‘𝑀)
8	7	eqimssi 3995	. . . . 5 ⊢ 𝑍 ⊆ (ℤ_≥‘𝑀)
9	8	orci 865	. . . 4 ⊢ (𝑍 ⊆ (ℤ_≥‘𝑀) ∨ 𝑍 ∈ Fin)
10	9	a1i 11	. . 3 ⊢ (𝜑 → (𝑍 ⊆ (ℤ_≥‘𝑀) ∨ 𝑍 ∈ Fin))
11		sumss2 15630	. . 3 ⊢ (((𝐴 ⊆ 𝑍 ∧ ∀𝑘 ∈ 𝐴 𝐵 ∈ ℂ) ∧ (𝑍 ⊆ (ℤ_≥‘𝑀) ∨ 𝑍 ∈ Fin)) → Σ𝑘 ∈ 𝐴 𝐵 = Σ𝑘 ∈ 𝑍 if(𝑘 ∈ 𝐴, 𝐵, 0))
12	1, 6, 10, 11	syl21anc 837	. 2 ⊢ (𝜑 → Σ𝑘 ∈ 𝐴 𝐵 = Σ𝑘 ∈ 𝑍 if(𝑘 ∈ 𝐴, 𝐵, 0))
13		isumless.2	. . 3 ⊢ (𝜑 → 𝑀 ∈ ℤ)
14		eleq1w 2814	. . . . . . 7 ⊢ (𝑗 = 𝑘 → (𝑗 ∈ 𝐴 ↔ 𝑘 ∈ 𝐴))
15		fveq2 6822	. . . . . . 7 ⊢ (𝑗 = 𝑘 → (𝐹‘𝑗) = (𝐹‘𝑘))
16	14, 15	ifbieq1d 4500	. . . . . 6 ⊢ (𝑗 = 𝑘 → if(𝑗 ∈ 𝐴, (𝐹‘𝑗), 0) = if(𝑘 ∈ 𝐴, (𝐹‘𝑘), 0))
17		eqid 2731	. . . . . 6 ⊢ (𝑗 ∈ 𝑍 ↦ if(𝑗 ∈ 𝐴, (𝐹‘𝑗), 0)) = (𝑗 ∈ 𝑍 ↦ if(𝑗 ∈ 𝐴, (𝐹‘𝑗), 0))
18		fvex 6835	. . . . . . 7 ⊢ (𝐹‘𝑘) ∈ V
19		c0ex 11103	. . . . . . 7 ⊢ 0 ∈ V
20	18, 19	ifex 4526	. . . . . 6 ⊢ if(𝑘 ∈ 𝐴, (𝐹‘𝑘), 0) ∈ V
21	16, 17, 20	fvmpt 6929	. . . . 5 ⊢ (𝑘 ∈ 𝑍 → ((𝑗 ∈ 𝑍 ↦ if(𝑗 ∈ 𝐴, (𝐹‘𝑗), 0))‘𝑘) = if(𝑘 ∈ 𝐴, (𝐹‘𝑘), 0))
22	21	adantl 481	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → ((𝑗 ∈ 𝑍 ↦ if(𝑗 ∈ 𝐴, (𝐹‘𝑗), 0))‘𝑘) = if(𝑘 ∈ 𝐴, (𝐹‘𝑘), 0))
23		isumless.5	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) = 𝐵)
24	23	ifeq1d 4495	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → if(𝑘 ∈ 𝐴, (𝐹‘𝑘), 0) = if(𝑘 ∈ 𝐴, 𝐵, 0))
25	22, 24	eqtrd 2766	. . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → ((𝑗 ∈ 𝑍 ↦ if(𝑗 ∈ 𝐴, (𝐹‘𝑗), 0))‘𝑘) = if(𝑘 ∈ 𝐴, 𝐵, 0))
26		0re 11111	. . . 4 ⊢ 0 ∈ ℝ
27		ifcl 4521	. . . 4 ⊢ ((𝐵 ∈ ℝ ∧ 0 ∈ ℝ) → if(𝑘 ∈ 𝐴, 𝐵, 0) ∈ ℝ)
28	3, 26, 27	sylancl 586	. . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → if(𝑘 ∈ 𝐴, 𝐵, 0) ∈ ℝ)
29		isumless.7	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 0 ≤ 𝐵)
30		leid 11206	. . . . 5 ⊢ (𝐵 ∈ ℝ → 𝐵 ≤ 𝐵)
31		breq1 5094	. . . . . 6 ⊢ (𝐵 = if(𝑘 ∈ 𝐴, 𝐵, 0) → (𝐵 ≤ 𝐵 ↔ if(𝑘 ∈ 𝐴, 𝐵, 0) ≤ 𝐵))
32		breq1 5094	. . . . . 6 ⊢ (0 = if(𝑘 ∈ 𝐴, 𝐵, 0) → (0 ≤ 𝐵 ↔ if(𝑘 ∈ 𝐴, 𝐵, 0) ≤ 𝐵))
33	31, 32	ifboth 4515	. . . . 5 ⊢ ((𝐵 ≤ 𝐵 ∧ 0 ≤ 𝐵) → if(𝑘 ∈ 𝐴, 𝐵, 0) ≤ 𝐵)
34	30, 33	sylan 580	. . . 4 ⊢ ((𝐵 ∈ ℝ ∧ 0 ≤ 𝐵) → if(𝑘 ∈ 𝐴, 𝐵, 0) ≤ 𝐵)
35	3, 29, 34	syl2anc 584	. . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → if(𝑘 ∈ 𝐴, 𝐵, 0) ≤ 𝐵)
36		isumless.3	. . . 4 ⊢ (𝜑 → 𝐴 ∈ Fin)
37	7, 13, 36, 1, 25, 5	fsumcvg3 15633	. . 3 ⊢ (𝜑 → seq𝑀( + , (𝑗 ∈ 𝑍 ↦ if(𝑗 ∈ 𝐴, (𝐹‘𝑗), 0))) ∈ dom ⇝ )
38		isumless.8	. . 3 ⊢ (𝜑 → seq𝑀( + , 𝐹) ∈ dom ⇝ )
39	7, 13, 25, 28, 23, 3, 35, 37, 38	isumle 15748	. 2 ⊢ (𝜑 → Σ𝑘 ∈ 𝑍 if(𝑘 ∈ 𝐴, 𝐵, 0) ≤ Σ𝑘 ∈ 𝑍 𝐵)
40	12, 39	eqbrtrd 5113	1 ⊢ (𝜑 → Σ𝑘 ∈ 𝐴 𝐵 ≤ Σ𝑘 ∈ 𝑍 𝐵)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 ∨ wo 847 = wceq 1541 ∈ wcel 2111 ∀wral 3047 ⊆ wss 3902 ifcif 4475 class class class wbr 5091 ↦ cmpt 5172 dom cdm 5616 ‘cfv 6481 Fincfn 8869 ℂcc 11001 ℝcr 11002 0cc0 11003 + caddc 11006 ≤ cle 11144 ℤcz 12465 ℤ_≥cuz 12729 seqcseq 13905 ⇝ cli 15388 Σcsu 15590

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-10 2144 ax-11 2160 ax-12 2180 ax-ext 2703 ax-rep 5217 ax-sep 5234 ax-nul 5244 ax-pow 5303 ax-pr 5370 ax-un 7668 ax-inf2 9531 ax-cnex 11059 ax-resscn 11060 ax-1cn 11061 ax-icn 11062 ax-addcl 11063 ax-addrcl 11064 ax-mulcl 11065 ax-mulrcl 11066 ax-mulcom 11067 ax-addass 11068 ax-mulass 11069 ax-distr 11070 ax-i2m1 11071 ax-1ne0 11072 ax-1rid 11073 ax-rnegex 11074 ax-rrecex 11075 ax-cnre 11076 ax-pre-lttri 11077 ax-pre-lttrn 11078 ax-pre-ltadd 11079 ax-pre-mulgt0 11080 ax-pre-sup 11081

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2535 df-eu 2564 df-clab 2710 df-cleq 2723 df-clel 2806 df-nfc 2881 df-ne 2929 df-nel 3033 df-ral 3048 df-rex 3057 df-rmo 3346 df-reu 3347 df-rab 3396 df-v 3438 df-sbc 3742 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4284 df-if 4476 df-pw 4552 df-sn 4577 df-pr 4579 df-op 4583 df-uni 4860 df-int 4898 df-iun 4943 df-br 5092 df-opab 5154 df-mpt 5173 df-tr 5199 df-id 5511 df-eprel 5516 df-po 5524 df-so 5525 df-fr 5569 df-se 5570 df-we 5571 df-xp 5622 df-rel 5623 df-cnv 5624 df-co 5625 df-dm 5626 df-rn 5627 df-res 5628 df-ima 5629 df-pred 6248 df-ord 6309 df-on 6310 df-lim 6311 df-suc 6312 df-iota 6437 df-fun 6483 df-fn 6484 df-f 6485 df-f1 6486 df-fo 6487 df-f1o 6488 df-fv 6489 df-isom 6490 df-riota 7303 df-ov 7349 df-oprab 7350 df-mpo 7351 df-om 7797 df-1st 7921 df-2nd 7922 df-frecs 8211 df-wrecs 8242 df-recs 8291 df-rdg 8329 df-1o 8385 df-er 8622 df-pm 8753 df-en 8870 df-dom 8871 df-sdom 8872 df-fin 8873 df-sup 9326 df-inf 9327 df-oi 9396 df-card 9829 df-pnf 11145 df-mnf 11146 df-xr 11147 df-ltxr 11148 df-le 11149 df-sub 11343 df-neg 11344 df-div 11772 df-nn 12123 df-2 12185 df-3 12186 df-n0 12379 df-z 12466 df-uz 12730 df-rp 12888 df-fz 13405 df-fzo 13552 df-fl 13693 df-seq 13906 df-exp 13966 df-hash 14235 df-cj 15003 df-re 15004 df-im 15005 df-sqrt 15139 df-abs 15140 df-clim 15392 df-rlim 15393 df-sum 15591

This theorem is referenced by: isumltss 15752 climcnds 15755 harmonic 15763 mertenslem1 15788 prmreclem5 16829 ovoliunlem1 25428 ovoliun2 25432 esumpcvgval 34086 eulerpartlems 34368 geomcau 37798

W3C validator