Proof of `Recognition induction for pure second-order logic` (3rd statement)
groundedproofs/Lax369799Proofs/SetLogicRecognition.lean · lax-369799
What this proof establishes
no assumptions
Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.
Description
Boolean operations use product algebras. Quantification forgets the new mark and uses the nonempty powerset algebra.