-- File: FoML/FoML/McDiarmid.lean
Theorem statement:
theorem extracted_formal_statement_25.{u_3, u_2} {𝓧 : Type u_2} {ι : Type u_3} [inst : DecidableEq ι] (f : (ι → 𝓧) → ℝ)
  (c : ι → ℝ) (h : ∀ (i : ι) (x : ι → 𝓧) (x' : 𝓧), |f x - f (Function.update x i x')| ≤ c i) (i : ι) (xi : ι → 𝓧)
  (x' : 𝓧) : f xi - f (Function.update xi i x') ≤ c i := sorry

Tactic state before:
case mp
𝓧 : Type u_2
ι : Type u_3
inst✝ : DecidableEq ι
f : (ι → 𝓧) → ℝ
c : ι → ℝ
h : ∀ (i : ι) (x : ι → 𝓧) (x' : 𝓧), |f x - f (Function.update x i x')| ≤ c i
i : ι
xi : ι → 𝓧
x' : 𝓧
⊢ f xi - f (Function.update xi i x') ≤ c i

Tactic: exact le_of_max_le_left (h i xi x')

Tactic state after:

Premises used:
le_of_max_le_left : ∀ {α : Type u} [inst : LinearOrder α] {a b c : α}, a ⊔ b ≤ c → a ≤ c