While this submission is a draft, it cannot be used by other submissions.

Proof of `Ordered syntactic algebras of finite presentations` (1st statement)

groundedproofs/Lax369799Proofs/FiniteOuterMorphisms.lean · lax-369799

What this proof establishes

Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.

Read the Lean proof on GitHub

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.