Proof of `Compressed transitions and their clone closure` (4th statement)
groundedproofs/Lax369799Proofs/CloneTransitions.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 a recurrent compression with at least as many copies as the clone. Cap excess copies at the last old direction. This map is surjective, and every compressed label lies below its original component.