proposition: Lemma rootCMr n x z : 0 <= x -> n.-root (z * x) = n.-root z * n.-root x.
proof: Proof. by move=> x_ge0; rewrite mulrC rootCMl // mulrC. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat seq choice) mathcomp(ssrAC div fintype path bigop order finset fingroup) mathcomp(ssralg poly)