Theorem: Asymptotics.IsBigO.sq (PrimeNumberTheoremAnd/Wiener.lean)

State before:
n : ℕ
A a b c d u x y t σ' : ℝ
ψ Ψ : ℝ → ℂ
F G : ℂ → ℂ
f✝ : ℕ → ℂ
𝕜 : Type
inst✝¹ : _root_.RCLike 𝕜
α : Type u_1
inst✝ : Preorder α
f g : α → ℝ
h : f =O[atTop] g
⊢ (fun n => f n ^ 2) =O[atTop] fun n => g n ^ 2
Tactic:
simpa [pow_two] using h.mul h
State after:
no goals