# polynomial time reduction of 2 langauges

If we can reduce a language y to x.

x ≤P y

how do I prove

 x(complement) ≤P  y (complement)


The definition of many-one reducibility means that, if you've proven that $X\leq Y$, you get $\overline{X}\leq\overline{Y}$ for free.