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

Environment v4.30.0. The archive's epoch is v4.33.0; only submissions in v4.30.0 can cite this work.

Proof of `Büchi-Elgot-Trakhtenbrot theorem for finite words`

groundedproofs/Lax52Proofs/MSOAutomataEquivalence.lean · lax-52

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.

Read the Lean proof on GitHub