have : u = fun n => (u n + c) + (-c) := by ext n ; ring
n : ℕ
A a b c✝ d u✝ x y t σ' : ℝ
ψ Ψ : ℝ → ℂ
F G : ℂ → ℂ
f : ℕ → ℂ
𝕜 : Type
inst✝ : _root_.RCLike 𝕜
u : ℕ → ℝ
c : ℝ
⊢ (atTop.BoundedAtFilter fun n => u n + c) ↔ atTop.BoundedAtFilter u
n : ℕ
A a b c✝ d u✝ x y t σ' : ℝ
ψ Ψ : ℝ → ℂ
F G : ℂ → ℂ
f : ℕ → ℂ
𝕜 : Type
inst✝ : _root_.RCLike 𝕜
u : ℕ → ℝ
c : ℝ
this : u = fun n => u n + c + -c
⊢ (atTop.BoundedAtFilter fun n => u n + c) ↔ atTop.BoundedAtFilter u