proposition: Lemma CRpow_one : forall {R : ConstructiveReals} (n:nat), @CRpow R 1 n == 1.
proof: Proof. induction n. - reflexivity. - transitivity (CRmult R 1 (CRpow 1 n)). + reflexivity. + rewrite IHn. rewrite CRmult_1_r. reflexivity. Qed.
imports: QArith Qabs ConstructiveReals ConstructiveRealsMorphisms ConstructiveAbs ConstructiveLimits ConstructiveSum