∀ {α : Type u_1} (p : α → Bool) (a : α) (x : List α) (a_1 : α) (t : List α),
  List.insertP.loop p a (a_1 :: t) x =
    bif p a_1 then (a :: x).reverseAux (a_1 :: t) else List.insertP.loop p a t (a_1 :: x)