liminflimsupclim - Mathbox for Glauco Siliprandi

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

Theorem liminflimsupclim 44523

Description: A sequence of real numbers converges if its inferior limit is real, and it is greater than or equal to the superior limit (in such a case, they are actually equal, see liminflelimsupuz 44501). (Contributed by Glauco Siliprandi, 2-Jan-2022.)

**Hypotheses**
Ref	Expression
liminflimsupclim.1	⊢ (𝜑 → 𝑀 ∈ ℤ)
liminflimsupclim.2	⊢ 𝑍 = (ℤ_≥‘𝑀)
liminflimsupclim.3	⊢ (𝜑 → 𝐹:𝑍⟶ℝ)
liminflimsupclim.4	⊢ (𝜑 → (lim inf‘𝐹) ∈ ℝ)
liminflimsupclim.5	⊢ (𝜑 → (lim sup‘𝐹) ≤ (lim inf‘𝐹))

**Assertion**
Ref	Expression
liminflimsupclim	⊢ (𝜑 → 𝐹 ∈ dom ⇝ )

Proof of Theorem liminflimsupclim Dummy variables 𝑗 𝑘 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		climrel 15436	. . 3 ⊢ Rel ⇝
2	1	a1i 11	. 2 ⊢ (𝜑 → Rel ⇝ )
3		liminflimsupclim.3	. . . . . . . . 9 ⊢ (𝜑 → 𝐹:𝑍⟶ℝ)
4		liminflimsupclim.2	. . . . . . . . . . 11 ⊢ 𝑍 = (ℤ_≥‘𝑀)
5	4	fvexi 6906	. . . . . . . . . 10 ⊢ 𝑍 ∈ V
6	5	a1i 11	. . . . . . . . 9 ⊢ (𝜑 → 𝑍 ∈ V)
7	3, 6	fexd 7229	. . . . . . . 8 ⊢ (𝜑 → 𝐹 ∈ V)
8	7	limsupcld 44406	. . . . . . 7 ⊢ (𝜑 → (lim sup‘𝐹) ∈ ℝ^*)
9		liminflimsupclim.4	. . . . . . . 8 ⊢ (𝜑 → (lim inf‘𝐹) ∈ ℝ)
10	9	rexrd 11264	. . . . . . 7 ⊢ (𝜑 → (lim inf‘𝐹) ∈ ℝ^*)
11		liminflimsupclim.5	. . . . . . 7 ⊢ (𝜑 → (lim sup‘𝐹) ≤ (lim inf‘𝐹))
12		liminflimsupclim.1	. . . . . . . 8 ⊢ (𝜑 → 𝑀 ∈ ℤ)
13	3	frexr 44095	. . . . . . . 8 ⊢ (𝜑 → 𝐹:𝑍⟶ℝ^*)
14	12, 4, 13	liminflelimsupuz 44501	. . . . . . 7 ⊢ (𝜑 → (lim inf‘𝐹) ≤ (lim sup‘𝐹))
15	8, 10, 11, 14	xrletrid 13134	. . . . . 6 ⊢ (𝜑 → (lim sup‘𝐹) = (lim inf‘𝐹))
16	15, 9	eqeltrd 2834	. . . . 5 ⊢ (𝜑 → (lim sup‘𝐹) ∈ ℝ)
17	16	recnd 11242	. . . 4 ⊢ (𝜑 → (lim sup‘𝐹) ∈ ℂ)
18		nfcv 2904	. . . . . . . . . 10 ⊢ Ⅎ𝑘𝐹
19	12	adantr 482	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ⁺) → 𝑀 ∈ ℤ)
20	3	adantr 482	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ⁺) → 𝐹:𝑍⟶ℝ)
21	9	adantr 482	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ⁺) → (lim inf‘𝐹) ∈ ℝ)
22		simpr 486	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ⁺) → 𝑥 ∈ ℝ⁺)
23	18, 19, 4, 20, 21, 22	liminflt 44521	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ⁺) → ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(lim inf‘𝐹) < ((𝐹‘𝑘) + 𝑥))
24	21	ad2antrr 725	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → (lim inf‘𝐹) ∈ ℝ)
25	3	ad2antrr 725	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → 𝐹:𝑍⟶ℝ)
26	4	uztrn2 12841	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → 𝑘 ∈ 𝑍)
27	26	adantll 713	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → 𝑘 ∈ 𝑍)
28	25, 27	ffvelcdmd 7088	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → (𝐹‘𝑘) ∈ ℝ)
29	28	adantllr 718	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → (𝐹‘𝑘) ∈ ℝ)
30	22	ad2antrr 725	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → 𝑥 ∈ ℝ⁺)
31		rpre 12982	. . . . . . . . . . . . . . 15 ⊢ (𝑥 ∈ ℝ⁺ → 𝑥 ∈ ℝ)
32	30, 31	syl 17	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → 𝑥 ∈ ℝ)
33	24, 29, 32	ltsubadd2d 11812	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → (((lim inf‘𝐹) − (𝐹‘𝑘)) < 𝑥 ↔ (lim inf‘𝐹) < ((𝐹‘𝑘) + 𝑥)))
34	33	bicomd 222	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → ((lim inf‘𝐹) < ((𝐹‘𝑘) + 𝑥) ↔ ((lim inf‘𝐹) − (𝐹‘𝑘)) < 𝑥))
35	28	recnd 11242	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → (𝐹‘𝑘) ∈ ℂ)
36	15	eqcomd 2739	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → (lim inf‘𝐹) = (lim sup‘𝐹))
37	36, 17	eqeltrd 2834	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → (lim inf‘𝐹) ∈ ℂ)
38	37	ad2antrr 725	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → (lim inf‘𝐹) ∈ ℂ)
39	35, 38	negsubdi2d 11587	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → -((𝐹‘𝑘) − (lim inf‘𝐹)) = ((lim inf‘𝐹) − (𝐹‘𝑘)))
40	39	breq1d 5159	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → (-((𝐹‘𝑘) − (lim inf‘𝐹)) < 𝑥 ↔ ((lim inf‘𝐹) − (𝐹‘𝑘)) < 𝑥))
41	40	adantllr 718	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → (-((𝐹‘𝑘) − (lim inf‘𝐹)) < 𝑥 ↔ ((lim inf‘𝐹) − (𝐹‘𝑘)) < 𝑥))
42	41	bicomd 222	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → (((lim inf‘𝐹) − (𝐹‘𝑘)) < 𝑥 ↔ -((𝐹‘𝑘) − (lim inf‘𝐹)) < 𝑥))
43	29, 24	resubcld 11642	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → ((𝐹‘𝑘) − (lim inf‘𝐹)) ∈ ℝ)
44		ltnegcon1 11715	. . . . . . . . . . . . . 14 ⊢ ((((𝐹‘𝑘) − (lim inf‘𝐹)) ∈ ℝ ∧ 𝑥 ∈ ℝ) → (-((𝐹‘𝑘) − (lim inf‘𝐹)) < 𝑥 ↔ -𝑥 < ((𝐹‘𝑘) − (lim inf‘𝐹))))
45	43, 32, 44	syl2anc 585	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → (-((𝐹‘𝑘) − (lim inf‘𝐹)) < 𝑥 ↔ -𝑥 < ((𝐹‘𝑘) − (lim inf‘𝐹))))
46	42, 45	bitrd 279	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → (((lim inf‘𝐹) − (𝐹‘𝑘)) < 𝑥 ↔ -𝑥 < ((𝐹‘𝑘) − (lim inf‘𝐹))))
47	36	oveq2d 7425	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ((𝐹‘𝑘) − (lim inf‘𝐹)) = ((𝐹‘𝑘) − (lim sup‘𝐹)))
48	47	breq2d 5161	. . . . . . . . . . . . 13 ⊢ (𝜑 → (-𝑥 < ((𝐹‘𝑘) − (lim inf‘𝐹)) ↔ -𝑥 < ((𝐹‘𝑘) − (lim sup‘𝐹))))
49	48	ad3antrrr 729	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → (-𝑥 < ((𝐹‘𝑘) − (lim inf‘𝐹)) ↔ -𝑥 < ((𝐹‘𝑘) − (lim sup‘𝐹))))
50	34, 46, 49	3bitrd 305	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → ((lim inf‘𝐹) < ((𝐹‘𝑘) + 𝑥) ↔ -𝑥 < ((𝐹‘𝑘) − (lim sup‘𝐹))))
51	50	ralbidva 3176	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑗 ∈ 𝑍) → (∀𝑘 ∈ (ℤ_≥‘𝑗)(lim inf‘𝐹) < ((𝐹‘𝑘) + 𝑥) ↔ ∀𝑘 ∈ (ℤ_≥‘𝑗)-𝑥 < ((𝐹‘𝑘) − (lim sup‘𝐹))))
52	51	rexbidva 3177	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ⁺) → (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(lim inf‘𝐹) < ((𝐹‘𝑘) + 𝑥) ↔ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)-𝑥 < ((𝐹‘𝑘) − (lim sup‘𝐹))))
53	23, 52	mpbid 231	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ⁺) → ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)-𝑥 < ((𝐹‘𝑘) − (lim sup‘𝐹)))
54	16	adantr 482	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ⁺) → (lim sup‘𝐹) ∈ ℝ)
55	18, 19, 4, 20, 54, 22	limsupgt 44494	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ⁺) → ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) − 𝑥) < (lim sup‘𝐹))
56	54	ad2antrr 725	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → (lim sup‘𝐹) ∈ ℝ)
57		ltsub23 11694	. . . . . . . . . . . 12 ⊢ (((𝐹‘𝑘) ∈ ℝ ∧ 𝑥 ∈ ℝ ∧ (lim sup‘𝐹) ∈ ℝ) → (((𝐹‘𝑘) − 𝑥) < (lim sup‘𝐹) ↔ ((𝐹‘𝑘) − (lim sup‘𝐹)) < 𝑥))
58	29, 32, 56, 57	syl3anc 1372	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → (((𝐹‘𝑘) − 𝑥) < (lim sup‘𝐹) ↔ ((𝐹‘𝑘) − (lim sup‘𝐹)) < 𝑥))
59	58	ralbidva 3176	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑗 ∈ 𝑍) → (∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) − 𝑥) < (lim sup‘𝐹) ↔ ∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) − (lim sup‘𝐹)) < 𝑥))
60	59	rexbidva 3177	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ⁺) → (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) − 𝑥) < (lim sup‘𝐹) ↔ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) − (lim sup‘𝐹)) < 𝑥))
61	55, 60	mpbid 231	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ⁺) → ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) − (lim sup‘𝐹)) < 𝑥)
62	53, 61	jca 513	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ⁺) → (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)-𝑥 < ((𝐹‘𝑘) − (lim sup‘𝐹)) ∧ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) − (lim sup‘𝐹)) < 𝑥))
63	4	rexanuz2 15296	. . . . . . 7 ⊢ (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(-𝑥 < ((𝐹‘𝑘) − (lim sup‘𝐹)) ∧ ((𝐹‘𝑘) − (lim sup‘𝐹)) < 𝑥) ↔ (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)-𝑥 < ((𝐹‘𝑘) − (lim sup‘𝐹)) ∧ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) − (lim sup‘𝐹)) < 𝑥))
64	62, 63	sylibr 233	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ⁺) → ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(-𝑥 < ((𝐹‘𝑘) − (lim sup‘𝐹)) ∧ ((𝐹‘𝑘) − (lim sup‘𝐹)) < 𝑥))
65		simplll 774	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → 𝜑)
66		simpllr 775	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → 𝑥 ∈ ℝ⁺)
67	26	adantll 713	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → 𝑘 ∈ 𝑍)
68		simpr 486	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑘 ∈ 𝑍) ∧ (-𝑥 < ((𝐹‘𝑘) − (lim sup‘𝐹)) ∧ ((𝐹‘𝑘) − (lim sup‘𝐹)) < 𝑥)) → (-𝑥 < ((𝐹‘𝑘) − (lim sup‘𝐹)) ∧ ((𝐹‘𝑘) − (lim sup‘𝐹)) < 𝑥))
69	3	ffvelcdmda 7087	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ ℝ)
70	16	adantr 482	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (lim sup‘𝐹) ∈ ℝ)
71	69, 70	resubcld 11642	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → ((𝐹‘𝑘) − (lim sup‘𝐹)) ∈ ℝ)
72	71	adantlr 714	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑘 ∈ 𝑍) → ((𝐹‘𝑘) − (lim sup‘𝐹)) ∈ ℝ)
73	31	ad2antlr 726	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑘 ∈ 𝑍) → 𝑥 ∈ ℝ)
74		abslt 15261	. . . . . . . . . . . . 13 ⊢ ((((𝐹‘𝑘) − (lim sup‘𝐹)) ∈ ℝ ∧ 𝑥 ∈ ℝ) → ((abs‘((𝐹‘𝑘) − (lim sup‘𝐹))) < 𝑥 ↔ (-𝑥 < ((𝐹‘𝑘) − (lim sup‘𝐹)) ∧ ((𝐹‘𝑘) − (lim sup‘𝐹)) < 𝑥)))
75	72, 73, 74	syl2anc 585	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑘 ∈ 𝑍) → ((abs‘((𝐹‘𝑘) − (lim sup‘𝐹))) < 𝑥 ↔ (-𝑥 < ((𝐹‘𝑘) − (lim sup‘𝐹)) ∧ ((𝐹‘𝑘) − (lim sup‘𝐹)) < 𝑥)))
76	75	adantr 482	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑘 ∈ 𝑍) ∧ (-𝑥 < ((𝐹‘𝑘) − (lim sup‘𝐹)) ∧ ((𝐹‘𝑘) − (lim sup‘𝐹)) < 𝑥)) → ((abs‘((𝐹‘𝑘) − (lim sup‘𝐹))) < 𝑥 ↔ (-𝑥 < ((𝐹‘𝑘) − (lim sup‘𝐹)) ∧ ((𝐹‘𝑘) − (lim sup‘𝐹)) < 𝑥)))
77	68, 76	mpbird 257	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑘 ∈ 𝑍) ∧ (-𝑥 < ((𝐹‘𝑘) − (lim sup‘𝐹)) ∧ ((𝐹‘𝑘) − (lim sup‘𝐹)) < 𝑥)) → (abs‘((𝐹‘𝑘) − (lim sup‘𝐹))) < 𝑥)
78	77	ex 414	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑘 ∈ 𝑍) → ((-𝑥 < ((𝐹‘𝑘) − (lim sup‘𝐹)) ∧ ((𝐹‘𝑘) − (lim sup‘𝐹)) < 𝑥) → (abs‘((𝐹‘𝑘) − (lim sup‘𝐹))) < 𝑥))
79	65, 66, 67, 78	syl21anc 837	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → ((-𝑥 < ((𝐹‘𝑘) − (lim sup‘𝐹)) ∧ ((𝐹‘𝑘) − (lim sup‘𝐹)) < 𝑥) → (abs‘((𝐹‘𝑘) − (lim sup‘𝐹))) < 𝑥))
80	79	ralimdva 3168	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑗 ∈ 𝑍) → (∀𝑘 ∈ (ℤ_≥‘𝑗)(-𝑥 < ((𝐹‘𝑘) − (lim sup‘𝐹)) ∧ ((𝐹‘𝑘) − (lim sup‘𝐹)) < 𝑥) → ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘((𝐹‘𝑘) − (lim sup‘𝐹))) < 𝑥))
81	80	reximdva 3169	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ⁺) → (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(-𝑥 < ((𝐹‘𝑘) − (lim sup‘𝐹)) ∧ ((𝐹‘𝑘) − (lim sup‘𝐹)) < 𝑥) → ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘((𝐹‘𝑘) − (lim sup‘𝐹))) < 𝑥))
82	64, 81	mpd 15	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ⁺) → ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘((𝐹‘𝑘) − (lim sup‘𝐹))) < 𝑥)
83	82	ralrimiva 3147	. . . 4 ⊢ (𝜑 → ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘((𝐹‘𝑘) − (lim sup‘𝐹))) < 𝑥)
84	17, 83	jca 513	. . 3 ⊢ (𝜑 → ((lim sup‘𝐹) ∈ ℂ ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘((𝐹‘𝑘) − (lim sup‘𝐹))) < 𝑥))
85		ax-resscn 11167	. . . . . 6 ⊢ ℝ ⊆ ℂ
86	85	a1i 11	. . . . 5 ⊢ (𝜑 → ℝ ⊆ ℂ)
87	3, 86	fssd 6736	. . . 4 ⊢ (𝜑 → 𝐹:𝑍⟶ℂ)
88	18, 12, 4, 87	climuz 44460	. . 3 ⊢ (𝜑 → (𝐹 ⇝ (lim sup‘𝐹) ↔ ((lim sup‘𝐹) ∈ ℂ ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘((𝐹‘𝑘) − (lim sup‘𝐹))) < 𝑥)))
89	84, 88	mpbird 257	. 2 ⊢ (𝜑 → 𝐹 ⇝ (lim sup‘𝐹))
90		releldm 5944	. 2 ⊢ ((Rel ⇝ ∧ 𝐹 ⇝ (lim sup‘𝐹)) → 𝐹 ∈ dom ⇝ )
91	2, 89, 90	syl2anc 585	1 ⊢ (𝜑 → 𝐹 ∈ dom ⇝ )

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 397 = wceq 1542 ∈ wcel 2107 ∀wral 3062 ∃wrex 3071 Vcvv 3475 ⊆ wss 3949 class class class wbr 5149 dom cdm 5677 Rel wrel 5682 ⟶wf 6540 ‘cfv 6544 (class class class)co 7409 ℂcc 11108 ℝcr 11109 + caddc 11113 < clt 11248 ≤ cle 11249 − cmin 11444 -cneg 11445 ℤcz 12558 ℤ_≥cuz 12822 ℝ⁺crp 12974 abscabs 15181 lim supclsp 15414 ⇝ cli 15428 lim infclsi 44467

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-rep 5286 ax-sep 5300 ax-nul 5307 ax-pow 5364 ax-pr 5428 ax-un 7725 ax-cnex 11166 ax-resscn 11167 ax-1cn 11168 ax-icn 11169 ax-addcl 11170 ax-addrcl 11171 ax-mulcl 11172 ax-mulrcl 11173 ax-mulcom 11174 ax-addass 11175 ax-mulass 11176 ax-distr 11177 ax-i2m1 11178 ax-1ne0 11179 ax-1rid 11180 ax-rnegex 11181 ax-rrecex 11182 ax-cnre 11183 ax-pre-lttri 11184 ax-pre-lttrn 11185 ax-pre-ltadd 11186 ax-pre-mulgt0 11187 ax-pre-sup 11188

