Not using anything other than the definition of SD and DI know if A is SD, then there exists a TM M such that A = L(M), and A can be enumerated, and if A is decidable, then everything in A can be enumerated in some order.How do I set up the diagonal matrix? 
Construct a semi decidable but not decidable set using the diagonal argument
complexity theory