proposition: Lemma fast_MonadLaw1 a : Cmap plX (uc_id X) a =m a.
proof: Proof. destruct (Cmap_correct plX (uc_id X)). rewrite H0. apply MonadLaw1. 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