Theorem: summable_congr_ae (PrimeNumberTheoremAnd/Wiener.lean)

State before:
n : ℕ
A a b c d u✝ x y t σ' : ℝ
ψ Ψ : ℝ → ℂ
F G : ℂ → ℂ
f : ℕ → ℂ
𝕜 : Type
inst✝ : _root_.RCLike 𝕜
u v : ℕ → ℝ
huv : u =ᶠ[atTop] v
⊢ Summable u ↔ Summable v
Tactic:
constructor <;> intro h <;> simp [huv.summable, huv.symm.summable, h]
State after:
no goals