Does this work? Use the Bellantoni-Cook theorem to enumerate all the polynomial time Turing machines.  If P=NP you will eventually run into a machine that you can recognize as Levin's universal search algorithm.  That proves Levin's algorithm runs in P-time and therefore P=NP.