proposition: Lemma lt_eqF x y: x < y -> x == y = false.
proof: Proof. by rewrite lt_neqAle => /andP [/negbTE->]. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat choice seq) mathcomp(path fintype tuple bigop finset div prime finfun) mathcomp(finset)