Theorem liminfreuz 45096

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.)

Hypotheses

Ref	Expression
liminfreuz.1	⊢ Ⅎ𝑗𝐹
liminfreuz.2	⊢ (𝜑 → 𝑀 ∈ ℤ)
liminfreuz.3	⊢ 𝑍 = (ℤ≥‘𝑀)
liminfreuz.4	⊢ (𝜑 → 𝐹:𝑍⟶ℝ)

Assertion

Ref	Expression
liminfreuz	⊢ (𝜑 → ((lim inf‘𝐹) ∈ ℝ ↔ (∃𝑥 ∈ ℝ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥 ∧ ∃𝑥 ∈ ℝ ∀𝑗 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑗))))

Distinct variable groups:   𝑘,𝐹,𝑥   𝑗,𝑍,𝑘,𝑥

Allowed substitution hints:   𝜑(𝑥,𝑗,𝑘)   𝐹(𝑗)   𝑀(𝑥,𝑗,𝑘)

Proof of Theorem liminfreuz

Dummy variables 𝑖 𝑙 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		nfcv 2897	. . 3 ⊢ Ⅎ𝑙𝐹
2		liminfreuz.2	. . 3 ⊢ (𝜑 → 𝑀 ∈ ℤ)
3		liminfreuz.3	. . 3 ⊢ 𝑍 = (ℤ≥‘𝑀)
4		liminfreuz.4	. . 3 ⊢ (𝜑 → 𝐹:𝑍⟶ℝ)
5	1, 2, 3, 4	liminfreuzlem 45095	. 2 ⊢ (𝜑 → ((lim inf‘𝐹) ∈ ℝ ↔ (∃𝑦 ∈ ℝ ∀𝑖 ∈ 𝑍 ∃𝑙 ∈ (ℤ≥‘𝑖)(𝐹‘𝑙) ≤ 𝑦 ∧ ∃𝑦 ∈ ℝ ∀𝑙 ∈ 𝑍 𝑦 ≤ (𝐹‘𝑙))))
6		breq2 5145	. . . . . . . 8 ⊢ (𝑦 = 𝑥 → ((𝐹‘𝑙) ≤ 𝑦 ↔ (𝐹‘𝑙) ≤ 𝑥))
7	6	rexbidv 3172	. . . . . . 7 ⊢ (𝑦 = 𝑥 → (∃𝑙 ∈ (ℤ≥‘𝑖)(𝐹‘𝑙) ≤ 𝑦 ↔ ∃𝑙 ∈ (ℤ≥‘𝑖)(𝐹‘𝑙) ≤ 𝑥))
8	7	ralbidv 3171	. . . . . 6 ⊢ (𝑦 = 𝑥 → (∀𝑖 ∈ 𝑍 ∃𝑙 ∈ (ℤ≥‘𝑖)(𝐹‘𝑙) ≤ 𝑦 ↔ ∀𝑖 ∈ 𝑍 ∃𝑙 ∈ (ℤ≥‘𝑖)(𝐹‘𝑙) ≤ 𝑥))
9		fveq2 6885	. . . . . . . . . 10 ⊢ (𝑖 = 𝑘 → (ℤ≥‘𝑖) = (ℤ≥‘𝑘))
10	9	rexeqdv 3320	. . . . . . . . 9 ⊢ (𝑖 = 𝑘 → (∃𝑙 ∈ (ℤ≥‘𝑖)(𝐹‘𝑙) ≤ 𝑥 ↔ ∃𝑙 ∈ (ℤ≥‘𝑘)(𝐹‘𝑙) ≤ 𝑥))
11		liminfreuz.1	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑗𝐹
12		nfcv 2897	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑗𝑙
13	11, 12	nffv 6895	. . . . . . . . . . . 12 ⊢ Ⅎ𝑗(𝐹‘𝑙)
14		nfcv 2897	. . . . . . . . . . . 12 ⊢ Ⅎ𝑗 ≤
15		nfcv 2897	. . . . . . . . . . . 12 ⊢ Ⅎ𝑗𝑥
16	13, 14, 15	nfbr 5188	. . . . . . . . . . 11 ⊢ Ⅎ𝑗(𝐹‘𝑙) ≤ 𝑥
17		nfv 1909	. . . . . . . . . . 11 ⊢ Ⅎ𝑙(𝐹‘𝑗) ≤ 𝑥
18		fveq2 6885	. . . . . . . . . . . 12 ⊢ (𝑙 = 𝑗 → (𝐹‘𝑙) = (𝐹‘𝑗))
19	18	breq1d 5151	. . . . . . . . . . 11 ⊢ (𝑙 = 𝑗 → ((𝐹‘𝑙) ≤ 𝑥 ↔ (𝐹‘𝑗) ≤ 𝑥))
20	16, 17, 19	cbvrexw 3298	. . . . . . . . . 10 ⊢ (∃𝑙 ∈ (ℤ≥‘𝑘)(𝐹‘𝑙) ≤ 𝑥 ↔ ∃𝑗 ∈ (ℤ≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥)
21	20	a1i 11	. . . . . . . . 9 ⊢ (𝑖 = 𝑘 → (∃𝑙 ∈ (ℤ≥‘𝑘)(𝐹‘𝑙) ≤ 𝑥 ↔ ∃𝑗 ∈ (ℤ≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥))
22	10, 21	bitrd 279	. . . . . . . 8 ⊢ (𝑖 = 𝑘 → (∃𝑙 ∈ (ℤ≥‘𝑖)(𝐹‘𝑙) ≤ 𝑥 ↔ ∃𝑗 ∈ (ℤ≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥))
23	22	cbvralvw 3228	. . . . . . 7 ⊢ (∀𝑖 ∈ 𝑍 ∃𝑙 ∈ (ℤ≥‘𝑖)(𝐹‘𝑙) ≤ 𝑥 ↔ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥)
24	23	a1i 11	. . . . . 6 ⊢ (𝑦 = 𝑥 → (∀𝑖 ∈ 𝑍 ∃𝑙 ∈ (ℤ≥‘𝑖)(𝐹‘𝑙) ≤ 𝑥 ↔ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥))
25	8, 24	bitrd 279	. . . . 5 ⊢ (𝑦 = 𝑥 → (∀𝑖 ∈ 𝑍 ∃𝑙 ∈ (ℤ≥‘𝑖)(𝐹‘𝑙) ≤ 𝑦 ↔ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥))
26	25	cbvrexvw 3229	. . . 4 ⊢ (∃𝑦 ∈ ℝ ∀𝑖 ∈ 𝑍 ∃𝑙 ∈ (ℤ≥‘𝑖)(𝐹‘𝑙) ≤ 𝑦 ↔ ∃𝑥 ∈ ℝ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥)
27		breq1 5144	. . . . . . 7 ⊢ (𝑦 = 𝑥 → (𝑦 ≤ (𝐹‘𝑙) ↔ 𝑥 ≤ (𝐹‘𝑙)))
28	27	ralbidv 3171	. . . . . 6 ⊢ (𝑦 = 𝑥 → (∀𝑙 ∈ 𝑍 𝑦 ≤ (𝐹‘𝑙) ↔ ∀𝑙 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑙)))
29	15, 14, 13	nfbr 5188	. . . . . . . 8 ⊢ Ⅎ𝑗 𝑥 ≤ (𝐹‘𝑙)
30		nfv 1909	. . . . . . . 8 ⊢ Ⅎ𝑙 𝑥 ≤ (𝐹‘𝑗)
31	18	breq2d 5153	. . . . . . . 8 ⊢ (𝑙 = 𝑗 → (𝑥 ≤ (𝐹‘𝑙) ↔ 𝑥 ≤ (𝐹‘𝑗)))
32	29, 30, 31	cbvralw 3297	. . . . . . 7 ⊢ (∀𝑙 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑙) ↔ ∀𝑗 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑗))
33	32	a1i 11	. . . . . 6 ⊢ (𝑦 = 𝑥 → (∀𝑙 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑙) ↔ ∀𝑗 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑗)))
34	28, 33	bitrd 279	. . . . 5 ⊢ (𝑦 = 𝑥 → (∀𝑙 ∈ 𝑍 𝑦 ≤ (𝐹‘𝑙) ↔ ∀𝑗 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑗)))
35	34	cbvrexvw 3229	. . . 4 ⊢ (∃𝑦 ∈ ℝ ∀𝑙 ∈ 𝑍 𝑦 ≤ (𝐹‘𝑙) ↔ ∃𝑥 ∈ ℝ ∀𝑗 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑗))
36	26, 35	anbi12i 626	. . 3 ⊢ ((∃𝑦 ∈ ℝ ∀𝑖 ∈ 𝑍 ∃𝑙 ∈ (ℤ≥‘𝑖)(𝐹‘𝑙) ≤ 𝑦 ∧ ∃𝑦 ∈ ℝ ∀𝑙 ∈ 𝑍 𝑦 ≤ (𝐹‘𝑙)) ↔ (∃𝑥 ∈ ℝ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥 ∧ ∃𝑥 ∈ ℝ ∀𝑗 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑗)))
37	36	a1i 11	. 2 ⊢ (𝜑 → ((∃𝑦 ∈ ℝ ∀𝑖 ∈ 𝑍 ∃𝑙 ∈ (ℤ≥‘𝑖)(𝐹‘𝑙) ≤ 𝑦 ∧ ∃𝑦 ∈ ℝ ∀𝑙 ∈ 𝑍 𝑦 ≤ (𝐹‘𝑙)) ↔ (∃𝑥 ∈ ℝ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥 ∧ ∃𝑥 ∈ ℝ ∀𝑗 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑗))))
38	5, 37	bitrd 279	1 ⊢ (𝜑 → ((lim inf‘𝐹) ∈ ℝ ↔ (∃𝑥 ∈ ℝ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥 ∧ ∃𝑥 ∈ ℝ ∀𝑗 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑗))))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 395   = wceq 1533   ∈ wcel 2098  Ⅎwnfc 2877  ∀wral 3055  ∃wrex 3064   class class class wbr 5141  ⟶wf 6533  ‘cfv 6537  ℝcr 11111   ≤ cle 11253  ℤcz 12562  ℤ_≥cuz 12826  lim infclsi 45044

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2163  ax-ext 2697  ax-rep 5278  ax-sep 5292  ax-nul 5299  ax-pow 5356  ax-pr 5420  ax-un 7722  ax-cnex 11168  ax-resscn 11169  ax-1cn 11170  ax-icn 11171  ax-addcl 11172  ax-addrcl 11173  ax-mulcl 11174  ax-mulrcl 11175  ax-mulcom 11176  ax-addass 11177  ax-mulass 11178  ax-distr 11179  ax-i2m1 11180  ax-1ne0 11181  ax-1rid 11182  ax-rnegex 11183  ax-rrecex 11184  ax-cnre 11185  ax-pre-lttri 11186  ax-pre-lttrn 11187  ax-pre-ltadd 11188  ax-pre-mulgt0 11189  ax-pre-sup 11190

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3or 1085  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2528  df-eu 2557  df-clab 2704  df-cleq 2718  df-clel 2804  df-nfc 2879  df-ne 2935  df-nel 3041  df-ral 3056  df-rex 3065  df-rmo 3370  df-reu 3371  df-rab 3427  df-v 3470  df-sbc 3773  df-csb 3889  df-dif 3946  df-un 3948  df-in 3950  df-ss 3960  df-pss 3962  df-nul 4318  df-if 4524  df-pw 4599  df-sn 4624  df-pr 4626  df-op 4630  df-uni 4903  df-iun 4992  df-br 5142  df-opab 5204  df-mpt 5225  df-tr 5259  df-id 5567  df-eprel 5573  df-po 5581  df-so 5582  df-fr 5624  df-we 5626  df-xp 5675  df-rel 5676  df-cnv 5677  df-co 5678  df-dm 5679  df-rn 5680  df-res 5681  df-ima 5682  df-pred 6294  df-ord 6361  df-on 6362  df-lim 6363  df-suc 6364  df-iota 6489  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-isom 6546  df-riota 7361  df-ov 7408  df-oprab 7409  df-mpo 7410  df-om 7853  df-1st 7974  df-2nd 7975  df-frecs 8267  df-wrecs 8298  df-recs 8372  df-rdg 8411  df-1o 8467  df-er 8705  df-en 8942  df-dom 8943  df-sdom 8944  df-fin 8945  df-sup 9439  df-inf 9440  df-pnf 11254  df-mnf 11255  df-xr 11256  df-ltxr 11257  df-le 11258  df-sub 11450  df-neg 11451  df-div 11876  df-nn 12217  df-n0 12477  df-z 12563  df-uz 12827  df-q 12937  df-xneg 13098  df-ico 13336  df-fz 13491  df-fzo 13634  df-fl 13763  df-ceil 13764  df-limsup 15421  df-liminf 45045

This theorem is referenced by: (None)