Based on Cook's theorem,

Any NP problem can be converted to SAT in polynomial time

I know that SAT is a NP-complete problem. Therefore, is it accurate to say:
If we **can** reduce a search problem A (which is in NP) to problem B in a polynomial number of steps, then problem B must be NP-complete?