Bennett prod erase last erase

import Lean.Elab.Tactic.Omega
import Mathlib.Algebra.BigOperators.Fin
import Mathlib.Algebra.CharZero.Infinite
import Mathlib.Algebra.Polynomial.BigOperators
import Mathlib.Algebra.Polynomial.Degree.Operations
import Mathlib.Algebra.Polynomial.Div
import Mathlib.Algebra.Polynomial.PartialFractions
import Mathlib.Algebra.Polynomial.RingDivision
import Mathlib.Algebra.Polynomial.Roots
import Mathlib.LinearAlgebra.Matrix.Polynomial
import Mathlib.RingTheory.PowerSeries.Binomial
import Mathlib.RingTheory.PowerSeries.Trunc
import Mathlib.Tactic.Ring

section
open Finset

namespace D1Bound5

variable {F : Type*} [Field F] [CharZero F]




theorem _root_.D1Bound5.bennett_prod_erase_last_erase {M : Type*} [CommMonoid M] (n : ℕ)
    (j : Fin n) (f : Fin (n + 1) → M) :
    (∏ l ∈ ((Finset.univ : Finset (Fin (n + 1))).erase (Fin.last n)).erase
      j.castSucc, f l) = ∏ l ∈ (Finset.univ : Finset (Fin n)).erase j, f l.castSucc := by sorry





end D1Bound5
end