proposition: Lemma mulgV : right_inverse 1 invg mulgT.
proof: Proof. by move=> x; rewrite -{1}(invgK x) mulVg. Qed.
imports: HB(structures) mathcomp(ssreflect ssrbool ssrfun eqtype ssrnat seq choice) mathcomp(fintype div path tuple bigop prime finset)