Strict Weak Ordering Ex

Less-than binary predicate ( < ) defines a Strict Weak Ordering, since
x < x  is false
x < y  implies  !(y < x)
!(x < y)  and  !(y < x)  implies  x == y
x == y  and  y == z  implies  x == z