well-ordering theorem

[ wel-awr-der-ing ]

noun

, Mathematics.

1. the theorem of set theory that every set can be made a well-ordered set.