proposition: Lemma Frobenius_autX x n : (x ^+ n)^f = x^f ^+ n.
proof: Proof. by rewrite !fE -!exprM mulnC. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat div seq) mathcomp(choice fintype finfun bigop prime binomial)