So every problem in NP can be reduced in poly-time to problems in NPC, and because P is in NP, we can of course conclude that every problem in P can be reduced in poly-time to N
