proposition: Lemma les0 s : s <= [::] = (s == [::]).
proof: Proof. by rewrite leEseq. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat choice seq) mathcomp(path fintype tuple bigop finset div prime finfun) mathcomp(finset)