Proof of `Ranking a functional bisimulation`
groundedproofs/Lax369799Proofs/RankedLifting.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
At a target vertex, enumerate each successor together with a copy index bounded by the source size. For each source vertex, map these copies onto all its successors lying over that target successor. The resulting two rankings have identical direction sets along the given functional map.