![]() |
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 of 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 11924 | . . . . 5 ⊢ ℕ0 = (ℤ≥‘0) | |
2 | 0zd 11591 | . . . . 5 ⊢ (𝜑 → 0 ∈ ℤ) | |
3 | effsumlt.1 | . . . . . . . 8 ⊢ 𝐹 = (𝑛 ∈ ℕ0 ↦ ((𝐴↑𝑛) / (!‘𝑛))) | |
4 | 3 | eftval 15013 | . . . . . . 7 ⊢ (𝑘 ∈ ℕ0 → (𝐹‘𝑘) = ((𝐴↑𝑘) / (!‘𝑘))) |
5 | 4 | adantl 467 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝐹‘𝑘) = ((𝐴↑𝑘) / (!‘𝑘))) |
6 | effsumlt.2 | . . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ ℝ+) | |
7 | 6 | rpred 12075 | . . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ ℝ) |
8 | reeftcl 15011 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝑘 ∈ ℕ0) → ((𝐴↑𝑘) / (!‘𝑘)) ∈ ℝ) | |
9 | 7, 8 | sylan 569 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → ((𝐴↑𝑘) / (!‘𝑘)) ∈ ℝ) |
10 | 5, 9 | eqeltrd 2850 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝐹‘𝑘) ∈ ℝ) |
11 | 1, 2, 10 | serfre 13037 | . . . 4 ⊢ (𝜑 → seq0( + , 𝐹):ℕ0⟶ℝ) |
12 | effsumlt.3 | . . . 4 ⊢ (𝜑 → 𝑁 ∈ ℕ0) | |
13 | 11, 12 | ffvelrnd 6503 | . . 3 ⊢ (𝜑 → (seq0( + , 𝐹)‘𝑁) ∈ ℝ) |
14 | eqid 2771 | . . . 4 ⊢ (ℤ≥‘(𝑁 + 1)) = (ℤ≥‘(𝑁 + 1)) | |
15 | peano2nn0 11535 | . . . . 5 ⊢ (𝑁 ∈ ℕ0 → (𝑁 + 1) ∈ ℕ0) | |
16 | 12, 15 | syl 17 | . . . 4 ⊢ (𝜑 → (𝑁 + 1) ∈ ℕ0) |
17 | eqidd 2772 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝐹‘𝑘) = (𝐹‘𝑘)) | |
18 | nn0z 11602 | . . . . . . 7 ⊢ (𝑘 ∈ ℕ0 → 𝑘 ∈ ℤ) | |
19 | rpexpcl 13086 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝑘 ∈ ℤ) → (𝐴↑𝑘) ∈ ℝ+) | |
20 | 6, 18, 19 | syl2an 583 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝐴↑𝑘) ∈ ℝ+) |
21 | faccl 13274 | . . . . . . . 8 ⊢ (𝑘 ∈ ℕ0 → (!‘𝑘) ∈ ℕ) | |
22 | 21 | adantl 467 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (!‘𝑘) ∈ ℕ) |
23 | 22 | nnrpd 12073 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (!‘𝑘) ∈ ℝ+) |
24 | 20, 23 | rpdivcld 12092 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → ((𝐴↑𝑘) / (!‘𝑘)) ∈ ℝ+) |
25 | 5, 24 | eqeltrd 2850 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝐹‘𝑘) ∈ ℝ+) |
26 | 7 | recnd 10270 | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ ℂ) |
27 | 3 | efcllem 15014 | . . . . 5 ⊢ (𝐴 ∈ ℂ → seq0( + , 𝐹) ∈ dom ⇝ ) |
28 | 26, 27 | syl 17 | . . . 4 ⊢ (𝜑 → seq0( + , 𝐹) ∈ dom ⇝ ) |
29 | 1, 14, 16, 17, 25, 28 | isumrpcl 14782 | . . 3 ⊢ (𝜑 → Σ𝑘 ∈ (ℤ≥‘(𝑁 + 1))(𝐹‘𝑘) ∈ ℝ+) |
30 | 13, 29 | ltaddrpd 12108 | . 2 ⊢ (𝜑 → (seq0( + , 𝐹)‘𝑁) < ((seq0( + , 𝐹)‘𝑁) + Σ𝑘 ∈ (ℤ≥‘(𝑁 + 1))(𝐹‘𝑘))) |
31 | 3 | efval2 15020 | . . . 4 ⊢ (𝐴 ∈ ℂ → (exp‘𝐴) = Σ𝑘 ∈ ℕ0 (𝐹‘𝑘)) |
32 | 26, 31 | syl 17 | . . 3 ⊢ (𝜑 → (exp‘𝐴) = Σ𝑘 ∈ ℕ0 (𝐹‘𝑘)) |
33 | 10 | recnd 10270 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝐹‘𝑘) ∈ ℂ) |
34 | 1, 14, 16, 17, 33, 28 | isumsplit 14779 | . . 3 ⊢ (𝜑 → Σ𝑘 ∈ ℕ0 (𝐹‘𝑘) = (Σ𝑘 ∈ (0...((𝑁 + 1) − 1))(𝐹‘𝑘) + Σ𝑘 ∈ (ℤ≥‘(𝑁 + 1))(𝐹‘𝑘))) |
35 | 12 | nn0cnd 11555 | . . . . . . . 8 ⊢ (𝜑 → 𝑁 ∈ ℂ) |
36 | ax-1cn 10196 | . . . . . . . 8 ⊢ 1 ∈ ℂ | |
37 | pncan 10489 | . . . . . . . 8 ⊢ ((𝑁 ∈ ℂ ∧ 1 ∈ ℂ) → ((𝑁 + 1) − 1) = 𝑁) | |
38 | 35, 36, 37 | sylancl 574 | . . . . . . 7 ⊢ (𝜑 → ((𝑁 + 1) − 1) = 𝑁) |
39 | 38 | oveq2d 6809 | . . . . . 6 ⊢ (𝜑 → (0...((𝑁 + 1) − 1)) = (0...𝑁)) |
40 | 39 | sumeq1d 14639 | . . . . 5 ⊢ (𝜑 → Σ𝑘 ∈ (0...((𝑁 + 1) − 1))(𝐹‘𝑘) = Σ𝑘 ∈ (0...𝑁)(𝐹‘𝑘)) |
41 | eqidd 2772 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...𝑁)) → (𝐹‘𝑘) = (𝐹‘𝑘)) | |
42 | 12, 1 | syl6eleq 2860 | . . . . . 6 ⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘0)) |
43 | elfznn0 12640 | . . . . . . 7 ⊢ (𝑘 ∈ (0...𝑁) → 𝑘 ∈ ℕ0) | |
44 | 43, 33 | sylan2 580 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...𝑁)) → (𝐹‘𝑘) ∈ ℂ) |
45 | 41, 42, 44 | fsumser 14669 | . . . . 5 ⊢ (𝜑 → Σ𝑘 ∈ (0...𝑁)(𝐹‘𝑘) = (seq0( + , 𝐹)‘𝑁)) |
46 | 40, 45 | eqtrd 2805 | . . . 4 ⊢ (𝜑 → Σ𝑘 ∈ (0...((𝑁 + 1) − 1))(𝐹‘𝑘) = (seq0( + , 𝐹)‘𝑁)) |
47 | 46 | oveq1d 6808 | . . 3 ⊢ (𝜑 → (Σ𝑘 ∈ (0...((𝑁 + 1) − 1))(𝐹‘𝑘) + Σ𝑘 ∈ (ℤ≥‘(𝑁 + 1))(𝐹‘𝑘)) = ((seq0( + , 𝐹)‘𝑁) + Σ𝑘 ∈ (ℤ≥‘(𝑁 + 1))(𝐹‘𝑘))) |
48 | 32, 34, 47 | 3eqtrd 2809 | . 2 ⊢ (𝜑 → (exp‘𝐴) = ((seq0( + , 𝐹)‘𝑁) + Σ𝑘 ∈ (ℤ≥‘(𝑁 + 1))(𝐹‘𝑘))) |
49 | 30, 48 | breqtrrd 4814 | 1 ⊢ (𝜑 → (seq0( + , 𝐹)‘𝑁) < (exp‘𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 382 = wceq 1631 ∈ wcel 2145 class class class wbr 4786 ↦ cmpt 4863 dom cdm 5249 ‘cfv 6031 (class class class)co 6793 ℂcc 10136 ℝcr 10137 0cc0 10138 1c1 10139 + caddc 10141 < clt 10276 − cmin 10468 / cdiv 10886 ℕcn 11222 ℕ0cn0 11494 ℤcz 11579 ℤ≥cuz 11888 ℝ+crp 12035 ...cfz 12533 seqcseq 13008 ↑cexp 13067 !cfa 13264 ⇝ cli 14423 Σcsu 14624 expce 14998 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1870 ax-4 1885 ax-5 1991 ax-6 2057 ax-7 2093 ax-8 2147 ax-9 2154 ax-10 2174 ax-11 2190 ax-12 2203 ax-13 2408 ax-ext 2751 ax-rep 4904 ax-sep 4915 ax-nul 4923 ax-pow 4974 ax-pr 5034 ax-un 7096 ax-inf2 8702 ax-cnex 10194 ax-resscn 10195 ax-1cn 10196 ax-icn 10197 ax-addcl 10198 ax-addrcl 10199 ax-mulcl 10200 ax-mulrcl 10201 ax-mulcom 10202 ax-addass 10203 ax-mulass 10204 ax-distr 10205 ax-i2m1 10206 ax-1ne0 10207 ax-1rid 10208 ax-rnegex 10209 ax-rrecex 10210 ax-cnre 10211 ax-pre-lttri 10212 ax-pre-lttrn 10213 ax-pre-ltadd 10214 ax-pre-mulgt0 10215 ax-pre-sup 10216 ax-addf 10217 ax-mulf 10218 |
This theorem depends on definitions: df-bi 197 df-an 383 df-or 837 df-3or 1072 df-3an 1073 df-tru 1634 df-fal 1637 df-ex 1853 df-nf 1858 df-sb 2050 df-eu 2622 df-mo 2623 df-clab 2758 df-cleq 2764 df-clel 2767 df-nfc 2902 df-ne 2944 df-nel 3047 df-ral 3066 df-rex 3067 df-reu 3068 df-rmo 3069 df-rab 3070 df-v 3353 df-sbc 3588 df-csb 3683 df-dif 3726 df-un 3728 df-in 3730 df-ss 3737 df-pss 3739 df-nul 4064 df-if 4226 df-pw 4299 df-sn 4317 df-pr 4319 df-tp 4321 df-op 4323 df-uni 4575 df-int 4612 df-iun 4656 df-br 4787 df-opab 4847 df-mpt 4864 df-tr 4887 df-id 5157 df-eprel 5162 df-po 5170 df-so 5171 df-fr 5208 df-se 5209 df-we 5210 df-xp 5255 df-rel 5256 df-cnv 5257 df-co 5258 df-dm 5259 df-rn 5260 df-res 5261 df-ima 5262 df-pred 5823 df-ord 5869 df-on 5870 df-lim 5871 df-suc 5872 df-iota 5994 df-fun 6033 df-fn 6034 df-f 6035 df-f1 6036 df-fo 6037 df-f1o 6038 df-fv 6039 df-isom 6040 df-riota 6754 df-ov 6796 df-oprab 6797 df-mpt2 6798 df-om 7213 df-1st 7315 df-2nd 7316 df-wrecs 7559 df-recs 7621 df-rdg 7659 df-1o 7713 df-oadd 7717 df-er 7896 df-pm 8012 df-en 8110 df-dom 8111 df-sdom 8112 df-fin 8113 df-sup 8504 df-inf 8505 df-oi 8571 df-card 8965 df-pnf 10278 df-mnf 10279 df-xr 10280 df-ltxr 10281 df-le 10282 df-sub 10470 df-neg 10471 df-div 10887 df-nn 11223 df-2 11281 df-3 11282 df-n0 11495 df-z 11580 df-uz 11889 df-rp 12036 df-ico 12386 df-fz 12534 df-fzo 12674 df-fl 12801 df-seq 13009 df-exp 13068 df-fac 13265 df-hash 13322 df-shft 14015 df-cj 14047 df-re 14048 df-im 14049 df-sqrt 14183 df-abs 14184 df-limsup 14410 df-clim 14427 df-rlim 14428 df-sum 14625 df-ef 15004 |
This theorem is referenced by: efgt1p2 15050 efgt1p 15051 |
Copyright terms: Public domain | W3C validator |