Forgive me for my lack of formal notation, I haven't taken any classes on set theory, or any advanced math topics for that matter.
From my understanding based on the wikipedia entries, a well-ordered set must have a least element. I have seen posts where people will explain contradictions with this statement, such as the least element of R is a contradiction, as you can divide by two to get a smaller real number. How does this not contradict AoC?
Here's a quote from another post, where somebody was explaining how well-ordering makes sense.
"...don't confuse "ordered" and "countable". You demand to know ..."
Which explained (I think, anyways) why you can't find the nth element of the real numbers, because the cardinality of [1,2,3,...n] must be less than the cardinality of real numbers.
Maybe I misunderstood the premise, but doesn't this logic also apply to countable infinities? The smallest rational number, for example, can be divided by 2 to get a smaller number. This set can be 1:1 mapped the integers, so there must be a set of positive rational numbers [q1, q2, q3...] that maps 1:1 to the natural numbers [1,2,3,...], which does have a clear least element. Both share a cardinality of aleph0, so they have to map 1:1, right? Why does AoC not contradict itself?
Edit: So this has been marked as a duplicate, but I haven't found any questions that answer this for me. Allow me to rephrase? These two sets share cardinality. How can a least element exist in Q if we can definitively prove is does not exist? Does this mean my intuitive definition of least elements only apply to some sets? If so, how do we redefine the definition to talk about the least element of positive rational numbers, as it has to exist under the theorem. Is there anything we can say about this number? If not, doesn't this contradict the idea of the theorem?