proposition: Lemma Cunit_eq : forall a b, msp_eq (Cunit a) (Cunit b) <-> msp_eq a b.
proof: Proof. intros a b. do 2 rewrite <- ball_eq_iff. split; intros H e epos; [rewrite <- (ball_Cunit e) | rewrite -> (ball_Cunit e)]; apply H; assumption. Qed.
imports: CoRN.metric2.UniformContinuity CoRN.model.structures.QposInf CoRN.metric2.Classification CoRN.model.totalorder.QposMinMax CoRN.model.totalorder.QMinMax