proposition: Lemma mulKVg : rev_left_loop invg mulgT.
proof: Proof. by move=> x y; rewrite mulgA mulgV mul1g. Qed.
imports: HB(structures) mathcomp(ssreflect ssrbool ssrfun eqtype ssrnat seq choice) mathcomp(fintype div path tuple bigop prime finset)