Metamath Proof Explorer


Theorem infxrrefi

Description: The real and extended real infima match when the set is finite. (Contributed by Glauco Siliprandi, 8-Apr-2021)

Ref Expression
Assertion infxrrefi ⊢ A ⊆ ℝ ∧ A ∈ Fin ∧ A ≠ ∅ → inf A ℝ * < = inf A ℝ <

Proof

Step Hyp Ref Expression
1 simp1 ⊢ A ⊆ ℝ ∧ A ∈ Fin ∧ A ≠ ∅ → A ⊆ ℝ
2 simp3 ⊢ A ⊆ ℝ ∧ A ∈ Fin ∧ A ≠ ∅ → A ≠ ∅
3 fiminre2 ⊢ A ⊆ ℝ ∧ A ∈ Fin → ∃ x ∈ ℝ ∀ y ∈ A x ≤ y
4 3 3adant3 ⊢ A ⊆ ℝ ∧ A ∈ Fin ∧ A ≠ ∅ → ∃ x ∈ ℝ ∀ y ∈ A x ≤ y
5 infxrre ⊢ A ⊆ ℝ ∧ A ≠ ∅ ∧ ∃ x ∈ ℝ ∀ y ∈ A x ≤ y → inf A ℝ * < = inf A ℝ <
6 1 2 4 5 syl3anc ⊢ A ⊆ ℝ ∧ A ∈ Fin ∧ A ≠ ∅ → inf A ℝ * < = inf A ℝ <