Theorem liminfreuzlem 46544

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 1944	. . . . 5 ⊢ Ⅎ𝑗𝜑
2		liminfreuzlem.1	. . . . 5 ⊢ Ⅎ𝑗𝐹
3		liminfreuzlem.2	. . . . 5 ⊢ (𝜑 → 𝑀 ∈ ℤ)
4		liminfreuzlem.3	. . . . 5 ⊢ 𝑍 = (ℤ≥‘𝑀)
5		liminfreuzlem.4	. . . . 5 ⊢ (𝜑 → 𝐹:𝑍⟶ℝ)
6	1, 2, 3, 4, 5	liminfvaluz4 46541	. . . 4 ⊢ (𝜑 → (lim inf‘𝐹) = -𝑒(lim sup‘(𝑗 ∈ 𝑍 ↦ -(𝐹‘𝑗))))
7	6	eleq1d 2848	. . 3 ⊢ (𝜑 → ((lim inf‘𝐹) ∈ ℝ ↔ -𝑒(lim sup‘(𝑗 ∈ 𝑍 ↦ -(𝐹‘𝑗))) ∈ ℝ))
8	4	fvexi 6895	. . . . . . 7 ⊢ 𝑍 ∈ V
9	8	mptex 7221	. . . . . 6 ⊢ (𝑗 ∈ 𝑍 ↦ -(𝐹‘𝑗)) ∈ V
10		limsupcl 15529	. . . . . 6 ⊢ ((𝑗 ∈ 𝑍 ↦ -(𝐹‘𝑗)) ∈ V → (lim sup‘(𝑗 ∈ 𝑍 ↦ -(𝐹‘𝑗))) ∈ ℝ*)
11	9, 10	ax-mp 5	. . . . 5 ⊢ (lim sup‘(𝑗 ∈ 𝑍 ↦ -(𝐹‘𝑗))) ∈ ℝ*
12	11	a1i 11	. . . 4 ⊢ (𝜑 → (lim sup‘(𝑗 ∈ 𝑍 ↦ -(𝐹‘𝑗))) ∈ ℝ*)
13	12	xnegred 46212	. . 3 ⊢ (𝜑 → ((lim sup‘(𝑗 ∈ 𝑍 ↦ -(𝐹‘𝑗))) ∈ ℝ ↔ -𝑒(lim sup‘(𝑗 ∈ 𝑍 ↦ -(𝐹‘𝑗))) ∈ ℝ))
14	7, 13	bitr4d 285	. 2 ⊢ (𝜑 → ((lim inf‘𝐹) ∈ ℝ ↔ (lim sup‘(𝑗 ∈ 𝑍 ↦ -(𝐹‘𝑗))) ∈ ℝ))
15	5	ffvelcdmda 7079	. . . . 5 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → (𝐹‘𝑗) ∈ ℝ)
16	15	renegcld 11645	. . . 4 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → -(𝐹‘𝑗) ∈ ℝ)
17	1, 3, 4, 16	limsupreuzmpt 46481	. . 3 ⊢ (𝜑 → ((lim sup‘(𝑗 ∈ 𝑍 ↦ -(𝐹‘𝑗))) ∈ ℝ ↔ (∃𝑦 ∈ ℝ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ≥‘𝑘)𝑦 ≤ -(𝐹‘𝑗) ∧ ∃𝑦 ∈ ℝ ∀𝑗 ∈ 𝑍 -(𝐹‘𝑗) ≤ 𝑦)))
18		renegcl 11525	. . . . . . . 8 ⊢ (𝑦 ∈ ℝ → -𝑦 ∈ ℝ)
19	18	ad2antlr 739	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ≥‘𝑘)𝑦 ≤ -(𝐹‘𝑗)) → -𝑦 ∈ ℝ)
20		simpllr 787	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑘 ∈ 𝑍) ∧ 𝑗 ∈ (ℤ≥‘𝑘)) → 𝑦 ∈ ℝ)
21	5	ad2antrr 738	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝑍) ∧ 𝑗 ∈ (ℤ≥‘𝑘)) → 𝐹:𝑍⟶ℝ)
22	4	uztrn2 12885	. . . . . . . . . . . . . . 15 ⊢ ((𝑘 ∈ 𝑍 ∧ 𝑗 ∈ (ℤ≥‘𝑘)) → 𝑗 ∈ 𝑍)
23	22	adantll 726	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝑍) ∧ 𝑗 ∈ (ℤ≥‘𝑘)) → 𝑗 ∈ 𝑍)
24	21, 23	ffvelcdmd 7080	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝑍) ∧ 𝑗 ∈ (ℤ≥‘𝑘)) → (𝐹‘𝑗) ∈ ℝ)
25	24	adantllr 731	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑘 ∈ 𝑍) ∧ 𝑗 ∈ (ℤ≥‘𝑘)) → (𝐹‘𝑗) ∈ ℝ)
26	20, 25	leneg2d 46190	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑘 ∈ 𝑍) ∧ 𝑗 ∈ (ℤ≥‘𝑘)) → (𝑦 ≤ -(𝐹‘𝑗) ↔ (𝐹‘𝑗) ≤ -𝑦))
27	26	rexbidva 3187	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑘 ∈ 𝑍) → (∃𝑗 ∈ (ℤ≥‘𝑘)𝑦 ≤ -(𝐹‘𝑗) ↔ ∃𝑗 ∈ (ℤ≥‘𝑘)(𝐹‘𝑗) ≤ -𝑦))
28	27	ralbidva 3186	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → (∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ≥‘𝑘)𝑦 ≤ -(𝐹‘𝑗) ↔ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ≥‘𝑘)(𝐹‘𝑗) ≤ -𝑦))
29	28	biimpd 232	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → (∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ≥‘𝑘)𝑦 ≤ -(𝐹‘𝑗) → ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ≥‘𝑘)(𝐹‘𝑗) ≤ -𝑦))
30	29	imp 411	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ≥‘𝑘)𝑦 ≤ -(𝐹‘𝑗)) → ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ≥‘𝑘)(𝐹‘𝑗) ≤ -𝑦)
31		breq2 5113	. . . . . . . . . 10 ⊢ (𝑥 = -𝑦 → ((𝐹‘𝑗) ≤ 𝑥 ↔ (𝐹‘𝑗) ≤ -𝑦))
32	31	rexbidv 3189	. . . . . . . . 9 ⊢ (𝑥 = -𝑦 → (∃𝑗 ∈ (ℤ≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥 ↔ ∃𝑗 ∈ (ℤ≥‘𝑘)(𝐹‘𝑗) ≤ -𝑦))
33	32	ralbidv 3188	. . . . . . . 8 ⊢ (𝑥 = -𝑦 → (∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥 ↔ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ≥‘𝑘)(𝐹‘𝑗) ≤ -𝑦))
34	33	rspcev 3581	. . . . . . 7 ⊢ ((-𝑦 ∈ ℝ ∧ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ≥‘𝑘)(𝐹‘𝑗) ≤ -𝑦) → ∃𝑥 ∈ ℝ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥)
35	19, 30, 34	syl2anc 595	. . . . . 6 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ≥‘𝑘)𝑦 ≤ -(𝐹‘𝑗)) → ∃𝑥 ∈ ℝ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥)
36	35	rexlimdva2 3168	. . . . 5 ⊢ (𝜑 → (∃𝑦 ∈ ℝ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ≥‘𝑘)𝑦 ≤ -(𝐹‘𝑗) → ∃𝑥 ∈ ℝ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥))
37		renegcl 11525	. . . . . . . 8 ⊢ (𝑥 ∈ ℝ → -𝑥 ∈ ℝ)
38	37	ad2antlr 739	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥) → -𝑥 ∈ ℝ)
39	24	adantllr 731	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑘 ∈ 𝑍) ∧ 𝑗 ∈ (ℤ≥‘𝑘)) → (𝐹‘𝑗) ∈ ℝ)
40		simpllr 787	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑘 ∈ 𝑍) ∧ 𝑗 ∈ (ℤ≥‘𝑘)) → 𝑥 ∈ ℝ)
41	39, 40	lenegd 11797	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑘 ∈ 𝑍) ∧ 𝑗 ∈ (ℤ≥‘𝑘)) → ((𝐹‘𝑗) ≤ 𝑥 ↔ -𝑥 ≤ -(𝐹‘𝑗)))
42	41	rexbidva 3187	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑘 ∈ 𝑍) → (∃𝑗 ∈ (ℤ≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥 ↔ ∃𝑗 ∈ (ℤ≥‘𝑘)-𝑥 ≤ -(𝐹‘𝑗)))
43	42	ralbidva 3186	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥 ↔ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ≥‘𝑘)-𝑥 ≤ -(𝐹‘𝑗)))
44	43	biimpd 232	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥 → ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ≥‘𝑘)-𝑥 ≤ -(𝐹‘𝑗)))
45	44	imp 411	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥) → ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ≥‘𝑘)-𝑥 ≤ -(𝐹‘𝑗))
46		breq1 5112	. . . . . . . . . 10 ⊢ (𝑦 = -𝑥 → (𝑦 ≤ -(𝐹‘𝑗) ↔ -𝑥 ≤ -(𝐹‘𝑗)))
47	46	rexbidv 3189	. . . . . . . . 9 ⊢ (𝑦 = -𝑥 → (∃𝑗 ∈ (ℤ≥‘𝑘)𝑦 ≤ -(𝐹‘𝑗) ↔ ∃𝑗 ∈ (ℤ≥‘𝑘)-𝑥 ≤ -(𝐹‘𝑗)))
48	47	ralbidv 3188	. . . . . . . 8 ⊢ (𝑦 = -𝑥 → (∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ≥‘𝑘)𝑦 ≤ -(𝐹‘𝑗) ↔ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ≥‘𝑘)-𝑥 ≤ -(𝐹‘𝑗)))
49	48	rspcev 3581	. . . . . . 7 ⊢ ((-𝑥 ∈ ℝ ∧ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ≥‘𝑘)-𝑥 ≤ -(𝐹‘𝑗)) → ∃𝑦 ∈ ℝ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ≥‘𝑘)𝑦 ≤ -(𝐹‘𝑗))
50	38, 45, 49	syl2anc 595	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥) → ∃𝑦 ∈ ℝ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ≥‘𝑘)𝑦 ≤ -(𝐹‘𝑗))
51	50	rexlimdva2 3168	. . . . 5 ⊢ (𝜑 → (∃𝑥 ∈ ℝ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥 → ∃𝑦 ∈ ℝ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ≥‘𝑘)𝑦 ≤ -(𝐹‘𝑗)))
52	36, 51	impbid 215	. . . 4 ⊢ (𝜑 → (∃𝑦 ∈ ℝ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ≥‘𝑘)𝑦 ≤ -(𝐹‘𝑗) ↔ ∃𝑥 ∈ ℝ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥))
53	18	ad2antlr 739	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ ∀𝑗 ∈ 𝑍 -(𝐹‘𝑗) ≤ 𝑦) → -𝑦 ∈ ℝ)
54	15	adantlr 727	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑗 ∈ 𝑍) → (𝐹‘𝑗) ∈ ℝ)
55		simplr 780	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑗 ∈ 𝑍) → 𝑦 ∈ ℝ)
56	54, 55	leneg3d 46199	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑗 ∈ 𝑍) → (-(𝐹‘𝑗) ≤ 𝑦 ↔ -𝑦 ≤ (𝐹‘𝑗)))
57	56	ralbidva 3186	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → (∀𝑗 ∈ 𝑍 -(𝐹‘𝑗) ≤ 𝑦 ↔ ∀𝑗 ∈ 𝑍 -𝑦 ≤ (𝐹‘𝑗)))
58	57	biimpd 232	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → (∀𝑗 ∈ 𝑍 -(𝐹‘𝑗) ≤ 𝑦 → ∀𝑗 ∈ 𝑍 -𝑦 ≤ (𝐹‘𝑗)))
59	58	imp 411	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ ∀𝑗 ∈ 𝑍 -(𝐹‘𝑗) ≤ 𝑦) → ∀𝑗 ∈ 𝑍 -𝑦 ≤ (𝐹‘𝑗))
60		breq1 5112	. . . . . . . . 9 ⊢ (𝑥 = -𝑦 → (𝑥 ≤ (𝐹‘𝑗) ↔ -𝑦 ≤ (𝐹‘𝑗)))
61	60	ralbidv 3188	. . . . . . . 8 ⊢ (𝑥 = -𝑦 → (∀𝑗 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑗) ↔ ∀𝑗 ∈ 𝑍 -𝑦 ≤ (𝐹‘𝑗)))
62	61	rspcev 3581	. . . . . . 7 ⊢ ((-𝑦 ∈ ℝ ∧ ∀𝑗 ∈ 𝑍 -𝑦 ≤ (𝐹‘𝑗)) → ∃𝑥 ∈ ℝ ∀𝑗 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑗))
63	53, 59, 62	syl2anc 595	. . . . . 6 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ ∀𝑗 ∈ 𝑍 -(𝐹‘𝑗) ≤ 𝑦) → ∃𝑥 ∈ ℝ ∀𝑗 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑗))
64	63	rexlimdva2 3168	. . . . 5 ⊢ (𝜑 → (∃𝑦 ∈ ℝ ∀𝑗 ∈ 𝑍 -(𝐹‘𝑗) ≤ 𝑦 → ∃𝑥 ∈ ℝ ∀𝑗 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑗)))
65	37	ad2antlr 739	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ ∀𝑗 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑗)) → -𝑥 ∈ ℝ)
66		simplr 780	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑗 ∈ 𝑍) → 𝑥 ∈ ℝ)
67	15	adantlr 727	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑗 ∈ 𝑍) → (𝐹‘𝑗) ∈ ℝ)
68	66, 67	lenegd 11797	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑗 ∈ 𝑍) → (𝑥 ≤ (𝐹‘𝑗) ↔ -(𝐹‘𝑗) ≤ -𝑥))
69	68	ralbidva 3186	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (∀𝑗 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑗) ↔ ∀𝑗 ∈ 𝑍 -(𝐹‘𝑗) ≤ -𝑥))
70	69	biimpd 232	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (∀𝑗 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑗) → ∀𝑗 ∈ 𝑍 -(𝐹‘𝑗) ≤ -𝑥))
71	70	imp 411	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ ∀𝑗 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑗)) → ∀𝑗 ∈ 𝑍 -(𝐹‘𝑗) ≤ -𝑥)
72		brralrspcev 5171	. . . . . . 7 ⊢ ((-𝑥 ∈ ℝ ∧ ∀𝑗 ∈ 𝑍 -(𝐹‘𝑗) ≤ -𝑥) → ∃𝑦 ∈ ℝ ∀𝑗 ∈ 𝑍 -(𝐹‘𝑗) ≤ 𝑦)
73	65, 71, 72	syl2anc 595	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ ∀𝑗 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑗)) → ∃𝑦 ∈ ℝ ∀𝑗 ∈ 𝑍 -(𝐹‘𝑗) ≤ 𝑦)
74	73	rexlimdva2 3168	. . . . 5 ⊢ (𝜑 → (∃𝑥 ∈ ℝ ∀𝑗 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑗) → ∃𝑦 ∈ ℝ ∀𝑗 ∈ 𝑍 -(𝐹‘𝑗) ≤ 𝑦))
75	64, 74	impbid 215	. . . 4 ⊢ (𝜑 → (∃𝑦 ∈ ℝ ∀𝑗 ∈ 𝑍 -(𝐹‘𝑗) ≤ 𝑦 ↔ ∃𝑥 ∈ ℝ ∀𝑗 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑗)))
76	52, 75	anbi12d 643	. . 3 ⊢ (𝜑 → ((∃𝑦 ∈ ℝ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ≥‘𝑘)𝑦 ≤ -(𝐹‘𝑗) ∧ ∃𝑦 ∈ ℝ ∀𝑗 ∈ 𝑍 -(𝐹‘𝑗) ≤ 𝑦) ↔ (∃𝑥 ∈ ℝ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥 ∧ ∃𝑥 ∈ ℝ ∀𝑗 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑗))))
77	17, 76	bitrd 282	. 2 ⊢ (𝜑 → ((lim sup‘(𝑗 ∈ 𝑍 ↦ -(𝐹‘𝑗))) ∈ ℝ ↔ (∃𝑥 ∈ ℝ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥 ∧ ∃𝑥 ∈ ℝ ∀𝑗 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑗))))
78	14, 77	bitrd 282	1 ⊢ (𝜑 → ((lim inf‘𝐹) ∈ ℝ ↔ (∃𝑥 ∈ ℝ ∀𝑘 ∈ 𝑍 ∃𝑗 ∈ (ℤ≥‘𝑘)(𝐹‘𝑗) ≤ 𝑥 ∧ ∃𝑥 ∈ ℝ ∀𝑗 ∈ 𝑍 𝑥 ≤ (𝐹‘𝑗))))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 400   = wceq 1570   ∈ wcel 2143  Ⅎwnfc 2910  ∀wral 3079  ∃wrex 3089  Vcvv 3455   class class class wbr 5109   ↦ cmpt 5192  ⟶wf 6532  ‘cfv 6536  ℝcr 11103  ℝ^*cxr 11246   ≤ cle 11248  -cneg 11446  ℤcz 12595  ℤ_≥cuz 12866  -_𝑒cxne 13138  lim supclsp 15526  lim infclsi 46493

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5238  ax-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404  ax-un 7732  ax-cnex 11160  ax-resscn 11161  ax-1cn 11162  ax-icn 11163  ax-addcl 11164  ax-addrcl 11165  ax-mulcl 11166  ax-mulrcl 11167  ax-mulcom 11168  ax-addass 11169  ax-mulass 11170  ax-distr 11171  ax-i2m1 11172  ax-1ne0 11173  ax-1rid 11174  ax-rnegex 11175  ax-rrecex 11176  ax-cnre 11177  ax-pre-lttri 11178  ax-pre-lttrn 11179  ax-pre-ltadd 11180  ax-pre-mulgt0 11181  ax-pre-sup 11182

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-nel 3065  df-ral 3080  df-rex 3090  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-pss 3925  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-iun 4958  df-br 5110  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5556  df-eprel 5561  df-po 5569  df-so 5570  df-fr 5614  df-we 5616  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-pred 6302  df-ord 6363  df-on 6364  df-lim 6365  df-suc 6366  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-isom 6545  df-riota 7367  df-ov 7413  df-oprab 7414  df-mpo 7415  df-om 7859  df-1st 7982  df-2nd 7983  df-frecs 8274  df-wrecs 8305  df-recs 8354  df-rdg 8393  df-1o 8449  df-er 8690  df-en 8940  df-dom 8941  df-sdom 8942  df-fin 8943  df-sup 9398  df-inf 9399  df-pnf 11249  df-mnf 11250  df-xr 11251  df-ltxr 11252  df-le 11253  df-sub 11447  df-neg 11448  df-div 11876  df-nn 12238  df-n0 12509  df-z 12596  df-uz 12867  df-q 12977  df-xneg 13141  df-ico 13382  df-fz 13540  df-fzo 13688  df-fl 13830  df-ceil 13831  df-limsup 15527  df-liminf 46494

This theorem is used by:  liminfreuz  46545