Metamath Proof Explorer


Theorem infssuzcl

Description: The infimum of a subset of an upper set of integers belongs to the subset. (Contributed by NM, 11-Oct-2005) (Revised by AV, 5-Sep-2020)

Ref Expression
Assertion infssuzcl ⊢ S ⊆ ℤ ≥ M ∧ S ≠ ∅ → inf S ℝ < ∈ S

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 lbinfcl ⊢ S ⊆ ℝ ∧ ∃ j ∈ S ∀ k ∈ S j ≤ k → inf S ℝ < ∈ S
8 5 6 7 syl2an2r ⊢ S ⊆ ℤ ≥ M ∧ S ≠ ∅ → inf S ℝ < ∈ S