$\{1,1\}=\{1\}$, origin of this convention Is there any book that explicitly contain the convention that a representation of the set that contain repeated element is the same as the one without repeated elements?
Like $\{1,1,2,3\} = \{1,2,3\}$.
I have looked over a few books and it didn't mention such thing. (Wikipedia has it, but it does not cite source).
In my years learning mathematics in both US and Hungary, this convention is known and applied. However recently I noticed some Chinese students claim they have never seen this before, and I don't remember I saw it in any book either. 
I never found a book explicitly says what are the rules in how $\{a_1,a_2,a_3,\ldots,a_n\}$ specify a set. Some people believe it can only specify a set if $a_i\neq a_j \Leftrightarrow i\neq j$. The convention shows that doesn't have to be satisfied. 

I took a quick look through some of the likelier candidates on my shelves. The following introductory discrete math texts all explicitly point out, with at least one example, that neither the order of listing nor the number of times an element is listed makes any difference to the identity of a set:


*

*Winfried K. Grassman & Jean-Paul Tremblay, Logic and Discrete Mathematics: A Computer Science Perspective

*Ralph P. Grimaldi, Discrete and Combinatorial Mathematics: An Applied Introduction, 4th ed.

*Richard Johnsonbaugh, Discrete Mathematics, 4th ed.

*Bernard Kolman, Robert C. Busby, & Sharon Ross, Discrete Mathematical Structures for Computer Science, 3rd ed.

*Edward Scheinerman, Mathematics: A Discrete Introduction, 2nd ed.

