Proof of `The subalgebra generated by a recognizing alphabet` (2nd statement)
groundedproofs/Lax369799Proofs/GeneratedAlgebra.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
Each generated sort is a subtype of the corresponding finite original sort.