-- File: optlib/Optlib/Algorithm/ADMM/Lemma.lean
Theorem statement:
theorem extracted_formal_statement_287.{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 : ℕ+)
  (h_original_goal :
    1 / (ADMM.τ E₁ E₂ F * ADMM.ρ E₁ E₂ F) * (‖ey ↑n‖ ^ 2 - ‖ey (↑n + 1)‖ ^ 2) -
                (2 - ADMM.τ E₁ E₂ F) * ADMM.ρ E₁ E₂ F *
                  ‖(OptProblem.A₁ E₂) (ADMM.x₁ E₂ F (↑n + 1)) + (OptProblem.A₂ E₁) (ADMM.x₂ E₁ F (↑n + 1)) -
                        OptProblem.b E₁ E₂‖ ^
                    2 +
              2 * M (n + 1) -
            ADMM.ρ E₁ E₂ F * ‖(OptProblem.A₂ E₁) (ADMM.x₂ E₁ F (↑n + 1) - ADMM.x₂ E₁ F ↑n)‖ ^ 2 -
          ADMM.ρ E₁ E₂ F * ‖(OptProblem.A₂ E₁) (e₂ (↑n + 1))‖ ^ 2 +
        ADMM.ρ E₁ E₂ F * ‖(OptProblem.A₂ E₁) (e₂ ↑n)‖ ^ 2 ≥
      0) :
  2 *
      (1 / (ADMM.τ E₁ E₂ F * ADMM.ρ E₁ E₂ F) * ⟪ey (↑n + 1), ey ↑n - ey (↑n + 1)⟫_ℝ -
            (1 - ADMM.τ E₁ E₂ F) * ADMM.ρ E₁ E₂ F *
              ‖(OptProblem.A₁ E₂) (ADMM.x₁ E₂ F (↑n + 1)) + (OptProblem.A₂ E₁) (ADMM.x₂ E₁ F (↑n + 1)) -
                    OptProblem.b E₁ E₂‖ ^
                2 +
          M (n + 1) -
        ADMM.ρ E₁ E₂ F *
          ⟪(OptProblem.A₂ E₁) (ADMM.x₂ E₁ F (↑n + 1) - ADMM.x₂ E₁ F ↑n), (OptProblem.A₂ E₁) (e₂ (↑n + 1))⟫_ℝ) ≥
    0 := 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 : ℕ+
⊢ 1 / (ADMM.τ E₁ E₂ F * ADMM.ρ E₁ E₂ F) * (‖ey ↑n‖ ^ 2 - ‖ey (↑n + 1)‖ ^ 2) -
              (2 - ADMM.τ E₁ E₂ F) * ADMM.ρ E₁ E₂ F *
                ‖(OptProblem.A₁ E₂) (ADMM.x₁ E₂ F (↑n + 1)) + (OptProblem.A₂ E₁) (ADMM.x₂ E₁ F (↑n + 1)) -
                      OptProblem.b E₁ E₂‖ ^
                  2 +
            2 * M (n + 1) -
          ADMM.ρ E₁ E₂ F * ‖(OptProblem.A₂ E₁) (ADMM.x₂ E₁ F (↑n + 1) - ADMM.x₂ E₁ F ↑n)‖ ^ 2 -
        ADMM.ρ E₁ E₂ F * ‖(OptProblem.A₂ E₁) (e₂ (↑n + 1))‖ ^ 2 +
      ADMM.ρ E₁ E₂ F * ‖(OptProblem.A₂ E₁) (e₂ ↑n)‖ ^ 2 ≥
    0

Tactic: rw [Φ_isdescending_inequ5']

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 : ℕ+
 ⊢ 2 *
       (1 / (ADMM.τ E₁ E₂ F * ADMM.ρ E₁ E₂ F) * ⟪ey (↑n + 1), ey ↑n - ey (↑n + 1)⟫_ℝ -
             (1 - ADMM.τ E₁ E₂ F) * ADMM.ρ E₁ E₂ F *
               ‖(OptProblem.A₁ E₂) (ADMM.x₁ E₂ F (↑n + 1)) + (OptProblem.A₂ E₁) (ADMM.x₂ E₁ F (↑n + 1)) -
                     OptProblem.b E₁ E₂‖ ^
                 2 +
           M (n + 1) -
         ADMM.ρ E₁ E₂ F *
           ⟪(OptProblem.A₂ E₁) (ADMM.x₂ E₁ F (↑n + 1) - ADMM.x₂ E₁ F ↑n), (OptProblem.A₂ E₁) (e₂ (↑n + 1))⟫_ℝ) ≥
     0]

Premises used: