Proof of `Bisimulation under ranked decoding` (2nd statement)
groundedproofs/Lax369799Proofs/RankedBisimulation.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
A ranked system morphism is locally surjective and decodes to a bisimulation. A common ranked unfolding therefore gives bisimilar decodings. Isomorphisms and equivalence closure preserve bisimilarity.