| |
| | Mathematical Proofs (Site not responding. Last check: ) |
 | | Clearly, if there is only one number in the set, as it is equal to itself (reflexive property of equality), all the numbers in this set are equal. |
 | | But note that when we removed x from the set, y was still a member, and therefore equal to all the other members; and when we removed y from the set, we had replaced x, so it was a member equal to all the other members. |
 | | Therefore x and y are both equal to all the other members of the set, so they must equal each other (transitive property of equality). |
| my.voyager.net /~jayjo/proofs.htm (542 words) |
|