Proof of `Path supports determine reachability`
groundedproofs/Lax330177Proofs/Basic.lean · lax-330177
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
Take the ordered vertex sequence of a path witnessing reachability in the first graph. Support equivalence supplies a path with that same sequence in the second graph, so its first and last vertices are the required endpoints. Exchanging the graphs proves the reverse implication.