proposition: Lemma uniq_one_1 : uniq (x ~ b).
proof: Proof. clear. rewrite_alist ((x ~ b) ++ nil). apply uniq_push. apply uniq_nil. apply empty_1. Qed.
imports: Coq.FSets.FSets Coq.Lists.List Coq.Logic.Decidable Coq.Strings.String String Metalib.CoqFSetDecide Metalib.CoqListFacts Metalib.LibTactics Metalib.CoqFSetInterface Coq.Classes.Equivalence Coq.Classes.EquivDec Metalib.CoqEqDec