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

Proof of `Bisimulation-invariant MSO on finite graphs` (1st statement)

groundedproofs/Lax369799Proofs/MainTheorems.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

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.