Breaking graph symmetries by edge colourings

The distinguishing index $D^{\mathrm{\prime }}(G)$ of a graph $G$ is the least number of colours needed in an edge colouring which is not preserved by any non-trivial automorphism. Broere and Pil'sniak conjectured that if every non-trivial automorphism of a countable graph $G$ moves infinitely many edges, then $D’(G) \leq 2$. We prove this conjecture.