Metamath Proof Explorer


Theorem logdifbnd

Description: Bound on the difference of logs. (Contributed by Mario Carneiro, 23-May-2016)

Ref Expression
Assertion logdifbnd ⊢ A ∈ ℝ + → log ⁡ A + 1 − log ⁡ A ≤ 1 A

Proof

Step Hyp Ref Expression
1 rpcn ⊢ A ∈ ℝ + → A ∈ ℂ
2 1cnd ⊢ A ∈ ℝ + → 1 ∈ ℂ
3 rpne0 ⊢ A ∈ ℝ + → A ≠ 0
4 1 2 1 3 divdird ⊢ A ∈ ℝ + → A + 1 A = A A + 1 A
5 1 3 dividd ⊢ A ∈ ℝ + → A A = 1
6 5 oveq1d ⊢ A ∈ ℝ + → A A + 1 A = 1 + 1 A
7 4 6 eqtr2d ⊢ A ∈ ℝ + → 1 + 1 A = A + 1 A
8 7 fveq2d ⊢ A ∈ ℝ + → log ⁡ 1 + 1 A = log ⁡ A + 1 A
9 1rp ⊢ 1 ∈ ℝ +
10 rpaddcl ⊢ A ∈ ℝ + ∧ 1 ∈ ℝ + → A + 1 ∈ ℝ +
11 9 10 mpan2 ⊢ A ∈ ℝ + → A + 1 ∈ ℝ +
12 relogdiv ⊢ A + 1 ∈ ℝ + ∧ A ∈ ℝ + → log ⁡ A + 1 A = log ⁡ A + 1 − log ⁡ A
13 11 12 mpancom ⊢ A ∈ ℝ + → log ⁡ A + 1 A = log ⁡ A + 1 − log ⁡ A
14 8 13 eqtrd ⊢ A ∈ ℝ + → log ⁡ 1 + 1 A = log ⁡ A + 1 − log ⁡ A
15 rpreccl ⊢ A ∈ ℝ + → 1 A ∈ ℝ +
16 rpaddcl ⊢ 1 ∈ ℝ + ∧ 1 A ∈ ℝ + → 1 + 1 A ∈ ℝ +
17 9 15 16 sylancr ⊢ A ∈ ℝ + → 1 + 1 A ∈ ℝ +
18 17 reeflogd ⊢ A ∈ ℝ + → e log ⁡ 1 + 1 A = 1 + 1 A
19 17 rpred ⊢ A ∈ ℝ + → 1 + 1 A ∈ ℝ
20 15 rpred ⊢ A ∈ ℝ + → 1 A ∈ ℝ
21 20 reefcld ⊢ A ∈ ℝ + → e 1 A ∈ ℝ
22 efgt1p ⊢ 1 A ∈ ℝ + → 1 + 1 A < e 1 A
23 15 22 syl ⊢ A ∈ ℝ + → 1 + 1 A < e 1 A
24 19 21 23 ltled ⊢ A ∈ ℝ + → 1 + 1 A ≤ e 1 A
25 18 24 eqbrtrd ⊢ A ∈ ℝ + → e log ⁡ 1 + 1 A ≤ e 1 A
26 relogcl ⊢ A + 1 ∈ ℝ + → log ⁡ A + 1 ∈ ℝ
27 11 26 syl ⊢ A ∈ ℝ + → log ⁡ A + 1 ∈ ℝ
28 relogcl ⊢ A ∈ ℝ + → log ⁡ A ∈ ℝ
29 27 28 resubcld ⊢ A ∈ ℝ + → log ⁡ A + 1 − log ⁡ A ∈ ℝ
30 14 29 eqeltrd ⊢ A ∈ ℝ + → log ⁡ 1 + 1 A ∈ ℝ
31 efle ⊢ log ⁡ 1 + 1 A ∈ ℝ ∧ 1 A ∈ ℝ → log ⁡ 1 + 1 A ≤ 1 A ↔ e log ⁡ 1 + 1 A ≤ e 1 A
32 30 20 31 syl2anc ⊢ A ∈ ℝ + → log ⁡ 1 + 1 A ≤ 1 A ↔ e log ⁡ 1 + 1 A ≤ e 1 A
33 25 32 mpbird ⊢ A ∈ ℝ + → log ⁡ 1 + 1 A ≤ 1 A
34 14 33 eqbrtrrd ⊢ A ∈ ℝ + → log ⁡ A + 1 − log ⁡ A ≤ 1 A