Proof of `One family for shops with and without preemption` (2nd statement)
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
A preemptive shop schedule is a schedule with pieces in which the pieces of every operation sum to its processing time; the fields that preemptive shops do not have impose nothing at their value none.