proposition: Lemma rmorphzP (f : {rmorphism int -> R}) : f =1 ( *~%R 1).
proof: Proof. move=> n; wlog : n / 0 <= n; case: n=> [] n //; do ?exact. by rewrite NegzE !rmorphN=>->. move=> _; elim: n=> [|n ihn]; first by rewrite rmorph0. by rewrite intS !rmorphD /= !rmorph1 ihn. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat choice seq) mathcomp(fintype finfun bigop order ssralg countalg ssrnum) mathcomp(poly)