TURING MACHINE LANGUAGES QUESTION:

Prove that the following language is undecidable:

L1 = {M1, M2, M3 | L(M1) L(M2) = L(M3)}