A theorem in edge colouring

We prove the following theorem: if G is an edge-chromatic critical multigraph with more than 3 vertices, and if x , y are two adjacent vertices of G , the edge-chromatic number of G does not change if we add an extra edge joining x and y .