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