proposition: Lemma intRN m : (- m)%R == - m.
proof: Proof. by case: m => [[|n]|n]; rewrite ?oppR0 ?oppRK. Qed.
imports: mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat div order) mathcomp(ssralg ssrnum ssrint rat intdiv) Coq(Morphisms Setoid) fourcolor(real realsyntax)