Lax Lean Archive

While this submission is a draft, it cannot be used by other submissions.

Proof of `Scheduling every job is hard for constant processing times and unit weights` (1st statement)

conditional — 1 open assumptionproofs/Lax470956Proofs/Theorem2.lean · lax-470956

What this proof establishes

thm×Lax470956.Theorem2 (1st statement)

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.