Proof of `Clone-automaton normal form and modal translation` (2nd statement)
groundedproofs/Lax369799Proofs/CloneNormalization.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
Choose the finite syntactic unary and nullary sorts and their algebraic branch condition. Stabilization compresses an accepted duplicated run into the recurrent clone table. Conversely, rerouting lifts a clone run to an original run with larger labels and isomorphic decoding.