Metamath Proof Explorer


Theorem liminfval5

Description: The inferior limit of an infinite sequence F of extended real numbers. (Contributed by Glauco Siliprandi, 2-Jan-2022)

Ref Expression
Hypotheses limsupval5.1 ⊢ Ⅎ k φ
limsupval5.2 ⊢ φ → A ∈ V
limsupval5.3 ⊢ φ → F : A ⟶ ℝ *
limsupval5.4 ⊢ G = k ∈ ℝ ⟼ inf F k +∞ ℝ * <
Assertion liminfval5 ⊢ φ → lim inf ⁡ F = sup ran ⁡ G ℝ * <

Proof

Step Hyp Ref Expression
1 limsupval5.1 ⊢ Ⅎ k φ
2 limsupval5.2 ⊢ φ → A ∈ V
3 limsupval5.3 ⊢ φ → F : A ⟶ ℝ *
4 limsupval5.4 ⊢ G = k ∈ ℝ ⟼ inf F k +∞ ℝ * <
5 3 2 fexd ⊢ φ → F ∈ V
6 eqid ⊢ k ∈ ℝ ⟼ inf F k +∞ ∩ ℝ * ℝ * < = k ∈ ℝ ⟼ inf F k +∞ ∩ ℝ * ℝ * <
7 6 liminfval ⊢ F ∈ V → lim inf ⁡ F = sup ran ⁡ k ∈ ℝ ⟼ inf F k +∞ ∩ ℝ * ℝ * < ℝ * <
8 5 7 syl ⊢ φ → lim inf ⁡ F = sup ran ⁡ k ∈ ℝ ⟼ inf F k +∞ ∩ ℝ * ℝ * < ℝ * <
9 4 a1i ⊢ φ → G = k ∈ ℝ ⟼ inf F k +∞ ℝ * <
10 3 fimassd ⊢ φ → F k +∞ ⊆ ℝ *
11 dfss2 ⊢ F k +∞ ⊆ ℝ * ↔ F k +∞ ∩ ℝ * = F k +∞
12 10 11 sylib ⊢ φ → F k +∞ ∩ ℝ * = F k +∞
13 12 eqcomd ⊢ φ → F k +∞ = F k +∞ ∩ ℝ *
14 13 adantr ⊢ φ ∧ k ∈ ℝ → F k +∞ = F k +∞ ∩ ℝ *
15 14 infeq1d ⊢ φ ∧ k ∈ ℝ → inf F k +∞ ℝ * < = inf F k +∞ ∩ ℝ * ℝ * <
16 1 15 mpteq2da ⊢ φ → k ∈ ℝ ⟼ inf F k +∞ ℝ * < = k ∈ ℝ ⟼ inf F k +∞ ∩ ℝ * ℝ * <
17 9 16 eqtr2d ⊢ φ → k ∈ ℝ ⟼ inf F k +∞ ∩ ℝ * ℝ * < = G
18 17 rneqd ⊢ φ → ran ⁡ k ∈ ℝ ⟼ inf F k +∞ ∩ ℝ * ℝ * < = ran ⁡ G
19 18 supeq1d ⊢ φ → sup ran ⁡ k ∈ ℝ ⟼ inf F k +∞ ∩ ℝ * ℝ * < ℝ * < = sup ran ⁡ G ℝ * <
20 8 19 eqtrd ⊢ φ → lim inf ⁡ F = sup ran ⁡ G ℝ * <