proposition: Lemma mem_nil_inv : forall x, mem x nil -> False.
proof: Proof. Proof using. introv E. inverts E. Qed.
imports: Coq.Classes.Morphisms TLC(LibTactics LibLogic LibReflect LibOperation LibProd LibOption LibNat LibInt LibWf LibMonoid LibRelation)