Proof of `Short paths in a finite graph`
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
Reachable layers grow strictly until they contain the target; there are only vertices.