- #1
gnome
- 1,041
- 1
If I'm writing a proof that depends upon the assumption that a set of unique identifiers (integers, names, etc) must have a "greatest" element under some ordering scheme, what do I need in order to be entitled to make that assertion?