proposition: Lemma map_rev : forall f l, map f (rev l) = rev (map f l).
proof: Proof. Proof using. intros. induction~ l. { rewrite map_cons. rew_list. rewrite map_last. rewrite~ IHl. } Qed.
imports: Coq.Classes.Morphisms TLC(LibTactics LibLogic LibReflect LibOperation LibProd LibOption LibNat LibInt LibWf LibMonoid LibRelation)