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

Proof of `Ordered syntactic algebras of finite presentations` (2nd 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

Relabel an outer morphism by presentation representatives and lift it through flattening, retaining every inner root. The resulting morphism reverses the contextual order on the evaluated classes.