proposition: Lemma iteropE n x : iterop n mul x idm = iter n (mul x) idm.
proof: Proof. by case: n => // n; rewrite iterSr mulm1 iteropS. Qed.
imports: HB(structures) mathcomp(ssreflect ssrbool ssrfun eqtype ssrnat seq path) mathcomp(div fintype tuple finfun)