Proof of `Polynomial-Time and Strict Reductions Are FPT-Reductions` (8th statement)

groundedproofs/Lax496464Proofs/WHierarchy/BridgesDerived.lean · lax-496464

What this proof establishes

thm✓Lax496464.WH_A5_Bridges
thm✓Lax759944.TuringRamPolytimeEquivalence

thm✓Lax496464.WH_A5_Bridges (8th 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