Order.pred

{α : Type u_1} → [inst : Preorder α] → [PredOrder α] → α → α

The predecessor of an element. If a is not minimal, then pred a is the greatest element less than a. If a is minimal, then pred a = a.

Defined in: Mathlib.Order.SuccPred.Basic
Cited by: 273 results in Mathlib
Foundations: Depth 3 from the axioms, rests on 4 definitions · uses no axioms
Assumes: Preorder PredOrder

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Results whose statement or proof uses this declaration.

Showing the 200 most cited of 282.