{ι : Type u_1} →
  {I : BoxIntegral.Box ι} →
    {motive : BoxIntegral.Prepartition I → Sort u} →
      ((boxes : Finset (BoxIntegral.Box ι)) →
          (le_of_mem' : ∀ J ∈ boxes, J ≤ I) →
            (pairwiseDisjoint : (↑boxes).Pairwise (Function.onFun Disjoint BoxIntegral.Box.toSet)) →
              motive { boxes := boxes, le_of_mem' := le_of_mem', pairwiseDisjoint := pairwiseDisjoint }) →
        (t : BoxIntegral.Prepartition I) → motive t