Proof of `Bisimulation under ranked decoding` (1st 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
Use equality, reverse a bisimulation, and compose two bisimulations by existential quantification over the intermediate vertex.