liminfreuzlem - Mathbox for Glauco Siliprandi

	Mathbox for Glauco Siliprandi		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > liminfreuzlem		Structured version Visualization version GIF version

Theorem liminfreuzlem 45113

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
liminfreuzlem.1	⊢ Ⅎ𝑗𝐹
liminfreuzlem.2	⊢ (𝜑 → 𝑀 ∈ ℤ)
liminfreuzlem.3	⊢ 𝑍 = (ℤ_≥‘𝑀)
liminfreuzlem.4	⊢ (𝜑 → 𝐹:𝑍⟶ℝ)

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

Distinct variable groups: 𝑘,𝐹,𝑥 𝑗,𝑀 𝑗,𝑍,𝑘,𝑥 𝜑,𝑗,𝑘,𝑥 Allowed substitution hints: 𝐹(𝑗) 𝑀(𝑥,𝑘)

Proof of Theorem liminfreuzlem Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		nfv 1910	. . . . 5 ⊢ Ⅎ𝑗𝜑
2		liminfreuzlem.1	. . . . 5 ⊢ Ⅎ𝑗𝐹
3		liminfreuzlem.2	. . . . 5 ⊢ (𝜑 → 𝑀 ∈ ℤ)
4		liminfreuzlem.3	. . . . 5 ⊢ 𝑍 = (ℤ_≥‘𝑀)
5		liminfreuzlem.4	. . . . 5 ⊢ (𝜑 → 𝐹:𝑍⟶ℝ)
6	1, 2, 3, 4, 5	liminfvaluz4 45110	. . . 4 ⊢ (𝜑 → (lim inf‘𝐹) = -_𝑒(lim sup‘(𝑗 ∈ 𝑍 ↦ -(𝐹‘𝑗))))
7	6	eleq1d 2813	. . 3 ⊢ (𝜑 → ((lim inf‘𝐹) ∈ ℝ ↔ -_𝑒(lim sup‘(𝑗 ∈ 𝑍 ↦ -(𝐹‘𝑗))) ∈ ℝ))
8	4	fvexi 6905	. . . . . . 7 ⊢ 𝑍 ∈ V
9	8	mptex 7229	. . . . . 6 ⊢ (𝑗 ∈ 𝑍 ↦ -(𝐹‘𝑗)) ∈ V
10		limsupcl 15441	. . . . . 6 ⊢ ((𝑗 ∈ 𝑍 ↦ -(𝐹‘𝑗)) ∈ V → (lim sup‘(𝑗 ∈ 𝑍 ↦ -(𝐹‘𝑗))) ∈ ℝ^*)
11	9, 10	ax-mp 5	. . . . 5 ⊢ (lim sup‘(𝑗 ∈ 𝑍 ↦ -(𝐹‘𝑗))) ∈ ℝ^*
12	11	a1i 11	. . . 4 ⊢ (𝜑 → (lim sup‘(𝑗 ∈ 𝑍 ↦ -(𝐹‘𝑗))) ∈ ℝ^*)
13	12	xnegred 44775	. . 3 ⊢ (𝜑 → ((lim sup‘(𝑗 ∈ 𝑍 ↦ -(𝐹‘𝑗))) ∈ ℝ ↔ -_𝑒(lim sup‘(𝑗 ∈ 𝑍 ↦ -(𝐹‘𝑗))) ∈ ℝ))
14	7, 13	bitr4d 282	. 2 ⊢ (𝜑 → ((lim inf‘𝐹) ∈ ℝ ↔ (lim sup‘(𝑗 ∈ 𝑍 ↦ -(𝐹‘𝑗))) ∈ ℝ))
15	5	ffvelcdmda 7088	. . . . 5 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → (𝐹‘𝑗) ∈ ℝ)
16	15	renegcld 11663	. . . 4 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → -(𝐹‘𝑗) ∈ ℝ)
17	1, 3, 4, 16	limsupreuzmpt 45050	. . 3 ⊢ (𝜑 → ((lim sup‘(𝑗 ∈ 𝑍 ↦ -(𝐹‘𝑗))) ∈ ℝ ↔ (∃𝑦 ∈ ℝ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)𝑦 ≤ -(𝐹‘𝑗) ∧ ∃𝑦 ∈ ℝ ∀𝑗 ∈ 𝑍 -(𝐹‘𝑗) ≤ 𝑦)))
18		renegcl 11545	. . . . . . . 8 ⊢ (𝑦 ∈ ℝ → -𝑦 ∈ ℝ)
19	18	ad2antlr 726	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)𝑦 ≤ -(𝐹‘𝑗)) → -𝑦 ∈ ℝ)
20		simpllr 775	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑘 ∈ 𝑍) ∧ 𝑗 ∈ (ℤ_≥‘𝑘)) → 𝑦 ∈ ℝ)
21	5	ad2antrr 725	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝑍) ∧ 𝑗 ∈ (ℤ_≥‘𝑘)) → 𝐹:𝑍⟶ℝ)
22	4	uztrn2 12863	. . . . . . . . . . . . . . 15 ⊢ ((𝑘 ∈ 𝑍 ∧ 𝑗 ∈ (ℤ_≥‘𝑘)) → 𝑗 ∈ 𝑍)
23	22	adantll 713	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝑍) ∧ 𝑗 ∈ (ℤ_≥‘𝑘)) → 𝑗 ∈ 𝑍)
24	21, 23	ffvelcdmd 7089	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝑍) ∧ 𝑗 ∈ (ℤ_≥‘𝑘)) → (𝐹‘𝑗) ∈ ℝ)
25	24	adantllr 718	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑘 ∈ 𝑍) ∧ 𝑗 ∈ (ℤ_≥‘𝑘)) → (𝐹‘𝑗) ∈ ℝ)
26	20, 25	leneg2d 44753	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑘 ∈ 𝑍) ∧ 𝑗 ∈ (ℤ_≥‘𝑘)) → (𝑦 ≤ -(𝐹‘𝑗) ↔ (𝐹‘𝑗) ≤ -𝑦))
27	26	rexbidva 3171	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑘 ∈ 𝑍) → (∃𝑗 ∈ (ℤ_≥‘𝑘)𝑦 ≤ -(𝐹‘𝑗) ↔ ∃𝑗 ∈ (ℤ_≥‘𝑘)(𝐹‘𝑗) ≤ -𝑦))
28	27	ralbidva 3170	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → (∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)𝑦 ≤ -(𝐹‘𝑗) ↔ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)(𝐹‘𝑗) ≤ -𝑦))
29	28	biimpd 228	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → (∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)𝑦 ≤ -(𝐹‘𝑗) → ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)(𝐹‘𝑗) ≤ -𝑦))
30	29	imp 406	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)𝑦 ≤ -(𝐹‘𝑗)) → ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)(𝐹‘𝑗) ≤ -𝑦)
31		breq2 5146	. . . . . . . . . 10 ⊢ (𝑥 = -𝑦 → ((𝐹‘𝑗) ≤ 𝑥 ↔ (𝐹‘𝑗) ≤ -𝑦))
32	31	rexbidv 3173	. . . . . . . . 9 ⊢ (𝑥 = -𝑦 → (∃𝑗 ∈ (ℤ_≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥 ↔ ∃𝑗 ∈ (ℤ_≥‘𝑘)(𝐹‘𝑗) ≤ -𝑦))
33	32	ralbidv 3172	. . . . . . . 8 ⊢ (𝑥 = -𝑦 → (∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥 ↔ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)(𝐹‘𝑗) ≤ -𝑦))
34	33	rspcev 3607	. . . . . . 7 ⊢ ((-𝑦 ∈ ℝ ∧ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)(𝐹‘𝑗) ≤ -𝑦) → ∃𝑥 ∈ ℝ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥)
35	19, 30, 34	syl2anc 583	. . . . . 6 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)𝑦 ≤ -(𝐹‘𝑗)) → ∃𝑥 ∈ ℝ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥)
36	35	rexlimdva2 3152	. . . . 5 ⊢ (𝜑 → (∃𝑦 ∈ ℝ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)𝑦 ≤ -(𝐹‘𝑗) → ∃𝑥 ∈ ℝ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥))
37		renegcl 11545	. . . . . . . 8 ⊢ (𝑥 ∈ ℝ → -𝑥 ∈ ℝ)
38	37	ad2antlr 726	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥) → -𝑥 ∈ ℝ)
39	24	adantllr 718	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑘 ∈ 𝑍) ∧ 𝑗 ∈ (ℤ_≥‘𝑘)) → (𝐹‘𝑗) ∈ ℝ)
40		simpllr 775	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑘 ∈ 𝑍) ∧ 𝑗 ∈ (ℤ_≥‘𝑘)) → 𝑥 ∈ ℝ)
41	39, 40	lenegd 11815	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑘 ∈ 𝑍) ∧ 𝑗 ∈ (ℤ_≥‘𝑘)) → ((𝐹‘𝑗) ≤ 𝑥 ↔ -𝑥 ≤ -(𝐹‘𝑗)))
42	41	rexbidva 3171	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑘 ∈ 𝑍) → (∃𝑗 ∈ (ℤ_≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥 ↔ ∃𝑗 ∈ (ℤ_≥‘𝑘)-𝑥 ≤ -(𝐹‘𝑗)))
43	42	ralbidva 3170	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥 ↔ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)-𝑥 ≤ -(𝐹‘𝑗)))
44	43	biimpd 228	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥 → ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)-𝑥 ≤ -(𝐹‘𝑗)))
45	44	imp 406	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥) → ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)-𝑥 ≤ -(𝐹‘𝑗))
46		breq1 5145	. . . . . . . . . 10 ⊢ (𝑦 = -𝑥 → (𝑦 ≤ -(𝐹‘𝑗) ↔ -𝑥 ≤ -(𝐹‘𝑗)))
47	46	rexbidv 3173	. . . . . . . . 9 ⊢ (𝑦 = -𝑥 → (∃𝑗 ∈ (ℤ_≥‘𝑘)𝑦 ≤ -(𝐹‘𝑗) ↔ ∃𝑗 ∈ (ℤ_≥‘𝑘)-𝑥 ≤ -(𝐹‘𝑗)))
48	47	ralbidv 3172	. . . . . . . 8 ⊢ (𝑦 = -𝑥 → (∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)𝑦 ≤ -(𝐹‘𝑗) ↔ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)-𝑥 ≤ -(𝐹‘𝑗)))
49	48	rspcev 3607	. . . . . . 7 ⊢ ((-𝑥 ∈ ℝ ∧ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)-𝑥 ≤ -(𝐹‘𝑗)) → ∃𝑦 ∈ ℝ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)𝑦 ≤ -(𝐹‘𝑗))
50	38, 45, 49	syl2anc 583	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥) → ∃𝑦 ∈ ℝ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)𝑦 ≤ -(𝐹‘𝑗))
51	50	rexlimdva2 3152	. . . . 5 ⊢ (𝜑 → (∃𝑥 ∈ ℝ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥 → ∃𝑦 ∈ ℝ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)𝑦 ≤ -(𝐹‘𝑗)))
52	36, 51	impbid 211	. . . 4 ⊢ (𝜑 → (∃𝑦 ∈ ℝ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)𝑦 ≤ -(𝐹‘𝑗) ↔ ∃𝑥 ∈ ℝ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥))
53	18	ad2antlr 726	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ ∀𝑗 ∈ 𝑍 -(𝐹‘𝑗) ≤ 𝑦) → -𝑦 ∈ ℝ)
54	15	adantlr 714	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑗 ∈ 𝑍) → (𝐹‘𝑗) ∈ ℝ)
55		simplr 768	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑗 ∈ 𝑍) → 𝑦 ∈ ℝ)
56	54, 55	leneg3d 44762	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑗 ∈ 𝑍) → (-(𝐹‘𝑗) ≤ 𝑦 ↔ -𝑦 ≤ (𝐹‘𝑗)))
57	56	ralbidva 3170	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → (∀𝑗 ∈ 𝑍 -(𝐹‘𝑗) ≤ 𝑦 ↔ ∀𝑗 ∈ 𝑍 -𝑦 ≤ (𝐹‘𝑗)))
58	57	biimpd 228	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → (∀𝑗 ∈ 𝑍 -(𝐹‘𝑗) ≤ 𝑦 → ∀𝑗 ∈ 𝑍 -𝑦 ≤ (𝐹‘𝑗)))
59	58	imp 406	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ ∀𝑗 ∈ 𝑍 -(𝐹‘𝑗) ≤ 𝑦) → ∀𝑗 ∈ 𝑍 -𝑦 ≤ (𝐹‘𝑗))
60		breq1 5145	. . . . . . . . 9 ⊢ (𝑥 = -𝑦 → (𝑥 ≤ (𝐹‘𝑗) ↔ -𝑦 ≤ (𝐹‘𝑗)))
61	60	ralbidv 3172	. . . . . . . 8 ⊢ (𝑥 = -𝑦 → (∀𝑗 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑗) ↔ ∀𝑗 ∈ 𝑍 -𝑦 ≤ (𝐹‘𝑗)))
62	61	rspcev 3607	. . . . . . 7 ⊢ ((-𝑦 ∈ ℝ ∧ ∀𝑗 ∈ 𝑍 -𝑦 ≤ (𝐹‘𝑗)) → ∃𝑥 ∈ ℝ ∀𝑗 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑗))
63	53, 59, 62	syl2anc 583	. . . . . 6 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ ∀𝑗 ∈ 𝑍 -(𝐹‘𝑗) ≤ 𝑦) → ∃𝑥 ∈ ℝ ∀𝑗 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑗))
64	63	rexlimdva2 3152	. . . . 5 ⊢ (𝜑 → (∃𝑦 ∈ ℝ ∀𝑗 ∈ 𝑍 -(𝐹‘𝑗) ≤ 𝑦 → ∃𝑥 ∈ ℝ ∀𝑗 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑗)))
65	37	ad2antlr 726	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ ∀𝑗 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑗)) → -𝑥 ∈ ℝ)
66		simplr 768	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑗 ∈ 𝑍) → 𝑥 ∈ ℝ)
67	15	adantlr 714	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑗 ∈ 𝑍) → (𝐹‘𝑗) ∈ ℝ)
68	66, 67	lenegd 11815	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑗 ∈ 𝑍) → (𝑥 ≤ (𝐹‘𝑗) ↔ -(𝐹‘𝑗) ≤ -𝑥))
69	68	ralbidva 3170	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (∀𝑗 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑗) ↔ ∀𝑗 ∈ 𝑍 -(𝐹‘𝑗) ≤ -𝑥))
70	69	biimpd 228	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (∀𝑗 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑗) → ∀𝑗 ∈ 𝑍 -(𝐹‘𝑗) ≤ -𝑥))
71	70	imp 406	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ ∀𝑗 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑗)) → ∀𝑗 ∈ 𝑍 -(𝐹‘𝑗) ≤ -𝑥)
72		brralrspcev 5202	. . . . . . 7 ⊢ ((-𝑥 ∈ ℝ ∧ ∀𝑗 ∈ 𝑍 -(𝐹‘𝑗) ≤ -𝑥) → ∃𝑦 ∈ ℝ ∀𝑗 ∈ 𝑍 -(𝐹‘𝑗) ≤ 𝑦)
73	65, 71, 72	syl2anc 583	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ ∀𝑗 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑗)) → ∃𝑦 ∈ ℝ ∀𝑗 ∈ 𝑍 -(𝐹‘𝑗) ≤ 𝑦)
74	73	rexlimdva2 3152	. . . . 5 ⊢ (𝜑 → (∃𝑥 ∈ ℝ ∀𝑗 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑗) → ∃𝑦 ∈ ℝ ∀𝑗 ∈ 𝑍 -(𝐹‘𝑗) ≤ 𝑦))
75	64, 74	impbid 211	. . . 4 ⊢ (𝜑 → (∃𝑦 ∈ ℝ ∀𝑗 ∈ 𝑍 -(𝐹‘𝑗) ≤ 𝑦 ↔ ∃𝑥 ∈ ℝ ∀𝑗 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑗)))
76	52, 75	anbi12d 630	. . 3 ⊢ (𝜑 → ((∃𝑦 ∈ ℝ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)𝑦 ≤ -(𝐹‘𝑗) ∧ ∃𝑦 ∈ ℝ ∀𝑗 ∈ 𝑍 -(𝐹‘𝑗) ≤ 𝑦) ↔ (∃𝑥 ∈ ℝ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥 ∧ ∃𝑥 ∈ ℝ ∀𝑗 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑗))))
77	17, 76	bitrd 279	. 2 ⊢ (𝜑 → ((lim sup‘(𝑗 ∈ 𝑍 ↦ -(𝐹‘𝑗))) ∈ ℝ ↔ (∃𝑥 ∈ ℝ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥 ∧ ∃𝑥 ∈ ℝ ∀𝑗 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑗))))
78	14, 77	bitrd 279	1 ⊢ (𝜑 → ((lim inf‘𝐹) ∈ ℝ ↔ (∃𝑥 ∈ ℝ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥 ∧ ∃𝑥 ∈ ℝ ∀𝑗 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑗))))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 = wceq 1534 ∈ wcel 2099 Ⅎwnfc 2878 ∀wral 3056 ∃wrex 3065 Vcvv 3469 class class class wbr 5142 ↦ cmpt 5225 ⟶wf 6538 ‘cfv 6542 ℝcr 11129 ℝ^*cxr 11269 ≤ cle 11271 -cneg 11467 ℤcz 12580 ℤ_≥cuz 12844 -_𝑒cxne 13113 lim supclsp 15438 lim infclsi 45062

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-10 2130 ax-11 2147 ax-12 2164 ax-ext 2698 ax-rep 5279 ax-sep 5293 ax-nul 5300 ax-pow 5359 ax-pr 5423 ax-un 7734 ax-cnex 11186 ax-resscn 11187 ax-1cn 11188 ax-icn 11189 ax-addcl 11190 ax-addrcl 11191 ax-mulcl 11192 ax-mulrcl 11193 ax-mulcom 11194 ax-addass 11195 ax-mulass 11196 ax-distr 11197 ax-i2m1 11198 ax-1ne0 11199 ax-1rid 11200 ax-rnegex 11201 ax-rrecex 11202 ax-cnre 11203 ax-pre-lttri 11204 ax-pre-lttrn 11205 ax-pre-ltadd 11206 ax-pre-mulgt0 11207 ax-pre-sup 11208

