Metamath Proof Explorer


Theorem infrecl

Description: Closure of infimum of a nonempty bounded set of reals. (Contributed by NM, 8-Oct-2005) (Revised by AV, 4-Sep-2020)

Ref Expression
Assertion infrecl ⊢ A ⊆ ℝ ∧ A ≠ ∅ ∧ ∃ x ∈ ℝ ∀ y ∈ A x ≤ y → inf A ℝ < ∈ ℝ

Proof

Step Hyp Ref Expression
1 ltso ⊢ < Or ℝ
2 1 a1i ⊢ A ⊆ ℝ ∧ A ≠ ∅ ∧ ∃ x ∈ ℝ ∀ y ∈ A x ≤ y → < Or ℝ
3 infm3 ⊢ A ⊆ ℝ ∧ A ≠ ∅ ∧ ∃ x ∈ ℝ ∀ y ∈ A x ≤ y → ∃ x ∈ ℝ ∀ y ∈ A ¬ y < x ∧ ∀ y ∈ ℝ x < y → ∃ z ∈ A z < y
4 2 3 infcl ⊢ A ⊆ ℝ ∧ A ≠ ∅ ∧ ∃ x ∈ ℝ ∀ y ∈ A x ≤ y → inf A ℝ < ∈ ℝ