This question already has an answer here:
How to prove that diagonal language is NP hard ? Any pointers in the direction would help. I am aware of this question but all the answer gives is a definition of reduction.
Edit : Diagonal-language contains all strings X s.t. Mx(x) = 0 where Mx is the turing machine whose string encoding is given by x.