While this submission is a draft, it cannot be used by other submissions.

Proof of `Recognition induction for pure second-order logic` (3rd statement)

groundedproofs/Lax369799Proofs/SetLogicRecognition.lean · lax-369799

What this proof establishes

Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.

Read the Lean proof on GitHub

Description

Boolean operations use product algebras. Quantification forgets the new mark and uses the nonempty powerset algebra.