Proof of `Syntactic set-algebras and rankwise finiteness` (2nd statement)
groundedproofs/Lax369799Proofs/ReachableFiniteness.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
Every class of the finite-presentation contextual quotient has a reachable representative. Equality of such classes implies equality in the original reachable contextual quotient, since every original context is a finite context with the same final observation. This gives a surjection from the finite repaired quotient onto the original syntactic quotient.