| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > efgt1p2 | Structured version Visualization version GIF version | ||
| Description: The exponential of a positive real number is greater than the sum of the first three terms of the series expansion. (Contributed by Mario Carneiro, 15-Sep-2014.) |
| Ref | Expression |
|---|---|
| efgt1p2 | ⊢ (𝐴 ∈ ℝ+ → ((1 + 𝐴) + ((𝐴↑2) / 2)) < (exp‘𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nn0uz 12906 | . . 3 ⊢ ℕ0 = (ℤ≥‘0) | |
| 2 | 1nn0 12526 | . . . 4 ⊢ 1 ∈ ℕ0 | |
| 3 | 2 | a1i 11 | . . 3 ⊢ (𝐴 ∈ ℝ+ → 1 ∈ ℕ0) |
| 4 | df-2 12309 | . . 3 ⊢ 2 = (1 + 1) | |
| 5 | rpcn 13033 | . . . 4 ⊢ (𝐴 ∈ ℝ+ → 𝐴 ∈ ℂ) | |
| 6 | 0nn0 12525 | . . . . . 6 ⊢ 0 ∈ ℕ0 | |
| 7 | 6 | a1i 11 | . . . . 5 ⊢ (𝐴 ∈ ℂ → 0 ∈ ℕ0) |
| 8 | 1e0p1 12764 | . . . . 5 ⊢ 1 = (0 + 1) | |
| 9 | 0z 12608 | . . . . . 6 ⊢ 0 ∈ ℤ | |
| 10 | eqid 2762 | . . . . . . . . 9 ⊢ (𝑛 ∈ ℕ0 ↦ ((𝐴↑𝑛) / (!‘𝑛))) = (𝑛 ∈ ℕ0 ↦ ((𝐴↑𝑛) / (!‘𝑛))) | |
| 11 | 10 | eftval 16136 | . . . . . . . 8 ⊢ (0 ∈ ℕ0 → ((𝑛 ∈ ℕ0 ↦ ((𝐴↑𝑛) / (!‘𝑛)))‘0) = ((𝐴↑0) / (!‘0))) |
| 12 | 6, 11 | ax-mp 5 | . . . . . . 7 ⊢ ((𝑛 ∈ ℕ0 ↦ ((𝐴↑𝑛) / (!‘𝑛)))‘0) = ((𝐴↑0) / (!‘0)) |
| 13 | eft0val 16174 | . . . . . . 7 ⊢ (𝐴 ∈ ℂ → ((𝐴↑0) / (!‘0)) = 1) | |
| 14 | 12, 13 | eqtrid 2809 | . . . . . 6 ⊢ (𝐴 ∈ ℂ → ((𝑛 ∈ ℕ0 ↦ ((𝐴↑𝑛) / (!‘𝑛)))‘0) = 1) |
| 15 | 9, 14 | seq1i 14058 | . . . . 5 ⊢ (𝐴 ∈ ℂ → (seq0( + , (𝑛 ∈ ℕ0 ↦ ((𝐴↑𝑛) / (!‘𝑛))))‘0) = 1) |
| 16 | 10 | eftval 16136 | . . . . . . 7 ⊢ (1 ∈ ℕ0 → ((𝑛 ∈ ℕ0 ↦ ((𝐴↑𝑛) / (!‘𝑛)))‘1) = ((𝐴↑1) / (!‘1))) |
| 17 | 2, 16 | ax-mp 5 | . . . . . 6 ⊢ ((𝑛 ∈ ℕ0 ↦ ((𝐴↑𝑛) / (!‘𝑛)))‘1) = ((𝐴↑1) / (!‘1)) |
| 18 | fac1 14320 | . . . . . . . 8 ⊢ (!‘1) = 1 | |
| 19 | 18 | oveq2i 7423 | . . . . . . 7 ⊢ ((𝐴↑1) / (!‘1)) = ((𝐴↑1) / 1) |
| 20 | exp1 14110 | . . . . . . . . 9 ⊢ (𝐴 ∈ ℂ → (𝐴↑1) = 𝐴) | |
| 21 | 20 | oveq1d 7427 | . . . . . . . 8 ⊢ (𝐴 ∈ ℂ → ((𝐴↑1) / 1) = (𝐴 / 1)) |
| 22 | div1 11910 | . . . . . . . 8 ⊢ (𝐴 ∈ ℂ → (𝐴 / 1) = 𝐴) | |
| 23 | 21, 22 | eqtrd 2797 | . . . . . . 7 ⊢ (𝐴 ∈ ℂ → ((𝐴↑1) / 1) = 𝐴) |
| 24 | 19, 23 | eqtrid 2809 | . . . . . 6 ⊢ (𝐴 ∈ ℂ → ((𝐴↑1) / (!‘1)) = 𝐴) |
| 25 | 17, 24 | eqtrid 2809 | . . . . 5 ⊢ (𝐴 ∈ ℂ → ((𝑛 ∈ ℕ0 ↦ ((𝐴↑𝑛) / (!‘𝑛)))‘1) = 𝐴) |
| 26 | 1, 7, 8, 15, 25 | seqp1d 14061 | . . . 4 ⊢ (𝐴 ∈ ℂ → (seq0( + , (𝑛 ∈ ℕ0 ↦ ((𝐴↑𝑛) / (!‘𝑛))))‘1) = (1 + 𝐴)) |
| 27 | 5, 26 | syl 18 | . . 3 ⊢ (𝐴 ∈ ℝ+ → (seq0( + , (𝑛 ∈ ℕ0 ↦ ((𝐴↑𝑛) / (!‘𝑛))))‘1) = (1 + 𝐴)) |
| 28 | 2nn0 12527 | . . . . . 6 ⊢ 2 ∈ ℕ0 | |
| 29 | 10 | eftval 16136 | . . . . . 6 ⊢ (2 ∈ ℕ0 → ((𝑛 ∈ ℕ0 ↦ ((𝐴↑𝑛) / (!‘𝑛)))‘2) = ((𝐴↑2) / (!‘2))) |
| 30 | 28, 29 | ax-mp 5 | . . . . 5 ⊢ ((𝑛 ∈ ℕ0 ↦ ((𝐴↑𝑛) / (!‘𝑛)))‘2) = ((𝐴↑2) / (!‘2)) |
| 31 | fac2 14322 | . . . . . 6 ⊢ (!‘2) = 2 | |
| 32 | 31 | oveq2i 7423 | . . . . 5 ⊢ ((𝐴↑2) / (!‘2)) = ((𝐴↑2) / 2) |
| 33 | 30, 32 | eqtri 2785 | . . . 4 ⊢ ((𝑛 ∈ ℕ0 ↦ ((𝐴↑𝑛) / (!‘𝑛)))‘2) = ((𝐴↑2) / 2) |
| 34 | 33 | a1i 11 | . . 3 ⊢ (𝐴 ∈ ℝ+ → ((𝑛 ∈ ℕ0 ↦ ((𝐴↑𝑛) / (!‘𝑛)))‘2) = ((𝐴↑2) / 2)) |
| 35 | 1, 3, 4, 27, 34 | seqp1d 14061 | . 2 ⊢ (𝐴 ∈ ℝ+ → (seq0( + , (𝑛 ∈ ℕ0 ↦ ((𝐴↑𝑛) / (!‘𝑛))))‘2) = ((1 + 𝐴) + ((𝐴↑2) / 2))) |
| 36 | id 23 | . . 3 ⊢ (𝐴 ∈ ℝ+ → 𝐴 ∈ ℝ+) | |
| 37 | 28 | a1i 11 | . . 3 ⊢ (𝐴 ∈ ℝ+ → 2 ∈ ℕ0) |
| 38 | 10, 36, 37 | effsumlt 16173 | . 2 ⊢ (𝐴 ∈ ℝ+ → (seq0( + , (𝑛 ∈ ℕ0 ↦ ((𝐴↑𝑛) / (!‘𝑛))))‘2) < (exp‘𝐴)) |
| 39 | 35, 38 | eqbrtrrd 5134 | 1 ⊢ (𝐴 ∈ ℝ+ → ((1 + 𝐴) + ((𝐴↑2) / 2)) < (exp‘𝐴)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1569 ∈ wcel 2142 class class class wbr 5108 ↦ cmpt 5191 ‘cfv 6536 (class class class)co 7412 ℂcc 11104 0cc0 11106 1c1 11107 + caddc 11109 < clt 11249 / cdiv 11877 2c2 12301 ℕ0cn0 12510 ℝ+crp 13022 seqcseq 14044 ↑cexp 14104 !cfa 14316 expce 16121 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-rep 5237 ax-sep 5256 ax-nul 5268 ax-pow 5335 ax-pr 5403 ax-un 7734 ax-inf2 9608 ax-cnex 11162 ax-resscn 11163 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-mulcom 11170 ax-addass 11171 ax-mulass 11172 ax-distr 11173 ax-i2m1 11174 ax-1ne0 11175 ax-1rid 11176 ax-rnegex 11177 ax-rrecex 11178 ax-cnre 11179 ax-pre-lttri 11180 ax-pre-lttrn 11181 ax-pre-ltadd 11182 ax-pre-mulgt0 11183 ax-pre-sup 11184 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1103 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-nf 1813 df-sb 2096 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3456 df-sbc 3744 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-int 4912 df-iun 4957 df-br 5109 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5555 df-eprel 5560 df-po 5568 df-so 5569 df-fr 5613 df-se 5614 df-we 5615 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-rn 5671 df-res 5672 df-ima 5673 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-isom 6545 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7861 df-1st 7984 df-2nd 7985 df-frecs 8276 df-wrecs 8307 df-recs 8356 df-rdg 8395 df-1o 8451 df-er 8692 df-pm 8825 df-en 8942 df-dom 8943 df-sdom 8944 df-fin 8945 df-sup 9400 df-inf 9401 df-oi 9470 df-card 9932 df-pnf 11251 df-mnf 11252 df-xr 11253 df-ltxr 11254 df-le 11255 df-sub 11449 df-neg 11450 df-div 11878 df-nn 12240 df-2 12309 df-3 12310 df-n0 12511 df-z 12598 df-uz 12869 df-rp 13023 df-ico 13384 df-fz 13542 df-fzo 13690 df-fl 13832 df-seq 14045 df-exp 14105 df-fac 14317 df-hash 14374 df-shft 15111 df-cj 15157 df-re 15158 df-im 15159 df-sqrt 15293 df-abs 15294 df-limsup 15529 df-clim 15546 df-rlim 15547 df-sum 15745 df-ef 16127 |
| This theorem is used by: cxp2limlem 27151 pntpbnd1a 27760 |
| Copyright terms: Public domain | W3C validator |