To show set equality we just need to show inclusion, right? One inclusion is obvious:
Clearly for each so .
The other inclusion is not much harder. Let . Then so by the Archimedean principle there exists an integer such that , and so thus . Therefore and so !