Proof of `Para-NP-hardness along the steps between objectives` (8th statement)
groundedproofs/Lax434175Proofs/ThresholdParams.lean · lax-434175
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.
Description
Compose the reduction with the word map of the step: the stepped word encodes an instance with the same kernel instance, so the parameter stays within the bound.