-- File: FoML/FoML/Rademacher.lean
Theorem statement:
theorem extracted_formal_statement_238.{u_1, w, u} {Ω : Type u} [inst : MeasurableSpace Ω] {Z : Type w} {n : ℕ}
  {ι : Type u_1} {f : ι → Z → ℝ} {μ : Measure Ω} [inst_1 : IsProbabilityMeasure μ] {X : Ω → Z} [inst_2 : Nonempty ι]
  [inst_3 : Countable ι] (hf : ∀ (i : ι), Measurable (f i ∘ X)) {b : ℝ} (hf' : ∀ (i : ι) (z : Z), |f i z| ≤ b) (i : ι)
  (a : Fin n → Ω) (i_1 : Fin n) (hi_1 : i_1 ∈ Finset.univ) : f i (X (a i_1)) ≤ b := sorry

Tactic state before:
Ω : Type u
inst✝¹ : MeasurableSpace Ω
Z : Type w
n : ℕ
ι : Type u_1
f : ι → Z → ℝ
μ : Measure Ω
inst✝ : IsProbabilityMeasure μ
X : Ω → Z
inst_2 : Nonempty ι
inst_3 : Countable ι
hf : ∀ (i : ι), Measurable (f i ∘ X)
b : ℝ
hf' : ∀ (i : ι) (z : Z), |f i z| ≤ b
ω' : Fin n → Ω
i : ι
a : Fin n → Ω
i_1 : Fin n
hi_1 : i_1 ∈ Finset.univ
⊢ f i (X (a i_1)) ≤ b

Tactic: exact le_of_max_le_left (hf' i (X (a i_1)))

Tactic state after:

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