proposition: Lemma fast_MonadLaw2 (f:Y --> Z) (g:X --> Y) a : Cmap plX (uc_compose f g) a =m (Cmap plY f (Cmap plX g a)).
proof: Proof. destruct (Cmap_correct plX (f ∘ g)). rewrite H0. clear H0 H. destruct (Cmap_correct plY f). rewrite H0. clear H0 H. destruct (Cmap_correct plX g). rewrite H0. clear H0 H. apply MonadLaw2. Qed.
imports: CoRN.metric2.Metric CoRN.metric2.UniformContinuity CoRN.metric2.Complete CoRN.model.totalorder.QMinMax CoRN.model.totalorder.QposMinMax CoRN.stdlib_omissions.List CoRN.stdlib_omissions.Q