-- File: FoML/FoML/Rademacher.lean
Theorem statement:
theorem extracted_formal_statement_280.{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)
  (h_original_goal : ⨆ i, |∑ k, ↑↑(σ k) * f i (X (ω.1 k))| ≤ ⨆ i, ∑ k, |↑↑(σ k) * f i (X (ω.1 k))|) (x : ι) :
  |∑ k, ↑↑(σ k) * f x (X (ω.1 k))| ≤ ∑ k, |↑↑(σ k) * f x (X (ω.1 k))| := sorry

Tactic state before:
case 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))| ≤ ⨆ i, ∑ k, |↑↑(σ k) * f i (X (ω.1 k))|

Tactic: apply ciSup_mono

Tactic state after:
[case h.B
 Ω : 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
 ⊢ BddAbove (Set.range fun i => ∑ k, |↑↑(σ k) * f i (X (ω.1 k))|),
 case h.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
 ⊢ ∀ (x : ι), |∑ k, ↑↑(σ k) * f x (X (ω.1 k))| ≤ ∑ k, |↑↑(σ k) * f x (X (ω.1 k))|]

Premises used:
ciSup_mono : ∀ {α : Type u_1} {ι : Sort u_4} [inst : ConditionallyCompleteLattice α] {f g : ι → α},
  BddAbove (Set.range g) → (∀ (x : ι), f x ≤ g x) → iSup f ≤ iSup g