proposition: Lemma CRmorph_proper : forall {R1 R2 : ConstructiveReals} (f : @ConstructiveRealsMorphism R1 R2) (x y : CRcarrier R1), x == y -> CRmorph f x == CRmorph f y.
proof: Proof. split. - intro abs. apply CRmorph_increasing_inv in abs. destruct H. contradiction. - intro abs. apply CRmorph_increasing_inv in abs. destruct H. contradiction. Qed.
imports: QArith Qabs ConstructiveReals ConstructiveLimits ConstructiveAbs