Proof of `Correctness of ranked transition encodings` (1st statement)
groundedproofs/Lax369799Proofs/EncodingBisimulation.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
The forward implication follows by decoding ranked generators. For the converse, map both decoded systems to a common bisimulation quotient and rank each functional map. Re-encodings of the same transition system are generators, while the two ranked maps supply common unfoldings.