proposition: Lemma rev_last : forall x l, rev (l & x) = x::(rev l).
proof: Proof. Proof using. intros. rewrite~ rev_app. Qed.
imports: Coq.Classes.Morphisms TLC(LibTactics LibLogic LibReflect LibOperation LibProd LibOption LibNat LibInt LibWf LibMonoid LibRelation)