Metamath Proof Explorer


Theorem limsupres

Description: The superior limit of a restriction is less than or equal to the original superior limit. (Contributed by Glauco Siliprandi, 23-Oct-2021)

Ref Expression
Hypothesis limsupres.1 ⊢ φ → F ∈ V
Assertion limsupres ⊢ φ → lim sup ⁡ F ↾ C ≤ lim sup ⁡ F

Proof

Step Hyp Ref Expression
1 limsupres.1 ⊢ φ → F ∈ V
2 nfv ⊢ Ⅎ k φ
3 resimass ⊢ F ↾ C k +∞ ⊆ F k +∞
4 3 a1i ⊢ k ∈ ℝ → F ↾ C k +∞ ⊆ F k +∞
5 4 ssrind ⊢ k ∈ ℝ → F ↾ C k +∞ ∩ ℝ * ⊆ F k +∞ ∩ ℝ *
6 5 adantl ⊢ φ ∧ k ∈ ℝ → F ↾ C k +∞ ∩ ℝ * ⊆ F k +∞ ∩ ℝ *
7 inss2 ⊢ F k +∞ ∩ ℝ * ⊆ ℝ *
8 7 a1i ⊢ φ ∧ k ∈ ℝ → F k +∞ ∩ ℝ * ⊆ ℝ *
9 6 8 sstrd ⊢ φ ∧ k ∈ ℝ → F ↾ C k +∞ ∩ ℝ * ⊆ ℝ *
10 9 supxrcld ⊢ φ ∧ k ∈ ℝ → sup F ↾ C k +∞ ∩ ℝ * ℝ * < ∈ ℝ *
11 8 supxrcld ⊢ φ ∧ k ∈ ℝ → sup F k +∞ ∩ ℝ * ℝ * < ∈ ℝ *
12 supxrss ⊢ F ↾ C k +∞ ∩ ℝ * ⊆ F k +∞ ∩ ℝ * ∧ F k +∞ ∩ ℝ * ⊆ ℝ * → sup F ↾ C k +∞ ∩ ℝ * ℝ * < ≤ sup F k +∞ ∩ ℝ * ℝ * <
13 6 8 12 syl2anc ⊢ φ ∧ k ∈ ℝ → sup F ↾ C k +∞ ∩ ℝ * ℝ * < ≤ sup F k +∞ ∩ ℝ * ℝ * <
14 2 10 11 13 infrnmptle ⊢ φ → inf ran ⁡ k ∈ ℝ ⟼ sup F ↾ C k +∞ ∩ ℝ * ℝ * < ℝ * < ≤ inf ran ⁡ k ∈ ℝ ⟼ sup F k +∞ ∩ ℝ * ℝ * < ℝ * <
15 1 resexd ⊢ φ → F ↾ C ∈ V
16 eqid ⊢ k ∈ ℝ ⟼ sup F ↾ C k +∞ ∩ ℝ * ℝ * < = k ∈ ℝ ⟼ sup F ↾ C k +∞ ∩ ℝ * ℝ * <
17 16 limsupval ⊢ F ↾ C ∈ V → lim sup ⁡ F ↾ C = inf ran ⁡ k ∈ ℝ ⟼ sup F ↾ C k +∞ ∩ ℝ * ℝ * < ℝ * <
18 15 17 syl ⊢ φ → lim sup ⁡ F ↾ C = inf ran ⁡ k ∈ ℝ ⟼ sup F ↾ C k +∞ ∩ ℝ * ℝ * < ℝ * <
19 eqid ⊢ k ∈ ℝ ⟼ sup F k +∞ ∩ ℝ * ℝ * < = k ∈ ℝ ⟼ sup F k +∞ ∩ ℝ * ℝ * <
20 19 limsupval ⊢ F ∈ V → lim sup ⁡ F = inf ran ⁡ k ∈ ℝ ⟼ sup F k +∞ ∩ ℝ * ℝ * < ℝ * <
21 1 20 syl ⊢ φ → lim sup ⁡ F = inf ran ⁡ k ∈ ℝ ⟼ sup F k +∞ ∩ ℝ * ℝ * < ℝ * <
22 18 21 breq12d ⊢ φ → lim sup ⁡ F ↾ C ≤ lim sup ⁡ F ↔ inf ran ⁡ k ∈ ℝ ⟼ sup F ↾ C k +∞ ∩ ℝ * ℝ * < ℝ * < ≤ inf ran ⁡ k ∈ ℝ ⟼ sup F k +∞ ∩ ℝ * ℝ * < ℝ * <
23 14 22 mpbird ⊢ φ → lim sup ⁡ F ↾ C ≤ lim sup ⁡ F