Theorems · Theorem · order theory

Order.isSuccPrelimitRecOn_succ_of_not_isMax

∀ {α : Type u_1} {b : α} {motive : α → Sort u_2} [inst : LinearOrder α] [inst_1 : SuccOrder α]
  (succ : (a : α) → ¬IsMax a → motive (Order.succ a)) (isSuccPrelimit : (a : α) → Order.IsSuccPrelimit a → motive a)
  (hb : ¬IsMax b), Order.isSuccPrelimitRecOn (Order.succ b) succ isSuccPrelimit = succ b hb

Defined in

Mathlib.Order.SuccPred.Limit

Cited by

2 results in Mathlib

Foundations

Depth 24 from the axioms · uses propext, Classical.choice, Quot.sound

Assumes

LinearOrderSuccOrder