Does apx hard imply NP hard?

Could you please clarify for me the relationship between "APX-hard" and "NP-hard" in the context of computational complexity? Specifically, I'm wondering if a problem being APX-hard necessarily implies that it is also NP-hard. Could you elaborate on the implications and potential differences between these two classifications, and provide any examples to further illustrate your points?