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