proposition: Lemma incomparable_eqF x y : (x >< y) -> (x == y) = false.
proof: Proof. by apply: contraNF => /eqP ->; rewrite comparablexx. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat choice seq) mathcomp(path fintype tuple bigop finset div prime finfun) mathcomp(finset)