proposition: Lemma sorted_ggen_uniq l : sorted ggen l -> uniq l.
proof: Proof. by rewrite - {2} (revK l) - rev_sorted rev_uniq; apply: sorted_llen_uniq. Qed.
imports: mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat) mathcomp(seq path fintype div bigop binomial) mathcomp(prime finset ssralg ssrnum ssrint)