proposition: Lemma scaler0 a : a *: 0 = 0 :> V.
proof: Proof. by rewrite -{1}(scale0r 0) scalerA mulr0 scale0r. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat div seq) mathcomp(choice fintype finfun bigop prime binomial)