![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > serle | Structured version Visualization version GIF version |
Description: Comparison of partial sums of two infinite series of reals. (Contributed by NM, 27-Dec-2005.) (Revised by Mario Carneiro, 27-May-2014.) |
Ref | Expression |
---|---|
serge0.1 | ⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘𝑀)) |
serge0.2 | ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → (𝐹‘𝑘) ∈ ℝ) |
serle.3 | ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → (𝐺‘𝑘) ∈ ℝ) |
serle.4 | ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → (𝐹‘𝑘) ≤ (𝐺‘𝑘)) |
Ref | Expression |
---|---|
serle | ⊢ (𝜑 → (seq𝑀( + , 𝐹)‘𝑁) ≤ (seq𝑀( + , 𝐺)‘𝑁)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | serge0.1 | . . . 4 ⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘𝑀)) | |
2 | fveq2 6882 | . . . . . . . 8 ⊢ (𝑥 = 𝑘 → (𝐺‘𝑥) = (𝐺‘𝑘)) | |
3 | fveq2 6882 | . . . . . . . 8 ⊢ (𝑥 = 𝑘 → (𝐹‘𝑥) = (𝐹‘𝑘)) | |
4 | 2, 3 | oveq12d 7420 | . . . . . . 7 ⊢ (𝑥 = 𝑘 → ((𝐺‘𝑥) − (𝐹‘𝑥)) = ((𝐺‘𝑘) − (𝐹‘𝑘))) |
5 | eqid 2724 | . . . . . . 7 ⊢ (𝑥 ∈ V ↦ ((𝐺‘𝑥) − (𝐹‘𝑥))) = (𝑥 ∈ V ↦ ((𝐺‘𝑥) − (𝐹‘𝑥))) | |
6 | ovex 7435 | . . . . . . 7 ⊢ ((𝐺‘𝑘) − (𝐹‘𝑘)) ∈ V | |
7 | 4, 5, 6 | fvmpt 6989 | . . . . . 6 ⊢ (𝑘 ∈ V → ((𝑥 ∈ V ↦ ((𝐺‘𝑥) − (𝐹‘𝑥)))‘𝑘) = ((𝐺‘𝑘) − (𝐹‘𝑘))) |
8 | 7 | elv 3472 | . . . . 5 ⊢ ((𝑥 ∈ V ↦ ((𝐺‘𝑥) − (𝐹‘𝑥)))‘𝑘) = ((𝐺‘𝑘) − (𝐹‘𝑘)) |
9 | serle.3 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → (𝐺‘𝑘) ∈ ℝ) | |
10 | serge0.2 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → (𝐹‘𝑘) ∈ ℝ) | |
11 | 9, 10 | resubcld 11640 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → ((𝐺‘𝑘) − (𝐹‘𝑘)) ∈ ℝ) |
12 | 8, 11 | eqeltrid 2829 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → ((𝑥 ∈ V ↦ ((𝐺‘𝑥) − (𝐹‘𝑥)))‘𝑘) ∈ ℝ) |
13 | serle.4 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → (𝐹‘𝑘) ≤ (𝐺‘𝑘)) | |
14 | 9, 10 | subge0d 11802 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → (0 ≤ ((𝐺‘𝑘) − (𝐹‘𝑘)) ↔ (𝐹‘𝑘) ≤ (𝐺‘𝑘))) |
15 | 13, 14 | mpbird 257 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → 0 ≤ ((𝐺‘𝑘) − (𝐹‘𝑘))) |
16 | 15, 8 | breqtrrdi 5181 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → 0 ≤ ((𝑥 ∈ V ↦ ((𝐺‘𝑥) − (𝐹‘𝑥)))‘𝑘)) |
17 | 1, 12, 16 | serge0 14020 | . . 3 ⊢ (𝜑 → 0 ≤ (seq𝑀( + , (𝑥 ∈ V ↦ ((𝐺‘𝑥) − (𝐹‘𝑥))))‘𝑁)) |
18 | 9 | recnd 11240 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → (𝐺‘𝑘) ∈ ℂ) |
19 | 10 | recnd 11240 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → (𝐹‘𝑘) ∈ ℂ) |
20 | 8 | a1i 11 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → ((𝑥 ∈ V ↦ ((𝐺‘𝑥) − (𝐹‘𝑥)))‘𝑘) = ((𝐺‘𝑘) − (𝐹‘𝑘))) |
21 | 1, 18, 19, 20 | sersub 14009 | . . 3 ⊢ (𝜑 → (seq𝑀( + , (𝑥 ∈ V ↦ ((𝐺‘𝑥) − (𝐹‘𝑥))))‘𝑁) = ((seq𝑀( + , 𝐺)‘𝑁) − (seq𝑀( + , 𝐹)‘𝑁))) |
22 | 17, 21 | breqtrd 5165 | . 2 ⊢ (𝜑 → 0 ≤ ((seq𝑀( + , 𝐺)‘𝑁) − (seq𝑀( + , 𝐹)‘𝑁))) |
23 | readdcl 11190 | . . . . 5 ⊢ ((𝑘 ∈ ℝ ∧ 𝑥 ∈ ℝ) → (𝑘 + 𝑥) ∈ ℝ) | |
24 | 23 | adantl 481 | . . . 4 ⊢ ((𝜑 ∧ (𝑘 ∈ ℝ ∧ 𝑥 ∈ ℝ)) → (𝑘 + 𝑥) ∈ ℝ) |
25 | 1, 9, 24 | seqcl 13986 | . . 3 ⊢ (𝜑 → (seq𝑀( + , 𝐺)‘𝑁) ∈ ℝ) |
26 | 1, 10, 24 | seqcl 13986 | . . 3 ⊢ (𝜑 → (seq𝑀( + , 𝐹)‘𝑁) ∈ ℝ) |
27 | 25, 26 | subge0d 11802 | . 2 ⊢ (𝜑 → (0 ≤ ((seq𝑀( + , 𝐺)‘𝑁) − (seq𝑀( + , 𝐹)‘𝑁)) ↔ (seq𝑀( + , 𝐹)‘𝑁) ≤ (seq𝑀( + , 𝐺)‘𝑁))) |
28 | 22, 27 | mpbid 231 | 1 ⊢ (𝜑 → (seq𝑀( + , 𝐹)‘𝑁) ≤ (seq𝑀( + , 𝐺)‘𝑁)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1533 ∈ wcel 2098 Vcvv 3466 class class class wbr 5139 ↦ cmpt 5222 ‘cfv 6534 (class class class)co 7402 ℝcr 11106 0cc0 11107 + caddc 11110 ≤ cle 11247 − cmin 11442 ℤ≥cuz 12820 ...cfz 13482 seqcseq 13964 |
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 2695 ax-sep 5290 ax-nul 5297 ax-pow 5354 ax-pr 5418 ax-un 7719 ax-cnex 11163 ax-resscn 11164 ax-1cn 11165 ax-icn 11166 ax-addcl 11167 ax-addrcl 11168 ax-mulcl 11169 ax-mulrcl 11170 ax-mulcom 11171 ax-addass 11172 ax-mulass 11173 ax-distr 11174 ax-i2m1 11175 ax-1ne0 11176 ax-1rid 11177 ax-rnegex 11178 ax-rrecex 11179 ax-cnre 11180 ax-pre-lttri 11181 ax-pre-lttrn 11182 ax-pre-ltadd 11183 ax-pre-mulgt0 11184 |
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 2526 df-eu 2555 df-clab 2702 df-cleq 2716 df-clel 2802 df-nfc 2877 df-ne 2933 df-nel 3039 df-ral 3054 df-rex 3063 df-reu 3369 df-rab 3425 df-v 3468 df-sbc 3771 df-csb 3887 df-dif 3944 df-un 3946 df-in 3948 df-ss 3958 df-pss 3960 df-nul 4316 df-if 4522 df-pw 4597 df-sn 4622 df-pr 4624 df-op 4628 df-uni 4901 df-iun 4990 df-br 5140 df-opab 5202 df-mpt 5223 df-tr 5257 df-id 5565 df-eprel 5571 df-po 5579 df-so 5580 df-fr 5622 df-we 5624 df-xp 5673 df-rel 5674 df-cnv 5675 df-co 5676 df-dm 5677 df-rn 5678 df-res 5679 df-ima 5680 df-pred 6291 df-ord 6358 df-on 6359 df-lim 6360 df-suc 6361 df-iota 6486 df-fun 6536 df-fn 6537 df-f 6538 df-f1 6539 df-fo 6540 df-f1o 6541 df-fv 6542 df-riota 7358 df-ov 7405 df-oprab 7406 df-mpo 7407 df-om 7850 df-1st 7969 df-2nd 7970 df-frecs 8262 df-wrecs 8293 df-recs 8367 df-rdg 8406 df-er 8700 df-en 8937 df-dom 8938 df-sdom 8939 df-pnf 11248 df-mnf 11249 df-xr 11250 df-ltxr 11251 df-le 11252 df-sub 11444 df-neg 11445 df-nn 12211 df-n0 12471 df-z 12557 df-uz 12821 df-fz 13483 df-fzo 13626 df-seq 13965 |
This theorem is referenced by: iserle 15604 cvgcmpub 15761 ioombl1lem4 25414 stirlinglem10 45309 |
Copyright terms: Public domain | W3C validator |