Why does Radix sort require stable digit sorts?

Question

I'm reading the CLRS book and have a question about the following quote from the book.

In order for radix sort to work correctly, the digit sorts must be stable.

Why is stability required? Wouldn't Radix sort still produce correctly sorted output even if there was no consistency in ordering of identical values, since Radix sort sorts on every digit position?