-- File: optlib/Optlib/Algorithm/ADMM/Lemma.lean
Theorem statement:
theorem extracted_formal_statement_58.{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} (n : ℕ+) :
  let c := (OptProblem.A₂ E₁) (ADMM.x₂ E₁ F n.natPred) - OptProblem.b E₁ E₂;
  ((fun x =>
        ADMM.ρ E₁ E₂ F / 2 *
          ‖(OptProblem.A₁ E₂) x + (OptProblem.A₂ E₁) (ADMM.x₂ E₁ F n.natPred) - OptProblem.b E₁ E₂‖ ^ 2) =
      fun x =>
      ADMM.ρ E₁ E₂ F / 2 *
        ‖(OptProblem.A₁ E₂) x + ((OptProblem.A₂ E₁) (ADMM.x₂ E₁ F n.natPred) - OptProblem.b E₁ E₂)‖ ^ 2) →
    ((fun x => ADMM.ρ E₁ E₂ F / 2 * ‖(OptProblem.A₁ E₂) x + c‖ ^ 2) = fun x =>
        ADMM.ρ E₁ E₂ F / 2 *
          (⟪(OptProblem.A₁ E₂) x, (OptProblem.A₁ E₂) x⟫_ℝ + 2 * ⟪c, (OptProblem.A₁ E₂) x⟫_ℝ + ⟪c, c⟫_ℝ)) →
      ADMM.ρ E₁ E₂ F • (ContinuousLinearMap.adjoint (OptProblem.A₁ E₂)) ((OptProblem.A₁ E₂) (ADMM.x₁ E₂ F ↑n) + c) =
          (ADMM.ρ E₁ E₂ F / 2) •
            2 • (ContinuousLinearMap.adjoint (OptProblem.A₁ E₂)) ((OptProblem.A₁ E₂) (ADMM.x₁ E₂ F ↑n) + c) →
        HasGradientAt
            (fun «y» =>
              ⟪(OptProblem.A₁ E₂) «y», (OptProblem.A₁ E₂) «y»⟫_ℝ + 2 * ⟪c, (OptProblem.A₁ E₂) «y»⟫_ℝ + ⟪c, c⟫_ℝ)
            (2 • (ContinuousLinearMap.adjoint (OptProblem.A₁ E₂)) ((OptProblem.A₁ E₂) (ADMM.x₁ E₂ F ↑n) + c))
            (ADMM.x₁ E₂ F ↑n) →
          HasGradientAt (fun x => ⟪(OptProblem.A₁ E₂) x, (OptProblem.A₁ E₂) x⟫_ℝ + 2 * ⟪c, (OptProblem.A₁ E₂) x⟫_ℝ)
            (2 • (ContinuousLinearMap.adjoint (OptProblem.A₁ E₂)) ((OptProblem.A₁ E₂) (ADMM.x₁ E₂ F ↑n) + c))
            (ADMM.x₁ E₂ F ↑n) := 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 : ℕ+
c : F := (OptProblem.A₂ E₁) (ADMM.x₂ E₁ F n.natPred) - OptProblem.b E₁ E₂
h1 :
  (fun x =>
      ADMM.ρ E₁ E₂ F / 2 *
        ‖(OptProblem.A₁ E₂) x + (OptProblem.A₂ E₁) (ADMM.x₂ E₁ F n.natPred) - OptProblem.b E₁ E₂‖ ^ 2) =
    fun x =>
    ADMM.ρ E₁ E₂ F / 2 * ‖(OptProblem.A₁ E₂) x + ((OptProblem.A₂ E₁) (ADMM.x₂ E₁ F n.natPred) - OptProblem.b E₁ E₂)‖ ^ 2
h2 :
  (fun x => ADMM.ρ E₁ E₂ F / 2 * ‖(OptProblem.A₁ E₂) x + c‖ ^ 2) = fun x =>
    ADMM.ρ E₁ E₂ F / 2 * (⟪(OptProblem.A₁ E₂) x, (OptProblem.A₁ E₂) x⟫_ℝ + 2 * ⟪c, (OptProblem.A₁ E₂) x⟫_ℝ + ⟪c, c⟫_ℝ)
