{α : Type u_1} →
  {β : α → Type u_2} →
    [inst : Ord α] →
      (motive : (Std.DTreeMap.Internal.Impl.ExplorationStep α β fun x => Ordering.lt) → Sort u_3) →
        (step : Std.DTreeMap.Internal.Impl.ExplorationStep α β fun x => Ordering.lt) →
          ((ky : α) →
              (a : Ordering.lt = Ordering.lt) →
                (y : β ky) →
                  (a_1 : List ((a : α) × β a)) → motive (Std.DTreeMap.Internal.Impl.ExplorationStep.lt ky a y a_1)) →
            ((a : List ((a : α) × β a)) →
                (a_1 : Std.DTreeMap.Internal.Cell α β fun x => Ordering.lt) →
                  (r : List ((a : α) × β a)) → motive (Std.DTreeMap.Internal.Impl.ExplorationStep.eq a a_1 r)) →
              motive step