Proof of `Scheduling Every Job Is Hard for Constant Processing Times and Unit Weights` (1st statement)

groundedproofs/Lax888481Proofs/Theorem2.lean · lax-888481

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

The slice statement, forgetting the slice.