-- File: optlib/Optlib/Algorithm/Nesterov/NesterovSmooth.lean
Theorem statement:
theorem extracted_formal_statement_60.{u_1} {E : Type u_1} [inst : NormedAddCommGroup E] [inst_1 : InnerProductSpace ℝ E]
  [inst_2 : CompleteSpace E] {f : E → ℝ} {f' : E → E} {xm x₀ : E} {γ : ℕ+ → ℝ} {alg : Nesterov f f' γ x₀}
  (hfun : ConvexOn ℝ univ f) (hg : ∀ (k : ℕ+), γ k = 2 / (↑↑k + 1)) (min : IsMinOn f univ xm)
  (con : ∀ (k : ℕ+), (1 - γ k) / γ k ^ 2 ≤ 1 / γ (k - 1) ^ 2)
  (h4 :
    ∀ (k : ℕ+),
      f (Nesterov.x f f' γ x₀ ↑k) - f xm - (1 - γ k) * (f (Nesterov.x f f' γ x₀ (↑k - 1)) - f xm) ≤
        ↑(Nesterov.l f f' γ x₀) * γ k ^ 2 / 2 *
          (‖Nesterov.v f f' γ x₀ (↑k - 1) - xm‖ ^ 2 - ‖Nesterov.v f f' γ x₀ ↑k - xm‖ ^ 2))
  (j : ℕ+)
  (IH :
    1 / γ j ^ 2 * (f (Nesterov.x f f' γ x₀ ↑j) - f xm) +
        ↑(Nesterov.l f f' γ x₀) / 2 * ‖Nesterov.v f f' γ x₀ ↑j - xm‖ ^ 2 ≤
      1 / γ 1 ^ 2 * (f (Nesterov.x f f' γ x₀ 1) - f xm) +
        ↑(Nesterov.l f f' γ x₀) / 2 * ‖Nesterov.v f f' γ x₀ 1 - xm‖ ^ 2)
  (h5 :
    1 / γ (j + 1) ^ 2 * (f (Nesterov.x f f' γ x₀ ↑(j + 1)) - f xm) +
        ↑(Nesterov.l f f' γ x₀) / 2 * ‖Nesterov.v f f' γ x₀ ↑(j + 1) - xm‖ ^ 2 ≤
      1 / γ (j + 1 - 1) ^ 2 * (f (Nesterov.x f f' γ x₀ (↑(j + 1) - 1)) - f xm) +
        ↑(Nesterov.l f f' γ x₀) / 2 * ‖Nesterov.v f f' γ x₀ (↑(j + 1) - 1) - xm‖ ^ 2)
  (y1 : ↑(j + 1) - 1 = ↑j) (y2 : j + 1 - 1 = j)
  (h_original_goal :
    1 / γ (j + 1) ^ 2 * (f (Nesterov.x f f' γ x₀ ↑(j + 1)) - f xm) +
        ↑(Nesterov.l f f' γ x₀) / 2 * ‖Nesterov.v f f' γ x₀ ↑(j + 1) - xm‖ ^ 2 ≤
      1 / γ 1 ^ 2 * (f (Nesterov.x f f' γ x₀ 1) - f xm) +
        ↑(Nesterov.l f f' γ x₀) / 2 * ‖Nesterov.v f f' γ x₀ 1 - xm‖ ^ 2) :
  1 / γ (j + 1 - 1) ^ 2 * (f (Nesterov.x f f' γ x₀ (↑(j + 1) - 1)) - f xm) +
      ↑(Nesterov.l f f' γ x₀) / 2 * ‖Nesterov.v f f' γ x₀ (↑(j + 1) - 1) - xm‖ ^ 2 ≤
    1 / γ 1 ^ 2 * (f (Nesterov.x f f' γ x₀ 1) - f xm) +
      ↑(Nesterov.l f f' γ x₀) / 2 * ‖Nesterov.v f f' γ x₀ 1 - xm‖ ^ 2 := sorry

Tactic state before:
case hi
E : Type u_1
inst✝² : NormedAddCommGroup E
inst✝¹ : InnerProductSpace ℝ E
inst✝ : CompleteSpace E
f : E → ℝ
f' : E → E
xm x₀ : E
γ : ℕ+ → ℝ
alg : Nesterov f f' γ x₀
hfun : ConvexOn ℝ univ f
hg : ∀ (k : ℕ+), γ k = 2 / (↑↑k + 1)
min : IsMinOn f univ xm
con : ∀ (k : ℕ+), (1 - γ k) / γ k ^ 2 ≤ 1 / γ (k - 1) ^ 2
h4 :
  ∀ (k : ℕ+),
    f (Nesterov.x f f' γ x₀ ↑k) - f xm - (1 - γ k) * (f (Nesterov.x f f' γ x₀ (↑k - 1)) - f xm) ≤
      ↑(Nesterov.l f f' γ x₀) * γ k ^ 2 / 2 *
        (‖Nesterov.v f f' γ x₀ (↑k - 1) - xm‖ ^ 2 - ‖Nesterov.v f f' γ x₀ ↑k - xm‖ ^ 2)
j : ℕ+
IH :
  1 / γ j ^ 2 * (f (Nesterov.x f f' γ x₀ ↑j) - f xm) +
      ↑(Nesterov.l f f' γ x₀) / 2 * ‖Nesterov.v f f' γ x₀ ↑j - xm‖ ^ 2 ≤
    1 / γ 1 ^ 2 * (f (Nesterov.x f f' γ x₀ 1) - f xm) + ↑(Nesterov.l f f' γ x₀) / 2 * ‖Nesterov.v f f' γ x₀ 1 - xm‖ ^ 2
h5 :
  1 / γ (j + 1) ^ 2 * (f (Nesterov.x f f' γ x₀ ↑(j + 1)) - f xm) +
      ↑(Nesterov.l f f' γ x₀) / 2 * ‖Nesterov.v f f' γ x₀ ↑(j + 1) - xm‖ ^ 2 ≤
    1 / γ (j + 1 - 1) ^ 2 * (f (Nesterov.x f f' γ x₀ (↑(j + 1) - 1)) - f xm) +
      ↑(Nesterov.l f f' γ x₀) / 2 * ‖Nesterov.v f f' γ x₀ (↑(j + 1) - 1) - xm‖ ^ 2
y1 : ↑(j + 1) - 1 = ↑j
y2 : j + 1 - 1 = j
⊢ 1 / γ (j + 1) ^ 2 * (f (Nesterov.x f f' γ x₀ ↑(j + 1)) - f xm) +
      ↑(Nesterov.l f f' γ x₀) / 2 * ‖Nesterov.v f f' γ x₀ ↑(j + 1) - xm‖ ^ 2 ≤
    1 / γ 1 ^ 2 * (f (Nesterov.x f f' γ x₀ 1) - f xm) + ↑(Nesterov.l f f' γ x₀) / 2 * ‖Nesterov.v f f' γ x₀ 1 - xm‖ ^ 2

Tactic: apply le_trans h5 _

Tactic state after:
[E : Type u_1
 inst✝² : NormedAddCommGroup E
 inst✝¹ : InnerProductSpace ℝ E
 inst✝ : CompleteSpace E
 f : E → ℝ
 f' : E → E
 xm x₀ : E
 γ : ℕ+ → ℝ
 alg : Nesterov f f' γ x₀
 hfun : ConvexOn ℝ univ f
 hg : ∀ (k : ℕ+), γ k = 2 / (↑↑k + 1)
 min : IsMinOn f univ xm
 con : ∀ (k : ℕ+), (1 - γ k) / γ k ^ 2 ≤ 1 / γ (k - 1) ^ 2
 h4 :
   ∀ (k : ℕ+),
     f (Nesterov.x f f' γ x₀ ↑k) - f xm - (1 - γ k) * (f (Nesterov.x f f' γ x₀ (↑k - 1)) - f xm) ≤
       ↑(Nesterov.l f f' γ x₀) * γ k ^ 2 / 2 *
         (‖Nesterov.v f f' γ x₀ (↑k - 1) - xm‖ ^ 2 - ‖Nesterov.v f f' γ x₀ ↑k - xm‖ ^ 2)
 j : ℕ+
 IH :
   1 / γ j ^ 2 * (f (Nesterov.x f f' γ x₀ ↑j) - f xm) +
       ↑(Nesterov.l f f' γ x₀) / 2 * ‖Nesterov.v f f' γ x₀ ↑j - xm‖ ^ 2 ≤
     1 / γ 1 ^ 2 * (f (Nesterov.x f f' γ x₀ 1) - f xm) + ↑(Nesterov.l f f' γ x₀) / 2 * ‖Nesterov.v f f' γ x₀ 1 - xm‖ ^ 2
 h5 :
   1 / γ (j + 1) ^ 2 * (f (Nesterov.x f f' γ x₀ ↑(j + 1)) - f xm) +
       ↑(Nesterov.l f f' γ x₀) / 2 * ‖Nesterov.v f f' γ x₀ ↑(j + 1) - xm‖ ^ 2 ≤
     1 / γ (j + 1 - 1) ^ 2 * (f (Nesterov.x f f' γ x₀ (↑(j + 1) - 1)) - f xm) +
       ↑(Nesterov.l f f' γ x₀) / 2 * ‖Nesterov.v f f' γ x₀ (↑(j + 1) - 1) - xm‖ ^ 2
 y1 : ↑(j + 1) - 1 = ↑j
 y2 : j + 1 - 1 = j
 ⊢ 1 / γ (j + 1 - 1) ^ 2 * (f (Nesterov.x f f' γ x₀ (↑(j + 1) - 1)) - f xm) +
       ↑(Nesterov.l f f' γ x₀) / 2 * ‖Nesterov.v f f' γ x₀ (↑(j + 1) - 1) - xm‖ ^ 2 ≤
     1 / γ 1 ^ 2 * (f (Nesterov.x f f' γ x₀ 1) - f xm) +
       ↑(Nesterov.l f f' γ x₀) / 2 * ‖Nesterov.v f f' γ x₀ 1 - xm‖ ^ 2]

Premises used:
le_trans : ∀ {α : Type u_1} [inst : Preorder α] {a b c : α}, a ≤ b → b ≤ c → a ≤ c