We also formalized the Monderer–Samet (1989) p-belief version, with proving assistance from @axiommathai's AxiomProver.
This illustrates the power of composability: Once the primitives (beliefs, partitions, etc.) are formal, we can automate probing for and proving extensions.