Proof of `Lemma 3` (3rd 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
Soundness and completeness of the printed recursion, proved in . A derived entry is always dominated by a genuine one — the sets the recursion really tracks have at least the weight and at most the load it records — so the optimum it reports is the true optimum even though individual entries are not.