Let S be a set equipped with a total order ≤, let a,b,c∈S, and let max{a,b} denote the maximum of a and b. Then the following hold.
1. (Upper bound) a≤max{a,b} and b≤max{a,b}.
2. (Attainment) max{a,b}=a or max{a,b}=b.
3. (Least upper bound) max{a,b}≤c if and only if both a≤c and b≤c.
4. (Symmetry) max{a,b}=max{b,a}.