proposition: Lemma mulr1 : right_id oneU mulU.
proof: Proof. by move=> x; apply: val_inj; rewrite !SubK mulr1. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat div seq) mathcomp(choice fintype finfun bigop prime binomial)