proposition: Lemma lt_neqAle x y: (x < y) = (x != y) && (x <= y).
proof: Proof. by rewrite lt_def eq_sym. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat choice seq) mathcomp(path fintype tuple bigop finset div prime finfun) mathcomp(finset)