-- File: optlib/Optlib/Algorithm/ADMM/Lemma.lean
Theorem statement:
theorem extracted_formal_statement_19.{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 := ADMM.y E₁ E₂ n.natPred;
  let a := (OptProblem.A₁ E₂) (ADMM.x₁ E₂ F ↑n) - OptProblem.b E₁ E₂;
  ((fun x =>
        ⟪ADMM.y E₁ E₂ n.natPred, (OptProblem.A₁ E₂) (ADMM.x₁ E₂ F ↑n) + (OptProblem.A₂ E₁) x - OptProblem.b E₁ E₂⟫_ℝ) =
      fun x =>
      ⟪ADMM.y E₁ E₂ n.natPred, (OptProblem.A₂ E₁) x + ((OptProblem.A₁ E₂) (ADMM.x₁ E₂ F ↑n) - OptProblem.b E₁ E₂)⟫_ℝ) →
    ((fun x => ⟪c, (OptProblem.A₂ E₁) x + a⟫_ℝ) = fun x => ⟪c, (OptProblem.A₂ E₁) x⟫_ℝ + ⟪c, a⟫_ℝ) →
      let f :=
        { toFun := fun x => ⟪c, (OptProblem.A₂ E₁) x⟫_ℝ,
          map_add' := fun u v =>
            Eq.mpr
              (id
                (congrArg (fun x => ⟪c, x⟫_ℝ = ⟪c, (OptProblem.A₂ E₁) u⟫_ℝ + ⟪c, (OptProblem.A₂ E₁) v⟫_ℝ)
                  (map_add (OptProblem.A₂ E₁) u v)))
              (Eq.mpr
                (id
                  (congrArg (fun _a => _a = ⟪c, (OptProblem.A₂ E₁) u⟫_ℝ + ⟪c, (OptProblem.A₂ E₁) v⟫_ℝ)
                    (inner_add_right c ((OptProblem.A₂ E₁) u) ((OptProblem.A₂ E₁) v))))
                (Eq.refl (⟪c, (OptProblem.A₂ E₁) u⟫_ℝ + ⟪c, (OptProblem.A₂ E₁) v⟫_ℝ))),
          map_smul' := fun u v =>
            Eq.mpr
              (id
                (congrArg (fun x => ⟪c, x⟫_ℝ = u * ⟪c, (OptProblem.A₂ E₁) v⟫_ℝ)
                  (LinearMapClass.map_smul (OptProblem.A₂ E₁) u v)))
              (inner_smul_right c ((OptProblem.A₂ E₁) v) u) };
      ConvexOn ℝ univ ⇑f → Convex ℝ univ := 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 := ADMM.y E₁ E₂ n.natPred
a : F := (OptProblem.A₁ E₂) (ADMM.x₁ E₂ F ↑n) - OptProblem.b E₁ E₂
this :
  (fun x =>
      ⟪ADMM.y E₁ E₂ n.natPred, (OptProblem.A₁ E₂) (ADMM.x₁ E₂ F ↑n) + (OptProblem.A₂ E₁) x - OptProblem.b E₁ E₂⟫_ℝ) =
    fun x =>
    ⟪ADMM.y E₁ E₂ n.natPred, (OptProblem.A₂ E₁) x + ((OptProblem.A₁ E₂) (ADMM.x₁ E₂ F ↑n) - OptProblem.b E₁ E₂)⟫_ℝ
h : (fun x => ⟪c, (OptProblem.A₂ E₁) x + a⟫_ℝ) = fun x => ⟪c, (OptProblem.A₂ E₁) x⟫_ℝ + ⟪c, a⟫_ℝ
p : ℝ := ⟪c, a⟫_ℝ
f : E₂ →ₗ[ℝ] ℝ := { toFun := fun x => ⟪c, (OptProblem.A₂ E₁) x⟫_ℝ, map_add' := ⋯, map_smul' := ⋯ }
⊢ ConvexOn ℝ univ ⇑f

Tactic: apply LinearMap.convexOn

Tactic state after:
[case hs
 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 := ADMM.y E₁ E₂ n.natPred
 a : F := (OptProblem.A₁ E₂) (ADMM.x₁ E₂ F ↑n) - OptProblem.b E₁ E₂
 this :
   (fun x =>
       ⟪ADMM.y E₁ E₂ n.natPred, (OptProblem.A₁ E₂) (ADMM.x₁ E₂ F ↑n) + (OptProblem.A₂ E₁) x - OptProblem.b E₁ E₂⟫_ℝ) =
     fun x =>
     ⟪ADMM.y E₁ E₂ n.natPred, (OptProblem.A₂ E₁) x + ((OptProblem.A₁ E₂) (ADMM.x₁ E₂ F ↑n) - OptProblem.b E₁ E₂)⟫_ℝ
 h : (fun x => ⟪c, (OptProblem.A₂ E₁) x + a⟫_ℝ) = fun x => ⟪c, (OptProblem.A₂ E₁) x⟫_ℝ + ⟪c, a⟫_ℝ
 p : ℝ := ⟪c, a⟫_ℝ
 f : E₂ →ₗ[ℝ] ℝ := { toFun := fun x => ⟪c, (OptProblem.A₂ E₁) x⟫_ℝ, map_add' := ⋯, map_smul' := ⋯ }
 ⊢ Convex ℝ univ]

Premises used:
LinearMap.convexOn : ∀ {𝕜 : Type u_1} {E : Type u_2} {β : Type u_5} [inst : OrderedSemiring 𝕜]
  [inst_9 : AddCommMonoid E] [inst_10 : OrderedAddCommMonoid β] [inst_11 : Module 𝕜 E] [inst_12 : Module 𝕜 β]
  (f : E →ₗ[𝕜] β) {s : Set E}, Convex 𝕜 s → ConvexOn 𝕜 s ⇑f