While this submission is a draft, it cannot be used by other submissions.

Proof of `Boolean closure and inverse relabelling of recognizable languages` (4th statement)

groundedproofs/Lax369799Proofs/RecognitionClosure.lean · lax-369799

What this proof establishes

Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.

Read the Lean proof on GitHub

Description

Use the same product algebra, accepting when at least one coordinate belongs to its accepting subset.