In Automata and Formal Languages: How can I show that L is an equivalence relation?

Question

Below is the scenario:

Let x and y be strings and let L be any language. We say that x and y are distinguishable by L if some string z exists whereby