Metamath Proof Explorer


Theorem limsupge

Description: The defining property of the superior limit. (Contributed by Glauco Siliprandi, 2-Jan-2022)

Ref Expression
Hypotheses limsupge.b ⊢ φ → B ⊆ ℝ
limsupge.f ⊢ φ → F : B ⟶ ℝ *
limsupge.a ⊢ φ → A ∈ ℝ *
Assertion limsupge ⊢ φ → A ≤ lim sup ⁡ F ↔ ∀ k ∈ ℝ A ≤ sup F k +∞ ∩ ℝ * ℝ * <

Proof

Step Hyp Ref Expression
1 limsupge.b ⊢ φ → B ⊆ ℝ
2 limsupge.f ⊢ φ → F : B ⟶ ℝ *
3 limsupge.a ⊢ φ → A ∈ ℝ *
4 eqid ⊢ j ∈ ℝ ⟼ sup F j +∞ ∩ ℝ * ℝ * < = j ∈ ℝ ⟼ sup F j +∞ ∩ ℝ * ℝ * <
5 4 limsuple ⊢ B ⊆ ℝ ∧ F : B ⟶ ℝ * ∧ A ∈ ℝ * → A ≤ lim sup ⁡ F ↔ ∀ i ∈ ℝ A ≤ j ∈ ℝ ⟼ sup F j +∞ ∩ ℝ * ℝ * < ⁡ i
6 1 2 3 5 syl3anc ⊢ φ → A ≤ lim sup ⁡ F ↔ ∀ i ∈ ℝ A ≤ j ∈ ℝ ⟼ sup F j +∞ ∩ ℝ * ℝ * < ⁡ i
7 oveq1 ⊢ j = i → j +∞ = i +∞
8 7 imaeq2d ⊢ j = i → F j +∞ = F i +∞
9 8 ineq1d ⊢ j = i → F j +∞ ∩ ℝ * = F i +∞ ∩ ℝ *
10 9 supeq1d ⊢ j = i → sup F j +∞ ∩ ℝ * ℝ * < = sup F i +∞ ∩ ℝ * ℝ * <
11 simpr ⊢ φ ∧ i ∈ ℝ → i ∈ ℝ
12 xrltso ⊢ < Or ℝ *
13 12 supex ⊢ sup F i +∞ ∩ ℝ * ℝ * < ∈ V
14 13 a1i ⊢ φ ∧ i ∈ ℝ → sup F i +∞ ∩ ℝ * ℝ * < ∈ V
15 4 10 11 14 fvmptd3 ⊢ φ ∧ i ∈ ℝ → j ∈ ℝ ⟼ sup F j +∞ ∩ ℝ * ℝ * < ⁡ i = sup F i +∞ ∩ ℝ * ℝ * <
16 15 breq2d ⊢ φ ∧ i ∈ ℝ → A ≤ j ∈ ℝ ⟼ sup F j +∞ ∩ ℝ * ℝ * < ⁡ i ↔ A ≤ sup F i +∞ ∩ ℝ * ℝ * <
17 16 ralbidva ⊢ φ → ∀ i ∈ ℝ A ≤ j ∈ ℝ ⟼ sup F j +∞ ∩ ℝ * ℝ * < ⁡ i ↔ ∀ i ∈ ℝ A ≤ sup F i +∞ ∩ ℝ * ℝ * <
18 6 17 bitrd ⊢ φ → A ≤ lim sup ⁡ F ↔ ∀ i ∈ ℝ A ≤ sup F i +∞ ∩ ℝ * ℝ * <
19 oveq1 ⊢ i = k → i +∞ = k +∞
20 19 imaeq2d ⊢ i = k → F i +∞ = F k +∞
21 20 ineq1d ⊢ i = k → F i +∞ ∩ ℝ * = F k +∞ ∩ ℝ *
22 21 supeq1d ⊢ i = k → sup F i +∞ ∩ ℝ * ℝ * < = sup F k +∞ ∩ ℝ * ℝ * <
23 22 breq2d ⊢ i = k → A ≤ sup F i +∞ ∩ ℝ * ℝ * < ↔ A ≤ sup F k +∞ ∩ ℝ * ℝ * <
24 23 cbvralvw ⊢ ∀ i ∈ ℝ A ≤ sup F i +∞ ∩ ℝ * ℝ * < ↔ ∀ k ∈ ℝ A ≤ sup F k +∞ ∩ ℝ * ℝ * <
25 24 a1i ⊢ φ → ∀ i ∈ ℝ A ≤ sup F i +∞ ∩ ℝ * ℝ * < ↔ ∀ k ∈ ℝ A ≤ sup F k +∞ ∩ ℝ * ℝ * <
26 18 25 bitrd ⊢ φ → A ≤ lim sup ⁡ F ↔ ∀ k ∈ ℝ A ≤ sup F k +∞ ∩ ℝ * ℝ * <