![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > efgt1p | Structured version Visualization version GIF version |
Description: The exponential of a positive real number is greater than 1 plus that number. (Contributed by Mario Carneiro, 14-Mar-2014.) (Revised by Mario Carneiro, 30-Apr-2014.) |
Ref | Expression |
---|---|
efgt1p | ⊢ (𝐴 ∈ ℝ+ → (1 + 𝐴) < (exp‘𝐴)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | rpcn 12980 | . . 3 ⊢ (𝐴 ∈ ℝ+ → 𝐴 ∈ ℂ) | |
2 | nn0uz 12860 | . . . 4 ⊢ ℕ0 = (ℤ≥‘0) | |
3 | 0nn0 12483 | . . . . 5 ⊢ 0 ∈ ℕ0 | |
4 | 3 | a1i 11 | . . . 4 ⊢ (𝐴 ∈ ℂ → 0 ∈ ℕ0) |
5 | 1e0p1 12715 | . . . 4 ⊢ 1 = (0 + 1) | |
6 | 0z 12565 | . . . . 5 ⊢ 0 ∈ ℤ | |
7 | eqid 2732 | . . . . . . . 8 ⊢ (𝑛 ∈ ℕ0 ↦ ((𝐴↑𝑛) / (!‘𝑛))) = (𝑛 ∈ ℕ0 ↦ ((𝐴↑𝑛) / (!‘𝑛))) | |
8 | 7 | eftval 16016 | . . . . . . 7 ⊢ (0 ∈ ℕ0 → ((𝑛 ∈ ℕ0 ↦ ((𝐴↑𝑛) / (!‘𝑛)))‘0) = ((𝐴↑0) / (!‘0))) |
9 | 3, 8 | ax-mp 5 | . . . . . 6 ⊢ ((𝑛 ∈ ℕ0 ↦ ((𝐴↑𝑛) / (!‘𝑛)))‘0) = ((𝐴↑0) / (!‘0)) |
10 | eft0val 16051 | . . . . . 6 ⊢ (𝐴 ∈ ℂ → ((𝐴↑0) / (!‘0)) = 1) | |
11 | 9, 10 | eqtrid 2784 | . . . . 5 ⊢ (𝐴 ∈ ℂ → ((𝑛 ∈ ℕ0 ↦ ((𝐴↑𝑛) / (!‘𝑛)))‘0) = 1) |
12 | 6, 11 | seq1i 13976 | . . . 4 ⊢ (𝐴 ∈ ℂ → (seq0( + , (𝑛 ∈ ℕ0 ↦ ((𝐴↑𝑛) / (!‘𝑛))))‘0) = 1) |
13 | 1nn0 12484 | . . . . . 6 ⊢ 1 ∈ ℕ0 | |
14 | 7 | eftval 16016 | . . . . . 6 ⊢ (1 ∈ ℕ0 → ((𝑛 ∈ ℕ0 ↦ ((𝐴↑𝑛) / (!‘𝑛)))‘1) = ((𝐴↑1) / (!‘1))) |
15 | 13, 14 | ax-mp 5 | . . . . 5 ⊢ ((𝑛 ∈ ℕ0 ↦ ((𝐴↑𝑛) / (!‘𝑛)))‘1) = ((𝐴↑1) / (!‘1)) |
16 | fac1 14233 | . . . . . . 7 ⊢ (!‘1) = 1 | |
17 | 16 | oveq2i 7416 | . . . . . 6 ⊢ ((𝐴↑1) / (!‘1)) = ((𝐴↑1) / 1) |
18 | exp1 14029 | . . . . . . . 8 ⊢ (𝐴 ∈ ℂ → (𝐴↑1) = 𝐴) | |
19 | 18 | oveq1d 7420 | . . . . . . 7 ⊢ (𝐴 ∈ ℂ → ((𝐴↑1) / 1) = (𝐴 / 1)) |
20 | div1 11899 | . . . . . . 7 ⊢ (𝐴 ∈ ℂ → (𝐴 / 1) = 𝐴) | |
21 | 19, 20 | eqtrd 2772 | . . . . . 6 ⊢ (𝐴 ∈ ℂ → ((𝐴↑1) / 1) = 𝐴) |
22 | 17, 21 | eqtrid 2784 | . . . . 5 ⊢ (𝐴 ∈ ℂ → ((𝐴↑1) / (!‘1)) = 𝐴) |
23 | 15, 22 | eqtrid 2784 | . . . 4 ⊢ (𝐴 ∈ ℂ → ((𝑛 ∈ ℕ0 ↦ ((𝐴↑𝑛) / (!‘𝑛)))‘1) = 𝐴) |
24 | 2, 4, 5, 12, 23 | seqp1d 13979 | . . 3 ⊢ (𝐴 ∈ ℂ → (seq0( + , (𝑛 ∈ ℕ0 ↦ ((𝐴↑𝑛) / (!‘𝑛))))‘1) = (1 + 𝐴)) |
25 | 1, 24 | syl 17 | . 2 ⊢ (𝐴 ∈ ℝ+ → (seq0( + , (𝑛 ∈ ℕ0 ↦ ((𝐴↑𝑛) / (!‘𝑛))))‘1) = (1 + 𝐴)) |
26 | id 22 | . . 3 ⊢ (𝐴 ∈ ℝ+ → 𝐴 ∈ ℝ+) | |
27 | 13 | a1i 11 | . . 3 ⊢ (𝐴 ∈ ℝ+ → 1 ∈ ℕ0) |
28 | 7, 26, 27 | effsumlt 16050 | . 2 ⊢ (𝐴 ∈ ℝ+ → (seq0( + , (𝑛 ∈ ℕ0 ↦ ((𝐴↑𝑛) / (!‘𝑛))))‘1) < (exp‘𝐴)) |
29 | 25, 28 | eqbrtrrd 5171 | 1 ⊢ (𝐴 ∈ ℝ+ → (1 + 𝐴) < (exp‘𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1541 ∈ wcel 2106 class class class wbr 5147 ↦ cmpt 5230 ‘cfv 6540 (class class class)co 7405 ℂcc 11104 0cc0 11106 1c1 11107 + caddc 11109 < clt 11244 / cdiv 11867 ℕ0cn0 12468 ℝ+crp 12970 seqcseq 13962 ↑cexp 14023 !cfa 14229 expce 16001 |
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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-rep 5284 ax-sep 5298 ax-nul 5305 ax-pow 5362 ax-pr 5426 ax-un 7721 ax-inf2 9632 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 theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3376 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4322 df-if 4528 df-pw 4603 df-sn 4628 df-pr 4630 df-op 4634 df-uni 4908 df-int 4950 df-iun 4998 df-br 5148 df-opab 5210 df-mpt 5231 df-tr 5265 df-id 5573 df-eprel 5579 df-po 5587 df-so 5588 df-fr 5630 df-se 5631 df-we 5632 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-rn 5686 df-res 5687 df-ima 5688 df-pred 6297 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6492 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-isom 6549 df-riota 7361 df-ov 7408 df-oprab 7409 df-mpo 7410 df-om 7852 df-1st 7971 df-2nd 7972 df-frecs 8262 df-wrecs 8293 df-recs 8367 df-rdg 8406 df-1o 8462 df-er 8699 df-pm 8819 df-en 8936 df-dom 8937 df-sdom 8938 df-fin 8939 df-sup 9433 df-inf 9434 df-oi 9501 df-card 9930 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-sub 11442 df-neg 11443 df-div 11868 df-nn 12209 df-2 12271 df-3 12272 df-n0 12469 df-z 12555 df-uz 12819 df-rp 12971 df-ico 13326 df-fz 13481 df-fzo 13624 df-fl 13753 df-seq 13963 df-exp 14024 df-fac 14230 df-hash 14287 df-shft 15010 df-cj 15042 df-re 15043 df-im 15044 df-sqrt 15178 df-abs 15179 df-limsup 15411 df-clim 15428 df-rlim 15429 df-sum 15629 df-ef 16007 |
This theorem is referenced by: efgt1 16055 reeff1olem 25949 logdivlti 26119 logdifbnd 26487 emcllem4 26492 harmonicbnd4 26504 |
Copyright terms: Public domain | W3C validator |