Theorems · Definition · order theory
Antisymmetrization
(α : Type u_1) → (r : α → α → Prop) → [IsPreorder α r] → Type u_1
The partial order derived from a preorder by making pairwise comparable elements equal. This is
the quotient by fun a b => a ≤ b ∧ b ≤ a.
- Defined in
- Mathlib.Order.Antisymmetrization
- Cited by
- 25 results in Mathlib
- Foundations
- Depth 9 from the axioms · uses no axioms
- Assumes
- IsPreorder
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- IsPreorderstatement and proof · cited by 20
- AntisymmRel.setoidproof · cited by 7
Cited by36
Results whose statement or proof uses this declaration.
- ArchimedeanClassproof · cited by 247
- MulArchimedeanClassproof · cited by 81
- toAntisymmetrizationstatement · cited by 12
- OrderIso.dualAntisymmetrizationstatement · cited by 5
- ofAntisymmetrizationstatement · cited by 4
- OrderHom.antisymmetrizationstatement · cited by 3
- ArchimedeanClass.indproof · cited by 3
- preordToPartOrdproof · cited by 3
- Antisymmetrization.indstatement and proof · cited by 2
- Antisymmetrization.prodEquivstatement · cited by 2
- OrderEmbedding.ofAntisymmetrizationstatement · cited by 1
- MulArchimedeanClass.indproof · cited by 1