proposition: Lemma seq_fsetE : seq_fset s =i s.
proof: Proof. by move=> a; rewrite [seq_fset]unlock sort_keysE. Qed.
imports: HB(structures) mathcomp(ssreflect ssrbool ssrnat eqtype ssrfun seq) mathcomp(choice path finset finfun fintype bigop)