This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-rmo 3377 df-reu 3378 df-rab 3434 df-v 3477 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-pss 3968 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4910 df-iun 5000 df-br 5150 df-opab 5212 df-mpt 5233 df-tr 5267 df-id 5575 df-eprel 5581 df-po 5589 df-so 5590 df-fr 5632 df-we 5634 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 df-pred 6301 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6496 df-fun 6546 df-fn 6547 df-f 6548 df-f1 6549 df-fo 6550 df-f1o 6551 df-fv 6552 df-isom 6553 df-riota 7365 df-ov 7412 df-oprab 7413 df-mpo 7414 df-om 7856 df-1st 7975 df-2nd 7976 df-frecs 8266 df-wrecs 8297 df-recs 8371 df-rdg 8410 df-1o 8466 df-er 8703 df-en 8940 df-dom 8941 df-sdom 8942 df-fin 8943 df-sup 9437 df-inf 9438 df-pnf 11250 df-mnf 11251 df-xr 11252 df-ltxr 11253 df-le 11254 df-sub 11446 df-neg 11447 df-div 11872 df-nn 12213 df-2 12275 df-3 12276 df-n0 12473 df-z 12559 df-uz 12823 df-q 12933 df-rp 12975 df-xneg 13092 df-xadd 13093 df-ioo 13328 df-ico 13330 df-fz 13485 df-fzo 13628 df-fl 13757 df-ceil 13758 df-seq 13967 df-exp 14028 df-cj 15046 df-re 15047 df-im 15048 df-sqrt 15182 df-abs 15183 df-limsup 15415 df-clim 15432 df-liminf 44468

This theorem is referenced by: climliminflimsup 44524 climliminflimsup2 44525

W3C validator