proposition: Lemma rootCK n : (n > 0)%N -> cancel n.-root (fun x => x ^+ n).
proof: Proof. by case: n => //= n _ x; case_rootC. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat seq choice) mathcomp(ssrAC div fintype path bigop order finset fingroup) mathcomp(ssralg poly)