∀ {α : Type u_1} (b : α) {motive : α → Sort u_2} [inst : PartialOrder α] [inst_1 : PredOrder α]
  [inst_2 : WellFoundedGT α] (isMin : (a : α) → IsMax a → motive a)
  (succ : (a : α) → ¬IsMin a → motive a → motive (Order.pred a))
  (isSuccLimit : (a : α) → Order.IsPredLimit a → ((b : α) → a < b → motive b) → motive a),
  PredOrder.colimitRecOn b isMin succ isSuccLimit =
    PredOrder.prelimitRecOn b succ fun a ha IH => if h : IsMax a then isMin a h else isSuccLimit a ⋯ IH