∀ {α : Type u} {β : Type v} [inst : Ord α] [Std.TransOrd α] (t : Std.DTreeMap.Internal.Impl α fun x => β),
  t.Ordered →
    ∀ (lowerBound upperBound : α),
      Std.Slice.toList (Std.Roo.Sliceable.mkSlice t lowerBound<...upperBound) =
        List.filter (fun e => decide ((compare e.1 lowerBound).isGT = true ∧ (compare e.1 upperBound).isLT = true))
          (Std.DTreeMap.Internal.Impl.Const.toList t)