proposition: Lemma scalerI a : a != 0 -> injective ( *:%R a : V -> V).
proof: Proof. by move=> nz_a; apply: can_inj (scalerK nz_a). Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat div seq) mathcomp(choice fintype finfun bigop prime binomial)