Metamath Proof Explorer


Theorem infxrlb

Description: A member of a set of extended reals is greater than or equal to the set's infimum. (Contributed by Mario Carneiro, 16-Mar-2014) (Revised by AV, 5-Sep-2020)

Ref Expression
Assertion infxrlb ⊢ A ⊆ ℝ * ∧ B ∈ A → inf A ℝ * < ≤ B

Proof

Step Hyp Ref Expression
1 infxrcl ⊢ A ⊆ ℝ * → inf A ℝ * < ∈ ℝ *
2 1 adantr ⊢ A ⊆ ℝ * ∧ B ∈ A → inf A ℝ * < ∈ ℝ *
3 ssel2 ⊢ A ⊆ ℝ * ∧ B ∈ A → B ∈ ℝ *
4 xrltso ⊢ < Or ℝ *
5 4 a1i ⊢ A ⊆ ℝ * → < Or ℝ *
6 xrinfmss ⊢ A ⊆ ℝ * → ∃ x ∈ ℝ * ∀ y ∈ A ¬ y < x ∧ ∀ y ∈ ℝ * x < y → ∃ z ∈ A z < y
7 5 6 inflb ⊢ A ⊆ ℝ * → B ∈ A → ¬ B < inf A ℝ * <
8 7 imp ⊢ A ⊆ ℝ * ∧ B ∈ A → ¬ B < inf A ℝ * <
9 2 3 8 xrnltled ⊢ A ⊆ ℝ * ∧ B ∈ A → inf A ℝ * < ≤ B