Proof of `The subalgebra generated by a recognizing alphabet` (1st 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
Choose a realizing system for each vertex label and flatten the resulting system of systems. Associativity proves closure under evaluation. The inclusion into the original algebra transports all algebra laws.