proposition: Lemma mem_cons_l : forall l x, mem x (x::l).
proof: Proof. Proof using. intros. rewrite* mem_cons_eq. Qed.
imports: Coq.Classes.Morphisms TLC(LibTactics LibLogic LibReflect LibOperation LibProd LibOption LibNat LibInt LibWf LibMonoid LibRelation)