proposition: Lemma size_algCpfactor x : size (algCpfactor x) = (x \isn't Num.real).+2.
proof: Proof. have [xR|xNR] := boolP (_ \is _); first by rewrite algCpfactorRE// size_XsubC. by rewrite algCpfactorCE// size_mul ?size_XsubC ?polyXsubC_eq0. Qed.
imports: HB(structures) mathcomp(all_ssreflect all_fingroup all_algebra) mathcomp(all_solvable all_field) Abel(various)