Metamath Proof Explorer


Theorem infxrpnf2

Description: Removing plus infinity from a set does not affect its infimum. (Contributed by Glauco Siliprandi, 2-Jan-2022)

Ref Expression
Assertion infxrpnf2 ⊢ A ⊆ ℝ * → inf A ∖ +∞ ℝ * < = inf A ℝ * <

Proof

Step Hyp Ref Expression
1 ssdifss ⊢ A ⊆ ℝ * → A ∖ +∞ ⊆ ℝ *
2 infxrpnf ⊢ A ∖ +∞ ⊆ ℝ * → inf A ∖ +∞ ∪ +∞ ℝ * < = inf A ∖ +∞ ℝ * <
3 1 2 syl ⊢ A ⊆ ℝ * → inf A ∖ +∞ ∪ +∞ ℝ * < = inf A ∖ +∞ ℝ * <
4 3 adantr ⊢ A ⊆ ℝ * ∧ +∞ ∈ A → inf A ∖ +∞ ∪ +∞ ℝ * < = inf A ∖ +∞ ℝ * <
5 difsnid ⊢ +∞ ∈ A → A ∖ +∞ ∪ +∞ = A
6 5 infeq1d ⊢ +∞ ∈ A → inf A ∖ +∞ ∪ +∞ ℝ * < = inf A ℝ * <
7 6 adantl ⊢ A ⊆ ℝ * ∧ +∞ ∈ A → inf A ∖ +∞ ∪ +∞ ℝ * < = inf A ℝ * <
8 4 7 eqtr3d ⊢ A ⊆ ℝ * ∧ +∞ ∈ A → inf A ∖ +∞ ℝ * < = inf A ℝ * <
9 difsn ⊢ ¬ +∞ ∈ A → A ∖ +∞ = A
10 9 infeq1d ⊢ ¬ +∞ ∈ A → inf A ∖ +∞ ℝ * < = inf A ℝ * <
11 10 adantl ⊢ A ⊆ ℝ * ∧ ¬ +∞ ∈ A → inf A ∖ +∞ ℝ * < = inf A ℝ * <
12 8 11 pm2.61dan ⊢ A ⊆ ℝ * → inf A ∖ +∞ ℝ * < = inf A ℝ * <