proposition: Lemma null_fun_is_scalable : scalable_for s (\0 : U -> V).
proof: Proof. by move=> a v /=; rewrite raddf0. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat div seq) mathcomp(choice fintype finfun bigop prime binomial)