proposition: Lemma AQsin_correct : forall a, 'AQsin a = rational_sin ('a).
proof: Proof. intro a. mc_setoid_replace ('a : Q) with (('a / '1)%mc : Q). now apply AQsin_bounded_correct. rewrite rings.preserves_1, dec_fields.dec_recip_1. rewrite Qmult_1_r. reflexivity. Qed.
imports: Coq.QArith.Qround Coq.QArith.Qpower MathClasses.interfaces.abstract_algebra MathClasses.theory.nat_pow MathClasses.theory.int_pow CoRN.algebra.RSetoid CoRN.metric2.Metric CoRN.metric2.MetricMorphisms CoRN.metric2.UniformContinuity CoRN.model.totalorder.QMinMax CoRN.util.Qdlog CoRN.stdlib_omissions.Q CoRN.reals.fast.CRsin CoRN.reals.fast.CRstreams CoRN.reals.fast.CRAlternatingSum CoRN.reals.fast.Compress CoRN.reals.faster.ARAlternatingSum CoRN.reals.faster.ARArith