Page "Completeness (order theory)" Paragraph 24
from
Wikipedia
:# Every element of D is the least upper bound of a countable increasing sequence of isolated elements.
Page 1 of 1.
1.835 seconds.