Proof of `Extremal accepted situations in the syntactic algebra` (6th statement)
groundedproofs/Lax369799Proofs/ExtremalSituations.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
Iterate extremal replacement through the finite vertex set. For the converse, monotonicity and upward closure restore the original labels.