MAIN-theoremA = A0, P = P0, ∀ p. p ∈ P → p.count = 0 ∧ okp(p, # A), DAid(A, D), ADid(A, D), nodups(A), partitions(P, # A), Fok(F, P, # A)
⊦ ⟨MAIN(X; A, D, P, F)⟩
( perm(A0, A) ∧ partitions(P, # A) ∧ divides(P, P0, X, A) ∧ DAid(A, D) ∧ ADid(A, D) ∧ Fok(F, P, # A) ∧ partitionRefinement(P, A, P0, A0, X))divides-resetFok-lemNEWPARTS-theoremREFINE-theoremMAIN
516MAIN-theorem-proofMAIN-theorem-proof-info
The proof is valid.
../../../../specs/partelem/export/unit.xmlpartelem../../../../specs/partelem/export/elim/longlemmainfo.xmlelim../../../../specs/partelem/export/unit.xmlpartelem../../../../specs/partelem/export/sel-05/longlemmainfo.xmlsel-05