Proof of `Compressed transitions and their clone closure` (5th 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
The space of compressed n-tuples is finite. Apply eventual containment in the recurrent part of the sequence.