proposition: Lemma le_eqVlt x y: (x <= y) = (x == y) || (x < y).
proof: Proof. by rewrite lt_neqAle; case: eqP => //= ->; rewrite lexx. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat choice seq) mathcomp(path fintype tuple bigop finset div prime finfun) mathcomp(finset)