Metamath Proof Explorer


Theorem infxrre

Description: The real and extended real infima match when the real infimum exists. (Contributed by Mario Carneiro, 7-Sep-2014) (Revised by AV, 5-Sep-2020)

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

Proof

Step Hyp Ref Expression
1 simp1 ⊢ A ⊆ ℝ ∧ A ≠ ∅ ∧ ∃ x ∈ ℝ ∀ y ∈ A x ≤ y → A ⊆ ℝ
2 ressxr ⊢ ℝ ⊆ ℝ *
3 1 2 sstrdi ⊢ A ⊆ ℝ ∧ A ≠ ∅ ∧ ∃ x ∈ ℝ ∀ y ∈ A x ≤ y → A ⊆ ℝ *
4 infxrcl ⊢ A ⊆ ℝ * → inf A ℝ * < ∈ ℝ *
5 3 4 syl ⊢ A ⊆ ℝ ∧ A ≠ ∅ ∧ ∃ x ∈ ℝ ∀ y ∈ A x ≤ y → inf A ℝ * < ∈ ℝ *
6 infrecl ⊢ A ⊆ ℝ ∧ A ≠ ∅ ∧ ∃ x ∈ ℝ ∀ y ∈ A x ≤ y → inf A ℝ < ∈ ℝ
7 6 rexrd ⊢ A ⊆ ℝ ∧ A ≠ ∅ ∧ ∃ x ∈ ℝ ∀ y ∈ A x ≤ y → inf A ℝ < ∈ ℝ *
8 5 xrleidd ⊢ A ⊆ ℝ ∧ A ≠ ∅ ∧ ∃ x ∈ ℝ ∀ y ∈ A x ≤ y → inf A ℝ * < ≤ inf A ℝ * <
9 infxrgelb ⊢ A ⊆ ℝ * ∧ inf A ℝ * < ∈ ℝ * → inf A ℝ * < ≤ inf A ℝ * < ↔ ∀ x ∈ A inf A ℝ * < ≤ x
10 3 5 9 syl2anc ⊢ A ⊆ ℝ ∧ A ≠ ∅ ∧ ∃ x ∈ ℝ ∀ y ∈ A x ≤ y → inf A ℝ * < ≤ inf A ℝ * < ↔ ∀ x ∈ A inf A ℝ * < ≤ x
11 simp2 ⊢ A ⊆ ℝ ∧ A ≠ ∅ ∧ ∃ x ∈ ℝ ∀ y ∈ A x ≤ y → A ≠ ∅
12 n0 ⊢ A ≠ ∅ ↔ ∃ z z ∈ A
13 11 12 sylib ⊢ A ⊆ ℝ ∧ A ≠ ∅ ∧ ∃ x ∈ ℝ ∀ y ∈ A x ≤ y → ∃ z z ∈ A
14 5 adantr ⊢ A ⊆ ℝ ∧ A ≠ ∅ ∧ ∃ x ∈ ℝ ∀ y ∈ A x ≤ y ∧ z ∈ A → inf A ℝ * < ∈ ℝ *
15 1 sselda ⊢ A ⊆ ℝ ∧ A ≠ ∅ ∧ ∃ x ∈ ℝ ∀ y ∈ A x ≤ y ∧ z ∈ A → z ∈ ℝ
16 mnfxr ⊢ −∞ ∈ ℝ *
17 16 a1i ⊢ A ⊆ ℝ ∧ A ≠ ∅ ∧ ∃ x ∈ ℝ ∀ y ∈ A x ≤ y → −∞ ∈ ℝ *
18 6 mnfltd ⊢ A ⊆ ℝ ∧ A ≠ ∅ ∧ ∃ x ∈ ℝ ∀ y ∈ A x ≤ y → −∞ < inf A ℝ <
19 6 leidd ⊢ A ⊆ ℝ ∧ A ≠ ∅ ∧ ∃ x ∈ ℝ ∀ y ∈ A x ≤ y → inf A ℝ < ≤ inf A ℝ <
20 infregelb ⊢ A ⊆ ℝ ∧ A ≠ ∅ ∧ ∃ x ∈ ℝ ∀ y ∈ A x ≤ y ∧ inf A ℝ < ∈ ℝ → inf A ℝ < ≤ inf A ℝ < ↔ ∀ x ∈ A inf A ℝ < ≤ x
21 6 20 mpdan ⊢ A ⊆ ℝ ∧ A ≠ ∅ ∧ ∃ x ∈ ℝ ∀ y ∈ A x ≤ y → inf A ℝ < ≤ inf A ℝ < ↔ ∀ x ∈ A inf A ℝ < ≤ x
22 infxrgelb ⊢ A ⊆ ℝ * ∧ inf A ℝ < ∈ ℝ * → inf A ℝ < ≤ inf A ℝ * < ↔ ∀ x ∈ A inf A ℝ < ≤ x
23 3 7 22 syl2anc ⊢ A ⊆ ℝ ∧ A ≠ ∅ ∧ ∃ x ∈ ℝ ∀ y ∈ A x ≤ y → inf A ℝ < ≤ inf A ℝ * < ↔ ∀ x ∈ A inf A ℝ < ≤ x
24 21 23 bitr4d ⊢ A ⊆ ℝ ∧ A ≠ ∅ ∧ ∃ x ∈ ℝ ∀ y ∈ A x ≤ y → inf A ℝ < ≤ inf A ℝ < ↔ inf A ℝ < ≤ inf A ℝ * <
25 19 24 mpbid ⊢ A ⊆ ℝ ∧ A ≠ ∅ ∧ ∃ x ∈ ℝ ∀ y ∈ A x ≤ y → inf A ℝ < ≤ inf A ℝ * <
26 17 7 5 18 25 xrltletrd ⊢ A ⊆ ℝ ∧ A ≠ ∅ ∧ ∃ x ∈ ℝ ∀ y ∈ A x ≤ y → −∞ < inf A ℝ * <
27 26 adantr ⊢ A ⊆ ℝ ∧ A ≠ ∅ ∧ ∃ x ∈ ℝ ∀ y ∈ A x ≤ y ∧ z ∈ A → −∞ < inf A ℝ * <
28 infxrlb ⊢ A ⊆ ℝ * ∧ z ∈ A → inf A ℝ * < ≤ z
29 3 28 sylan ⊢ A ⊆ ℝ ∧ A ≠ ∅ ∧ ∃ x ∈ ℝ ∀ y ∈ A x ≤ y ∧ z ∈ A → inf A ℝ * < ≤ z
30 xrre ⊢ inf A ℝ * < ∈ ℝ * ∧ z ∈ ℝ ∧ −∞ < inf A ℝ * < ∧ inf A ℝ * < ≤ z → inf A ℝ * < ∈ ℝ
31 14 15 27 29 30 syl22anc ⊢ A ⊆ ℝ ∧ A ≠ ∅ ∧ ∃ x ∈ ℝ ∀ y ∈ A x ≤ y ∧ z ∈ A → inf A ℝ * < ∈ ℝ
32 13 31 exlimddv ⊢ A ⊆ ℝ ∧ A ≠ ∅ ∧ ∃ x ∈ ℝ ∀ y ∈ A x ≤ y → inf A ℝ * < ∈ ℝ
33 infregelb ⊢ A ⊆ ℝ ∧ A ≠ ∅ ∧ ∃ x ∈ ℝ ∀ y ∈ A x ≤ y ∧ inf A ℝ * < ∈ ℝ → inf A ℝ * < ≤ inf A ℝ < ↔ ∀ x ∈ A inf A ℝ * < ≤ x
34 32 33 mpdan ⊢ A ⊆ ℝ ∧ A ≠ ∅ ∧ ∃ x ∈ ℝ ∀ y ∈ A x ≤ y → inf A ℝ * < ≤ inf A ℝ < ↔ ∀ x ∈ A inf A ℝ * < ≤ x
35 10 34 bitr4d ⊢ A ⊆ ℝ ∧ A ≠ ∅ ∧ ∃ x ∈ ℝ ∀ y ∈ A x ≤ y → inf A ℝ * < ≤ inf A ℝ * < ↔ inf A ℝ * < ≤ inf A ℝ <
36 8 35 mpbid ⊢ A ⊆ ℝ ∧ A ≠ ∅ ∧ ∃ x ∈ ℝ ∀ y ∈ A x ≤ y → inf A ℝ * < ≤ inf A ℝ <
37 5 7 36 25 xrletrid ⊢ A ⊆ ℝ ∧ A ≠ ∅ ∧ ∃ x ∈ ℝ ∀ y ∈ A x ≤ y → inf A ℝ * < = inf A ℝ <