Metamath Proof Explorer


Theorem limsupgle

Description: The defining property of the superior limit function. (Contributed by Mario Carneiro, 5-Sep-2014) (Revised by Mario Carneiro, 7-May-2016)

Ref Expression
Hypothesis limsupval.1 ⊢ G = k ∈ ℝ ⟼ sup F k +∞ ∩ ℝ * ℝ * <
Assertion limsupgle ⊢ B ⊆ ℝ ∧ F : B ⟶ ℝ * ∧ C ∈ ℝ ∧ A ∈ ℝ * → G ⁡ C ≤ A ↔ ∀ j ∈ B C ≤ j → F ⁡ j ≤ A

Proof

Step Hyp Ref Expression
1 limsupval.1 ⊢ G = k ∈ ℝ ⟼ sup F k +∞ ∩ ℝ * ℝ * <
2 1 limsupgval ⊢ C ∈ ℝ → G ⁡ C = sup F C +∞ ∩ ℝ * ℝ * <
3 2 3ad2ant2 ⊢ B ⊆ ℝ ∧ F : B ⟶ ℝ * ∧ C ∈ ℝ ∧ A ∈ ℝ * → G ⁡ C = sup F C +∞ ∩ ℝ * ℝ * <
4 3 breq1d ⊢ B ⊆ ℝ ∧ F : B ⟶ ℝ * ∧ C ∈ ℝ ∧ A ∈ ℝ * → G ⁡ C ≤ A ↔ sup F C +∞ ∩ ℝ * ℝ * < ≤ A
5 inss2 ⊢ F C +∞ ∩ ℝ * ⊆ ℝ *
6 simp3 ⊢ B ⊆ ℝ ∧ F : B ⟶ ℝ * ∧ C ∈ ℝ ∧ A ∈ ℝ * → A ∈ ℝ *
7 supxrleub ⊢ F C +∞ ∩ ℝ * ⊆ ℝ * ∧ A ∈ ℝ * → sup F C +∞ ∩ ℝ * ℝ * < ≤ A ↔ ∀ x ∈ F C +∞ ∩ ℝ * x ≤ A
8 5 6 7 sylancr ⊢ B ⊆ ℝ ∧ F : B ⟶ ℝ * ∧ C ∈ ℝ ∧ A ∈ ℝ * → sup F C +∞ ∩ ℝ * ℝ * < ≤ A ↔ ∀ x ∈ F C +∞ ∩ ℝ * x ≤ A
9 imassrn ⊢ F C +∞ ⊆ ran ⁡ F
10 simp1r ⊢ B ⊆ ℝ ∧ F : B ⟶ ℝ * ∧ C ∈ ℝ ∧ A ∈ ℝ * → F : B ⟶ ℝ *
11 10 frnd ⊢ B ⊆ ℝ ∧ F : B ⟶ ℝ * ∧ C ∈ ℝ ∧ A ∈ ℝ * → ran ⁡ F ⊆ ℝ *
12 9 11 sstrid ⊢ B ⊆ ℝ ∧ F : B ⟶ ℝ * ∧ C ∈ ℝ ∧ A ∈ ℝ * → F C +∞ ⊆ ℝ *
13 dfss2 ⊢ F C +∞ ⊆ ℝ * ↔ F C +∞ ∩ ℝ * = F C +∞
14 12 13 sylib ⊢ B ⊆ ℝ ∧ F : B ⟶ ℝ * ∧ C ∈ ℝ ∧ A ∈ ℝ * → F C +∞ ∩ ℝ * = F C +∞
15 imadmres ⊢ F dom ⁡ F ↾ C +∞ = F C +∞
16 14 15 eqtr4di ⊢ B ⊆ ℝ ∧ F : B ⟶ ℝ * ∧ C ∈ ℝ ∧ A ∈ ℝ * → F C +∞ ∩ ℝ * = F dom ⁡ F ↾ C +∞
17 16 raleqdv ⊢ B ⊆ ℝ ∧ F : B ⟶ ℝ * ∧ C ∈ ℝ ∧ A ∈ ℝ * → ∀ x ∈ F C +∞ ∩ ℝ * x ≤ A ↔ ∀ x ∈ F dom ⁡ F ↾ C +∞ x ≤ A
18 10 ffnd ⊢ B ⊆ ℝ ∧ F : B ⟶ ℝ * ∧ C ∈ ℝ ∧ A ∈ ℝ * → F Fn B
19 10 fdmd ⊢ B ⊆ ℝ ∧ F : B ⟶ ℝ * ∧ C ∈ ℝ ∧ A ∈ ℝ * → dom ⁡ F = B
20 19 ineq2d ⊢ B ⊆ ℝ ∧ F : B ⟶ ℝ * ∧ C ∈ ℝ ∧ A ∈ ℝ * → C +∞ ∩ dom ⁡ F = C +∞ ∩ B
21 dmres ⊢ dom ⁡ F ↾ C +∞ = C +∞ ∩ dom ⁡ F
22 incom ⊢ B ∩ C +∞ = C +∞ ∩ B
23 20 21 22 3eqtr4g ⊢ B ⊆ ℝ ∧ F : B ⟶ ℝ * ∧ C ∈ ℝ ∧ A ∈ ℝ * → dom ⁡ F ↾ C +∞ = B ∩ C +∞
24 inss1 ⊢ B ∩ C +∞ ⊆ B
25 23 24 eqsstrdi ⊢ B ⊆ ℝ ∧ F : B ⟶ ℝ * ∧ C ∈ ℝ ∧ A ∈ ℝ * → dom ⁡ F ↾ C +∞ ⊆ B
26 breq1 ⊢ x = F ⁡ j → x ≤ A ↔ F ⁡ j ≤ A
27 26 ralima ⊢ F Fn B ∧ dom ⁡ F ↾ C +∞ ⊆ B → ∀ x ∈ F dom ⁡ F ↾ C +∞ x ≤ A ↔ ∀ j ∈ dom ⁡ F ↾ C +∞ F ⁡ j ≤ A
28 18 25 27 syl2anc ⊢ B ⊆ ℝ ∧ F : B ⟶ ℝ * ∧ C ∈ ℝ ∧ A ∈ ℝ * → ∀ x ∈ F dom ⁡ F ↾ C +∞ x ≤ A ↔ ∀ j ∈ dom ⁡ F ↾ C +∞ F ⁡ j ≤ A
29 23 eleq2d ⊢ B ⊆ ℝ ∧ F : B ⟶ ℝ * ∧ C ∈ ℝ ∧ A ∈ ℝ * → j ∈ dom ⁡ F ↾ C +∞ ↔ j ∈ B ∩ C +∞
30 elin ⊢ j ∈ B ∩ C +∞ ↔ j ∈ B ∧ j ∈ C +∞
31 29 30 bitrdi ⊢ B ⊆ ℝ ∧ F : B ⟶ ℝ * ∧ C ∈ ℝ ∧ A ∈ ℝ * → j ∈ dom ⁡ F ↾ C +∞ ↔ j ∈ B ∧ j ∈ C +∞
32 simpl2 ⊢ B ⊆ ℝ ∧ F : B ⟶ ℝ * ∧ C ∈ ℝ ∧ A ∈ ℝ * ∧ j ∈ B → C ∈ ℝ
33 simp1l ⊢ B ⊆ ℝ ∧ F : B ⟶ ℝ * ∧ C ∈ ℝ ∧ A ∈ ℝ * → B ⊆ ℝ
34 33 sselda ⊢ B ⊆ ℝ ∧ F : B ⟶ ℝ * ∧ C ∈ ℝ ∧ A ∈ ℝ * ∧ j ∈ B → j ∈ ℝ
35 elicopnf ⊢ C ∈ ℝ → j ∈ C +∞ ↔ j ∈ ℝ ∧ C ≤ j
36 35 baibd ⊢ C ∈ ℝ ∧ j ∈ ℝ → j ∈ C +∞ ↔ C ≤ j
37 32 34 36 syl2anc ⊢ B ⊆ ℝ ∧ F : B ⟶ ℝ * ∧ C ∈ ℝ ∧ A ∈ ℝ * ∧ j ∈ B → j ∈ C +∞ ↔ C ≤ j
38 37 pm5.32da ⊢ B ⊆ ℝ ∧ F : B ⟶ ℝ * ∧ C ∈ ℝ ∧ A ∈ ℝ * → j ∈ B ∧ j ∈ C +∞ ↔ j ∈ B ∧ C ≤ j
39 31 38 bitrd ⊢ B ⊆ ℝ ∧ F : B ⟶ ℝ * ∧ C ∈ ℝ ∧ A ∈ ℝ * → j ∈ dom ⁡ F ↾ C +∞ ↔ j ∈ B ∧ C ≤ j
40 39 imbi1d ⊢ B ⊆ ℝ ∧ F : B ⟶ ℝ * ∧ C ∈ ℝ ∧ A ∈ ℝ * → j ∈ dom ⁡ F ↾ C +∞ → F ⁡ j ≤ A ↔ j ∈ B ∧ C ≤ j → F ⁡ j ≤ A
41 impexp ⊢ j ∈ B ∧ C ≤ j → F ⁡ j ≤ A ↔ j ∈ B → C ≤ j → F ⁡ j ≤ A
42 40 41 bitrdi ⊢ B ⊆ ℝ ∧ F : B ⟶ ℝ * ∧ C ∈ ℝ ∧ A ∈ ℝ * → j ∈ dom ⁡ F ↾ C +∞ → F ⁡ j ≤ A ↔ j ∈ B → C ≤ j → F ⁡ j ≤ A
43 42 ralbidv2 ⊢ B ⊆ ℝ ∧ F : B ⟶ ℝ * ∧ C ∈ ℝ ∧ A ∈ ℝ * → ∀ j ∈ dom ⁡ F ↾ C +∞ F ⁡ j ≤ A ↔ ∀ j ∈ B C ≤ j → F ⁡ j ≤ A
44 17 28 43 3bitrd ⊢ B ⊆ ℝ ∧ F : B ⟶ ℝ * ∧ C ∈ ℝ ∧ A ∈ ℝ * → ∀ x ∈ F C +∞ ∩ ℝ * x ≤ A ↔ ∀ j ∈ B C ≤ j → F ⁡ j ≤ A
45 4 8 44 3bitrd ⊢ B ⊆ ℝ ∧ F : B ⟶ ℝ * ∧ C ∈ ℝ ∧ A ∈ ℝ * → G ⁡ C ≤ A ↔ ∀ j ∈ B C ≤ j → F ⁡ j ≤ A