![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > effsumlt | Structured version Visualization version GIF version |
Description: The partial sums of the series expansion of the exponential function at a positive real number are bounded by the value of the function. (Contributed by Paul Chapman, 21-Aug-2007.) (Revised by Mario Carneiro, 29-Apr-2014.) |
Ref | Expression |
---|---|
effsumlt.1 | ⊢ 𝐹 = (𝑛 ∈ ℕ0 ↦ ((𝐴↑𝑛) / (!‘𝑛))) |
effsumlt.2 | ⊢ (𝜑 → 𝐴 ∈ ℝ+) |
effsumlt.3 | ⊢ (𝜑 → 𝑁 ∈ ℕ0) |
Ref | Expression |
---|---|
effsumlt | ⊢ (𝜑 → (seq0( + , 𝐹)‘𝑁) < (exp‘𝐴)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nn0uz 12033 | . . . . 5 ⊢ ℕ0 = (ℤ≥‘0) | |
2 | 0zd 11745 | . . . . 5 ⊢ (𝜑 → 0 ∈ ℤ) | |
3 | effsumlt.1 | . . . . . . . 8 ⊢ 𝐹 = (𝑛 ∈ ℕ0 ↦ ((𝐴↑𝑛) / (!‘𝑛))) | |
4 | 3 | eftval 15218 | . . . . . . 7 ⊢ (𝑘 ∈ ℕ0 → (𝐹‘𝑘) = ((𝐴↑𝑘) / (!‘𝑘))) |
5 | 4 | adantl 475 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝐹‘𝑘) = ((𝐴↑𝑘) / (!‘𝑘))) |
6 | effsumlt.2 | . . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ ℝ+) | |
7 | 6 | rpred 12186 | . . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ ℝ) |
8 | reeftcl 15216 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝑘 ∈ ℕ0) → ((𝐴↑𝑘) / (!‘𝑘)) ∈ ℝ) | |
9 | 7, 8 | sylan 575 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → ((𝐴↑𝑘) / (!‘𝑘)) ∈ ℝ) |
10 | 5, 9 | eqeltrd 2859 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝐹‘𝑘) ∈ ℝ) |
11 | 1, 2, 10 | serfre 13153 | . . . 4 ⊢ (𝜑 → seq0( + , 𝐹):ℕ0⟶ℝ) |
12 | effsumlt.3 | . . . 4 ⊢ (𝜑 → 𝑁 ∈ ℕ0) | |
13 | 11, 12 | ffvelrnd 6626 | . . 3 ⊢ (𝜑 → (seq0( + , 𝐹)‘𝑁) ∈ ℝ) |
14 | eqid 2778 | . . . 4 ⊢ (ℤ≥‘(𝑁 + 1)) = (ℤ≥‘(𝑁 + 1)) | |
15 | peano2nn0 11689 | . . . . 5 ⊢ (𝑁 ∈ ℕ0 → (𝑁 + 1) ∈ ℕ0) | |
16 | 12, 15 | syl 17 | . . . 4 ⊢ (𝜑 → (𝑁 + 1) ∈ ℕ0) |
17 | eqidd 2779 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝐹‘𝑘) = (𝐹‘𝑘)) | |
18 | nn0z 11757 | . . . . . . 7 ⊢ (𝑘 ∈ ℕ0 → 𝑘 ∈ ℤ) | |
19 | rpexpcl 13202 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝑘 ∈ ℤ) → (𝐴↑𝑘) ∈ ℝ+) | |
20 | 6, 18, 19 | syl2an 589 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝐴↑𝑘) ∈ ℝ+) |
21 | faccl 13394 | . . . . . . . 8 ⊢ (𝑘 ∈ ℕ0 → (!‘𝑘) ∈ ℕ) | |
22 | 21 | adantl 475 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (!‘𝑘) ∈ ℕ) |
23 | 22 | nnrpd 12184 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (!‘𝑘) ∈ ℝ+) |
24 | 20, 23 | rpdivcld 12203 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → ((𝐴↑𝑘) / (!‘𝑘)) ∈ ℝ+) |
25 | 5, 24 | eqeltrd 2859 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝐹‘𝑘) ∈ ℝ+) |
26 | 7 | recnd 10407 | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ ℂ) |
27 | 3 | efcllem 15219 | . . . . 5 ⊢ (𝐴 ∈ ℂ → seq0( + , 𝐹) ∈ dom ⇝ ) |
28 | 26, 27 | syl 17 | . . . 4 ⊢ (𝜑 → seq0( + , 𝐹) ∈ dom ⇝ ) |
29 | 1, 14, 16, 17, 25, 28 | isumrpcl 14988 | . . 3 ⊢ (𝜑 → Σ𝑘 ∈ (ℤ≥‘(𝑁 + 1))(𝐹‘𝑘) ∈ ℝ+) |
30 | 13, 29 | ltaddrpd 12219 | . 2 ⊢ (𝜑 → (seq0( + , 𝐹)‘𝑁) < ((seq0( + , 𝐹)‘𝑁) + Σ𝑘 ∈ (ℤ≥‘(𝑁 + 1))(𝐹‘𝑘))) |
31 | 3 | efval2 15225 | . . . 4 ⊢ (𝐴 ∈ ℂ → (exp‘𝐴) = Σ𝑘 ∈ ℕ0 (𝐹‘𝑘)) |
32 | 26, 31 | syl 17 | . . 3 ⊢ (𝜑 → (exp‘𝐴) = Σ𝑘 ∈ ℕ0 (𝐹‘𝑘)) |
33 | 10 | recnd 10407 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝐹‘𝑘) ∈ ℂ) |
34 | 1, 14, 16, 17, 33, 28 | isumsplit 14985 | . . 3 ⊢ (𝜑 → Σ𝑘 ∈ ℕ0 (𝐹‘𝑘) = (Σ𝑘 ∈ (0...((𝑁 + 1) − 1))(𝐹‘𝑘) + Σ𝑘 ∈ (ℤ≥‘(𝑁 + 1))(𝐹‘𝑘))) |
35 | 12 | nn0cnd 11709 | . . . . . . . 8 ⊢ (𝜑 → 𝑁 ∈ ℂ) |
36 | ax-1cn 10332 | . . . . . . . 8 ⊢ 1 ∈ ℂ | |
37 | pncan 10630 | . . . . . . . 8 ⊢ ((𝑁 ∈ ℂ ∧ 1 ∈ ℂ) → ((𝑁 + 1) − 1) = 𝑁) | |
38 | 35, 36, 37 | sylancl 580 | . . . . . . 7 ⊢ (𝜑 → ((𝑁 + 1) − 1) = 𝑁) |
39 | 38 | oveq2d 6940 | . . . . . 6 ⊢ (𝜑 → (0...((𝑁 + 1) − 1)) = (0...𝑁)) |
40 | 39 | sumeq1d 14848 | . . . . 5 ⊢ (𝜑 → Σ𝑘 ∈ (0...((𝑁 + 1) − 1))(𝐹‘𝑘) = Σ𝑘 ∈ (0...𝑁)(𝐹‘𝑘)) |
41 | eqidd 2779 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...𝑁)) → (𝐹‘𝑘) = (𝐹‘𝑘)) | |
42 | 12, 1 | syl6eleq 2869 | . . . . . 6 ⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘0)) |
43 | elfznn0 12756 | . . . . . . 7 ⊢ (𝑘 ∈ (0...𝑁) → 𝑘 ∈ ℕ0) | |
44 | 43, 33 | sylan2 586 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...𝑁)) → (𝐹‘𝑘) ∈ ℂ) |
45 | 41, 42, 44 | fsumser 14877 | . . . . 5 ⊢ (𝜑 → Σ𝑘 ∈ (0...𝑁)(𝐹‘𝑘) = (seq0( + , 𝐹)‘𝑁)) |
46 | 40, 45 | eqtrd 2814 | . . . 4 ⊢ (𝜑 → Σ𝑘 ∈ (0...((𝑁 + 1) − 1))(𝐹‘𝑘) = (seq0( + , 𝐹)‘𝑁)) |
47 | 46 | oveq1d 6939 | . . 3 ⊢ (𝜑 → (Σ𝑘 ∈ (0...((𝑁 + 1) − 1))(𝐹‘𝑘) + Σ𝑘 ∈ (ℤ≥‘(𝑁 + 1))(𝐹‘𝑘)) = ((seq0( + , 𝐹)‘𝑁) + Σ𝑘 ∈ (ℤ≥‘(𝑁 + 1))(𝐹‘𝑘))) |
48 | 32, 34, 47 | 3eqtrd 2818 | . 2 ⊢ (𝜑 → (exp‘𝐴) = ((seq0( + , 𝐹)‘𝑁) + Σ𝑘 ∈ (ℤ≥‘(𝑁 + 1))(𝐹‘𝑘))) |
49 | 30, 48 | breqtrrd 4916 | 1 ⊢ (𝜑 → (seq0( + , 𝐹)‘𝑁) < (exp‘𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 386 = wceq 1601 ∈ wcel 2107 class class class wbr 4888 ↦ cmpt 4967 dom cdm 5357 ‘cfv 6137 (class class class)co 6924 ℂcc 10272 ℝcr 10273 0cc0 10274 1c1 10275 + caddc 10277 < clt 10413 − cmin 10608 / cdiv 11035 ℕcn 11379 ℕ0cn0 11647 ℤcz 11733 ℤ≥cuz 11997 ℝ+crp 12142 ...cfz 12648 seqcseq 13124 ↑cexp 13183 !cfa 13384 ⇝ cli 14632 Σcsu 14833 expce 15203 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1839 ax-4 1853 ax-5 1953 ax-6 2021 ax-7 2055 ax-8 2109 ax-9 2116 ax-10 2135 ax-11 2150 ax-12 2163 ax-13 2334 ax-ext 2754 ax-rep 5008 ax-sep 5019 ax-nul 5027 ax-pow 5079 ax-pr 5140 ax-un 7228 ax-inf2 8837 ax-cnex 10330 ax-resscn 10331 ax-1cn 10332 ax-icn 10333 ax-addcl 10334 ax-addrcl 10335 ax-mulcl 10336 ax-mulrcl 10337 ax-mulcom 10338 ax-addass 10339 ax-mulass 10340 ax-distr 10341 ax-i2m1 10342 ax-1ne0 10343 ax-1rid 10344 ax-rnegex 10345 ax-rrecex 10346 ax-cnre 10347 ax-pre-lttri 10348 ax-pre-lttrn 10349 ax-pre-ltadd 10350 ax-pre-mulgt0 10351 ax-pre-sup 10352 ax-addf 10353 ax-mulf 10354 |
This theorem depends on definitions: df-bi 199 df-an 387 df-or 837 df-3or 1072 df-3an 1073 df-tru 1605 df-fal 1615 df-ex 1824 df-nf 1828 df-sb 2012 df-mo 2551 df-eu 2587 df-clab 2764 df-cleq 2770 df-clel 2774 df-nfc 2921 df-ne 2970 df-nel 3076 df-ral 3095 df-rex 3096 df-reu 3097 df-rmo 3098 df-rab 3099 df-v 3400 df-sbc 3653 df-csb 3752 df-dif 3795 df-un 3797 df-in 3799 df-ss 3806 df-pss 3808 df-nul 4142 df-if 4308 df-pw 4381 df-sn 4399 df-pr 4401 df-tp 4403 df-op 4405 df-uni 4674 df-int 4713 df-iun 4757 df-br 4889 df-opab 4951 df-mpt 4968 df-tr 4990 df-id 5263 df-eprel 5268 df-po 5276 df-so 5277 df-fr 5316 df-se 5317 df-we 5318 df-xp 5363 df-rel 5364 df-cnv 5365 df-co 5366 df-dm 5367 df-rn 5368 df-res 5369 df-ima 5370 df-pred 5935 df-ord 5981 df-on 5982 df-lim 5983 df-suc 5984 df-iota 6101 df-fun 6139 df-fn 6140 df-f 6141 df-f1 6142 df-fo 6143 df-f1o 6144 df-fv 6145 df-isom 6146 df-riota 6885 df-ov 6927 df-oprab 6928 df-mpt2 6929 df-om 7346 df-1st 7447 df-2nd 7448 df-wrecs 7691 df-recs 7753 df-rdg 7791 df-1o 7845 df-oadd 7849 df-er 8028 df-pm 8145 df-en 8244 df-dom 8245 df-sdom 8246 df-fin 8247 df-sup 8638 df-inf 8639 df-oi 8706 df-card 9100 df-pnf 10415 df-mnf 10416 df-xr 10417 df-ltxr 10418 df-le 10419 df-sub 10610 df-neg 10611 df-div 11036 df-nn 11380 df-2 11443 df-3 11444 df-n0 11648 df-z 11734 df-uz 11998 df-rp 12143 df-ico 12498 df-fz 12649 df-fzo 12790 df-fl 12917 df-seq 13125 df-exp 13184 df-fac 13385 df-hash 13442 df-shft 14220 df-cj 14252 df-re 14253 df-im 14254 df-sqrt 14388 df-abs 14389 df-limsup 14619 df-clim 14636 df-rlim 14637 df-sum 14834 df-ef 15209 |
This theorem is referenced by: efgt1p2 15255 efgt1p 15256 |
Copyright terms: Public domain | W3C validator |