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 44508

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 1917	. . . . 5 ⊢ Ⅎ𝑗𝜑
2		liminfreuzlem.1	. . . . 5 ⊢ Ⅎ𝑗𝐹
3		liminfreuzlem.2	. . . . 5 ⊢ (𝜑 → 𝑀 ∈ ℤ)
4		liminfreuzlem.3	. . . . 5 ⊢ 𝑍 = (ℤ_≥‘𝑀)
5		liminfreuzlem.4	. . . . 5 ⊢ (𝜑 → 𝐹:𝑍⟶ℝ)
6	1, 2, 3, 4, 5	liminfvaluz4 44505	. . . 4 ⊢ (𝜑 → (lim inf‘𝐹) = -_𝑒(lim sup‘(𝑗 ∈ 𝑍 ↦ -(𝐹‘𝑗))))
7	6	eleq1d 2818	. . 3 ⊢ (𝜑 → ((lim inf‘𝐹) ∈ ℝ ↔ -_𝑒(lim sup‘(𝑗 ∈ 𝑍 ↦ -(𝐹‘𝑗))) ∈ ℝ))
8	4	fvexi 6905	. . . . . . 7 ⊢ 𝑍 ∈ V
9	8	mptex 7224	. . . . . 6 ⊢ (𝑗 ∈ 𝑍 ↦ -(𝐹‘𝑗)) ∈ V
10		limsupcl 15416	. . . . . 6 ⊢ ((𝑗 ∈ 𝑍 ↦ -(𝐹‘𝑗)) ∈ V → (lim sup‘(𝑗 ∈ 𝑍 ↦ -(𝐹‘𝑗))) ∈ ℝ^*)
11	9, 10	ax-mp 5	. . . . 5 ⊢ (lim sup‘(𝑗 ∈ 𝑍 ↦ -(𝐹‘𝑗))) ∈ ℝ^*
12	11	a1i 11	. . . 4 ⊢ (𝜑 → (lim sup‘(𝑗 ∈ 𝑍 ↦ -(𝐹‘𝑗))) ∈ ℝ^*)
13	12	xnegred 44170	. . 3 ⊢ (𝜑 → ((lim sup‘(𝑗 ∈ 𝑍 ↦ -(𝐹‘𝑗))) ∈ ℝ ↔ -_𝑒(lim sup‘(𝑗 ∈ 𝑍 ↦ -(𝐹‘𝑗))) ∈ ℝ))
14	7, 13	bitr4d 281	. 2 ⊢ (𝜑 → ((lim inf‘𝐹) ∈ ℝ ↔ (lim sup‘(𝑗 ∈ 𝑍 ↦ -(𝐹‘𝑗))) ∈ ℝ))
15	5	ffvelcdmda 7086	. . . . 5 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → (𝐹‘𝑗) ∈ ℝ)
16	15	renegcld 11640	. . . 4 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → -(𝐹‘𝑗) ∈ ℝ)
17	1, 3, 4, 16	limsupreuzmpt 44445	. . 3 ⊢ (𝜑 → ((lim sup‘(𝑗 ∈ 𝑍 ↦ -(𝐹‘𝑗))) ∈ ℝ ↔ (∃𝑦 ∈ ℝ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)𝑦 ≤ -(𝐹‘𝑗) ∧ ∃𝑦 ∈ ℝ ∀𝑗 ∈ 𝑍 -(𝐹‘𝑗) ≤ 𝑦)))
18		renegcl 11522	. . . . . . . 8 ⊢ (𝑦 ∈ ℝ → -𝑦 ∈ ℝ)
19	18	ad2antlr 725	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)𝑦 ≤ -(𝐹‘𝑗)) → -𝑦 ∈ ℝ)
20		simpllr 774	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑘 ∈ 𝑍) ∧ 𝑗 ∈ (ℤ_≥‘𝑘)) → 𝑦 ∈ ℝ)
21	5	ad2antrr 724	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝑍) ∧ 𝑗 ∈ (ℤ_≥‘𝑘)) → 𝐹:𝑍⟶ℝ)
22	4	uztrn2 12840	. . . . . . . . . . . . . . 15 ⊢ ((𝑘 ∈ 𝑍 ∧ 𝑗 ∈ (ℤ_≥‘𝑘)) → 𝑗 ∈ 𝑍)
23	22	adantll 712	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝑍) ∧ 𝑗 ∈ (ℤ_≥‘𝑘)) → 𝑗 ∈ 𝑍)
24	21, 23	ffvelcdmd 7087	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝑍) ∧ 𝑗 ∈ (ℤ_≥‘𝑘)) → (𝐹‘𝑗) ∈ ℝ)
25	24	adantllr 717	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑘 ∈ 𝑍) ∧ 𝑗 ∈ (ℤ_≥‘𝑘)) → (𝐹‘𝑗) ∈ ℝ)
26	20, 25	leneg2d 44148	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑘 ∈ 𝑍) ∧ 𝑗 ∈ (ℤ_≥‘𝑘)) → (𝑦 ≤ -(𝐹‘𝑗) ↔ (𝐹‘𝑗) ≤ -𝑦))
27	26	rexbidva 3176	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑘 ∈ 𝑍) → (∃𝑗 ∈ (ℤ_≥‘𝑘)𝑦 ≤ -(𝐹‘𝑗) ↔ ∃𝑗 ∈ (ℤ_≥‘𝑘)(𝐹‘𝑗) ≤ -𝑦))
28	27	ralbidva 3175	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → (∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)𝑦 ≤ -(𝐹‘𝑗) ↔ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)(𝐹‘𝑗) ≤ -𝑦))
29	28	biimpd 228	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → (∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)𝑦 ≤ -(𝐹‘𝑗) → ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)(𝐹‘𝑗) ≤ -𝑦))
30	29	imp 407	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)𝑦 ≤ -(𝐹‘𝑗)) → ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)(𝐹‘𝑗) ≤ -𝑦)
31		breq2 5152	. . . . . . . . . 10 ⊢ (𝑥 = -𝑦 → ((𝐹‘𝑗) ≤ 𝑥 ↔ (𝐹‘𝑗) ≤ -𝑦))
32	31	rexbidv 3178	. . . . . . . . 9 ⊢ (𝑥 = -𝑦 → (∃𝑗 ∈ (ℤ_≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥 ↔ ∃𝑗 ∈ (ℤ_≥‘𝑘)(𝐹‘𝑗) ≤ -𝑦))
33	32	ralbidv 3177	. . . . . . . 8 ⊢ (𝑥 = -𝑦 → (∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥 ↔ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)(𝐹‘𝑗) ≤ -𝑦))
34	33	rspcev 3612	. . . . . . 7 ⊢ ((-𝑦 ∈ ℝ ∧ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)(𝐹‘𝑗) ≤ -𝑦) → ∃𝑥 ∈ ℝ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥)
35	19, 30, 34	syl2anc 584	. . . . . 6 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)𝑦 ≤ -(𝐹‘𝑗)) → ∃𝑥 ∈ ℝ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥)
36	35	rexlimdva2 3157	. . . . 5 ⊢ (𝜑 → (∃𝑦 ∈ ℝ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)𝑦 ≤ -(𝐹‘𝑗) → ∃𝑥 ∈ ℝ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥))
37		renegcl 11522	. . . . . . . 8 ⊢ (𝑥 ∈ ℝ → -𝑥 ∈ ℝ)
38	37	ad2antlr 725	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥) → -𝑥 ∈ ℝ)
39	24	adantllr 717	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑘 ∈ 𝑍) ∧ 𝑗 ∈ (ℤ_≥‘𝑘)) → (𝐹‘𝑗) ∈ ℝ)
40		simpllr 774	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑘 ∈ 𝑍) ∧ 𝑗 ∈ (ℤ_≥‘𝑘)) → 𝑥 ∈ ℝ)
41	39, 40	lenegd 11792	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑘 ∈ 𝑍) ∧ 𝑗 ∈ (ℤ_≥‘𝑘)) → ((𝐹‘𝑗) ≤ 𝑥 ↔ -𝑥 ≤ -(𝐹‘𝑗)))
42	41	rexbidva 3176	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑘 ∈ 𝑍) → (∃𝑗 ∈ (ℤ_≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥 ↔ ∃𝑗 ∈ (ℤ_≥‘𝑘)-𝑥 ≤ -(𝐹‘𝑗)))
43	42	ralbidva 3175	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥 ↔ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)-𝑥 ≤ -(𝐹‘𝑗)))
44	43	biimpd 228	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥 → ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)-𝑥 ≤ -(𝐹‘𝑗)))
45	44	imp 407	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥) → ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)-𝑥 ≤ -(𝐹‘𝑗))
46		breq1 5151	. . . . . . . . . 10 ⊢ (𝑦 = -𝑥 → (𝑦 ≤ -(𝐹‘𝑗) ↔ -𝑥 ≤ -(𝐹‘𝑗)))
47	46	rexbidv 3178	. . . . . . . . 9 ⊢ (𝑦 = -𝑥 → (∃𝑗 ∈ (ℤ_≥‘𝑘)𝑦 ≤ -(𝐹‘𝑗) ↔ ∃𝑗 ∈ (ℤ_≥‘𝑘)-𝑥 ≤ -(𝐹‘𝑗)))
48	47	ralbidv 3177	. . . . . . . 8 ⊢ (𝑦 = -𝑥 → (∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)𝑦 ≤ -(𝐹‘𝑗) ↔ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)-𝑥 ≤ -(𝐹‘𝑗)))
49	48	rspcev 3612	. . . . . . 7 ⊢ ((-𝑥 ∈ ℝ ∧ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)-𝑥 ≤ -(𝐹‘𝑗)) → ∃𝑦 ∈ ℝ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)𝑦 ≤ -(𝐹‘𝑗))
50	38, 45, 49	syl2anc 584	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥) → ∃𝑦 ∈ ℝ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)𝑦 ≤ -(𝐹‘𝑗))
51	50	rexlimdva2 3157	. . . . 5 ⊢ (𝜑 → (∃𝑥 ∈ ℝ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥 → ∃𝑦 ∈ ℝ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)𝑦 ≤ -(𝐹‘𝑗)))
52	36, 51	impbid 211	. . . 4 ⊢ (𝜑 → (∃𝑦 ∈ ℝ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)𝑦 ≤ -(𝐹‘𝑗) ↔ ∃𝑥 ∈ ℝ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥))
53	18	ad2antlr 725	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ ∀𝑗 ∈ 𝑍 -(𝐹‘𝑗) ≤ 𝑦) → -𝑦 ∈ ℝ)
54	15	adantlr 713	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑗 ∈ 𝑍) → (𝐹‘𝑗) ∈ ℝ)
55		simplr 767	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑗 ∈ 𝑍) → 𝑦 ∈ ℝ)
56	54, 55	leneg3d 44157	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑗 ∈ 𝑍) → (-(𝐹‘𝑗) ≤ 𝑦 ↔ -𝑦 ≤ (𝐹‘𝑗)))
57	56	ralbidva 3175	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → (∀𝑗 ∈ 𝑍 -(𝐹‘𝑗) ≤ 𝑦 ↔ ∀𝑗 ∈ 𝑍 -𝑦 ≤ (𝐹‘𝑗)))
58	57	biimpd 228	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → (∀𝑗 ∈ 𝑍 -(𝐹‘𝑗) ≤ 𝑦 → ∀𝑗 ∈ 𝑍 -𝑦 ≤ (𝐹‘𝑗)))
59	58	imp 407	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ ∀𝑗 ∈ 𝑍 -(𝐹‘𝑗) ≤ 𝑦) → ∀𝑗 ∈ 𝑍 -𝑦 ≤ (𝐹‘𝑗))
60		breq1 5151	. . . . . . . . 9 ⊢ (𝑥 = -𝑦 → (𝑥 ≤ (𝐹‘𝑗) ↔ -𝑦 ≤ (𝐹‘𝑗)))
61	60	ralbidv 3177	. . . . . . . 8 ⊢ (𝑥 = -𝑦 → (∀𝑗 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑗) ↔ ∀𝑗 ∈ 𝑍 -𝑦 ≤ (𝐹‘𝑗)))
62	61	rspcev 3612	. . . . . . 7 ⊢ ((-𝑦 ∈ ℝ ∧ ∀𝑗 ∈ 𝑍 -𝑦 ≤ (𝐹‘𝑗)) → ∃𝑥 ∈ ℝ ∀𝑗 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑗))
63	53, 59, 62	syl2anc 584	. . . . . 6 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ ∀𝑗 ∈ 𝑍 -(𝐹‘𝑗) ≤ 𝑦) → ∃𝑥 ∈ ℝ ∀𝑗 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑗))
64	63	rexlimdva2 3157	. . . . 5 ⊢ (𝜑 → (∃𝑦 ∈ ℝ ∀𝑗 ∈ 𝑍 -(𝐹‘𝑗) ≤ 𝑦 → ∃𝑥 ∈ ℝ ∀𝑗 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑗)))
65	37	ad2antlr 725	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ ∀𝑗 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑗)) → -𝑥 ∈ ℝ)
66		simplr 767	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑗 ∈ 𝑍) → 𝑥 ∈ ℝ)
67	15	adantlr 713	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑗 ∈ 𝑍) → (𝐹‘𝑗) ∈ ℝ)
68	66, 67	lenegd 11792	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑗 ∈ 𝑍) → (𝑥 ≤ (𝐹‘𝑗) ↔ -(𝐹‘𝑗) ≤ -𝑥))
69	68	ralbidva 3175	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (∀𝑗 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑗) ↔ ∀𝑗 ∈ 𝑍 -(𝐹‘𝑗) ≤ -𝑥))
70	69	biimpd 228	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (∀𝑗 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑗) → ∀𝑗 ∈ 𝑍 -(𝐹‘𝑗) ≤ -𝑥))
71	70	imp 407	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ ∀𝑗 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑗)) → ∀𝑗 ∈ 𝑍 -(𝐹‘𝑗) ≤ -𝑥)
72		brralrspcev 5208	. . . . . . 7 ⊢ ((-𝑥 ∈ ℝ ∧ ∀𝑗 ∈ 𝑍 -(𝐹‘𝑗) ≤ -𝑥) → ∃𝑦 ∈ ℝ ∀𝑗 ∈ 𝑍 -(𝐹‘𝑗) ≤ 𝑦)
73	65, 71, 72	syl2anc 584	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ ∀𝑗 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑗)) → ∃𝑦 ∈ ℝ ∀𝑗 ∈ 𝑍 -(𝐹‘𝑗) ≤ 𝑦)
74	73	rexlimdva2 3157	. . . . 5 ⊢ (𝜑 → (∃𝑥 ∈ ℝ ∀𝑗 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑗) → ∃𝑦 ∈ ℝ ∀𝑗 ∈ 𝑍 -(𝐹‘𝑗) ≤ 𝑦))
75	64, 74	impbid 211	. . . 4 ⊢ (𝜑 → (∃𝑦 ∈ ℝ ∀𝑗 ∈ 𝑍 -(𝐹‘𝑗) ≤ 𝑦 ↔ ∃𝑥 ∈ ℝ ∀𝑗 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑗)))
76	52, 75	anbi12d 631	. . 3 ⊢ (𝜑 → ((∃𝑦 ∈ ℝ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)𝑦 ≤ -(𝐹‘𝑗) ∧ ∃𝑦 ∈ ℝ ∀𝑗 ∈ 𝑍 -(𝐹‘𝑗) ≤ 𝑦) ↔ (∃𝑥 ∈ ℝ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥 ∧ ∃𝑥 ∈ ℝ ∀𝑗 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑗))))
77	17, 76	bitrd 278	. 2 ⊢ (𝜑 → ((lim sup‘(𝑗 ∈ 𝑍 ↦ -(𝐹‘𝑗))) ∈ ℝ ↔ (∃𝑥 ∈ ℝ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥 ∧ ∃𝑥 ∈ ℝ ∀𝑗 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑗))))
78	14, 77	bitrd 278	1 ⊢ (𝜑 → ((lim inf‘𝐹) ∈ ℝ ↔ (∃𝑥 ∈ ℝ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ_≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥 ∧ ∃𝑥 ∈ ℝ ∀𝑗 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑗))))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1541 ∈ wcel 2106 Ⅎwnfc 2883 ∀wral 3061 ∃wrex 3070 Vcvv 3474 class class class wbr 5148 ↦ cmpt 5231 ⟶wf 6539 ‘cfv 6543 ℝcr 11108 ℝ^*cxr 11246 ≤ cle 11248 -cneg 11444 ℤcz 12557 ℤ_≥cuz 12821 -_𝑒cxne 13088 lim supclsp 15413 lim infclsi 44457

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7724 ax-cnex 11165 ax-resscn 11166 ax-1cn 11167 ax-icn 11168 ax-addcl 11169 ax-addrcl 11170 ax-mulcl 11171 ax-mulrcl 11172 ax-mulcom 11173 ax-addass 11174 ax-mulass 11175 ax-distr 11176 ax-i2m1 11177 ax-1ne0 11178 ax-1rid 11179 ax-rnegex 11180 ax-rrecex 11181 ax-cnre 11182 ax-pre-lttri 11183 ax-pre-lttrn 11184 ax-pre-ltadd 11185 ax-pre-mulgt0 11186 ax-pre-sup 11187

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3376 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-pss 3967 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-iun 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5574 df-eprel 5580 df-po 5588 df-so 5589 df-fr 5631 df-we 5633 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-pred 6300 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-isom 6552 df-riota 7364 df-ov 7411 df-oprab 7412 df-mpo 7413 df-om 7855 df-1st 7974 df-2nd 7975 df-frecs 8265 df-wrecs 8296 df-recs 8370 df-rdg 8409 df-1o 8465 df-er 8702 df-en 8939 df-dom 8940 df-sdom 8941 df-fin 8942 df-sup 9436 df-inf 9437 df-pnf 11249 df-mnf 11250 df-xr 11251 df-ltxr 11252 df-le 11253 df-sub 11445 df-neg 11446 df-div 11871 df-nn 12212 df-n0 12472 df-z 12558 df-uz 12822 df-q 12932 df-xneg 13091 df-ico 13329 df-fz 13484 df-fzo 13627 df-fl 13756 df-ceil 13757 df-limsup 15414 df-liminf 44458

This theorem is referenced by: liminfreuz 44509

W3C validator