proposition: Lemma Map_compose_Map : forall X Y Z (f:Y->Z) (g:X -> Y) a, ((fun a => f (g a)) ^@> a) = (f ^@> (g ^@> a)).
proof: Proof. induction a; simpl; congruence. Qed.
imports: CoRN.model.structures.OpenUnit CoRN.tactics.CornTac CoRN.tactics.Qauto CoRN.model.ordfields.Qordfield CoRN.algebra.COrdFields