Metamath Proof Explorer


Theorem uzwo2

Description: Well-ordering principle: any nonempty subset of an upper set of integers has a unique least element. (Contributed by NM, 8-Oct-2005)

Ref Expression
Assertion uzwo2 ⊢ S ⊆ ℤ ≥ M ∧ S ≠ ∅ → ∃! j ∈ S ∀ k ∈ S j ≤ k

Proof

Step Hyp Ref Expression
1 uzssz ⊢ ℤ ≥ M ⊆ ℤ
2 zssre ⊢ ℤ ⊆ ℝ
3 1 2 sstri ⊢ ℤ ≥ M ⊆ ℝ
4 sstr ⊢ S ⊆ ℤ ≥ M ∧ ℤ ≥ M ⊆ ℝ → S ⊆ ℝ
5 3 4 mpan2 ⊢ S ⊆ ℤ ≥ M → S ⊆ ℝ
6 uzwo ⊢ S ⊆ ℤ ≥ M ∧ S ≠ ∅ → ∃ j ∈ S ∀ k ∈ S j ≤ k
7 lbreu ⊢ S ⊆ ℝ ∧ ∃ j ∈ S ∀ k ∈ S j ≤ k → ∃! j ∈ S ∀ k ∈ S j ≤ k
8 5 6 7 syl2an2r ⊢ S ⊆ ℤ ≥ M ∧ S ≠ ∅ → ∃! j ∈ S ∀ k ∈ S j ≤ k