Mathlib Map

Structures · Order

Preorder

A preorder is a reflexive, transitive relation . In a preorder, a < b means a ≤ b ∧ ¬b ≤ a, and < is defined this way by default. You can override this definition to set a better def-eq.

Defined in
Mathlib.Order.Defs.PartialOrder
Shape
One type argument · adds le_refl, le_trans, lt_iff_le_not_ge

Extends2

Extended by1

Forgetful instances

Every Preorder is also a

Concrete types that are instances66

  • Nat
  • Real
  • Rat
  • TopCat.carrier
  • Filter.Germ
  • WithVal
  • NonemptyInterval
  • ENat
  • Units
  • MeasureTheory.SimpleFunc
  • Finsupp
  • Zsqrtd
  • Interval
  • AddUnits
  • DFinsupp
  • CauSeq
  • Tropical
  • CategoryTheory.PreZeroHypercover.I₀
  • MeasureTheory.AEEqFun
  • Associates
  • WithTopology
  • ValuativeRel.WithPreorder
  • OrderRingHom
  • MulArchimedeanOrder
  • ArchimedeanOrder
  • OrderType
  • NONote
  • DyckWord
  • ONote
  • Booleanisation
  • PSet
  • Topology.WithUpper
  • Topology.WithLower
  • PFun
  • TopHom
  • BotHom
  • SSet.N
  • Topology.WithScott
  • Topology.WithUpperSet
  • Topology.WithLawson
  • Topology.WithLowerSet
  • CategoryTheory.GrothendieckTopology.Cover
  • CategoryTheory.ThinSkeleton
  • ContinuousOrderHom
  • AlgebraicGeometry.Scheme.AffineZariskiSite
  • SSet.S
  • Order.PartialIso
  • Specialization
  • Preord.carrier
  • Subtype
  • Prod
  • OrderDual
  • ULift
  • MulOpposite
  • Lex
  • AddOpposite
  • Shrink
  • WithTop
  • WithBot
  • Sum
  • Multiplicative
  • Additive
  • Sigma
  • WithZero
  • Quotient
  • OrderHom

How is a type an instance?

Loading the hierarchy index…

Assumed by9,289

Ancestors6