This theorem depends on definitions: df-bi 206 df-an 396 df-or 847 df-3or 1086 df-3an 1087 df-tru 1537 df-fal 1547 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2529 df-eu 2558 df-clab 2705 df-cleq 2719 df-clel 2805 df-nfc 2880 df-ne 2936 df-nel 3042 df-ral 3057 df-rex 3066 df-rmo 3371 df-reu 3372 df-rab 3428 df-v 3471 df-sbc 3775 df-csb 3890 df-dif 3947 df-un 3949 df-in 3951 df-ss 3961 df-pss 3963 df-nul 4319 df-if 4525 df-pw 4600 df-sn 4625 df-pr 4627 df-op 4631 df-uni 4904 df-iun 4993 df-br 5143 df-opab 5205 df-mpt 5226 df-tr 5260 df-id 5570 df-eprel 5576 df-po 5584 df-so 5585 df-fr 5627 df-we 5629 df-xp 5678 df-rel 5679 df-cnv 5680 df-co 5681 df-dm 5682 df-rn 5683 df-res 5684 df-ima 5685 df-pred 6299 df-ord 6366 df-on 6367 df-lim 6368 df-suc 6369 df-iota 6494 df-fun 6544 df-fn 6545 df-f 6546 df-f1 6547 df-fo 6548 df-f1o 6549 df-fv 6550 df-isom 6551 df-riota 7370 df-ov 7417 df-oprab 7418 df-mpo 7419 df-om 7865 df-1st 7987 df-2nd 7988 df-frecs 8280 df-wrecs 8311 df-recs 8385 df-rdg 8424 df-1o 8480 df-er 8718 df-en 8956 df-dom 8957 df-sdom 8958 df-fin 8959 df-sup 9457 df-inf 9458 df-pnf 11272 df-mnf 11273 df-xr 11274 df-ltxr 11275 df-le 11276 df-sub 11468 df-neg 11469 df-div 11894 df-nn 12235 df-n0 12495 df-z 12581 df-uz 12845 df-q 12955 df-xneg 13116 df-ico 13354 df-fz 13509 df-fzo 13652 df-fl 13781 df-ceil 13782 df-limsup 15439 df-liminf 45063

This theorem is referenced by: liminfreuz 45114

W3C validator