proposition: Lemma fmorph_char : char R =i char F.
proof: Proof. by move=> p; rewrite !inE -fmorph_eq0 rmorph_nat. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat div seq) mathcomp(choice fintype finfun bigop prime binomial)