Theorem: log_isbigo_log_div (PrimeNumberTheoremAnd/Wiener.lean)

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

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