The only if is clear but the if side seems to be assuming that P=NP entails not just proving the existence of polynomial time solution algorithms but also const

The only if is clear but the if side seems to be assuming that P=NP entails not just proving the existence of polynomial time solution algorithms but also constructing said algorithms?