Proof of `Polynomial-time substitution of black-box subroutines` (2nd statement)

groundedproofs/Lax218471Proofs/Substitution.lean · lax-218471

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.

Read the Lean proof on GitHub