proposition: Lemma classes_gt0 : 0 < #|classes G|.
proof: Proof. by rewrite (cardsD1 1) classes1. Qed.
imports: HB(structures) mathcomp(ssreflect ssrbool ssrfun eqtype ssrnat seq choice) mathcomp(fintype div path tuple bigop prime finset)