Proof of `Compressed transitions and their clone closure` (6th 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
Take the maximum of the thresholds for the finitely many input labels and arities; the tuple spaces may have different dimensions.