-- File: optlib/Optlib/Algorithm/ADMM/Lemma.lean
Theorem statement:
theorem extracted_formal_statement_219.{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] (n : ℕ) :
  let pm1 := 1 / (ADMM.τ E₁ E₂ F * ADMM.ρ E₁ E₂ F);
  let pm2 := (1 - ADMM.τ E₁ E₂ F) * ADMM.ρ E₁ E₂ F;
  pm1 * ⟪ey (n + 1), ey n - ey (n + 1)⟫_ℝ =
      ⟪ey (n + 1), -((OptProblem.A₁ E₂) (e₁ (n + 1)) + (OptProblem.A₂ E₁) (e₂ (n + 1)))⟫_ℝ →
    pm2 *
          ‖(OptProblem.A₁ E₂) (ADMM.x₁ E₂ F (n + 1)) + (OptProblem.A₂ E₁) (ADMM.x₂ E₁ F (n + 1)) - OptProblem.b E₁ E₂‖ ^
            2 =
        pm2 * ‖(OptProblem.A₁ E₂) (e₁ (n + 1)) + (OptProblem.A₂ E₁) (e₂ (n + 1))‖ ^ 2 →
      ADMM.ρ E₁ E₂ F *
            ⟪(OptProblem.A₂ E₁) (ADMM.x₂ E₁ F n - ADMM.x₂ E₁ F (n + 1)),
              -((OptProblem.A₁ E₂) (ADMM.x₁ E₂ F (n + 1)) + (OptProblem.A₂ E₁) (ADMM.x₂ E₁ F (n + 1)) -
                    OptProblem.b E₁ E₂ -
                  (OptProblem.A₂ E₁) (e₂ (n + 1)))⟫_ℝ =
          -ADMM.ρ E₁ E₂ F *
            ⟪(OptProblem.A₂ E₁) (ADMM.x₂ E₁ F n - ADMM.x₂ E₁ F (n + 1)),
              (OptProblem.A₁ E₂) (ADMM.x₁ E₂ F (n + 1)) + (OptProblem.A₂ E₁) (ADMM.x₂ E₁ F (n + 1)) -
                  OptProblem.b E₁ E₂ -
                (OptProblem.A₂ E₁) (e₂ (n + 1))⟫_ℝ →
        ADMM.ρ E₁ E₂ F *
            -⟪(OptProblem.A₂ E₁) (ADMM.x₂ E₁ F n - ADMM.x₂ E₁ F (n + 1)),
                (OptProblem.A₁ E₂) (ADMM.x₁ E₂ F (n + 1)) + (OptProblem.A₂ E₁) (ADMM.x₂ E₁ F (n + 1)) -
                    OptProblem.b E₁ E₂ -
                  (OptProblem.A₂ E₁) (e₂ (n + 1))⟫_ℝ =
          -ADMM.ρ E₁ E₂ F *
            ⟪(OptProblem.A₂ E₁) (ADMM.x₂ E₁ F n - ADMM.x₂ E₁ F (n + 1)),
              (OptProblem.A₁ E₂) (ADMM.x₁ E₂ F (n + 1)) + (OptProblem.A₂ E₁) (ADMM.x₂ E₁ F (n + 1)) -
                  OptProblem.b E₁ E₂ -
                (OptProblem.A₂ E₁) (e₂ (n + 1))⟫_ℝ := 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
n : ℕ
pm1 : ℝ := 1 / (ADMM.τ E₁ E₂ F * ADMM.ρ E₁ E₂ F)
pm2 : ℝ := (1 - ADMM.τ E₁ E₂ F) * ADMM.ρ E₁ E₂ F
h1 :
  pm1 * ⟪ey (n + 1), ey n - ey (n + 1)⟫_ℝ =
    ⟪ey (n + 1), -((OptProblem.A₁ E₂) (e₁ (n + 1)) + (OptProblem.A₂ E₁) (e₂ (n + 1)))⟫_ℝ
