proposition: Lemma linearZ c a (h_c := h c) (f : Linear.map_for U s a h_c) u : f (a *: u) = h_c (Linear.wrap f u).
proof: Proof. by rewrite linearZ_LR; case: f => f /= ->. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat div seq) mathcomp(choice fintype finfun bigop prime binomial)