proposition: Lemma seq_fset_uniq : uniq (seq_fset s).
proof: Proof. by rewrite [seq_fset]unlock /= sort_keys_uniq. Qed.
imports: HB(structures) mathcomp(ssreflect ssrbool ssrnat eqtype ssrfun seq) mathcomp(choice path finset finfun fintype bigop)