proposition: Lemma mem_sort_keys ks k : k \in ks -> k \in sort_keys ks.
proof: Proof. by rewrite sort_keysE. Qed.
imports: HB(structures) mathcomp(ssreflect ssrbool ssrnat eqtype ssrfun seq) mathcomp(choice path finset finfun fintype bigop)