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