Diagonal_Relation_is_Ordering_and_Equivalence
Provedequivalence-relationsorder-theoryproofwiki
Let be a relational structure where is the diagonal relation, defined as Then is the '''only''' relation on which is both an equivalence and an ordering.
Preamble
import Mathlib.Analysis.Complex.Basic
Formal statement
theorem Diagonal_Relation_is_Ordering_and_Equivalence {S : Type _} (R : S -> S -> Prop) (hEquiv : Equivalence R) (hAnti : forall x y, R x y -> R y x -> x = y) : forall x y : S, R x y <-> x = y := by sorrySource