proposition: Lemma map_make : forall f n v, map f (make n v) = make n (f v).
proof: Proof. Proof using. intros. induction n as [|n']. { do 2 rewrite make_zero. auto. } { do 2 rewrite make_succ. rewrite map_cons. fequals. } Qed.
imports: Coq.Classes.Morphisms TLC(LibTactics LibLogic LibReflect LibOperation LibProd LibOption LibNat LibInt LibWf LibMonoid LibRelation)