theorem extracted_formal_statement_10.{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} (fullrank₁ : Function.Injective ⇑(OptProblem.A₁ E₂))
  (fullrank₂ : Function.Injective ⇑(OptProblem.A₂ E₁)) [inst_9 : Setting E₁ E₂ F admm admm_kkt]
  (this :
    (fun n => v ↑(φ₁ n)) = fun n =>
      -(ContinuousLinearMap.adjoint (OptProblem.A₂ E₁))
          (ADMM.y E₁ E₂ ↑(φ₁ n) +
            ((1 - ADMM.τ E₁ E₂ F) * ADMM.ρ E₁ E₂ F) •
              ((OptProblem.A₁ E₂) (e₁ ↑(φ₁ n)) + (OptProblem.A₂ E₁) (e₂ ↑(φ₁ n))))) :
  Tendsto (fun n => v ↑(φ₁ n)) atTop (𝓝 (-(ContinuousLinearMap.adjoint (OptProblem.A₂ E₁)) y'')) := sorry

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
fullrank₁ : Function.Injective ⇑(OptProblem.A₁ E₂)
fullrank₂ : Function.Injective ⇑(OptProblem.A₂ E₁)
inst✝ : Setting E₁ E₂ F admm admm_kkt
this :
  (fun n => v ↑(φ₁ n)) = fun n =>
    -(ContinuousLinearMap.adjoint (OptProblem.A₂ E₁))
        (ADMM.y E₁ E₂ ↑(φ₁ n) +
          ((1 - ADMM.τ E₁ E₂ F) * ADMM.ρ E₁ E₂ F) • ((OptProblem.A₁ E₂) (e₁ ↑(φ₁ n)) + (OptProblem.A₂ E₁) (e₂ ↑(φ₁ n))))
⊢ Tendsto (fun n => v ↑(φ₁ n)) atTop (𝓝 (-(ContinuousLinearMap.adjoint (OptProblem.A₂ E₁)) y''))

Tactic: rw [this]
    have h : Tendsto (fun n => (y (φ₁ n) + ((1 - τ) * ρ) • (A₁ (e₁ (φ₁ n)) + A₂ (e₂ (φ₁ n))))) atTop (𝓝 y'') :=
  by
  rw [← add_zero y'']
  apply Filter.Tendsto.add (y_subseq_converge' fullrank₁ fullrank₂) (const_smul_subseq₁ fullrank₁ fullrank₂)
    have : Tendsto (-A₂†) (𝓝 y'') (𝓝 (-A₂† y'')) := by apply Continuous.tendsto; apply ContinuousLinearMap.continuous
    apply Filter.tendsto_iff_seq_tendsto.1 this
    apply h

State after:

Relevant lemmas:
error