Theorems · Definition · order theory
OrderHom.antisymmetrization
{α : Type u_1} →
{β : Type u_2} →
[inst : Preorder α] →
[inst_1 : Preorder β] →
(α →o β) → (Antisymmetrization α fun x1 x2 => x1 ≤ x2) →o Antisymmetrization β fun x1 x2 => x1 ≤ x2Turns an order homomorphism from α to β into one from Antisymmetrization α to
Antisymmetrization β. Antisymmetrization is actually a functor. See Preorder_to_PartialOrder.
- Defined in
- Mathlib.Order.Antisymmetrization
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 13 from the axioms · uses propext, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coeproof · cited by 62,936
- Preorderstatement and proof · cited by 7,952
- OrderHomstatement and proof · cited by 934
- Antisymmetrizationstatement · cited by 25
- Quotient.map'proof · cited by 18
- liftFun_antisymmRelproof · cited by 3
Cited by6
Results whose statement or proof uses this declaration.
- ArchimedeanClass.orderHomproof · cited by 8
- MulArchimedeanClass.orderHomproof · cited by 5
- preordToPartOrdproof · cited by 3
- OrderHom.antisymmetrization_applystatement · cited by 0
- OrderHom.antisymmetrization_apply_mkstatement · cited by 0
- OrderHom.coe_antisymmetrizationstatement · cited by 0