-- File: FoML/FoML/Rademacher.lean
Theorem statement:
theorem extracted_formal_statement_298.{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)
  (h_original_goal :
    Integrable
      (fun ω => ∫ (x : Fin n → Ω), (fun ω' => ⨆ i, |∑ k, (f i (X (ω k)) - f i (X (ω' k)))|) x ∂Measure.pi fun x => μ)
      (Measure.pi fun x => μ)) :
  MemLp (fun ω => ∫ (x : Fin n → Ω), ⨆ i, |∑ k, (f i (X (ω k)) - f i (X (x k)))| ∂Measure.pi fun x => μ) 1
    (Measure.pi fun x => μ) := 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
⊢ Integrable
    (fun ω => ∫ (x : Fin n → Ω), (fun ω' => ⨆ i, |∑ k, (f i (X (ω k)) - f i (X (ω' k)))|) x ∂Measure.pi fun x => μ)
    (Measure.pi fun x => μ)

Tactic: simp_rw [← memLp_one_iff_integrable]

Tactic state after:
[Ω : 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
 ⊢ MemLp (fun ω => ∫ (x : Fin n → Ω), ⨆ i, |∑ k, (f i (X (ω k)) - f i (X (x k)))| ∂Measure.pi fun x => μ) 1
     (Measure.pi fun x => μ)]

Premises used:
MeasureTheory.memLp_one_iff_integrable : ∀ {α : Type u_1} {β : Type u_2} {m : MeasurableSpace α} {μ : Measure α}
  [inst : NormedAddCommGroup β] {f : α → β}, MemLp f 1 μ ↔ Integrable f μ