proposition: Lemma ratRE a : ratRR a == numq a / denq a.
proof: Proof. by rewrite /ratRR /ratR Qint_def; case: eqP => // ->; rewrite invR1 mulR1. Qed.
imports: mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat div order) mathcomp(ssralg ssrnum ssrint rat intdiv) Coq(Morphisms Setoid) fourcolor(real realsyntax)