proposition: Lemma SlowMorph_increasing : forall {R1 R2 : ConstructiveReals} (x y : CRcarrier R1), x < y -> @SlowMorph R1 R2 x < SlowMorph y.
proof: Proof. intros. destruct (CR_Q_dense R1 _ _ H) as [q [H0 H1]]. apply (CRlt_trans _ (CR_of_Q R2 q)). - apply SlowMorph_increasing_Ql. exact H0. - apply SlowMorph_increasing_Qr. exact H1. Qed.
imports: QArith Qabs ConstructiveReals ConstructiveLimits ConstructiveAbs