proposition: Lemma add_already_in a P : mem a P -> add a P [=] P.
proof: Proof. intros a_in_P x. split; fo. subst. hyp. Qed.
imports: Coq(Basics Morphisms Setoid) CoLoR(LogicUtil RelUtil FunUtil ListUtil NatUtil ClassicUtil BoundNat)