-- File: FoML/FoML/Rademacher.lean
Theorem statement:
theorem extracted_formal_statement_498.{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)))) :
  ∫ (x : (Fin n → Ω) × (Fin n → Ω)),
        (fun ω => (↑(Fintype.card (Signs n)))⁻¹ * ∑ σ, ⨆ i, |∑ k, ↑↑(σ k) * f i (X (ω.1 k))|)
          x ∂(Measure.pi fun x => μ).prod (Measure.pi fun x => μ) +
      ∫ (x : (Fin n → Ω) × (Fin n → Ω)),
        (fun ω => (↑(Fintype.card (Signs n)))⁻¹ * ∑ σ, ⨆ i, |∑ k, ↑↑(σ k) * f i (X (ω.2 k))|)
          x ∂(Measure.pi fun x => μ).prod (Measure.pi fun x => μ) =
    2 *
      ∫ (x : Fin n → Ω),
        (fun ω => (↑(Fintype.card (Signs n)))⁻¹ * ∑ σ, ⨆ i, |∑ k, ↑↑(σ k) * f i (X (ω k))|)
          x ∂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✝¹ : 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)))
⊢ ∫ (x : (Fin n → Ω) × (Fin n → Ω)),
        (fun ω => (↑(Fintype.card (Signs n)))⁻¹ * ∑ σ, ⨆ i, |∑ k, ↑↑(σ k) * f i (X (ω.1 k))|)
          x ∂(Measure.pi fun x => μ).prod (Measure.pi fun x => μ) +
      ∫ (x : (Fin n → Ω) × (Fin n → Ω)),
        (fun ω => (↑(Fintype.card (Signs n)))⁻¹ * ∑ σ, ⨆ i, |∑ k, ↑↑(σ k) * f i (X (ω.2 k))|)
          x ∂(Measure.pi fun x => μ).prod (Measure.pi fun x => μ) =
    2 *
      ∫ (x : Fin n → Ω),
        (fun ω => (↑(Fintype.card (Signs n)))⁻¹ * ∑ σ, ⨆ i, |∑ k, ↑↑(σ k) * f i (X (ω k))|) x ∂Measure.pi fun x => μ

Tactic: apply extracted_10 hf hf'

Tactic state after:

Premises used:
extracted_10 : ∀ {Ω : Type u} [inst : MeasurableSpace Ω] {Z : Type w} {n : ℕ} {ι : Type u_1} {f : ι → Z → ℝ}
  {μ : Measure Ω} [inst_4 : IsProbabilityMeasure μ] {X : Ω → Z} [inst_5 : Nonempty ι] [inst_6 : Countable ι],
  (∀ (i : ι), Measurable (f i ∘ X)) →
    ∀ {b : ℝ},
      (∀ (i : ι) (z : Z), |f i z| ≤ b) →
        ∫ (x : (Fin n → Ω) × (Fin n → Ω)),
              (fun ω => (↑(Fintype.card (Signs n)))⁻¹ * ∑ σ, ⨆ i, |∑ k, ↑↑(σ k) * f i (X (ω.1 k))|)
                x ∂(Measure.pi fun x => μ).prod (Measure.pi fun x => μ) +
            ∫ (x : (Fin n → Ω) × (Fin n → Ω)),
              (fun ω => (↑(Fintype.card (Signs n)))⁻¹ * ∑ σ, ⨆ i, |∑ k, ↑↑(σ k) * f i (X (ω.2 k))|)
                x ∂(Measure.pi fun x => μ).prod (Measure.pi fun x => μ) =
          2 *
            ∫ (x : Fin n → Ω),
              (fun ω => (↑(Fintype.card (Signs n)))⁻¹ * ∑ σ, ⨆ i, |∑ k, ↑↑(σ k) * f i (X (ω k))|)
                x ∂Measure.pi fun x => μ