proposition: Lemma rmorph_int : forall n, f n%:~R = n%:~R.
proof: Proof. by move=> n; rewrite rmorphMz rmorph1. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat choice seq) mathcomp(fintype finfun bigop order ssralg countalg ssrnum) mathcomp(poly)