Maximality of the Došen-Petrić Boolean Category
Došen and Petrić conjectured that their freely generated zero-identity Boolean category is not maximal. The question is whether every congruence preserved by the operations on morphisms and by uniform substitution is either equality or total.
An identification of distinct parallel morphisms is reduced to equality of the product projections. Boolean Coherence isolates an occurrence pair on which the two relations differ, which yields the equation j_A∘π_1 = 0. Uniform substitution, double negation, and certain isomorphisms (or, in a second proof, the mix morphism) then collapse the quotient to a preorder. Formulas and arrow terms are encoded as inductive types in Lean 4, with derivability as a generated relation, and substitution, normalization and the occurrence interpretation are proved to respect it.
The category is maximal, which disproves the conjecture. The Lean development checks both proofs and their dependencies, including Boolean Coherence and the correspondence between tagged-occurrence substitution and finite-ordinal substitution.
