proposition: Lemma mem_remove_eq : forall x a l, mem x (remove a l) = (mem x l /\ x <> a).
proof: Proof. Proof using. intros. applys* mem_filter_eq. Qed.
imports: Coq.Classes.Morphisms TLC(LibTactics LibLogic LibReflect LibOperation LibProd LibOption LibNat LibInt LibWf LibMonoid LibRelation)