I'm studying complexity classes and the diagram in NP-Hardness article is confusing to me.

NP-hard has all problems that can be reduced in polynomial time from an NP to them. P is contained in NP. Then it is possible to reduce a problem X in P to a problem Y in NP-hard. This does not add up to me in the scenario P!=NP.

What am I missing here? Is P contained in NP-hard?