proposition: Lemma CRmult_1_l : forall (x: CR), 1 * x == x.
proof: Proof. intro x. rewrite CRmult_scale. intros e1 e2. destruct x; simpl. rewrite Qplus_0_r. rewrite Qmult_1_l. rewrite <- (Qmult_1_l (`e1)). apply (regFun_prf ((1#1)*e1)%Qpos e2). Qed.
imports: CoRN.metric2.Metric CoRN.metric2.UniformContinuity CoRN.model.totalorder.QMinMax CoRN.model.totalorder.QposMinMax Coq.setoid_ring.Ring_theory Coq.Setoids.Setoid Coq.QArith.QArith Coq.QArith.Qabs Coq.QArith.Qround CoRN.metric2.Complete CoRN.metric2.ProductMetric CoRN.reals.fast.CRFieldOps CoRN.model.metric2.Qmetric CoRN.logic.Stability Coq.Logic.ConstructiveEpsilon CoRN.util.Qdlog MathClasses.interfaces.abstract_algebra MathClasses.interfaces.orders