proposition: Lemma mem_nil_eq : forall x, mem x nil = False.
proof: Proof. Proof using. intros. extens. iff H; inverts H. Qed.
imports: Coq.Classes.Morphisms TLC(LibTactics LibLogic LibReflect LibOperation LibProd LibOption LibNat LibInt LibWf LibMonoid LibRelation)