Proof of `Interval scheduling with eligible machine sets as a zoo problem` (3rd statement)
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.
Description
The program of the interval scheduling algorithm decides the zoo problem: on the words where every job has an eligible machine the two problems have the same yes-instances and the same parameter.