Proof of `Conditioning graph routes on uniform endpoints` (3rd statement)
groundedproofs/Lax263307Proofs/ConditionalRoutes.lean · lax-263307
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
Every positive-probability route is nonempty and has a unique ordered endpoint pair. All other terms in the endpoint sum vanish.