Proof of `Finite presentations without reachability pruning` (3rd statement)
groundedproofs/Lax369799Proofs/UntrimmedFlattening.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
Relabelling changes neither vertex sets nor marks and transitions, so both constructions use the same finite enumeration and labelling.