{α : Type u_1} →
  {β : Type u_2} →
    (motive : (x : Std.DTreeMap.Internal.Impl α fun x => β) → x.isEmpty = false → Sort u_3) →
      (x : Std.DTreeMap.Internal.Impl α fun x => β) →
        (x_1 : x.isEmpty = false) →
          ((size : ℕ) →
              (k : α) →
                (v : β) →
                  (l : Std.DTreeMap.Internal.Impl α fun x => β) →
                    (x :
                        (Std.DTreeMap.Internal.Impl.inner size k v l Std.DTreeMap.Internal.Impl.leaf).isEmpty = false) →
                      motive (Std.DTreeMap.Internal.Impl.inner size k v l Std.DTreeMap.Internal.Impl.leaf) x) →
            ((size : ℕ) →
                (k : α) →
                  (v : β) →
                    (l : Std.DTreeMap.Internal.Impl α fun x => β) →
                      (size_1 : ℕ) →
                        (k_1 : α) →
                          (v_1 : β) →
                            (l_1 r : Std.DTreeMap.Internal.Impl α fun x => β) →
                              (h :
                                  (Std.DTreeMap.Internal.Impl.inner size k v l
                                        (Std.DTreeMap.Internal.Impl.inner size_1 k_1 v_1 l_1 r)).isEmpty =
                                    false) →
                                motive
                                  (Std.DTreeMap.Internal.Impl.inner size k v l
                                    (Std.DTreeMap.Internal.Impl.inner size_1 k_1 v_1 l_1 r))
                                  h) →
              motive x x_1