theorem extracted_formal_statement_257.{u_3, u_2, u_1} {E₁ : Type u_1} {E₂ : Type u_2} {F : Type u_3}
  [inst : NormedAddCommGroup E₁] [inst_1 : InnerProductSpace ℝ E₁] [inst_2 : FiniteDimensional ℝ E₁]
  [inst_3 : NormedAddCommGroup E₂] [inst_4 : InnerProductSpace ℝ E₂] [inst_5 : FiniteDimensional ℝ E₂]
  [inst_6 : NormedAddCommGroup F] [inst_7 : InnerProductSpace ℝ F] [inst_8 : FiniteDimensional ℝ F]
  {admm : ADMM E₁ E₂ F} {admm_kkt : Existance_of_kkt admm} :
  Tendsto (fun n => (OptProblem.A₂ E₁) (ADMM.x₂ E₁ F (n + 1) - ADMM.x₂ E₁ F n)) atTop (𝓝 0) := sorry

State before:
E₁ : Type u_1
E₂ : Type u_2
F : Type u_3
inst✝⁹ : NormedAddCommGroup E₁
inst✝⁸ : InnerProductSpace ℝ E₁
inst✝⁷ : FiniteDimensional ℝ E₁
inst✝⁶ : NormedAddCommGroup E₂
inst✝⁵ : InnerProductSpace ℝ E₂
inst✝⁴ : FiniteDimensional ℝ E₂
inst✝³ : NormedAddCommGroup F
inst✝² : InnerProductSpace ℝ F
inst✝¹ : FiniteDimensional ℝ F
admm : ADMM E₁ E₂ F
admm_kkt : Existance_of_kkt admm
inst✝ : Setting E₁ E₂ F admm admm_kkt
⊢ Tendsto (fun n => (OptProblem.A₂ E₁) (ADMM.x₂ E₁ F (n + 1) - ADMM.x₂ E₁ F n)) atTop (𝓝 0)

Tactic: apply tendsto_zero_iff_norm_tendsto_zero.2 converge_zero₃

State after:

Relevant lemmas:
tendsto_zero_iff_norm_tendsto_zero : ∀ {α : Type u_2} {E : Type u_5} [inst : SeminormedAddGroup E] {f : α → E}
  {a : Filter α}, Tendsto f a (𝓝 0) ↔ Tendsto (fun x => ‖f x‖) a (𝓝 0)