Metamath Proof Explorer


Theorem limsuplesup

Description: An upper bound for the superior limit. (Contributed by Glauco Siliprandi, 23-Oct-2021)

Ref Expression
Hypotheses limsuplesup.1 ⊢ φ → F ∈ V
limsuplesup.2 ⊢ φ → K ∈ ℝ
Assertion limsuplesup ⊢ φ → lim sup ⁡ F ≤ sup F K +∞ ∩ ℝ * ℝ * <

Proof

Step Hyp Ref Expression
1 limsuplesup.1 ⊢ φ → F ∈ V
2 limsuplesup.2 ⊢ φ → K ∈ ℝ
3 eqid ⊢ k ∈ ℝ ⟼ sup F k +∞ ∩ ℝ * ℝ * < = k ∈ ℝ ⟼ sup F k +∞ ∩ ℝ * ℝ * <
4 3 limsupval ⊢ F ∈ V → lim sup ⁡ F = inf ran ⁡ k ∈ ℝ ⟼ sup F k +∞ ∩ ℝ * ℝ * < ℝ * <
5 1 4 syl ⊢ φ → lim sup ⁡ F = inf ran ⁡ k ∈ ℝ ⟼ sup F k +∞ ∩ ℝ * ℝ * < ℝ * <
6 nfv ⊢ Ⅎ k φ
7 inss2 ⊢ F k +∞ ∩ ℝ * ⊆ ℝ *
8 7 a1i ⊢ φ ∧ k ∈ ℝ → F k +∞ ∩ ℝ * ⊆ ℝ *
9 8 supxrcld ⊢ φ ∧ k ∈ ℝ → sup F k +∞ ∩ ℝ * ℝ * < ∈ ℝ *
10 inss2 ⊢ F K +∞ ∩ ℝ * ⊆ ℝ *
11 10 a1i ⊢ φ → F K +∞ ∩ ℝ * ⊆ ℝ *
12 11 supxrcld ⊢ φ → sup F K +∞ ∩ ℝ * ℝ * < ∈ ℝ *
13 oveq1 ⊢ k = K → k +∞ = K +∞
14 13 imaeq2d ⊢ k = K → F k +∞ = F K +∞
15 14 ineq1d ⊢ k = K → F k +∞ ∩ ℝ * = F K +∞ ∩ ℝ *
16 15 supeq1d ⊢ k = K → sup F k +∞ ∩ ℝ * ℝ * < = sup F K +∞ ∩ ℝ * ℝ * <
17 6 9 2 12 16 infxrlbrnmpt2 ⊢ φ → inf ran ⁡ k ∈ ℝ ⟼ sup F k +∞ ∩ ℝ * ℝ * < ℝ * < ≤ sup F K +∞ ∩ ℝ * ℝ * <
18 5 17 eqbrtrd ⊢ φ → lim sup ⁡ F ≤ sup F K +∞ ∩ ℝ * ℝ * <