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