proposition: Lemma Rmorph_eq x y : phi x == phi y <-> x == y.
proof: Proof. by rewrite /Real.eq !Real.morph_le. Qed.
imports: mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat seq order) mathcomp(ssralg ssrnum ssrint rat) Coq(Morphisms Setoid) fourcolor(real realsyntax realprop)