| 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 12789 | . . . . 5 ⊢ ℕ0 = (ℤ≥‘0) | |
| 2 | 0zd 12500 | . . . . 5 ⊢ (𝜑 → 0 ∈ ℤ) | |
| 3 | effsumlt.1 | . . . . . . . 8 ⊢ 𝐹 = (𝑛 ∈ ℕ0 ↦ ((𝐴↑𝑛) / (!‘𝑛))) | |
| 4 | 3 | eftval 15999 | . . . . . . 7 ⊢ (𝑘 ∈ ℕ0 → (𝐹‘𝑘) = ((𝐴↑𝑘) / (!‘𝑘))) |
| 5 | 4 | adantl 481 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝐹‘𝑘) = ((𝐴↑𝑘) / (!‘𝑘))) |
| 6 | effsumlt.2 | . . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ ℝ+) | |
| 7 | 6 | rpred 12949 | . . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ ℝ) |
| 8 | reeftcl 15997 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝑘 ∈ ℕ0) → ((𝐴↑𝑘) / (!‘𝑘)) ∈ ℝ) | |
| 9 | 7, 8 | sylan 580 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → ((𝐴↑𝑘) / (!‘𝑘)) ∈ ℝ) |
| 10 | 5, 9 | eqeltrd 2836 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝐹‘𝑘) ∈ ℝ) |
| 11 | 1, 2, 10 | serfre 13954 | . . . 4 ⊢ (𝜑 → seq0( + , 𝐹):ℕ0⟶ℝ) |
| 12 | effsumlt.3 | . . . 4 ⊢ (𝜑 → 𝑁 ∈ ℕ0) | |
| 13 | 11, 12 | ffvelcdmd 7030 | . . 3 ⊢ (𝜑 → (seq0( + , 𝐹)‘𝑁) ∈ ℝ) |
| 14 | eqid 2736 | . . . 4 ⊢ (ℤ≥‘(𝑁 + 1)) = (ℤ≥‘(𝑁 + 1)) | |
| 15 | peano2nn0 12441 | . . . . 5 ⊢ (𝑁 ∈ ℕ0 → (𝑁 + 1) ∈ ℕ0) | |
| 16 | 12, 15 | syl 17 | . . . 4 ⊢ (𝜑 → (𝑁 + 1) ∈ ℕ0) |
| 17 | eqidd 2737 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝐹‘𝑘) = (𝐹‘𝑘)) | |
| 18 | nn0z 12512 | . . . . . . 7 ⊢ (𝑘 ∈ ℕ0 → 𝑘 ∈ ℤ) | |
| 19 | rpexpcl 14003 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝑘 ∈ ℤ) → (𝐴↑𝑘) ∈ ℝ+) | |
| 20 | 6, 18, 19 | syl2an 596 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝐴↑𝑘) ∈ ℝ+) |
| 21 | faccl 14206 | . . . . . . . 8 ⊢ (𝑘 ∈ ℕ0 → (!‘𝑘) ∈ ℕ) | |
| 22 | 21 | adantl 481 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (!‘𝑘) ∈ ℕ) |
| 23 | 22 | nnrpd 12947 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (!‘𝑘) ∈ ℝ+) |
| 24 | 20, 23 | rpdivcld 12966 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → ((𝐴↑𝑘) / (!‘𝑘)) ∈ ℝ+) |
| 25 | 5, 24 | eqeltrd 2836 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝐹‘𝑘) ∈ ℝ+) |
| 26 | 7 | recnd 11160 | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ ℂ) |
| 27 | 3 | efcllem 16000 | . . . . 5 ⊢ (𝐴 ∈ ℂ → seq0( + , 𝐹) ∈ dom ⇝ ) |
| 28 | 26, 27 | syl 17 | . . . 4 ⊢ (𝜑 → seq0( + , 𝐹) ∈ dom ⇝ ) |
| 29 | 1, 14, 16, 17, 25, 28 | isumrpcl 15766 | . . 3 ⊢ (𝜑 → Σ𝑘 ∈ (ℤ≥‘(𝑁 + 1))(𝐹‘𝑘) ∈ ℝ+) |
| 30 | 13, 29 | ltaddrpd 12982 | . 2 ⊢ (𝜑 → (seq0( + , 𝐹)‘𝑁) < ((seq0( + , 𝐹)‘𝑁) + Σ𝑘 ∈ (ℤ≥‘(𝑁 + 1))(𝐹‘𝑘))) |
| 31 | 3 | efval2 16007 | . . . 4 ⊢ (𝐴 ∈ ℂ → (exp‘𝐴) = Σ𝑘 ∈ ℕ0 (𝐹‘𝑘)) |
| 32 | 26, 31 | syl 17 | . . 3 ⊢ (𝜑 → (exp‘𝐴) = Σ𝑘 ∈ ℕ0 (𝐹‘𝑘)) |
| 33 | 10 | recnd 11160 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ0) → (𝐹‘𝑘) ∈ ℂ) |
| 34 | 1, 14, 16, 17, 33, 28 | isumsplit 15763 | . . 3 ⊢ (𝜑 → Σ𝑘 ∈ ℕ0 (𝐹‘𝑘) = (Σ𝑘 ∈ (0...((𝑁 + 1) − 1))(𝐹‘𝑘) + Σ𝑘 ∈ (ℤ≥‘(𝑁 + 1))(𝐹‘𝑘))) |
| 35 | 12 | nn0cnd 12464 | . . . . . . . 8 ⊢ (𝜑 → 𝑁 ∈ ℂ) |
| 36 | ax-1cn 11084 | . . . . . . . 8 ⊢ 1 ∈ ℂ | |
| 37 | pncan 11386 | . . . . . . . 8 ⊢ ((𝑁 ∈ ℂ ∧ 1 ∈ ℂ) → ((𝑁 + 1) − 1) = 𝑁) | |
| 38 | 35, 36, 37 | sylancl 586 | . . . . . . 7 ⊢ (𝜑 → ((𝑁 + 1) − 1) = 𝑁) |
| 39 | 38 | oveq2d 7374 | . . . . . 6 ⊢ (𝜑 → (0...((𝑁 + 1) − 1)) = (0...𝑁)) |
| 40 | 39 | sumeq1d 15623 | . . . . 5 ⊢ (𝜑 → Σ𝑘 ∈ (0...((𝑁 + 1) − 1))(𝐹‘𝑘) = Σ𝑘 ∈ (0...𝑁)(𝐹‘𝑘)) |
| 41 | eqidd 2737 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...𝑁)) → (𝐹‘𝑘) = (𝐹‘𝑘)) | |
| 42 | 12, 1 | eleqtrdi 2846 | . . . . . 6 ⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘0)) |
| 43 | elfznn0 13536 | . . . . . . 7 ⊢ (𝑘 ∈ (0...𝑁) → 𝑘 ∈ ℕ0) | |
| 44 | 43, 33 | sylan2 593 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...𝑁)) → (𝐹‘𝑘) ∈ ℂ) |
| 45 | 41, 42, 44 | fsumser 15653 | . . . . 5 ⊢ (𝜑 → Σ𝑘 ∈ (0...𝑁)(𝐹‘𝑘) = (seq0( + , 𝐹)‘𝑁)) |
| 46 | 40, 45 | eqtrd 2771 | . . . 4 ⊢ (𝜑 → Σ𝑘 ∈ (0...((𝑁 + 1) − 1))(𝐹‘𝑘) = (seq0( + , 𝐹)‘𝑁)) |
| 47 | 46 | oveq1d 7373 | . . 3 ⊢ (𝜑 → (Σ𝑘 ∈ (0...((𝑁 + 1) − 1))(𝐹‘𝑘) + Σ𝑘 ∈ (ℤ≥‘(𝑁 + 1))(𝐹‘𝑘)) = ((seq0( + , 𝐹)‘𝑁) + Σ𝑘 ∈ (ℤ≥‘(𝑁 + 1))(𝐹‘𝑘))) |
| 48 | 32, 34, 47 | 3eqtrd 2775 | . 2 ⊢ (𝜑 → (exp‘𝐴) = ((seq0( + , 𝐹)‘𝑁) + Σ𝑘 ∈ (ℤ≥‘(𝑁 + 1))(𝐹‘𝑘))) |
| 49 | 30, 48 | breqtrrd 5126 | 1 ⊢ (𝜑 → (seq0( + , 𝐹)‘𝑁) < (exp‘𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2113 class class class wbr 5098 ↦ cmpt 5179 dom cdm 5624 ‘cfv 6492 (class class class)co 7358 ℂcc 11024 ℝcr 11025 0cc0 11026 1c1 11027 + caddc 11029 < clt 11166 − cmin 11364 / cdiv 11794 ℕcn 12145 ℕ0cn0 12401 ℤcz 12488 ℤ≥cuz 12751 ℝ+crp 12905 ...cfz 13423 seqcseq 13924 ↑cexp 13984 !cfa 14196 ⇝ cli 15407 Σcsu 15609 expce 15984 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-rep 5224 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-inf2 9550 ax-cnex 11082 ax-resscn 11083 ax-1cn 11084 ax-icn 11085 ax-addcl 11086 ax-addrcl 11087 ax-mulcl 11088 ax-mulrcl 11089 ax-mulcom 11090 ax-addass 11091 ax-mulass 11092 ax-distr 11093 ax-i2m1 11094 ax-1ne0 11095 ax-1rid 11096 ax-rnegex 11097 ax-rrecex 11098 ax-cnre 11099 ax-pre-lttri 11100 ax-pre-lttrn 11101 ax-pre-ltadd 11102 ax-pre-mulgt0 11103 ax-pre-sup 11104 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 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 3061 df-rmo 3350 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-int 4903 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-se 5578 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-isom 6501 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-1st 7933 df-2nd 7934 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-1o 8397 df-er 8635 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 9851 df-pnf 11168 df-mnf 11169 df-xr 11170 df-ltxr 11171 df-le 11172 df-sub 11366 df-neg 11367 df-div 11795 df-nn 12146 df-2 12208 df-3 12209 df-n0 12402 df-z 12489 df-uz 12752 df-rp 12906 df-ico 13267 df-fz 13424 df-fzo 13571 df-fl 13712 df-seq 13925 df-exp 13985 df-fac 14197 df-hash 14254 df-shft 14990 df-cj 15022 df-re 15023 df-im 15024 df-sqrt 15158 df-abs 15159 df-limsup 15394 df-clim 15411 df-rlim 15412 df-sum 15610 df-ef 15990 |
| This theorem is referenced by: efgt1p2 16039 efgt1p 16040 |
| Copyright terms: Public domain | W3C validator |