Given $A \subseteq \mathbb{N}, A \neq \emptyset$, prove that A has a minimum element.
Can anyone help me with this problem?
Given $A \subseteq \mathbb{N}, A \neq \emptyset$, prove that A has a minimum element.
Can anyone help me with this problem?
Hint Use induction. Assume that $A$ has no least element, and show it must be empty, arriving at a contradiction.