Proof of `Executable finite model checking for both logics` (2nd statement)
groundedproofs/Lax369799Proofs/FiniteModelChecking.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
Finite Boolean quantification agrees with quantification over vertices and arbitrary vertex subsets.