Proof of `Correctness of ranked transition encodings` (2nd statement)
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
Enumerate the successor set of each vertex to give its outgoing edges directions. The vertex set, initial vertex, and valuations are retained.