Metamath Proof Explorer


Theorem infxrlesupxr

Description: The supremum of a nonempty set is greater than or equal to the infimum. The second condition is needed, see supxrltinfxr . (Contributed by Glauco Siliprandi, 2-Jan-2022)

Ref Expression
Hypotheses infxrlesupxr.1 ⊢ φ → A ⊆ ℝ *
infxrlesupxr.2 ⊢ φ → A ≠ ∅
Assertion infxrlesupxr ⊢ φ → inf A ℝ * < ≤ sup A ℝ * <

Proof

Step Hyp Ref Expression
1 infxrlesupxr.1 ⊢ φ → A ⊆ ℝ *
2 infxrlesupxr.2 ⊢ φ → A ≠ ∅
3 n0 ⊢ A ≠ ∅ ↔ ∃ x x ∈ A
4 3 biimpi ⊢ A ≠ ∅ → ∃ x x ∈ A
5 2 4 syl ⊢ φ → ∃ x x ∈ A
6 1 infxrcld ⊢ φ → inf A ℝ * < ∈ ℝ *
7 6 adantr ⊢ φ ∧ x ∈ A → inf A ℝ * < ∈ ℝ *
8 1 sselda ⊢ φ ∧ x ∈ A → x ∈ ℝ *
9 1 supxrcld ⊢ φ → sup A ℝ * < ∈ ℝ *
10 9 adantr ⊢ φ ∧ x ∈ A → sup A ℝ * < ∈ ℝ *
11 1 adantr ⊢ φ ∧ x ∈ A → A ⊆ ℝ *
12 simpr ⊢ φ ∧ x ∈ A → x ∈ A
13 infxrlb ⊢ A ⊆ ℝ * ∧ x ∈ A → inf A ℝ * < ≤ x
14 11 12 13 syl2anc ⊢ φ ∧ x ∈ A → inf A ℝ * < ≤ x
15 eqid ⊢ sup A ℝ * < = sup A ℝ * <
16 11 12 15 supxrubd ⊢ φ ∧ x ∈ A → x ≤ sup A ℝ * <
17 7 8 10 14 16 xrletrd ⊢ φ ∧ x ∈ A → inf A ℝ * < ≤ sup A ℝ * <
18 17 ex ⊢ φ → x ∈ A → inf A ℝ * < ≤ sup A ℝ * <
19 18 exlimdv ⊢ φ → ∃ x x ∈ A → inf A ℝ * < ≤ sup A ℝ * <
20 5 19 mpd ⊢ φ → inf A ℝ * < ≤ sup A ℝ * <