Proof of `The stacked scheduling instance` (1st statement)
groundedproofs/Lax391470Proofs/StackedNumbering.lean · lax-391470
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
The numbered auxiliary instance and its stacked instance are renumberings of the typed ones, for which the exchange argument of the source is carried out.