| 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 12817 | . . . . 5 ⊢ ℕ0 = (ℤ≥‘0) | |
| 2 | 0zd 12527 | . . . . 5 ⊢ (𝜑 → 0 ∈ ℤ) | |
| 3 | effsumlt.1 | . . . . . . . 8 ⊢ 𝐹 = (𝑛 ∈ ℕ0 ↦ ((𝐴↑𝑛) / (!‘𝑛))) | |
| 4 | 3 | eftval 16032 | . . . . . . 7 ⊢ (𝑘 ∈ ℕ0 → (𝐹‘𝑘) = ((𝐴↑𝑘) / (!‘𝑘))) |
| 5 | 4 | adantl 482 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝐹‘𝑘) = ((𝐴↑𝑘) / (!‘𝑘))) |
| 6 | effsumlt.2 | . . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ ℝ+) | |
| 7 | 6 | rpred 12977 | . . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ ℝ) |
| 8 | reeftcl 16030 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝑘 ∈ ℕ0) → ((𝐴↑𝑘) / (!‘𝑘)) ∈ ℝ) | |
| 9 | 7, 8 | sylan 586 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → ((𝐴↑𝑘) / (!‘𝑘)) ∈ ℝ) |
| 10 | 5, 9 | eqeltrd 2839 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝐹‘𝑘) ∈ ℝ) |
| 11 | 1, 2, 10 | serfre 13984 | . . . 4 ⊢ (𝜑 → seq0( + , 𝐹):ℕ0⟶ℝ) |
| 12 | effsumlt.3 | . . . 4 ⊢ (𝜑 → 𝑁 ∈ ℕ0) | |
| 13 | 11, 12 | ffvelcdmd 7026 | . . 3 ⊢ (𝜑 → (seq0( + , 𝐹)‘𝑁) ∈ ℝ) |
| 14 | eqid 2739 | . . . 4 ⊢ (ℤ≥‘(𝑁 + 1)) = (ℤ≥‘(𝑁 + 1)) | |
| 15 | peano2nn0 12468 | . . . . 5 ⊢ (𝑁 ∈ ℕ0 → (𝑁 + 1) ∈ ℕ0) | |
| 16 | 12, 15 | syl 17 | . . . 4 ⊢ (𝜑 → (𝑁 + 1) ∈ ℕ0) |
| 17 | eqidd 2740 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝐹‘𝑘) = (𝐹‘𝑘)) | |
| 18 | nn0z 12539 | . . . . . . 7 ⊢ (𝑘 ∈ ℕ0 → 𝑘 ∈ ℤ) | |
| 19 | rpexpcl 14033 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝑘 ∈ ℤ) → (𝐴↑𝑘) ∈ ℝ+) | |
| 20 | 6, 18, 19 | syl2an 602 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝐴↑𝑘) ∈ ℝ+) |
| 21 | faccl 14236 | . . . . . . . 8 ⊢ (𝑘 ∈ ℕ0 → (!‘𝑘) ∈ ℕ) | |
| 22 | 21 | adantl 482 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (!‘𝑘) ∈ ℕ) |
| 23 | 22 | nnrpd 12975 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (!‘𝑘) ∈ ℝ+) |
| 24 | 20, 23 | rpdivcld 12994 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → ((𝐴↑𝑘) / (!‘𝑘)) ∈ ℝ+) |
| 25 | 5, 24 | eqeltrd 2839 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝐹‘𝑘) ∈ ℝ+) |
| 26 | 7 | recnd 11164 | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ ℂ) |
| 27 | 3 | efcllem 16033 | . . . . 5 ⊢ (𝐴 ∈ ℂ → seq0( + , 𝐹) ∈ dom ⇝ ) |
| 28 | 26, 27 | syl 17 | . . . 4 ⊢ (𝜑 → seq0( + , 𝐹) ∈ dom ⇝ ) |
| 29 | 1, 14, 16, 17, 25, 28 | isumrpcl 15799 | . . 3 ⊢ (𝜑 → Σ𝑘 ∈ (ℤ≥‘(𝑁 + 1))(𝐹‘𝑘) ∈ ℝ+) |
| 30 | 13, 29 | ltaddrpd 13010 | . 2 ⊢ (𝜑 → (seq0( + , 𝐹)‘𝑁) < ((seq0( + , 𝐹)‘𝑁) + Σ𝑘 ∈ (ℤ≥‘(𝑁 + 1))(𝐹‘𝑘))) |
| 31 | 3 | efval2 16040 | . . . 4 ⊢ (𝐴 ∈ ℂ → (exp‘𝐴) = Σ𝑘 ∈ ℕ0 (𝐹‘𝑘)) |
| 32 | 26, 31 | syl 17 | . . 3 ⊢ (𝜑 → (exp‘𝐴) = Σ𝑘 ∈ ℕ0 (𝐹‘𝑘)) |
| 33 | 10 | recnd 11164 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝐹‘𝑘) ∈ ℂ) |
| 34 | 1, 14, 16, 17, 33, 28 | isumsplit 15796 | . . 3 ⊢ (𝜑 → Σ𝑘 ∈ ℕ0 (𝐹‘𝑘) = (Σ𝑘 ∈ (0...((𝑁 + 1) − 1))(𝐹‘𝑘) + Σ𝑘 ∈ (ℤ≥‘(𝑁 + 1))(𝐹‘𝑘))) |
| 35 | 12 | nn0cnd 12491 | . . . . . . . 8 ⊢ (𝜑 → 𝑁 ∈ ℂ) |
| 36 | ax-1cn 11087 | . . . . . . . 8 ⊢ 1 ∈ ℂ | |
| 37 | pncan 11390 | . . . . . . . 8 ⊢ ((𝑁 ∈ ℂ ∧ 1 ∈ ℂ) → ((𝑁 + 1) − 1) = 𝑁) | |
| 38 | 35, 36, 37 | sylancl 592 | . . . . . . 7 ⊢ (𝜑 → ((𝑁 + 1) − 1) = 𝑁) |
| 39 | 38 | oveq2d 7372 | . . . . . 6 ⊢ (𝜑 → (0...((𝑁 + 1) − 1)) = (0...𝑁)) |
| 40 | 39 | sumeq1d 15653 | . . . . 5 ⊢ (𝜑 → Σ𝑘 ∈ (0...((𝑁 + 1) − 1))(𝐹‘𝑘) = Σ𝑘 ∈ (0...𝑁)(𝐹‘𝑘)) |
| 41 | eqidd 2740 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...𝑁)) → (𝐹‘𝑘) = (𝐹‘𝑘)) | |
| 42 | 12, 1 | eleqtrdi 2849 | . . . . . 6 ⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘0)) |
| 43 | elfznn0 13565 | . . . . . . 7 ⊢ (𝑘 ∈ (0...𝑁) → 𝑘 ∈ ℕ0) | |
| 44 | 43, 33 | sylan2 599 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...𝑁)) → (𝐹‘𝑘) ∈ ℂ) |
| 45 | 41, 42, 44 | fsumser 15683 | . . . . 5 ⊢ (𝜑 → Σ𝑘 ∈ (0...𝑁)(𝐹‘𝑘) = (seq0( + , 𝐹)‘𝑁)) |
| 46 | 40, 45 | eqtrd 2774 | . . . 4 ⊢ (𝜑 → Σ𝑘 ∈ (0...((𝑁 + 1) − 1))(𝐹‘𝑘) = (seq0( + , 𝐹)‘𝑁)) |
| 47 | 46 | oveq1d 7371 | . . 3 ⊢ (𝜑 → (Σ𝑘 ∈ (0...((𝑁 + 1) − 1))(𝐹‘𝑘) + Σ𝑘 ∈ (ℤ≥‘(𝑁 + 1))(𝐹‘𝑘)) = ((seq0( + , 𝐹)‘𝑁) + Σ𝑘 ∈ (ℤ≥‘(𝑁 + 1))(𝐹‘𝑘))) |
| 48 | 32, 34, 47 | 3eqtrd 2778 | . 2 ⊢ (𝜑 → (exp‘𝐴) = ((seq0( + , 𝐹)‘𝑁) + Σ𝑘 ∈ (ℤ≥‘(𝑁 + 1))(𝐹‘𝑘))) |
| 49 | 30, 48 | breqtrrd 5100 | 1 ⊢ (𝜑 → (seq0( + , 𝐹)‘𝑁) < (exp‘𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 396 = wceq 1547 ∈ wcel 2119 class class class wbr 5072 ↦ cmpt 5153 dom cdm 5618 ‘cfv 6485 (class class class)co 7356 ℂcc 11027 ℝcr 11028 0cc0 11029 1c1 11030 + caddc 11032 < clt 11170 − cmin 11368 / cdiv 11798 ℕcn 12165 ℕ0cn0 12428 ℤcz 12515 ℤ≥cuz 12779 ℝ+crp 12933 ...cfz 13452 seqcseq 13954 ↑cexp 14014 !cfa 14226 ⇝ cli 15437 Σcsu 15639 expce 16017 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2711 ax-rep 5199 ax-sep 5218 ax-nul 5228 ax-pow 5294 ax-pr 5362 ax-un 7678 ax-inf2 9553 ax-cnex 11085 ax-resscn 11086 ax-1cn 11087 ax-icn 11088 ax-addcl 11089 ax-addrcl 11090 ax-mulcl 11091 ax-mulrcl 11092 ax-mulcom 11093 ax-addass 11094 ax-mulass 11095 ax-distr 11096 ax-i2m1 11097 ax-1ne0 11098 ax-1rid 11099 ax-rnegex 11100 ax-rrecex 11101 ax-cnre 11102 ax-pre-lttri 11103 ax-pre-lttrn 11104 ax-pre-ltadd 11105 ax-pre-mulgt0 11106 ax-pre-sup 11107 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2718 df-cleq 2731 df-clel 2814 df-nfc 2888 df-ne 2935 df-nel 3039 df-ral 3054 df-rex 3064 df-rmo 3344 df-reu 3345 df-rab 3392 df-v 3433 df-sbc 3724 df-csb 3832 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3903 df-nul 4262 df-if 4455 df-pw 4531 df-sn 4556 df-pr 4558 df-op 4562 df-uni 4839 df-int 4878 df-iun 4923 df-br 5073 df-opab 5135 df-mpt 5154 df-tr 5180 df-id 5513 df-eprel 5518 df-po 5526 df-so 5527 df-fr 5571 df-se 5572 df-we 5573 df-xp 5624 df-rel 5625 df-cnv 5626 df-co 5627 df-dm 5628 df-rn 5629 df-res 5630 df-ima 5631 df-pred 6252 df-ord 6313 df-on 6314 df-lim 6315 df-suc 6316 df-iota 6441 df-fun 6487 df-fn 6488 df-f 6489 df-f1 6490 df-fo 6491 df-f1o 6492 df-fv 6493 df-isom 6494 df-riota 7313 df-ov 7359 df-oprab 7360 df-mpo 7361 df-om 7807 df-1st 7931 df-2nd 7932 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-1o 8395 df-er 8633 df-pm 8766 df-en 8884 df-dom 8885 df-sdom 8886 df-fin 8887 df-sup 9345 df-inf 9346 df-oi 9415 df-card 9854 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-div 11799 df-nn 12166 df-2 12235 df-3 12236 df-n0 12429 df-z 12516 df-uz 12780 df-rp 12934 df-ico 13295 df-fz 13453 df-fzo 13600 df-fl 13742 df-seq 13955 df-exp 14015 df-fac 14227 df-hash 14284 df-shft 15020 df-cj 15052 df-re 15053 df-im 15054 df-sqrt 15188 df-abs 15189 df-limsup 15424 df-clim 15441 df-rlim 15442 df-sum 15640 df-ef 16023 |
| This theorem is referenced by: efgt1p2 16072 efgt1p 16073 |
| Copyright terms: Public domain | W3C validator |