While this submission is a draft, it cannot be used by other submissions.

Proof of `Compressed transitions and their clone closure` (1st statement)

groundedproofs/Lax369799Proofs/CloneTransitions.lean · lax-369799

What this proof establishes

Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.

Read the Lean proof on GitHub

Description

Decode the unary type codes, apply closure under duplication, and transport the resulting tuple along the positive target arity.