Proof of `From exact running times to complexity classes` (1st statement)
groundedproofs/Lax434175Proofs/ResultTransfer.lean · lax-434175
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
The constant serves both as the word bound and as the factor.