proposition: Lemma fmod1 : fmod 1 = 0.
proof: Proof. by rewrite -fmval0 fmvalK. Qed.
imports: HB(structures) mathcomp(ssreflect ssrbool ssrfun eqtype ssrnat seq path) mathcomp(div choice fintype bigop ssralg finset fingroup) mathcomp(morphism perm finalg action gproduct commutator) mathcomp(cyclic)