Mathlib Map

Theorems · Definition · order theory

Preorder.lift

{α : Type u_2} → {β : Type u_3} → [Preorder β] → (α → β) → Preorder α

Transfer a Preorder on β to a Preorder on α using a function f : α → β. See also Function.Injective.preorder when only the proof fields need to be transferred. See note [reducible non-instances].

Defined in
Mathlib.Order.Basic
Cited by
1 results in Mathlib
Foundations
Depth 11 from the axioms · uses propext
Assumes
Preorder
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

specializationPreorder · cited by 2specializationPreorderTuple.bubble_sort_induction' · cited by 1Tuple.bubble_sort_inducti…AddValuation.toPreorder · cited by 0AddValuation.toPreorderValuation.toPreorder · cited by 0Valuation.toPreorderPreorder · cited by 7952PreorderFunction.Injective.preorder · cited by 0Injective.preorderPreorder.liftCITED BYCITES

Cites2

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

Cited by4

Results whose statement or proof uses this declaration.