Let and assume that .
Case 1: contains no smallest or largest element, then there exists some such that and now if there is no such that then consider , we can see that and that , also consider any this implies that or and that or in any case we know that . If there was some between then we let .
Case 2: contains a smallest element but no largest element, if it turns out that is not the smallest element, then suppose that is, since there is no largest element then we know that there is an element such that , if there is no between then the sets , if there is a we take . If it turned out that was the smallest element, we adjust the above with syntactically replacing with .
Case 3: contains a largest and smallest element if neither of are the largest or smallest element then we obtain which are and follow the case 1 construction, if exactly one of is the largest or smallest element, then we proceed with the case 2 construction, finally when are the smallest and largest element respectively, then again if there is some between then we can use otherwise we use .
Thus we've proven that in any case had open sets containing them that were disjoint.