Set of $\mathsf{NP}$-hard languages closed under set inclusion?
Indeed, if NP=P then every nontrivial problem is NP-hard, and in particular every nontrivial subset of an NP-hard problem (thus closing it to inclusion).