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