![]() |
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 6493 | . . . . . . . 8 ⊢ (𝑥 = 𝑘 → (𝐺‘𝑥) = (𝐺‘𝑘)) | |
3 | fveq2 6493 | . . . . . . . 8 ⊢ (𝑥 = 𝑘 → (𝐹‘𝑥) = (𝐹‘𝑘)) | |
4 | 2, 3 | oveq12d 6988 | . . . . . . 7 ⊢ (𝑥 = 𝑘 → ((𝐺‘𝑥) − (𝐹‘𝑥)) = ((𝐺‘𝑘) − (𝐹‘𝑘))) |
5 | eqid 2772 | . . . . . . 7 ⊢ (𝑥 ∈ V ↦ ((𝐺‘𝑥) − (𝐹‘𝑥))) = (𝑥 ∈ V ↦ ((𝐺‘𝑥) − (𝐹‘𝑥))) | |
6 | ovex 7002 | . . . . . . 7 ⊢ ((𝐺‘𝑘) − (𝐹‘𝑘)) ∈ V | |
7 | 4, 5, 6 | fvmpt 6589 | . . . . . 6 ⊢ (𝑘 ∈ V → ((𝑥 ∈ V ↦ ((𝐺‘𝑥) − (𝐹‘𝑥)))‘𝑘) = ((𝐺‘𝑘) − (𝐹‘𝑘))) |
8 | 7 | elv 3414 | . . . . 5 ⊢ ((𝑥 ∈ V ↦ ((𝐺‘𝑥) − (𝐹‘𝑥)))‘𝑘) = ((𝐺‘𝑘) − (𝐹‘𝑘)) |
9 | serle.3 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → (𝐺‘𝑘) ∈ ℝ) | |
10 | serge0.2 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → (𝐹‘𝑘) ∈ ℝ) | |
11 | 9, 10 | resubcld 10863 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → ((𝐺‘𝑘) − (𝐹‘𝑘)) ∈ ℝ) |
12 | 8, 11 | syl5eqel 2864 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → ((𝑥 ∈ V ↦ ((𝐺‘𝑥) − (𝐹‘𝑥)))‘𝑘) ∈ ℝ) |
13 | serle.4 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → (𝐹‘𝑘) ≤ (𝐺‘𝑘)) | |
14 | 9, 10 | subge0d 11025 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → (0 ≤ ((𝐺‘𝑘) − (𝐹‘𝑘)) ↔ (𝐹‘𝑘) ≤ (𝐺‘𝑘))) |
15 | 13, 14 | mpbird 249 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → 0 ≤ ((𝐺‘𝑘) − (𝐹‘𝑘))) |
16 | 15, 8 | syl6breqr 4965 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → 0 ≤ ((𝑥 ∈ V ↦ ((𝐺‘𝑥) − (𝐹‘𝑥)))‘𝑘)) |
17 | 1, 12, 16 | serge0 13233 | . . 3 ⊢ (𝜑 → 0 ≤ (seq𝑀( + , (𝑥 ∈ V ↦ ((𝐺‘𝑥) − (𝐹‘𝑥))))‘𝑁)) |
18 | 9 | recnd 10462 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → (𝐺‘𝑘) ∈ ℂ) |
19 | 10 | recnd 10462 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → (𝐹‘𝑘) ∈ ℂ) |
20 | 8 | a1i 11 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → ((𝑥 ∈ V ↦ ((𝐺‘𝑥) − (𝐹‘𝑥)))‘𝑘) = ((𝐺‘𝑘) − (𝐹‘𝑘))) |
21 | 1, 18, 19, 20 | sersub 13222 | . . 3 ⊢ (𝜑 → (seq𝑀( + , (𝑥 ∈ V ↦ ((𝐺‘𝑥) − (𝐹‘𝑥))))‘𝑁) = ((seq𝑀( + , 𝐺)‘𝑁) − (seq𝑀( + , 𝐹)‘𝑁))) |
22 | 17, 21 | breqtrd 4949 | . 2 ⊢ (𝜑 → 0 ≤ ((seq𝑀( + , 𝐺)‘𝑁) − (seq𝑀( + , 𝐹)‘𝑁))) |
23 | readdcl 10412 | . . . . 5 ⊢ ((𝑘 ∈ ℝ ∧ 𝑥 ∈ ℝ) → (𝑘 + 𝑥) ∈ ℝ) | |
24 | 23 | adantl 474 | . . . 4 ⊢ ((𝜑 ∧ (𝑘 ∈ ℝ ∧ 𝑥 ∈ ℝ)) → (𝑘 + 𝑥) ∈ ℝ) |
25 | 1, 9, 24 | seqcl 13199 | . . 3 ⊢ (𝜑 → (seq𝑀( + , 𝐺)‘𝑁) ∈ ℝ) |
26 | 1, 10, 24 | seqcl 13199 | . . 3 ⊢ (𝜑 → (seq𝑀( + , 𝐹)‘𝑁) ∈ ℝ) |
27 | 25, 26 | subge0d 11025 | . 2 ⊢ (𝜑 → (0 ≤ ((seq𝑀( + , 𝐺)‘𝑁) − (seq𝑀( + , 𝐹)‘𝑁)) ↔ (seq𝑀( + , 𝐹)‘𝑁) ≤ (seq𝑀( + , 𝐺)‘𝑁))) |
28 | 22, 27 | mpbid 224 | 1 ⊢ (𝜑 → (seq𝑀( + , 𝐹)‘𝑁) ≤ (seq𝑀( + , 𝐺)‘𝑁)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 387 = wceq 1507 ∈ wcel 2050 Vcvv 3409 class class class wbr 4923 ↦ cmpt 5002 ‘cfv 6182 (class class class)co 6970 ℝcr 10328 0cc0 10329 + caddc 10332 ≤ cle 10469 − cmin 10664 ℤ≥cuz 12052 ...cfz 12702 seqcseq 13178 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1758 ax-4 1772 ax-5 1869 ax-6 1928 ax-7 1965 ax-8 2052 ax-9 2059 ax-10 2079 ax-11 2093 ax-12 2106 ax-13 2301 ax-ext 2744 ax-sep 5054 ax-nul 5061 ax-pow 5113 ax-pr 5180 ax-un 7273 ax-cnex 10385 ax-resscn 10386 ax-1cn 10387 ax-icn 10388 ax-addcl 10389 ax-addrcl 10390 ax-mulcl 10391 ax-mulrcl 10392 ax-mulcom 10393 ax-addass 10394 ax-mulass 10395 ax-distr 10396 ax-i2m1 10397 ax-1ne0 10398 ax-1rid 10399 ax-rnegex 10400 ax-rrecex 10401 ax-cnre 10402 ax-pre-lttri 10403 ax-pre-lttrn 10404 ax-pre-ltadd 10405 ax-pre-mulgt0 10406 |
This theorem depends on definitions: df-bi 199 df-an 388 df-or 834 df-3or 1069 df-3an 1070 df-tru 1510 df-ex 1743 df-nf 1747 df-sb 2016 df-mo 2547 df-eu 2584 df-clab 2753 df-cleq 2765 df-clel 2840 df-nfc 2912 df-ne 2962 df-nel 3068 df-ral 3087 df-rex 3088 df-reu 3089 df-rab 3091 df-v 3411 df-sbc 3676 df-csb 3781 df-dif 3826 df-un 3828 df-in 3830 df-ss 3837 df-pss 3839 df-nul 4173 df-if 4345 df-pw 4418 df-sn 4436 df-pr 4438 df-tp 4440 df-op 4442 df-uni 4707 df-iun 4788 df-br 4924 df-opab 4986 df-mpt 5003 df-tr 5025 df-id 5306 df-eprel 5311 df-po 5320 df-so 5321 df-fr 5360 df-we 5362 df-xp 5407 df-rel 5408 df-cnv 5409 df-co 5410 df-dm 5411 df-rn 5412 df-res 5413 df-ima 5414 df-pred 5980 df-ord 6026 df-on 6027 df-lim 6028 df-suc 6029 df-iota 6146 df-fun 6184 df-fn 6185 df-f 6186 df-f1 6187 df-fo 6188 df-f1o 6189 df-fv 6190 df-riota 6931 df-ov 6973 df-oprab 6974 df-mpo 6975 df-om 7391 df-1st 7495 df-2nd 7496 df-wrecs 7744 df-recs 7806 df-rdg 7844 df-er 8083 df-en 8301 df-dom 8302 df-sdom 8303 df-pnf 10470 df-mnf 10471 df-xr 10472 df-ltxr 10473 df-le 10474 df-sub 10666 df-neg 10667 df-nn 11434 df-n0 11702 df-z 11788 df-uz 12053 df-fz 12703 df-fzo 12844 df-seq 13179 |
This theorem is referenced by: iserle 14871 cvgcmpub 15026 ioombl1lem4 23859 stirlinglem10 41799 |
Copyright terms: Public domain | W3C validator |