well-ordering theorem

[ wel-awr-der-ing ]
/ ˈwɛlˈɔr dər ɪŋ /

noun Mathematics.

the theorem of set theory that every set can be made a well-ordered set.
Dictionary.com Unabridged Based on the Random House Unabridged Dictionary, © Random House, Inc. 2019