h3 :
  ADMM.ρ E₁ E₂ F • (ContinuousLinearMap.adjoint (OptProblem.A₁ E₂)) ((OptProblem.A₁ E₂) (ADMM.x₁ E₂ F ↑n) + c) =
    (ADMM.ρ E₁ E₂ F / 2) •
      2 • (ContinuousLinearMap.adjoint (OptProblem.A₁ E₂)) ((OptProblem.A₁ E₂) (ADMM.x₁ E₂ F ↑n) + c)
⊢ HasGradientAt
    (fun «y» => ⟪(OptProblem.A₁ E₂) «y», (OptProblem.A₁ E₂) «y»⟫_ℝ + 2 * ⟪c, (OptProblem.A₁ E₂) «y»⟫_ℝ + ⟪c, c⟫_ℝ)
    (2 • (ContinuousLinearMap.adjoint (OptProblem.A₁ E₂)) ((OptProblem.A₁ E₂) (ADMM.x₁ E₂ F ↑n) + c)) (ADMM.x₁ E₂ F ↑n)

Tactic: apply HasGradientAt.add_const

Tactic state after:
[case hf
 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 : ℕ+
 c : F := (OptProblem.A₂ E₁) (ADMM.x₂ E₁ F n.natPred) - OptProblem.b E₁ E₂
 h1 :
   (fun x =>
       ADMM.ρ E₁ E₂ F / 2 *
         ‖(OptProblem.A₁ E₂) x + (OptProblem.A₂ E₁) (ADMM.x₂ E₁ F n.natPred) - OptProblem.b E₁ E₂‖ ^ 2) =
     fun x =>
     ADMM.ρ E₁ E₂ F / 2 *
       ‖(OptProblem.A₁ E₂) x + ((OptProblem.A₂ E₁) (ADMM.x₂ E₁ F n.natPred) - OptProblem.b E₁ E₂)‖ ^ 2
 h2 :
   (fun x => ADMM.ρ E₁ E₂ F / 2 * ‖(OptProblem.A₁ E₂) x + c‖ ^ 2) = fun x =>
     ADMM.ρ E₁ E₂ F / 2 * (⟪(OptProblem.A₁ E₂) x, (OptProblem.A₁ E₂) x⟫_ℝ + 2 * ⟪c, (OptProblem.A₁ E₂) x⟫_ℝ + ⟪c, c⟫_ℝ)
 h3 :
   ADMM.ρ E₁ E₂ F • (ContinuousLinearMap.adjoint (OptProblem.A₁ E₂)) ((OptProblem.A₁ E₂) (ADMM.x₁ E₂ F ↑n) + c) =
     (ADMM.ρ E₁ E₂ F / 2) •
       2 • (ContinuousLinearMap.adjoint (OptProblem.A₁ E₂)) ((OptProblem.A₁ E₂) (ADMM.x₁ E₂ F ↑n) + c)
 ⊢ HasGradientAt (fun x => ⟪(OptProblem.A₁ E₂) x, (OptProblem.A₁ E₂) x⟫_ℝ + 2 * ⟪c, (OptProblem.A₁ E₂) x⟫_ℝ)
     (2 • (ContinuousLinearMap.adjoint (OptProblem.A₁ E₂)) ((OptProblem.A₁ E₂) (ADMM.x₁ E₂ F ↑n) + c))
     (ADMM.x₁ E₂ F ↑n)]

Premises used:
HasGradientAt.add_const : ∀ {𝕜 : Type u_1} {F : Type u_2} [inst : RCLike 𝕜] [inst_9 : NormedAddCommGroup F]
  [inst_10 : InnerProductSpace 𝕜 F] [inst_11 : CompleteSpace F] {f' x : F} {f : F → 𝕜},
  HasGradientAt f f' x → ∀ (c : 𝕜), HasGradientAt (fun x => f x + c) f' x