Proof of `Systems with all output variables reachable` (1st statement)
groundedproofs/Lax369799Proofs/SupportedSystems.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
Every outer edge can be traversed through a reachable variable of its inner system. Induct on an outer path, then follow an inner path to the desired vertex. No flattened vertex is removed.