Is there any decidable problem that is NOT NP-HARD?

Question

Is there a proof that there exists a decidable problem that is NOT NP-HARD??

Answer 1

Very simple answer:

Since you need one $x \in A$, and one $x \not \in A$ for a polynomial time reduction, $A = \emptyset$ cannot be a hard language for NP.