Metamath Proof Explorer


Theorem infssuzle

Description: The infimum of a subset of an upper set of integers is less than or equal to all members of the subset. (Contributed by NM, 11-Oct-2005) (Revised by AV, 5-Sep-2020)

Ref Expression
Assertion infssuzle ⊢ S ⊆ ℤ ≥ M ∧ A ∈ S → inf S ℝ < ≤ A

Proof

Step Hyp Ref Expression
1 ne0i ⊢ A ∈ S → S ≠ ∅
2 uzwo ⊢ S ⊆ ℤ ≥ M ∧ S ≠ ∅ → ∃ j ∈ S ∀ k ∈ S j ≤ k
3 1 2 sylan2 ⊢ S ⊆ ℤ ≥ M ∧ A ∈ S → ∃ j ∈ S ∀ k ∈ S j ≤ k
4 uzssz ⊢ ℤ ≥ M ⊆ ℤ
5 zssre ⊢ ℤ ⊆ ℝ
6 4 5 sstri ⊢ ℤ ≥ M ⊆ ℝ
7 sstr ⊢ S ⊆ ℤ ≥ M ∧ ℤ ≥ M ⊆ ℝ → S ⊆ ℝ
8 6 7 mpan2 ⊢ S ⊆ ℤ ≥ M → S ⊆ ℝ
9 lbinfle ⊢ S ⊆ ℝ ∧ ∃ j ∈ S ∀ k ∈ S j ≤ k ∧ A ∈ S → inf S ℝ < ≤ A
10 9 3com23 ⊢ S ⊆ ℝ ∧ A ∈ S ∧ ∃ j ∈ S ∀ k ∈ S j ≤ k → inf S ℝ < ≤ A
11 8 10 syl3an1 ⊢ S ⊆ ℤ ≥ M ∧ A ∈ S ∧ ∃ j ∈ S ∀ k ∈ S j ≤ k → inf S ℝ < ≤ A
12 3 11 mpd3an3 ⊢ S ⊆ ℤ ≥ M ∧ A ∈ S → inf S ℝ < ≤ A