-- File: optlib/Optlib/Algorithm/ADMM/Theroem_converge.lean
Theorem statement:
theorem extracted_formal_statement_194.{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} [inst_9 : Setting E₁ E₂ F admm admm_kkt] (M : ℝ)
  (h : {x | ∃ «y», ey «y» = x} ⊆ ball 0 M) ⦃x : F⦄ (n : ℕ) (eq : ADMM.y E₁ E₂ n = x) (ey_bd : ‖ey n‖ < M) :
  ‖ADMM.y E₁ E₂ n‖ = ‖ADMM.y E₁ E₂ n - admm_kkt.y + admm_kkt.y‖ := sorry

Tactic 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
M : ℝ
h : {x | ∃ «y», ey «y» = x} ⊆ ball 0 M
x : F
n : ℕ
eq : ADMM.y E₁ E₂ n = x
ey_bd : ‖ey n‖ < M
⊢ ‖ADMM.y E₁ E₂ n‖ = ‖ADMM.y E₁ E₂ n - admm_kkt.y + admm_kkt.y‖

Tactic: rw [add_comm, add_sub, add_comm, add_sub_assoc, sub_self, add_zero]

Tactic state after:

Premises used:
add_sub_assoc : ∀ {G : Type u_1} [inst : SubNegMonoid G] (a b c : G), a + b - c = a + (b - c)
add_sub : ∀ {G : Type u_3} [inst : SubNegMonoid G] (a b c : G), a + (b - c) = a + b - c
sub_self : ∀ {G : Type u_1} [inst : AddGroup G] (a : G), a - a = 0
add_zero : ∀ {M : Type u} [inst : AddZeroClass M] (a : M), a + 0 = a
add_comm : ∀ {G : Type u_1} [inst : AddCommMagma G] (a b : G), a + b = b + a