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