∀ {α : Type u_1} {b : α} {motive : α → Sort u_2} [inst : PartialOrder α] [inst_1 : PredOrder α]
  [inst_2 : WellFoundedGT α] (pred : (a : α) → ¬IsMin a → motive a → motive (Order.pred a))
  (isPredPrelimit : (a : α) → Order.IsPredPrelimit a → ((b : α) → a < b → motive b) → motive a)
  (hb : Order.IsPredPrelimit b),
  PredOrder.prelimitRecOn b pred isPredPrelimit =
    isPredPrelimit b hb fun x x_1 => PredOrder.prelimitRecOn x pred isPredPrelimit