Proof of `Conditioning graph routes on uniform endpoints` (2nd 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
Factor the four finite endpoint sums into two separate sums and use the mixture identity for each route. Cancel the factor n⁴.