proposition: Lemma addrN : @right_inverse V V V 0 -%R +%R.
proof: Proof. by move=> x; rewrite addrC addNr. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat div seq) mathcomp(choice fintype finfun bigop prime binomial)