theorem extracted_formal_statement_36.{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 => (↑↑(φ₁ n)).toNat) = fun n => φ (n + 1)) (h_original_goal : StrictMono fun n => ↑(φ₁ n)) :
  (fun n => ↑(φ₁ n)) = fun n => φ (n + 1) := sorry

State before:
case a.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
fullrank₁ : Function.Injective ⇑(OptProblem.A₁ E₂)
fullrank₂ : Function.Injective ⇑(OptProblem.A₂ E₁)
inst✝ : Setting E₁ E₂ F admm admm_kkt
this : (fun n => (↑↑(φ₁ n)).toNat) = fun n => φ (n + 1)
⊢ StrictMono fun n => ↑(φ₁ n)

Tactic: simp at this
    rw [this]
    apply StrictMono.comp

State after:
[case a.h.hg
 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 => ↑(φ₁ n)) = fun n => φ (n + 1)
 ⊢ StrictMono φ,
 case a.h.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
 fullrank₁ : Function.Injective ⇑(OptProblem.A₁ E₂)
 fullrank₂ : Function.Injective ⇑(OptProblem.A₂ E₁)
 inst✝ : Setting E₁ E₂ F admm admm_kkt
 this : (fun n => ↑(φ₁ n)) = fun n => φ (n + 1)
 ⊢ StrictMono fun n => n + 1]

Relevant lemmas:
StrictMono.comp : ∀ {α : Type u} {β : Type v} {γ : Type w} [inst : Preorder α] [inst_10 : Preorder β]
  [inst_11 : Preorder γ] {g : β → γ} {f : α → β}, StrictMono g → StrictMono f → StrictMono (g ∘ f)