Thich_Tuyet_Tinh
New Member
Show that the partial ordering relation <= on N has the following wel l-ordering property :
∀ M ⊆ N with M = ∅, ∃ m0 ∈ M such that ∀ m ∈ M, m0 <= m.
In other words, every non-empty subset of N has a smallest element.
∀ M ⊆ N with M = ∅, ∃ m0 ∈ M such that ∀ m ∈ M, m0 <= m.
In other words, every non-empty subset of N has a smallest element.