Proof of `Finite path-summary algebras` (1st statement)
groundedproofs/Lax369799Proofs/PathAlgebra.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
A finite execution in a flattening can be partitioned into inner executions, and conversely inner executions expand to flattened paths. Reachable restriction preserves executions from the initial vertex.