Well-ordering principle states that every non-empty set of positive integers contains a least element.
I have a set S which is a subset of natural numbers. Now by well-ordering principle I can conclude that S will have a least element in it. I may figure it out or I may not but there is a least element.
Let $m\in S$ such that $m=3n$ for some $n \in \mathbb{N}$, Now I somehow show that if $3n \in S$ then $2n\in S$.
Now can I conclude that the least element of S is not any multiple of 3?
Now if I somehow show that the least element of S is not of the form say, $4n$, $4n+1$, $4n+2$ and $4n+3$ then can I conclude that S is an empty set?
Kindly help me.