Proof of `Polynomial-Time and Strict Reductions Are FPT-Reductions` (4th statement)
groundedproofs/Lax496464Proofs/WHierarchy/Machine/Compose/Strict.lean · lax-496464
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.