proposition: Lemma raddfZ_int a u : a \is a int_num -> f (a *: u) = a *: f u.
proof: Proof. by move=> /intrP[m ->]; rewrite !scaler_int raddfMz. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat seq choice) mathcomp(fintype bigop order ssralg poly ssrnum ssrint)