Dijkstra’s Algorithm negative edges

How can I formally prove that Dijkstra’s algorithm doesn’t work with negative-weighted edges?