Proof of `Selection and common unfoldings of fully supported systems` (5th 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
The reachable part of the fiber product is deterministic. Its projections lift all outputs from either factor. Pairing any two compatible maps from a system lands in this reachable part and is the unique factorization.