Theorem: log_add_div_isBigO_log (PrimeNumberTheoremAnd/Wiener.lean)

State before:
n : ℕ
A a✝ b✝ c d u x y t σ' : ℝ
ψ Ψ : ℝ → ℂ
F G : ℂ → ℂ
f : ℕ → ℂ
𝕜 : Type
inst✝ : _root_.RCLike 𝕜
a b : ℝ
hb : 0 < b
⊢ (fun x => ((x + a) / b).log) =O[atTop] fun x => x.log
Tactic:
convert log_mul_add_isBigO_log (inv_pos.mpr hb) (a / b) using 3
State after:
case h.e'_7.h.h.e'_1
n : ℕ
A a✝ b✝ c d u x y t σ' : ℝ
ψ Ψ : ℝ → ℂ
F G : ℂ → ℂ
f : ℕ → ℂ
𝕜 : Type
inst✝ : _root_.RCLike 𝕜
a b : ℝ
hb : 0 < b
x✝ : ℝ
⊢ (x✝ + a) / b = b⁻¹ * x✝ + a / b

State before:
case h.e'_7.h.h.e'_1
n : ℕ
A a✝ b✝ c d u x y t σ' : ℝ
ψ Ψ : ℝ → ℂ
F G : ℂ → ℂ
f : ℕ → ℂ
𝕜 : Type
inst✝ : _root_.RCLike 𝕜
a b : ℝ
hb : 0 < b
x✝ : ℝ
⊢ (x✝ + a) / b = b⁻¹ * x✝ + a / b
Tactic:
ring
State after:
no goals