Proof of `Finite automata are MSO-definable`
groundedproofs/Lax52Proofs/NFAToMSO.lean · lax-52
What this proof establishes
no assumptions
thm✓
Lax52.NFAToMSOAssuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.