Proof of `Value-level translations between MSO and tree automata`
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
The two witnesses operate directly on finite Lean values. Their correctness uses the previously verified automaton-to-formula construction and the marked-tree formula compiler; no serialization theorem occurs in the result.