theorem extracted_formal_statement_132.{w, v, u} {Z : Type w} {ι : Type v} {f : ι → Z → ℝ} {Ω : Type u}
  [inst : MeasurableSpace Ω] {X : Ω → Z} {μ : Measure Ω} [inst_1 : IsProbabilityMeasure μ] [inst_2 : Countable ι]
  [inst_3 : Nonempty ι] (h𝓕 : ∀ (I : ι), Measurable (f I ∘ X)) {b : ℝ} (h𝓕' : ∀ (I : ι) (z : Z), |f I z| ≤ b) {n : ℕ}
  {c : ι → ℝ} {C : ℝ} (hC : ∀ (I : ι), |c I| ≤ C) (σ : Fin (n + 1) → { x // x ∈ {-1, 1} }) (a : σ ∈ Finset.univ) (I : ι)
  (h_original_goal :
    Measurable fun b =>
      ∑ i, ↑↑(σ ↑↑i) * (f I (X (b.2 i).1) - f I (X (b.2 i).2)) + (↑↑(σ ↑n) * (f I (X b.1.1) - f I (X b.1.2)) + c I)) :
  Measurable fun a => ↑↑(σ ↑n) * (f I (X a.1.1) - f I (X a.1.2)) + c I := sorry

State before:
case left.hf.hf.hf
Z : Type w
ι : Type v
f : ι → Z → ℝ
Ω : Type u
inst✝³ : MeasurableSpace Ω
X : Ω → Z
μ : Measure Ω
inst✝² : IsProbabilityMeasure μ
inst✝¹ : Countable ι
inst✝ : Nonempty ι
h𝓕 : ∀ (I : ι), Measurable (f I ∘ X)
b : ℝ
h𝓕' : ∀ (I : ι) (z : Z), |f I z| ≤ b
n : ℕ
c : ι → ℝ
C : ℝ
hC : ∀ (I : ι), |c I| ≤ C
σ : Fin (n + 1) → { x // x ∈ {-1, 1} }
a✝ : σ ∈ Finset.univ
I : ι
⊢ Measurable fun b =>
    ∑ i, ↑↑(σ ↑↑i) * (f I (X (b.2 i).1) - f I (X (b.2 i).2)) + (↑↑(σ ↑n) * (f I (X b.1.1) - f I (X b.1.2)) + c I)

Tactic: apply Measurable.add

State after:
[case left.hf.hf.hf.hf
 Z : Type w
 ι : Type v
 f : ι → Z → ℝ
 Ω : Type u
 inst✝³ : MeasurableSpace Ω
 X : Ω → Z
 μ : Measure Ω
 inst✝² : IsProbabilityMeasure μ
 inst✝¹ : Countable ι
 inst✝ : Nonempty ι
 h𝓕 : ∀ (I : ι), Measurable (f I ∘ X)
 b : ℝ
 h𝓕' : ∀ (I : ι) (z : Z), |f I z| ≤ b
 n : ℕ
 c : ι → ℝ
 C : ℝ
 hC : ∀ (I : ι), |c I| ≤ C
 σ : Fin (n + 1) → { x // x ∈ {-1, 1} }
 a✝ : σ ∈ Finset.univ
 I : ι
 ⊢ Measurable fun a => ∑ i, ↑↑(σ ↑↑i) * (f I (X (a.2 i).1) - f I (X (a.2 i).2)),
 case left.hf.hf.hf.hg
 Z : Type w
 ι : Type v
 f : ι → Z → ℝ
 Ω : Type u
 inst✝³ : MeasurableSpace Ω
 X : Ω → Z
 μ : Measure Ω
 inst✝² : IsProbabilityMeasure μ
 inst✝¹ : Countable ι
 inst✝ : Nonempty ι
 h𝓕 : ∀ (I : ι), Measurable (f I ∘ X)
 b : ℝ
 h𝓕' : ∀ (I : ι) (z : Z), |f I z| ≤ b
 n : ℕ
 c : ι → ℝ
 C : ℝ
 hC : ∀ (I : ι), |c I| ≤ C
 σ : Fin (n + 1) → { x // x ∈ {-1, 1} }
 a✝ : σ ∈ Finset.univ
 I : ι
 ⊢ Measurable fun a => ↑↑(σ ↑n) * (f I (X a.1.1) - f I (X a.1.2)) + c I]

Relevant lemmas:
Measurable.add : ∀ {M : Type u_2} {α : Type u_3} [inst : MeasurableSpace M] [inst_4 : Add M] {m : MeasurableSpace α}
  {f g : α → M} [inst_5 : MeasurableAdd₂ M], Measurable f → Measurable g → Measurable fun a => f a + g a