h2 :
  pm2 *
      ‖(OptProblem.A₁ E₂) (ADMM.x₁ E₂ F (n + 1)) + (OptProblem.A₂ E₁) (ADMM.x₂ E₁ F (n + 1)) - OptProblem.b E₁ E₂‖ ^ 2 =
    pm2 * ‖(OptProblem.A₁ E₂) (e₁ (n + 1)) + (OptProblem.A₂ E₁) (e₂ (n + 1))‖ ^ 2
⊢ ADMM.ρ E₁ E₂ F *
      ⟪(OptProblem.A₂ E₁) (ADMM.x₂ E₁ F n - ADMM.x₂ E₁ F (n + 1)),
        -((OptProblem.A₁ E₂) (ADMM.x₁ E₂ F (n + 1)) + (OptProblem.A₂ E₁) (ADMM.x₂ E₁ F (n + 1)) - OptProblem.b E₁ E₂ -
            (OptProblem.A₂ E₁) (e₂ (n + 1)))⟫_ℝ =
    -ADMM.ρ E₁ E₂ F *
      ⟪(OptProblem.A₂ E₁) (ADMM.x₂ E₁ F n - ADMM.x₂ E₁ F (n + 1)),
        (OptProblem.A₁ E₂) (ADMM.x₁ E₂ F (n + 1)) + (OptProblem.A₂ E₁) (ADMM.x₂ E₁ F (n + 1)) - OptProblem.b E₁ E₂ -
          (OptProblem.A₂ E₁) (e₂ (n + 1))⟫_ℝ

Tactic: rw [inner_neg_right]

Tactic state after:
[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
 n : ℕ
 pm1 : ℝ := 1 / (ADMM.τ E₁ E₂ F * ADMM.ρ E₁ E₂ F)
 pm2 : ℝ := (1 - ADMM.τ E₁ E₂ F) * ADMM.ρ E₁ E₂ F
 h1 :
   pm1 * ⟪ey (n + 1), ey n - ey (n + 1)⟫_ℝ =
     ⟪ey (n + 1), -((OptProblem.A₁ E₂) (e₁ (n + 1)) + (OptProblem.A₂ E₁) (e₂ (n + 1)))⟫_ℝ
 h2 :
   pm2 *
       ‖(OptProblem.A₁ E₂) (ADMM.x₁ E₂ F (n + 1)) + (OptProblem.A₂ E₁) (ADMM.x₂ E₁ F (n + 1)) - OptProblem.b E₁ E₂‖ ^
         2 =
     pm2 * ‖(OptProblem.A₁ E₂) (e₁ (n + 1)) + (OptProblem.A₂ E₁) (e₂ (n + 1))‖ ^ 2
 ⊢ ADMM.ρ E₁ E₂ F *
       -⟪(OptProblem.A₂ E₁) (ADMM.x₂ E₁ F n - ADMM.x₂ E₁ F (n + 1)),
           (OptProblem.A₁ E₂) (ADMM.x₁ E₂ F (n + 1)) + (OptProblem.A₂ E₁) (ADMM.x₂ E₁ F (n + 1)) - OptProblem.b E₁ E₂ -
             (OptProblem.A₂ E₁) (e₂ (n + 1))⟫_ℝ =
     -ADMM.ρ E₁ E₂ F *
       ⟪(OptProblem.A₂ E₁) (ADMM.x₂ E₁ F n - ADMM.x₂ E₁ F (n + 1)),
         (OptProblem.A₁ E₂) (ADMM.x₁ E₂ F (n + 1)) + (OptProblem.A₂ E₁) (ADMM.x₂ E₁ F (n + 1)) - OptProblem.b E₁ E₂ -
           (OptProblem.A₂ E₁) (e₂ (n + 1))⟫_ℝ]

Premises used:
inner_neg_right : ∀ {𝕜 : Type u_1} {E : Type u_2} [inst : RCLike 𝕜] [inst_10 : SeminormedAddCommGroup E]
  [inst_11 : InnerProductSpace 𝕜 E] (x y : E), ⟪x, -y⟫_𝕜 = -⟪x, y⟫_𝕜