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

Tactic state before:
case h.hf.h
Ω : Type u
inst✝³ : MeasurableSpace Ω
Z : Type w
n : ℕ
ι : Type u_1
f : ι → Z → ℝ
μ : Measure Ω
inst✝² : IsProbabilityMeasure μ
inst✝¹ : Nonempty ι
inst✝ : Countable ι
X : Ω → Z
hf : ∀ (i : ι), Measurable (f i ∘ X)
b : ℝ
hf' : ∀ (i : ι) (z : Z), |f i z| ≤ b
ω : (Fin n → Ω) × (Fin n → Ω)
σ : Signs n
a✝ : σ ∈ Finset.univ
i : ι
⊢ |∑ k, ↑↑(σ k) * f i (X (ω.1 k))| ≤ |∑ k, ↑↑(σ k) * f ?h.hf.c (X (ω.1 k))|

Tactic: apply le_of_eq rfl

Tactic state after:

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