Short Axiomatization of Stratified Comprehension
Several finite axiomatizations of stratified comprehension (as in NF/NFU) are known. The question is whether a smaller set of set existence principles suffices to derive the fourteen-point finite basis recorded by Holmes, and to derive stratified comprehension directly.
Five set existence principles are proposed. Under Extensionality they derive the fourteen Holmes set-construction principles (Sheffer stroke, unordered relative products, and similar constructions). A separate direct, unordered proof derives every stratified comprehension instance using only extensionality for nonempty sets, bypassing the ordered-pair machinery. Both developments are formalized in self-contained Lean 4 files, and a verification script checks for sorry, admit and custom axioms.
The five principles yield all fourteen Holmes basis points. With nonempty extensionality alone they imply stratified comprehension. Earlier displayed reductions for unordered, Cartesian and ordered relative products are corrected. Both developments compile in Lean 4.24 without sorry, admit or custom axioms.
