Proof of `Variable renaming and inverse renaming without pruning` (2nd 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.
Description
Inverse variable renaming changes only external exit targets. It therefore commutes with substitution while retaining the same flattened vertices.