proposition: Lemma linearP a : {morph f : u v / a *: u + v >-> s a u + v}.
proof: Proof. by move=> u v /=; rewrite linearD linearZ_LR. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat div seq) mathcomp(choice fintype finfun bigop prime binomial)