Proof of `Compressed transitions and their clone closure` (1st 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
Decode the unary type codes, apply closure under duplication, and transport the resulting tuple along the positive target arity.