Proof of `Shop scheduling` (1st statement)
groundedproofs/Lax434175Proofs/Shops.lean · lax-434175
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
An operation with a given machine has the machine set and the fixed set consisting of that machine alone.