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 44509

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 44487). (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 15432	. . 3 ⊢ Rel ⇝
2	1	a1i 11	. 2 ⊢ (𝜑 → Rel ⇝ )
3		liminflimsupclim.3	. . . . . . . . 9 ⊢ (𝜑 → 𝐹:𝑍⟶ℝ)
4		liminflimsupclim.2	. . . . . . . . . . 11 ⊢ 𝑍 = (ℤ_≥‘𝑀)
5	4	fvexi 6902	. . . . . . . . . 10 ⊢ 𝑍 ∈ V
6	5	a1i 11	. . . . . . . . 9 ⊢ (𝜑 → 𝑍 ∈ V)
7	3, 6	fexd 7225	. . . . . . . 8 ⊢ (𝜑 → 𝐹 ∈ V)
8	7	limsupcld 44392	. . . . . . 7 ⊢ (𝜑 → (lim sup‘𝐹) ∈ ℝ^*)
9		liminflimsupclim.4	. . . . . . . 8 ⊢ (𝜑 → (lim inf‘𝐹) ∈ ℝ)
10	9	rexrd 11260	. . . . . . 7 ⊢ (𝜑 → (lim inf‘𝐹) ∈ ℝ^*)
11		liminflimsupclim.5	. . . . . . 7 ⊢ (𝜑 → (lim sup‘𝐹) ≤ (lim inf‘𝐹))
12		liminflimsupclim.1	. . . . . . . 8 ⊢ (𝜑 → 𝑀 ∈ ℤ)
13	3	frexr 44081	. . . . . . . 8 ⊢ (𝜑 → 𝐹:𝑍⟶ℝ^*)
14	12, 4, 13	liminflelimsupuz 44487	. . . . . . 7 ⊢ (𝜑 → (lim inf‘𝐹) ≤ (lim sup‘𝐹))
15	8, 10, 11, 14	xrletrid 13130	. . . . . 6 ⊢ (𝜑 → (lim sup‘𝐹) = (lim inf‘𝐹))
16	15, 9	eqeltrd 2833	. . . . 5 ⊢ (𝜑 → (lim sup‘𝐹) ∈ ℝ)
17	16	recnd 11238	. . . 4 ⊢ (𝜑 → (lim sup‘𝐹) ∈ ℂ)
18		nfcv 2903	. . . . . . . . . 10 ⊢ Ⅎ𝑘𝐹
19	12	adantr 481	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ⁺) → 𝑀 ∈ ℤ)
20	3	adantr 481	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ⁺) → 𝐹:𝑍⟶ℝ)
21	9	adantr 481	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ⁺) → (lim inf‘𝐹) ∈ ℝ)
22		simpr 485	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ⁺) → 𝑥 ∈ ℝ⁺)
23	18, 19, 4, 20, 21, 22	liminflt 44507	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ⁺) → ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(lim inf‘𝐹) < ((𝐹‘𝑘) + 𝑥))
24	21	ad2antrr 724	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → (lim inf‘𝐹) ∈ ℝ)
25	3	ad2antrr 724	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → 𝐹:𝑍⟶ℝ)
26	4	uztrn2 12837	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → 𝑘 ∈ 𝑍)
27	26	adantll 712	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → 𝑘 ∈ 𝑍)
28	25, 27	ffvelcdmd 7084	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → (𝐹‘𝑘) ∈ ℝ)
29	28	adantllr 717	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → (𝐹‘𝑘) ∈ ℝ)
30	22	ad2antrr 724	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → 𝑥 ∈ ℝ⁺)
31		rpre 12978	. . . . . . . . . . . . . . 15 ⊢ (𝑥 ∈ ℝ⁺ → 𝑥 ∈ ℝ)
32	30, 31	syl 17	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → 𝑥 ∈ ℝ)
33	24, 29, 32	ltsubadd2d 11808	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → (((lim inf‘𝐹) − (𝐹‘𝑘)) < 𝑥 ↔ (lim inf‘𝐹) < ((𝐹‘𝑘) + 𝑥)))
34	33	bicomd 222	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → ((lim inf‘𝐹) < ((𝐹‘𝑘) + 𝑥) ↔ ((lim inf‘𝐹) − (𝐹‘𝑘)) < 𝑥))
35	28	recnd 11238	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → (𝐹‘𝑘) ∈ ℂ)
36	15	eqcomd 2738	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → (lim inf‘𝐹) = (lim sup‘𝐹))
37	36, 17	eqeltrd 2833	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → (lim inf‘𝐹) ∈ ℂ)
38	37	ad2antrr 724	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → (lim inf‘𝐹) ∈ ℂ)
39	35, 38	negsubdi2d 11583	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → -((𝐹‘𝑘) − (lim inf‘𝐹)) = ((lim inf‘𝐹) − (𝐹‘𝑘)))
40	39	breq1d 5157	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → (-((𝐹‘𝑘) − (lim inf‘𝐹)) < 𝑥 ↔ ((lim inf‘𝐹) − (𝐹‘𝑘)) < 𝑥))
41	40	adantllr 717	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → (-((𝐹‘𝑘) − (lim inf‘𝐹)) < 𝑥 ↔ ((lim inf‘𝐹) − (𝐹‘𝑘)) < 𝑥))
42	41	bicomd 222	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → (((lim inf‘𝐹) − (𝐹‘𝑘)) < 𝑥 ↔ -((𝐹‘𝑘) − (lim inf‘𝐹)) < 𝑥))
43	29, 24	resubcld 11638	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → ((𝐹‘𝑘) − (lim inf‘𝐹)) ∈ ℝ)
44		ltnegcon1 11711	. . . . . . . . . . . . . 14 ⊢ ((((𝐹‘𝑘) − (lim inf‘𝐹)) ∈ ℝ ∧ 𝑥 ∈ ℝ) → (-((𝐹‘𝑘) − (lim inf‘𝐹)) < 𝑥 ↔ -𝑥 < ((𝐹‘𝑘) − (lim inf‘𝐹))))
45	43, 32, 44	syl2anc 584	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → (-((𝐹‘𝑘) − (lim inf‘𝐹)) < 𝑥 ↔ -𝑥 < ((𝐹‘𝑘) − (lim inf‘𝐹))))
46	42, 45	bitrd 278	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → (((lim inf‘𝐹) − (𝐹‘𝑘)) < 𝑥 ↔ -𝑥 < ((𝐹‘𝑘) − (lim inf‘𝐹))))
47	36	oveq2d 7421	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ((𝐹‘𝑘) − (lim inf‘𝐹)) = ((𝐹‘𝑘) − (lim sup‘𝐹)))
48	47	breq2d 5159	. . . . . . . . . . . . 13 ⊢ (𝜑 → (-𝑥 < ((𝐹‘𝑘) − (lim inf‘𝐹)) ↔ -𝑥 < ((𝐹‘𝑘) − (lim sup‘𝐹))))
49	48	ad3antrrr 728	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → (-𝑥 < ((𝐹‘𝑘) − (lim inf‘𝐹)) ↔ -𝑥 < ((𝐹‘𝑘) − (lim sup‘𝐹))))
50	34, 46, 49	3bitrd 304	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → ((lim inf‘𝐹) < ((𝐹‘𝑘) + 𝑥) ↔ -𝑥 < ((𝐹‘𝑘) − (lim sup‘𝐹))))
51	50	ralbidva 3175	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑗 ∈ 𝑍) → (∀𝑘 ∈ (ℤ_≥‘𝑗)(lim inf‘𝐹) < ((𝐹‘𝑘) + 𝑥) ↔ ∀𝑘 ∈ (ℤ_≥‘𝑗)-𝑥 < ((𝐹‘𝑘) − (lim sup‘𝐹))))
52	51	rexbidva 3176	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ⁺) → (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(lim inf‘𝐹) < ((𝐹‘𝑘) + 𝑥) ↔ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)-𝑥 < ((𝐹‘𝑘) − (lim sup‘𝐹))))
53	23, 52	mpbid 231	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ⁺) → ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)-𝑥 < ((𝐹‘𝑘) − (lim sup‘𝐹)))
54	16	adantr 481	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ⁺) → (lim sup‘𝐹) ∈ ℝ)
55	18, 19, 4, 20, 54, 22	limsupgt 44480	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ⁺) → ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) − 𝑥) < (lim sup‘𝐹))
56	54	ad2antrr 724	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → (lim sup‘𝐹) ∈ ℝ)
57		ltsub23 11690	. . . . . . . . . . . 12 ⊢ (((𝐹‘𝑘) ∈ ℝ ∧ 𝑥 ∈ ℝ ∧ (lim sup‘𝐹) ∈ ℝ) → (((𝐹‘𝑘) − 𝑥) < (lim sup‘𝐹) ↔ ((𝐹‘𝑘) − (lim sup‘𝐹)) < 𝑥))
58	29, 32, 56, 57	syl3anc 1371	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → (((𝐹‘𝑘) − 𝑥) < (lim sup‘𝐹) ↔ ((𝐹‘𝑘) − (lim sup‘𝐹)) < 𝑥))
59	58	ralbidva 3175	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑗 ∈ 𝑍) → (∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) − 𝑥) < (lim sup‘𝐹) ↔ ∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) − (lim sup‘𝐹)) < 𝑥))
60	59	rexbidva 3176	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ⁺) → (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) − 𝑥) < (lim sup‘𝐹) ↔ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) − (lim sup‘𝐹)) < 𝑥))
61	55, 60	mpbid 231	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ⁺) → ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) − (lim sup‘𝐹)) < 𝑥)
62	53, 61	jca 512	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ⁺) → (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)-𝑥 < ((𝐹‘𝑘) − (lim sup‘𝐹)) ∧ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) − (lim sup‘𝐹)) < 𝑥))
63	4	rexanuz2 15292	. . . . . . 7 ⊢ (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(-𝑥 < ((𝐹‘𝑘) − (lim sup‘𝐹)) ∧ ((𝐹‘𝑘) − (lim sup‘𝐹)) < 𝑥) ↔ (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)-𝑥 < ((𝐹‘𝑘) − (lim sup‘𝐹)) ∧ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) − (lim sup‘𝐹)) < 𝑥))
64	62, 63	sylibr 233	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ⁺) → ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(-𝑥 < ((𝐹‘𝑘) − (lim sup‘𝐹)) ∧ ((𝐹‘𝑘) − (lim sup‘𝐹)) < 𝑥))
65		simplll 773	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → 𝜑)
66		simpllr 774	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → 𝑥 ∈ ℝ⁺)
67	26	adantll 712	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → 𝑘 ∈ 𝑍)
68		simpr 485	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑘 ∈ 𝑍) ∧ (-𝑥 < ((𝐹‘𝑘) − (lim sup‘𝐹)) ∧ ((𝐹‘𝑘) − (lim sup‘𝐹)) < 𝑥)) → (-𝑥 < ((𝐹‘𝑘) − (lim sup‘𝐹)) ∧ ((𝐹‘𝑘) − (lim sup‘𝐹)) < 𝑥))
69	3	ffvelcdmda 7083	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ ℝ)
70	16	adantr 481	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (lim sup‘𝐹) ∈ ℝ)
71	69, 70	resubcld 11638	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → ((𝐹‘𝑘) − (lim sup‘𝐹)) ∈ ℝ)
72	71	adantlr 713	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑘 ∈ 𝑍) → ((𝐹‘𝑘) − (lim sup‘𝐹)) ∈ ℝ)
73	31	ad2antlr 725	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑘 ∈ 𝑍) → 𝑥 ∈ ℝ)
74		abslt 15257	. . . . . . . . . . . . 13 ⊢ ((((𝐹‘𝑘) − (lim sup‘𝐹)) ∈ ℝ ∧ 𝑥 ∈ ℝ) → ((abs‘((𝐹‘𝑘) − (lim sup‘𝐹))) < 𝑥 ↔ (-𝑥 < ((𝐹‘𝑘) − (lim sup‘𝐹)) ∧ ((𝐹‘𝑘) − (lim sup‘𝐹)) < 𝑥)))
75	72, 73, 74	syl2anc 584	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑘 ∈ 𝑍) → ((abs‘((𝐹‘𝑘) − (lim sup‘𝐹))) < 𝑥 ↔ (-𝑥 < ((𝐹‘𝑘) − (lim sup‘𝐹)) ∧ ((𝐹‘𝑘) − (lim sup‘𝐹)) < 𝑥)))
76	75	adantr 481	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑘 ∈ 𝑍) ∧ (-𝑥 < ((𝐹‘𝑘) − (lim sup‘𝐹)) ∧ ((𝐹‘𝑘) − (lim sup‘𝐹)) < 𝑥)) → ((abs‘((𝐹‘𝑘) − (lim sup‘𝐹))) < 𝑥 ↔ (-𝑥 < ((𝐹‘𝑘) − (lim sup‘𝐹)) ∧ ((𝐹‘𝑘) − (lim sup‘𝐹)) < 𝑥)))
77	68, 76	mpbird 256	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑘 ∈ 𝑍) ∧ (-𝑥 < ((𝐹‘𝑘) − (lim sup‘𝐹)) ∧ ((𝐹‘𝑘) − (lim sup‘𝐹)) < 𝑥)) → (abs‘((𝐹‘𝑘) − (lim sup‘𝐹))) < 𝑥)
78	77	ex 413	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑘 ∈ 𝑍) → ((-𝑥 < ((𝐹‘𝑘) − (lim sup‘𝐹)) ∧ ((𝐹‘𝑘) − (lim sup‘𝐹)) < 𝑥) → (abs‘((𝐹‘𝑘) − (lim sup‘𝐹))) < 𝑥))
79	65, 66, 67, 78	syl21anc 836	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → ((-𝑥 < ((𝐹‘𝑘) − (lim sup‘𝐹)) ∧ ((𝐹‘𝑘) − (lim sup‘𝐹)) < 𝑥) → (abs‘((𝐹‘𝑘) − (lim sup‘𝐹))) < 𝑥))
80	79	ralimdva 3167	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑗 ∈ 𝑍) → (∀𝑘 ∈ (ℤ_≥‘𝑗)(-𝑥 < ((𝐹‘𝑘) − (lim sup‘𝐹)) ∧ ((𝐹‘𝑘) − (lim sup‘𝐹)) < 𝑥) → ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘((𝐹‘𝑘) − (lim sup‘𝐹))) < 𝑥))
81	80	reximdva 3168	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ⁺) → (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(-𝑥 < ((𝐹‘𝑘) − (lim sup‘𝐹)) ∧ ((𝐹‘𝑘) − (lim sup‘𝐹)) < 𝑥) → ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘((𝐹‘𝑘) − (lim sup‘𝐹))) < 𝑥))
82	64, 81	mpd 15	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ⁺) → ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘((𝐹‘𝑘) − (lim sup‘𝐹))) < 𝑥)
83	82	ralrimiva 3146	. . . 4 ⊢ (𝜑 → ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘((𝐹‘𝑘) − (lim sup‘𝐹))) < 𝑥)
84	17, 83	jca 512	. . 3 ⊢ (𝜑 → ((lim sup‘𝐹) ∈ ℂ ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘((𝐹‘𝑘) − (lim sup‘𝐹))) < 𝑥))
85		ax-resscn 11163	. . . . . 6 ⊢ ℝ ⊆ ℂ
86	85	a1i 11	. . . . 5 ⊢ (𝜑 → ℝ ⊆ ℂ)
87	3, 86	fssd 6732	. . . 4 ⊢ (𝜑 → 𝐹:𝑍⟶ℂ)
88	18, 12, 4, 87	climuz 44446	. . 3 ⊢ (𝜑 → (𝐹 ⇝ (lim sup‘𝐹) ↔ ((lim sup‘𝐹) ∈ ℂ ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘((𝐹‘𝑘) − (lim sup‘𝐹))) < 𝑥)))
89	84, 88	mpbird 256	. 2 ⊢ (𝜑 → 𝐹 ⇝ (lim sup‘𝐹))
90		releldm 5941	. 2 ⊢ ((Rel ⇝ ∧ 𝐹 ⇝ (lim sup‘𝐹)) → 𝐹 ∈ dom ⇝ )
91	2, 89, 90	syl2anc 584	1 ⊢ (𝜑 → 𝐹 ∈ dom ⇝ )

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1541 ∈ wcel 2106 ∀wral 3061 ∃wrex 3070 Vcvv 3474 ⊆ wss 3947 class class class wbr 5147 dom cdm 5675 Rel wrel 5680 ⟶wf 6536 ‘cfv 6540 (class class class)co 7405 ℂcc 11104 ℝcr 11105 + caddc 11109 < clt 11244 ≤ cle 11245 − cmin 11440 -cneg 11441 ℤcz 12554 ℤ_≥cuz 12818 ℝ⁺crp 12970 abscabs 15177 lim supclsp 15410 ⇝ cli 15424 lim infclsi 44453

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 5284 ax-sep 5298 ax-nul 5305 ax-pow 5362 ax-pr 5426 ax-un 7721 ax-cnex 11162 ax-resscn 11163 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-mulcom 11170 ax-addass 11171 ax-mulass 11172 ax-distr 11173 ax-i2m1 11174 ax-1ne0 11175 ax-1rid 11176 ax-rnegex 11177 ax-rrecex 11178 ax-cnre 11179 ax-pre-lttri 11180 ax-pre-lttrn 11181 ax-pre-ltadd 11182 ax-pre-mulgt0 11183 ax-pre-sup 11184

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 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4322 df-if 4528 df-pw 4603 df-sn 4628 df-pr 4630 df-op 4634 df-uni 4908 df-iun 4998 df-br 5148 df-opab 5210 df-mpt 5231 df-tr 5265 df-id 5573 df-eprel 5579 df-po 5587 df-so 5588 df-fr 5630 df-we 5632 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-rn 5686 df-res 5687 df-ima 5688 df-pred 6297 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6492 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-isom 6549 df-riota 7361 df-ov 7408 df-oprab 7409 df-mpo 7410 df-om 7852 df-1st 7971 df-2nd 7972 df-frecs 8262 df-wrecs 8293 df-recs 8367 df-rdg 8406 df-1o 8462 df-er 8699 df-en 8936 df-dom 8937 df-sdom 8938 df-fin 8939 df-sup 9433 df-inf 9434 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-sub 11442 df-neg 11443 df-div 11868 df-nn 12209 df-2 12271 df-3 12272 df-n0 12469 df-z 12555 df-uz 12819 df-q 12929 df-rp 12971 df-xneg 13088 df-xadd 13089 df-ioo 13324 df-ico 13326 df-fz 13481 df-fzo 13624 df-fl 13753 df-ceil 13754 df-seq 13963 df-exp 14024 df-cj 15042 df-re 15043 df-im 15044 df-sqrt 15178 df-abs 15179 df-limsup 15411 df-clim 15428 df-liminf 44454

This theorem is referenced by: climliminflimsup 44510 climliminflimsup2 44511

W3C validator