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

Proof of `Correctness of ranked transition encodings` (2nd statement)

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

Enumerate the successor set of each vertex to give its outgoing edges directions. The vertex set, initial vertex, and valuations are retained.