-- File: FoML/FoML/Rademacher.lean
Theorem statement:
theorem extracted_formal_statement_461.{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 : ℝ} (hb : b ≥ 0)
  (hf' : ∀ (i : ι) (z : Z), |f i z| ≤ b) (hn : ¬n = 0)
  (hr : ∃ C, ∀ (ω : Fin n → Ω) (k : Fin n), ∀ y ∈ Set.range fun i => f i (X (ω k)), y ≤ C)
  (hr' : ∃ C, ∀ (ω : Fin n → Ω) (k : Fin n), ∀ y ∈ Set.range fun i => f i (X (ω k)), C ≤ y)
  (hq : ∀ (ω : Fin n → Ω) (k : Fin n), BddAbove (Set.range fun i => f i (X (ω k))))
  (hq' : ∀ (ω : Fin n → Ω) (k : Fin n), BddBelow (Set.range fun i => f i (X (ω k)))) :
  let mp := measurePreserving_arrowProdEquivProdArrow Ω Ω (Fin n) (fun x => μ) fun x => μ;
  ∀ (i : ι),
    (Measurable fun b => |∑ k, (f i (X (b.1 k)) - f i (X (b.2 k)))|) →
      Measurable fun a => ∑ k, (f i (X (a.1 k)) - f i (X (a.2 k))) := sorry

Tactic state before:
case hf.hf
Ω : Type u
inst✝³ : MeasurableSpace Ω
Z : Type w
n : ℕ
ι : Type u_1
f : ι → Z → ℝ
μ : Measure Ω
inst✝² : IsProbabilityMeasure μ
X : Ω → Z
inst✝¹ : Nonempty ι
inst✝ : Countable ι
hf : ∀ (i : ι), Measurable (f i ∘ X)
b : ℝ
hb : b ≥ 0
hf' : ∀ (i : ι) (z : Z), |f i z| ≤ b
hn : ¬n = 0
hr : ∃ C, ∀ (ω : Fin n → Ω) (k : Fin n), ∀ y ∈ Set.range fun i => f i (X (ω k)), y ≤ C
hr' : ∃ C, ∀ (ω : Fin n → Ω) (k : Fin n), ∀ y ∈ Set.range fun i => f i (X (ω k)), C ≤ y
hq : ∀ (ω : Fin n → Ω) (k : Fin n), BddAbove (Set.range fun i => f i (X (ω k)))
hq' : ∀ (ω : Fin n → Ω) (k : Fin n), BddBelow (Set.range fun i => f i (X (ω k)))
mp : MeasurePreserving (⇑(MeasurableEquiv.arrowProdEquivProdArrow Ω Ω (Fin n))) (Measure.pi fun i => μ.prod μ)
  ((Measure.pi fun i => μ).prod (Measure.pi fun i => μ)) :=
  measurePreserving_arrowProdEquivProdArrow Ω Ω (Fin n) (fun x => μ) fun x => μ
i : ι
⊢ Measurable fun b => |∑ k, (f i (X (b.1 k)) - f i (X (b.2 k)))|

Tactic: apply Measurable.max

Tactic state after:
[case hf.hf.hf
 Ω : Type u
 inst✝³ : MeasurableSpace Ω
 Z : Type w
 n : ℕ
 ι : Type u_1
 f : ι → Z → ℝ
 μ : Measure Ω
 inst✝² : IsProbabilityMeasure μ
 X : Ω → Z
 inst✝¹ : Nonempty ι
 inst✝ : Countable ι
 hf : ∀ (i : ι), Measurable (f i ∘ X)
 b : ℝ
 hb : b ≥ 0
 hf' : ∀ (i : ι) (z : Z), |f i z| ≤ b
 hn : ¬n = 0
 hr : ∃ C, ∀ (ω : Fin n → Ω) (k : Fin n), ∀ y ∈ Set.range fun i => f i (X (ω k)), y ≤ C
 hr' : ∃ C, ∀ (ω : Fin n → Ω) (k : Fin n), ∀ y ∈ Set.range fun i => f i (X (ω k)), C ≤ y
 hq : ∀ (ω : Fin n → Ω) (k : Fin n), BddAbove (Set.range fun i => f i (X (ω k)))
 hq' : ∀ (ω : Fin n → Ω) (k : Fin n), BddBelow (Set.range fun i => f i (X (ω k)))
 mp : MeasurePreserving (⇑(MeasurableEquiv.arrowProdEquivProdArrow Ω Ω (Fin n))) (Measure.pi fun i => μ.prod μ)
   ((Measure.pi fun i => μ).prod (Measure.pi fun i => μ)) :=
   measurePreserving_arrowProdEquivProdArrow Ω Ω (Fin n) (fun x => μ) fun x => μ
 i : ι
 ⊢ Measurable fun a => ∑ k, (f i (X (a.1 k)) - f i (X (a.2 k))),
 case hf.hf.hg
 Ω : Type u
 inst✝³ : MeasurableSpace Ω
 Z : Type w
 n : ℕ
 ι : Type u_1
 f : ι → Z → ℝ
 μ : Measure Ω
 inst✝² : IsProbabilityMeasure μ
 X : Ω → Z
 inst✝¹ : Nonempty ι
 inst✝ : Countable ι
 hf : ∀ (i : ι), Measurable (f i ∘ X)
 b : ℝ
 hb : b ≥ 0
 hf' : ∀ (i : ι) (z : Z), |f i z| ≤ b
 hn : ¬n = 0
 hr : ∃ C, ∀ (ω : Fin n → Ω) (k : Fin n), ∀ y ∈ Set.range fun i => f i (X (ω k)), y ≤ C
 hr' : ∃ C, ∀ (ω : Fin n → Ω) (k : Fin n), ∀ y ∈ Set.range fun i => f i (X (ω k)), C ≤ y
 hq : ∀ (ω : Fin n → Ω) (k : Fin n), BddAbove (Set.range fun i => f i (X (ω k)))
 hq' : ∀ (ω : Fin n → Ω) (k : Fin n), BddBelow (Set.range fun i => f i (X (ω k)))
 mp : MeasurePreserving (⇑(MeasurableEquiv.arrowProdEquivProdArrow Ω Ω (Fin n))) (Measure.pi fun i => μ.prod μ)
   ((Measure.pi fun i => μ).prod (Measure.pi fun i => μ)) :=
   measurePreserving_arrowProdEquivProdArrow Ω Ω (Fin n) (fun x => μ) fun x => μ
 i : ι
 ⊢ Measurable fun a => -∑ k, (f i (X (a.1 k)) - f i (X (a.2 k)))]

Premises used:
Measurable.max : ∀ {α : Type u_1} {δ : Type u_4} [inst : TopologicalSpace α] {mα : MeasurableSpace α}
  [inst_4 : OpensMeasurableSpace α] {mδ : MeasurableSpace δ} [inst_5 : LinearOrder α] [inst_6 : OrderClosedTopology α]
  [inst : SecondCountableTopology α] {f g : δ → α}, Measurable f → Measurable g → Measurable fun a => f a ⊔ g a