Proof of `Ordered syntactic algebras of finite presentations` (1st statement)
groundedproofs/Lax369799Proofs/FiniteOuterMorphisms.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 cover that reaches every outer vertex lifts through substitution. Global surjectivity supplies preimages for roots inside labels even when the corresponding outer vertex is unreachable. Contextual invariance of the resulting cover identifies the two evaluation classes.