Proof of `Bisimulation-invariant MSO on finite graphs` (1st statement)
groundedproofs/Lax369799Proofs/MainTheorems.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
Apply the verified total finite-search compiler. Its bounded table list contains an equivalent sentence under the invariance promise, and its finite comparison bound separates every inequivalent candidate pair.