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

Proof of `Variable renaming and inverse renaming without pruning` (1st statement)

groundedproofs/Lax369799Proofs/FiniteRenaming.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.

Read the Lean proof on GitHub

Description

The same vertex map works in both directions: moving the variable map across the morphism changes exactly the variable targets of its edges.