Theorem: bound_sum_log' (PrimeNumberTheoremAnd/Wiener.lean)

State before:
n : ℕ
A a b c d u x✝ y t σ' : ℝ
ψ Ψ : ℝ → ℂ
F G : ℂ → ℂ
f : ℕ → ℂ
𝕜 : Type
inst✝ : _root_.RCLike 𝕜
C : ℝ
hf : chebyWith C f
x : ℝ
hx : 1 ≤ x
⊢ ∑' (i : ℕ), ‖f i‖ / ↑i * (1 + (1 / (2 * π) * (↑i / x).log) ^ 2)⁻¹ ≤ C * (1 + 2 * π ^ 2)
Tactic:
simpa only [hh_integral'] using bound_sum_log0 hf hx
State after:
no goals