If I want to prove that a language A is not in P, yet I can't find a proper polynomial reduction from an NPC language to A, can I assume that A is in P, and than present a polynomial algorithm to the NPC language to get a contradiction?