Metamath Proof Explorer


Theorem liminfreuz

Description: Given a function on the reals, its inferior limit is real if and only if two condition holds: 1. there is a real number that is greater than or equal to the function, infinitely often; 2. there is a real number that is smaller than or equal to the function. (Contributed by Glauco Siliprandi, 2-Jan-2022)

Ref Expression
Hypotheses liminfreuz.1 ⊢ Ⅎ _ j F
liminfreuz.2 ⊢ φ → M ∈ ℤ
liminfreuz.3 ⊢ Z = ℤ ≥ M
liminfreuz.4 ⊢ φ → F : Z ⟶ ℝ
Assertion liminfreuz ⊢ φ → lim inf ⁡ F ∈ ℝ ↔ ∃ x ∈ ℝ ∀ k ∈ Z ∃ j ∈ ℤ ≥ k F ⁡ j ≤ x ∧ ∃ x ∈ ℝ ∀ j ∈ Z x ≤ F ⁡ j

Proof

Step Hyp Ref Expression
1 liminfreuz.1 ⊢ Ⅎ _ j F
2 liminfreuz.2 ⊢ φ → M ∈ ℤ
3 liminfreuz.3 ⊢ Z = ℤ ≥ M
4 liminfreuz.4 ⊢ φ → F : Z ⟶ ℝ
5 nfcv ⊢ Ⅎ _ l F
6 5 2 3 4 liminfreuzlem ⊢ φ → lim inf ⁡ F ∈ ℝ ↔ ∃ y ∈ ℝ ∀ i ∈ Z ∃ l ∈ ℤ ≥ i F ⁡ l ≤ y ∧ ∃ y ∈ ℝ ∀ l ∈ Z y ≤ F ⁡ l
7 breq2 ⊢ y = x → F ⁡ l ≤ y ↔ F ⁡ l ≤ x
8 7 rexbidv ⊢ y = x → ∃ l ∈ ℤ ≥ i F ⁡ l ≤ y ↔ ∃ l ∈ ℤ ≥ i F ⁡ l ≤ x
9 8 ralbidv ⊢ y = x → ∀ i ∈ Z ∃ l ∈ ℤ ≥ i F ⁡ l ≤ y ↔ ∀ i ∈ Z ∃ l ∈ ℤ ≥ i F ⁡ l ≤ x
10 fveq2 ⊢ i = k → ℤ ≥ i = ℤ ≥ k
11 10 rexeqdv ⊢ i = k → ∃ l ∈ ℤ ≥ i F ⁡ l ≤ x ↔ ∃ l ∈ ℤ ≥ k F ⁡ l ≤ x
12 nfcv ⊢ Ⅎ _ j l
13 1 12 nffv ⊢ Ⅎ _ j F ⁡ l
14 nfcv ⊢ Ⅎ _ j ≤
15 nfcv ⊢ Ⅎ _ j x
16 13 14 15 nfbr ⊢ Ⅎ j F ⁡ l ≤ x
17 nfv ⊢ Ⅎ l F ⁡ j ≤ x
18 fveq2 ⊢ l = j → F ⁡ l = F ⁡ j
19 18 breq1d ⊢ l = j → F ⁡ l ≤ x ↔ F ⁡ j ≤ x
20 16 17 19 cbvrexw ⊢ ∃ l ∈ ℤ ≥ k F ⁡ l ≤ x ↔ ∃ j ∈ ℤ ≥ k F ⁡ j ≤ x
21 20 a1i ⊢ i = k → ∃ l ∈ ℤ ≥ k F ⁡ l ≤ x ↔ ∃ j ∈ ℤ ≥ k F ⁡ j ≤ x
22 11 21 bitrd ⊢ i = k → ∃ l ∈ ℤ ≥ i F ⁡ l ≤ x ↔ ∃ j ∈ ℤ ≥ k F ⁡ j ≤ x
23 22 cbvralvw ⊢ ∀ i ∈ Z ∃ l ∈ ℤ ≥ i F ⁡ l ≤ x ↔ ∀ k ∈ Z ∃ j ∈ ℤ ≥ k F ⁡ j ≤ x
24 23 a1i ⊢ y = x → ∀ i ∈ Z ∃ l ∈ ℤ ≥ i F ⁡ l ≤ x ↔ ∀ k ∈ Z ∃ j ∈ ℤ ≥ k F ⁡ j ≤ x
25 9 24 bitrd ⊢ y = x → ∀ i ∈ Z ∃ l ∈ ℤ ≥ i F ⁡ l ≤ y ↔ ∀ k ∈ Z ∃ j ∈ ℤ ≥ k F ⁡ j ≤ x
26 25 cbvrexvw ⊢ ∃ y ∈ ℝ ∀ i ∈ Z ∃ l ∈ ℤ ≥ i F ⁡ l ≤ y ↔ ∃ x ∈ ℝ ∀ k ∈ Z ∃ j ∈ ℤ ≥ k F ⁡ j ≤ x
27 breq1 ⊢ y = x → y ≤ F ⁡ l ↔ x ≤ F ⁡ l
28 27 ralbidv ⊢ y = x → ∀ l ∈ Z y ≤ F ⁡ l ↔ ∀ l ∈ Z x ≤ F ⁡ l
29 15 14 13 nfbr ⊢ Ⅎ j x ≤ F ⁡ l
30 nfv ⊢ Ⅎ l x ≤ F ⁡ j
31 18 breq2d ⊢ l = j → x ≤ F ⁡ l ↔ x ≤ F ⁡ j
32 29 30 31 cbvralw ⊢ ∀ l ∈ Z x ≤ F ⁡ l ↔ ∀ j ∈ Z x ≤ F ⁡ j
33 32 a1i ⊢ y = x → ∀ l ∈ Z x ≤ F ⁡ l ↔ ∀ j ∈ Z x ≤ F ⁡ j
34 28 33 bitrd ⊢ y = x → ∀ l ∈ Z y ≤ F ⁡ l ↔ ∀ j ∈ Z x ≤ F ⁡ j
35 34 cbvrexvw ⊢ ∃ y ∈ ℝ ∀ l ∈ Z y ≤ F ⁡ l ↔ ∃ x ∈ ℝ ∀ j ∈ Z x ≤ F ⁡ j
36 26 35 anbi12i ⊢ ∃ y ∈ ℝ ∀ i ∈ Z ∃ l ∈ ℤ ≥ i F ⁡ l ≤ y ∧ ∃ y ∈ ℝ ∀ l ∈ Z y ≤ F ⁡ l ↔ ∃ x ∈ ℝ ∀ k ∈ Z ∃ j ∈ ℤ ≥ k F ⁡ j ≤ x ∧ ∃ x ∈ ℝ ∀ j ∈ Z x ≤ F ⁡ j
37 36 a1i ⊢ φ → ∃ y ∈ ℝ ∀ i ∈ Z ∃ l ∈ ℤ ≥ i F ⁡ l ≤ y ∧ ∃ y ∈ ℝ ∀ l ∈ Z y ≤ F ⁡ l ↔ ∃ x ∈ ℝ ∀ k ∈ Z ∃ j ∈ ℤ ≥ k F ⁡ j ≤ x ∧ ∃ x ∈ ℝ ∀ j ∈ Z x ≤ F ⁡ j
38 6 37 bitrd ⊢ φ → lim inf ⁡ F ∈ ℝ ↔ ∃ x ∈ ℝ ∀ k ∈ Z ∃ j ∈ ℤ ≥ k F ⁡ j ≤ x ∧ ∃ x ∈ ℝ ∀ j ∈ Z x ≤ F ⁡ j