theorem extracted_formal_statement_8.{u_1} {E : Type u_1} {xm : E} {f : E → ℝ} {g : ℕ → E}
  (mono : ∀ (k : ℕ), f (g (k + 1)) ≤ f (g k)) (j : ℕ)
  (a : f (g (j + 1)) - f xm ≤ (∑ k ∈ Finset.range (j + 1), (f (g (k + 1)) - f xm)) / (↑j + 1))
  (h_original_goal :
    f (g (j + 1 + 1)) - f xm ≤ (∑ k ∈ Finset.range (j + 1 + 1), (f (g (k + 1)) - f xm)) / (↑(j + 1) + 1)) :
  f (g (j + 1 + 1)) ≤
    (∑ x ∈ Finset.range (j + 1 + 1), f (g (x + 1)) - (↑j + 1 + 1) * f xm) / (↑j + 1 + 1) + f xm := sorry

State before:
case succ
E : Type u_1
xm : E
f : E → ℝ
g : ℕ → E
mono : ∀ (k : ℕ), f (g (k + 1)) ≤ f (g k)
j : ℕ
a✝ : f (g (j + 1)) - f xm ≤ (∑ k ∈ Finset.range (j + 1), (f (g (k + 1)) - f xm)) / (↑j + 1)
⊢ f (g (j + 1 + 1)) - f xm ≤ (∑ k ∈ Finset.range (j + 1 + 1), (f (g (k + 1)) - f xm)) / (↑(j + 1) + 1)

Tactic: simp

State after:
[case succ
 E : Type u_1
 xm : E
 f : E → ℝ
 g : ℕ → E
 mono : ∀ (k : ℕ), f (g (k + 1)) ≤ f (g k)
 j : ℕ
 a✝ : f (g (j + 1)) - f xm ≤ (∑ k ∈ Finset.range (j + 1), (f (g (k + 1)) - f xm)) / (↑j + 1)
 ⊢ f (g (j + 1 + 1)) ≤ (∑ x ∈ Finset.range (j + 1 + 1), f (g (x + 1)) - (↑j + 1 + 1) * f xm) / (↑j + 1 + 1) + f xm]

Relevant lemmas: