| 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 12826 | . . . . 5 ⊢ ℕ0 = (ℤ≥‘0) | |
| 2 | 0zd 12536 | . . . . 5 ⊢ (𝜑 → 0 ∈ ℤ) | |
| 3 | effsumlt.1 | . . . . . . . 8 ⊢ 𝐹 = (𝑛 ∈ ℕ0 ↦ ((𝐴↑𝑛) / (!‘𝑛))) | |
| 4 | 3 | eftval 16041 | . . . . . . 7 ⊢ (𝑘 ∈ ℕ0 → (𝐹‘𝑘) = ((𝐴↑𝑘) / (!‘𝑘))) |
| 5 | 4 | adantl 481 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝐹‘𝑘) = ((𝐴↑𝑘) / (!‘𝑘))) |
| 6 | effsumlt.2 | . . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ ℝ+) | |
| 7 | 6 | rpred 12986 | . . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ ℝ) |
| 8 | reeftcl 16039 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝑘 ∈ ℕ0) → ((𝐴↑𝑘) / (!‘𝑘)) ∈ ℝ) | |
| 9 | 7, 8 | sylan 581 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → ((𝐴↑𝑘) / (!‘𝑘)) ∈ ℝ) |
| 10 | 5, 9 | eqeltrd 2836 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝐹‘𝑘) ∈ ℝ) |
| 11 | 1, 2, 10 | serfre 13993 | . . . 4 ⊢ (𝜑 → seq0( + , 𝐹):ℕ0⟶ℝ) |
| 12 | effsumlt.3 | . . . 4 ⊢ (𝜑 → 𝑁 ∈ ℕ0) | |
| 13 | 11, 12 | ffvelcdmd 7037 | . . 3 ⊢ (𝜑 → (seq0( + , 𝐹)‘𝑁) ∈ ℝ) |
| 14 | eqid 2736 | . . . 4 ⊢ (ℤ≥‘(𝑁 + 1)) = (ℤ≥‘(𝑁 + 1)) | |
| 15 | peano2nn0 12477 | . . . . 5 ⊢ (𝑁 ∈ ℕ0 → (𝑁 + 1) ∈ ℕ0) | |
| 16 | 12, 15 | syl 17 | . . . 4 ⊢ (𝜑 → (𝑁 + 1) ∈ ℕ0) |
| 17 | eqidd 2737 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝐹‘𝑘) = (𝐹‘𝑘)) | |
| 18 | nn0z 12548 | . . . . . . 7 ⊢ (𝑘 ∈ ℕ0 → 𝑘 ∈ ℤ) | |
| 19 | rpexpcl 14042 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝑘 ∈ ℤ) → (𝐴↑𝑘) ∈ ℝ+) | |
| 20 | 6, 18, 19 | syl2an 597 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝐴↑𝑘) ∈ ℝ+) |
| 21 | faccl 14245 | . . . . . . . 8 ⊢ (𝑘 ∈ ℕ0 → (!‘𝑘) ∈ ℕ) | |
| 22 | 21 | adantl 481 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (!‘𝑘) ∈ ℕ) |
| 23 | 22 | nnrpd 12984 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (!‘𝑘) ∈ ℝ+) |
| 24 | 20, 23 | rpdivcld 13003 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → ((𝐴↑𝑘) / (!‘𝑘)) ∈ ℝ+) |
| 25 | 5, 24 | eqeltrd 2836 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝐹‘𝑘) ∈ ℝ+) |
| 26 | 7 | recnd 11173 | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ ℂ) |
| 27 | 3 | efcllem 16042 | . . . . 5 ⊢ (𝐴 ∈ ℂ → seq0( + , 𝐹) ∈ dom ⇝ ) |
| 28 | 26, 27 | syl 17 | . . . 4 ⊢ (𝜑 → seq0( + , 𝐹) ∈ dom ⇝ ) |
| 29 | 1, 14, 16, 17, 25, 28 | isumrpcl 15808 | . . 3 ⊢ (𝜑 → Σ𝑘 ∈ (ℤ≥‘(𝑁 + 1))(𝐹‘𝑘) ∈ ℝ+) |
| 30 | 13, 29 | ltaddrpd 13019 | . 2 ⊢ (𝜑 → (seq0( + , 𝐹)‘𝑁) < ((seq0( + , 𝐹)‘𝑁) + Σ𝑘 ∈ (ℤ≥‘(𝑁 + 1))(𝐹‘𝑘))) |
| 31 | 3 | efval2 16049 | . . . 4 ⊢ (𝐴 ∈ ℂ → (exp‘𝐴) = Σ𝑘 ∈ ℕ0 (𝐹‘𝑘)) |
| 32 | 26, 31 | syl 17 | . . 3 ⊢ (𝜑 → (exp‘𝐴) = Σ𝑘 ∈ ℕ0 (𝐹‘𝑘)) |
| 33 | 10 | recnd 11173 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝐹‘𝑘) ∈ ℂ) |
| 34 | 1, 14, 16, 17, 33, 28 | isumsplit 15805 | . . 3 ⊢ (𝜑 → Σ𝑘 ∈ ℕ0 (𝐹‘𝑘) = (Σ𝑘 ∈ (0...((𝑁 + 1) − 1))(𝐹‘𝑘) + Σ𝑘 ∈ (ℤ≥‘(𝑁 + 1))(𝐹‘𝑘))) |
| 35 | 12 | nn0cnd 12500 | . . . . . . . 8 ⊢ (𝜑 → 𝑁 ∈ ℂ) |
| 36 | ax-1cn 11096 | . . . . . . . 8 ⊢ 1 ∈ ℂ | |
| 37 | pncan 11399 | . . . . . . . 8 ⊢ ((𝑁 ∈ ℂ ∧ 1 ∈ ℂ) → ((𝑁 + 1) − 1) = 𝑁) | |
| 38 | 35, 36, 37 | sylancl 587 | . . . . . . 7 ⊢ (𝜑 → ((𝑁 + 1) − 1) = 𝑁) |
| 39 | 38 | oveq2d 7383 | . . . . . 6 ⊢ (𝜑 → (0...((𝑁 + 1) − 1)) = (0...𝑁)) |
| 40 | 39 | sumeq1d 15662 | . . . . 5 ⊢ (𝜑 → Σ𝑘 ∈ (0...((𝑁 + 1) − 1))(𝐹‘𝑘) = Σ𝑘 ∈ (0...𝑁)(𝐹‘𝑘)) |
| 41 | eqidd 2737 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...𝑁)) → (𝐹‘𝑘) = (𝐹‘𝑘)) | |
| 42 | 12, 1 | eleqtrdi 2846 | . . . . . 6 ⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘0)) |
| 43 | elfznn0 13574 | . . . . . . 7 ⊢ (𝑘 ∈ (0...𝑁) → 𝑘 ∈ ℕ0) | |
| 44 | 43, 33 | sylan2 594 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...𝑁)) → (𝐹‘𝑘) ∈ ℂ) |
| 45 | 41, 42, 44 | fsumser 15692 | . . . . 5 ⊢ (𝜑 → Σ𝑘 ∈ (0...𝑁)(𝐹‘𝑘) = (seq0( + , 𝐹)‘𝑁)) |
| 46 | 40, 45 | eqtrd 2771 | . . . 4 ⊢ (𝜑 → Σ𝑘 ∈ (0...((𝑁 + 1) − 1))(𝐹‘𝑘) = (seq0( + , 𝐹)‘𝑁)) |
| 47 | 46 | oveq1d 7382 | . . 3 ⊢ (𝜑 → (Σ𝑘 ∈ (0...((𝑁 + 1) − 1))(𝐹‘𝑘) + Σ𝑘 ∈ (ℤ≥‘(𝑁 + 1))(𝐹‘𝑘)) = ((seq0( + , 𝐹)‘𝑁) + Σ𝑘 ∈ (ℤ≥‘(𝑁 + 1))(𝐹‘𝑘))) |
| 48 | 32, 34, 47 | 3eqtrd 2775 | . 2 ⊢ (𝜑 → (exp‘𝐴) = ((seq0( + , 𝐹)‘𝑁) + Σ𝑘 ∈ (ℤ≥‘(𝑁 + 1))(𝐹‘𝑘))) |
| 49 | 30, 48 | breqtrrd 5113 | 1 ⊢ (𝜑 → (seq0( + , 𝐹)‘𝑁) < (exp‘𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 class class class wbr 5085 ↦ cmpt 5166 dom cdm 5631 ‘cfv 6498 (class class class)co 7367 ℂcc 11036 ℝcr 11037 0cc0 11038 1c1 11039 + caddc 11041 < clt 11179 − cmin 11377 / cdiv 11807 ℕcn 12174 ℕ0cn0 12437 ℤcz 12524 ℤ≥cuz 12788 ℝ+crp 12942 ...cfz 13461 seqcseq 13963 ↑cexp 14023 !cfa 14235 ⇝ cli 15446 Σcsu 15648 expce 16026 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 ax-inf2 9562 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 ax-pre-sup 11116 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3062 df-rmo 3342 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-pss 3909 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-int 4890 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-tr 5193 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-se 5585 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6265 df-ord 6326 df-on 6327 df-lim 6328 df-suc 6329 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-isom 6507 df-riota 7324 df-ov 7370 df-oprab 7371 df-mpo 7372 df-om 7818 df-1st 7942 df-2nd 7943 df-frecs 8231 df-wrecs 8262 df-recs 8311 df-rdg 8349 df-1o 8405 df-er 8643 df-pm 8776 df-en 8894 df-dom 8895 df-sdom 8896 df-fin 8897 df-sup 9355 df-inf 9356 df-oi 9425 df-card 9863 df-pnf 11181 df-mnf 11182 df-xr 11183 df-ltxr 11184 df-le 11185 df-sub 11379 df-neg 11380 df-div 11808 df-nn 12175 df-2 12244 df-3 12245 df-n0 12438 df-z 12525 df-uz 12789 df-rp 12943 df-ico 13304 df-fz 13462 df-fzo 13609 df-fl 13751 df-seq 13964 df-exp 14024 df-fac 14236 df-hash 14293 df-shft 15029 df-cj 15061 df-re 15062 df-im 15063 df-sqrt 15197 df-abs 15198 df-limsup 15433 df-clim 15450 df-rlim 15451 df-sum 15649 df-ef 16032 |
| This theorem is referenced by: efgt1p2 16081 efgt1p 16082 |
| Copyright terms: Public domain | W3C validator |