theorem extracted_formal_statement_163.{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] (r1 : ℝ)
  (h_A₂e₂ : range (⇑(OptProblem.A₂ E₁) ∘ e₂) ⊆ ball 0 r1) (r2 : ℝ)
  (h_A₁e₁_A₂e₂ : range (⇑(OptProblem.A₁ E₂) ∘ e₁ + ⇑(OptProblem.A₂ E₁) ∘ e₂) ⊆ ball 0 r2) :
  let r := r1 + r2;
  r = r1 + r2 → ∀ (n : ℕ), (⇑(OptProblem.A₂ E₁) ∘ e₂) n = (OptProblem.A₂ E₁) (e₂ n) := sorry

State before:
case h
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
r1 : ℝ
h_A₂e₂ : range (⇑(OptProblem.A₂ E₁) ∘ e₂) ⊆ ball 0 r1
r2 : ℝ
h_A₁e₁_A₂e₂ : range (⇑(OptProblem.A₁ E₂) ∘ e₁ + ⇑(OptProblem.A₂ E₁) ∘ e₂) ⊆ ball 0 r2
r : ℝ := r1 + r2
hr : r = r1 + r2
n : ℕ
⊢ (⇑(OptProblem.A₂ E₁) ∘ e₂) n = (OptProblem.A₂ E₁) (e₂ n)

Tactic: simp

State after:

Relevant lemmas: