Proof of `Selection and common unfoldings of fully supported systems` (6th statement)
groundedproofs/Lax369799Proofs/SupportedMorphisms.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
Choose one initial vertex and one edge in each permitted direction, then restrict to the reachable part. The resulting map into the source is injective. Its composite to the target is a folding, which also lifts every output variable and proves full support.