Metamath Proof Explorer


Theorem logdiflbnd

Description: Lower bound on the difference of logs. (Contributed by Mario Carneiro, 3-Jul-2017)

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

Proof

Step Hyp Ref Expression
1 rpre ⊢ A ∈ ℝ + → A ∈ ℝ
2 rpge0 ⊢ A ∈ ℝ + → 0 ≤ A
3 1 2 ge0p1rpd ⊢ A ∈ ℝ + → A + 1 ∈ ℝ +
4 3 rprecred ⊢ A ∈ ℝ + → 1 A + 1 ∈ ℝ
5 1red ⊢ A ∈ ℝ + → 1 ∈ ℝ
6 0le1 ⊢ 0 ≤ 1
7 6 a1i ⊢ A ∈ ℝ + → 0 ≤ 1
8 5 3 7 divge0d ⊢ A ∈ ℝ + → 0 ≤ 1 A + 1
9 id ⊢ A ∈ ℝ + → A ∈ ℝ +
10 5 9 ltaddrp2d ⊢ A ∈ ℝ + → 1 < A + 1
11 1 5 readdcld ⊢ A ∈ ℝ + → A + 1 ∈ ℝ
12 11 recnd ⊢ A ∈ ℝ + → A + 1 ∈ ℂ
13 12 mulridd ⊢ A ∈ ℝ + → A + 1 ⋅ 1 = A + 1
14 10 13 breqtrrd ⊢ A ∈ ℝ + → 1 < A + 1 ⋅ 1
15 5 5 3 ltdivmuld ⊢ A ∈ ℝ + → 1 A + 1 < 1 ↔ 1 < A + 1 ⋅ 1
16 14 15 mpbird ⊢ A ∈ ℝ + → 1 A + 1 < 1
17 4 8 16 eflegeo ⊢ A ∈ ℝ + → e 1 A + 1 ≤ 1 1 − 1 A + 1
18 5 recnd ⊢ A ∈ ℝ + → 1 ∈ ℂ
19 3 rpne0d ⊢ A ∈ ℝ + → A + 1 ≠ 0
20 12 18 12 19 divsubdird ⊢ A ∈ ℝ + → A + 1 - 1 A + 1 = A + 1 A + 1 − 1 A + 1
21 1 recnd ⊢ A ∈ ℝ + → A ∈ ℂ
22 21 18 pncand ⊢ A ∈ ℝ + → A + 1 - 1 = A
23 22 oveq1d ⊢ A ∈ ℝ + → A + 1 - 1 A + 1 = A A + 1
24 12 19 dividd ⊢ A ∈ ℝ + → A + 1 A + 1 = 1
25 24 oveq1d ⊢ A ∈ ℝ + → A + 1 A + 1 − 1 A + 1 = 1 − 1 A + 1
26 20 23 25 3eqtr3rd ⊢ A ∈ ℝ + → 1 − 1 A + 1 = A A + 1
27 26 oveq2d ⊢ A ∈ ℝ + → 1 1 − 1 A + 1 = 1 A A + 1
28 rpne0 ⊢ A ∈ ℝ + → A ≠ 0
29 21 12 28 19 recdivd ⊢ A ∈ ℝ + → 1 A A + 1 = A + 1 A
30 27 29 eqtrd ⊢ A ∈ ℝ + → 1 1 − 1 A + 1 = A + 1 A
31 17 30 breqtrd ⊢ A ∈ ℝ + → e 1 A + 1 ≤ A + 1 A
32 4 rpefcld ⊢ A ∈ ℝ + → e 1 A + 1 ∈ ℝ +
33 3 9 rpdivcld ⊢ A ∈ ℝ + → A + 1 A ∈ ℝ +
34 32 33 logled ⊢ A ∈ ℝ + → e 1 A + 1 ≤ A + 1 A ↔ log ⁡ e 1 A + 1 ≤ log ⁡ A + 1 A
35 31 34 mpbid ⊢ A ∈ ℝ + → log ⁡ e 1 A + 1 ≤ log ⁡ A + 1 A
36 4 relogefd ⊢ A ∈ ℝ + → log ⁡ e 1 A + 1 = 1 A + 1
37 3 9 relogdivd ⊢ A ∈ ℝ + → log ⁡ A + 1 A = log ⁡ A + 1 − log ⁡ A
38 35 36 37 3brtr3d ⊢ A ∈ ℝ + → 1 A + 1 ≤ log ⁡ A + 1 − log ⁡ A