-- File: FoML/FoML/Symmetrization.lean
Theorem statement:
theorem extracted_formal_statement_6.{u} {Ω : Type u} [inst : MeasurableSpace Ω] {n : ℕ}
  (h_original_goal : Measurable fun f => Fin.snoc f.2 f.1) (a : Fin (n + 1)) :
  Measurable fun c => Fin.snoc c.2 c.1 a := sorry

Tactic state before:
Ω : Type u
inst✝ : MeasurableSpace Ω
n : ℕ
⊢ Measurable fun f => Fin.snoc f.2 f.1

Tactic: apply measurable_pi_lambda

Tactic state after:
[case hf
 Ω : Type u
 inst✝ : MeasurableSpace Ω
 n : ℕ
 ⊢ ∀ (a : Fin (n + 1)), Measurable fun c => Fin.snoc c.2 c.1 a]

Premises used:
measurable_pi_lambda : ∀ {α : Type u_1} {δ : Type u_4} {X : δ → Type u_6} [inst : MeasurableSpace α]
  [inst_1 : (a : δ) → MeasurableSpace (X a)] (f : α → (a : δ) → X a),
  (∀ (a : δ), Measurable fun c => f c a) → Measurable f