Proof of `Regular functions are closed under conditionals over regular languages`
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
Regular functions are closed under conditionals over regular languages (Lemma C.2.10, third item): a rational marking of the input with its membership in and the sum of Claim C.2.11 (, third conjunct).
Attribution
Lemma C.2.10 of Transducers, Part C; formalised by Aristotle (Harmonic), .