Not the parent, but you are correct in that NP-Hard includes also harder problems than the problems in NP. "At least NP-hard" is just "NP-hard".
> There are harder problems in NP
That is an unresolved question. It might turn out that every problem in NP is equally hard. (Up to a polynomial translation cost.)
But I was wrong ultimately