Hypothesis: "Every nonempty subset S of the positive integers has a least element." Goal: "Every nonempty subset S of non-negative integers has a least element."
Is this proof possible? I was able to prove it the other way around but failed to prove it this way. So I wonder if it's possible and how would I prove it.