proposition: Lemma sorted_llen_uniq l: sorted llen l -> uniq l.
proof: Proof. apply: (sorted_uniq transitive_llen irreflexive_llen). Qed.
imports: mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat) mathcomp(seq path fintype div bigop binomial) mathcomp(prime finset ssralg ssrnum ssrint)