Proof of `Boolean closure and inverse relabelling of recognizable languages` (4th statement)
groundedproofs/Lax369799Proofs/RecognitionClosure.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
Use the same product algebra, accepting when at least one coordinate belongs to its accepting subset.