proposition: Lemma Rmorph_neq0 x : x != 0 -> phi x != 0.
proof: Proof. by rewrite -phi_eq phi0. Qed.
imports: mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat seq order) mathcomp(ssralg ssrnum ssrint rat) Coq(Morphisms Setoid) fourcolor(real realsyntax realprop)