climxrre - Mathbox for Glauco Siliprandi

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

Theorem climxrre 44765

Description: If a sequence ranging over the extended reals converges w.r.t. the standard topology on the complex numbers, then there exists an upper set of the integers over which the function is real-valued (the weaker hypothesis 𝐹 ∈ dom ⇝ is probably not enough, since in principle we could have +∞ ∈ ℂ and -∞ ∈ ℂ). (Contributed by Glauco Siliprandi, 5-Feb-2022.)

**Hypotheses**
Ref	Expression
climxrre.m	⊢ (𝜑 → 𝑀 ∈ ℤ)
climxrre.z	⊢ 𝑍 = (ℤ_≥‘𝑀)
climxrre.f	⊢ (𝜑 → 𝐹:𝑍⟶ℝ^*)
climxrre.a	⊢ (𝜑 → 𝐴 ∈ ℝ)
climxrre.c	⊢ (𝜑 → 𝐹 ⇝ 𝐴)

**Assertion**
Ref	Expression
climxrre	⊢ (𝜑 → ∃𝑗 ∈ 𝑍 (𝐹 ↾ (ℤ_≥‘𝑗)):(ℤ_≥‘𝑗)⟶ℝ)

Distinct variable groups: 𝐴,𝑗 𝑗,𝐹 𝑗,𝑀 𝑗,𝑍 𝜑,𝑗

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

Step	Hyp	Ref	Expression
1		climxrre.m	. . . . 5 ⊢ (𝜑 → 𝑀 ∈ ℤ)
2	1	ad2antrr 724	. . . 4 ⊢ (((𝜑 ∧ +∞ ∈ ℂ) ∧ -∞ ∈ ℂ) → 𝑀 ∈ ℤ)
3		climxrre.z	. . . 4 ⊢ 𝑍 = (ℤ_≥‘𝑀)
4		climxrre.f	. . . . 5 ⊢ (𝜑 → 𝐹:𝑍⟶ℝ^*)
5	4	ad2antrr 724	. . . 4 ⊢ (((𝜑 ∧ +∞ ∈ ℂ) ∧ -∞ ∈ ℂ) → 𝐹:𝑍⟶ℝ^*)
6		climxrre.c	. . . . 5 ⊢ (𝜑 → 𝐹 ⇝ 𝐴)
7	6	ad2antrr 724	. . . 4 ⊢ (((𝜑 ∧ +∞ ∈ ℂ) ∧ -∞ ∈ ℂ) → 𝐹 ⇝ 𝐴)
8		simpr 485	. . . . . . . 8 ⊢ ((𝜑 ∧ +∞ ∈ ℂ) → +∞ ∈ ℂ)
9		climxrre.a	. . . . . . . . . 10 ⊢ (𝜑 → 𝐴 ∈ ℝ)
10	9	recnd 11246	. . . . . . . . 9 ⊢ (𝜑 → 𝐴 ∈ ℂ)
11	10	adantr 481	. . . . . . . 8 ⊢ ((𝜑 ∧ +∞ ∈ ℂ) → 𝐴 ∈ ℂ)
12	8, 11	subcld 11575	. . . . . . 7 ⊢ ((𝜑 ∧ +∞ ∈ ℂ) → (+∞ − 𝐴) ∈ ℂ)
13		renepnf 11266	. . . . . . . . . . 11 ⊢ (𝐴 ∈ ℝ → 𝐴 ≠ +∞)
14	13	necomd 2996	. . . . . . . . . 10 ⊢ (𝐴 ∈ ℝ → +∞ ≠ 𝐴)
15	9, 14	syl 17	. . . . . . . . 9 ⊢ (𝜑 → +∞ ≠ 𝐴)
16	15	adantr 481	. . . . . . . 8 ⊢ ((𝜑 ∧ +∞ ∈ ℂ) → +∞ ≠ 𝐴)
17	8, 11, 16	subne0d 11584	. . . . . . 7 ⊢ ((𝜑 ∧ +∞ ∈ ℂ) → (+∞ − 𝐴) ≠ 0)
18	12, 17	absrpcld 15399	. . . . . 6 ⊢ ((𝜑 ∧ +∞ ∈ ℂ) → (abs‘(+∞ − 𝐴)) ∈ ℝ⁺)
19	18	adantr 481	. . . . 5 ⊢ (((𝜑 ∧ +∞ ∈ ℂ) ∧ -∞ ∈ ℂ) → (abs‘(+∞ − 𝐴)) ∈ ℝ⁺)
20		simpr 485	. . . . . . . 8 ⊢ ((𝜑 ∧ -∞ ∈ ℂ) → -∞ ∈ ℂ)
21	10	adantr 481	. . . . . . . 8 ⊢ ((𝜑 ∧ -∞ ∈ ℂ) → 𝐴 ∈ ℂ)
22	20, 21	subcld 11575	. . . . . . 7 ⊢ ((𝜑 ∧ -∞ ∈ ℂ) → (-∞ − 𝐴) ∈ ℂ)
23	9	adantr 481	. . . . . . . . 9 ⊢ ((𝜑 ∧ -∞ ∈ ℂ) → 𝐴 ∈ ℝ)
24		renemnf 11267	. . . . . . . . . 10 ⊢ (𝐴 ∈ ℝ → 𝐴 ≠ -∞)
25	24	necomd 2996	. . . . . . . . 9 ⊢ (𝐴 ∈ ℝ → -∞ ≠ 𝐴)
26	23, 25	syl 17	. . . . . . . 8 ⊢ ((𝜑 ∧ -∞ ∈ ℂ) → -∞ ≠ 𝐴)
27	20, 21, 26	subne0d 11584	. . . . . . 7 ⊢ ((𝜑 ∧ -∞ ∈ ℂ) → (-∞ − 𝐴) ≠ 0)
28	22, 27	absrpcld 15399	. . . . . 6 ⊢ ((𝜑 ∧ -∞ ∈ ℂ) → (abs‘(-∞ − 𝐴)) ∈ ℝ⁺)
29	28	adantlr 713	. . . . 5 ⊢ (((𝜑 ∧ +∞ ∈ ℂ) ∧ -∞ ∈ ℂ) → (abs‘(-∞ − 𝐴)) ∈ ℝ⁺)
30	19, 29	ifcld 4574	. . . 4 ⊢ (((𝜑 ∧ +∞ ∈ ℂ) ∧ -∞ ∈ ℂ) → if((abs‘(+∞ − 𝐴)) ≤ (abs‘(-∞ − 𝐴)), (abs‘(+∞ − 𝐴)), (abs‘(-∞ − 𝐴))) ∈ ℝ⁺)
31	19	rpred 13020	. . . . . 6 ⊢ (((𝜑 ∧ +∞ ∈ ℂ) ∧ -∞ ∈ ℂ) → (abs‘(+∞ − 𝐴)) ∈ ℝ)
32	29	rpred 13020	. . . . . 6 ⊢ (((𝜑 ∧ +∞ ∈ ℂ) ∧ -∞ ∈ ℂ) → (abs‘(-∞ − 𝐴)) ∈ ℝ)
33	31, 32	min1d 44481	. . . . 5 ⊢ (((𝜑 ∧ +∞ ∈ ℂ) ∧ -∞ ∈ ℂ) → if((abs‘(+∞ − 𝐴)) ≤ (abs‘(-∞ − 𝐴)), (abs‘(+∞ − 𝐴)), (abs‘(-∞ − 𝐴))) ≤ (abs‘(+∞ − 𝐴)))
34	33	adantr 481	. . . 4 ⊢ ((((𝜑 ∧ +∞ ∈ ℂ) ∧ -∞ ∈ ℂ) ∧ +∞ ∈ ℂ) → if((abs‘(+∞ − 𝐴)) ≤ (abs‘(-∞ − 𝐴)), (abs‘(+∞ − 𝐴)), (abs‘(-∞ − 𝐴))) ≤ (abs‘(+∞ − 𝐴)))
35	31, 32	min2d 44482	. . . . 5 ⊢ (((𝜑 ∧ +∞ ∈ ℂ) ∧ -∞ ∈ ℂ) → if((abs‘(+∞ − 𝐴)) ≤ (abs‘(-∞ − 𝐴)), (abs‘(+∞ − 𝐴)), (abs‘(-∞ − 𝐴))) ≤ (abs‘(-∞ − 𝐴)))
36	35	adantr 481	. . . 4 ⊢ ((((𝜑 ∧ +∞ ∈ ℂ) ∧ -∞ ∈ ℂ) ∧ -∞ ∈ ℂ) → if((abs‘(+∞ − 𝐴)) ≤ (abs‘(-∞ − 𝐴)), (abs‘(+∞ − 𝐴)), (abs‘(-∞ − 𝐴))) ≤ (abs‘(-∞ − 𝐴)))
37	2, 3, 5, 7, 30, 34, 36	climxrrelem 44764	. . 3 ⊢ (((𝜑 ∧ +∞ ∈ ℂ) ∧ -∞ ∈ ℂ) → ∃𝑗 ∈ 𝑍 (𝐹 ↾ (ℤ_≥‘𝑗)):(ℤ_≥‘𝑗)⟶ℝ)
38	1	ad2antrr 724	. . . 4 ⊢ (((𝜑 ∧ +∞ ∈ ℂ) ∧ ¬ -∞ ∈ ℂ) → 𝑀 ∈ ℤ)
39	4	ad2antrr 724	. . . 4 ⊢ (((𝜑 ∧ +∞ ∈ ℂ) ∧ ¬ -∞ ∈ ℂ) → 𝐹:𝑍⟶ℝ^*)
40	6	ad2antrr 724	. . . 4 ⊢ (((𝜑 ∧ +∞ ∈ ℂ) ∧ ¬ -∞ ∈ ℂ) → 𝐹 ⇝ 𝐴)
41	18	adantr 481	. . . 4 ⊢ (((𝜑 ∧ +∞ ∈ ℂ) ∧ ¬ -∞ ∈ ℂ) → (abs‘(+∞ − 𝐴)) ∈ ℝ⁺)
42	18	rpred 13020	. . . . . 6 ⊢ ((𝜑 ∧ +∞ ∈ ℂ) → (abs‘(+∞ − 𝐴)) ∈ ℝ)
43	42	leidd 11784	. . . . 5 ⊢ ((𝜑 ∧ +∞ ∈ ℂ) → (abs‘(+∞ − 𝐴)) ≤ (abs‘(+∞ − 𝐴)))
44	43	ad2antrr 724	. . . 4 ⊢ ((((𝜑 ∧ +∞ ∈ ℂ) ∧ ¬ -∞ ∈ ℂ) ∧ +∞ ∈ ℂ) → (abs‘(+∞ − 𝐴)) ≤ (abs‘(+∞ − 𝐴)))
45		pm2.21 123	. . . . . 6 ⊢ (¬ -∞ ∈ ℂ → (-∞ ∈ ℂ → (abs‘(+∞ − 𝐴)) ≤ (abs‘(-∞ − 𝐴))))
46	45	imp 407	. . . . 5 ⊢ ((¬ -∞ ∈ ℂ ∧ -∞ ∈ ℂ) → (abs‘(+∞ − 𝐴)) ≤ (abs‘(-∞ − 𝐴)))
47	46	adantll 712	. . . 4 ⊢ ((((𝜑 ∧ +∞ ∈ ℂ) ∧ ¬ -∞ ∈ ℂ) ∧ -∞ ∈ ℂ) → (abs‘(+∞ − 𝐴)) ≤ (abs‘(-∞ − 𝐴)))
48	38, 3, 39, 40, 41, 44, 47	climxrrelem 44764	. . 3 ⊢ (((𝜑 ∧ +∞ ∈ ℂ) ∧ ¬ -∞ ∈ ℂ) → ∃𝑗 ∈ 𝑍 (𝐹 ↾ (ℤ_≥‘𝑗)):(ℤ_≥‘𝑗)⟶ℝ)
49	37, 48	pm2.61dan 811	. 2 ⊢ ((𝜑 ∧ +∞ ∈ ℂ) → ∃𝑗 ∈ 𝑍 (𝐹 ↾ (ℤ_≥‘𝑗)):(ℤ_≥‘𝑗)⟶ℝ)
50	1	ad2antrr 724	. . . 4 ⊢ (((𝜑 ∧ ¬ +∞ ∈ ℂ) ∧ -∞ ∈ ℂ) → 𝑀 ∈ ℤ)
51	4	ad2antrr 724	. . . 4 ⊢ (((𝜑 ∧ ¬ +∞ ∈ ℂ) ∧ -∞ ∈ ℂ) → 𝐹:𝑍⟶ℝ^*)
52	6	ad2antrr 724	. . . 4 ⊢ (((𝜑 ∧ ¬ +∞ ∈ ℂ) ∧ -∞ ∈ ℂ) → 𝐹 ⇝ 𝐴)
53	28	adantlr 713	. . . 4 ⊢ (((𝜑 ∧ ¬ +∞ ∈ ℂ) ∧ -∞ ∈ ℂ) → (abs‘(-∞ − 𝐴)) ∈ ℝ⁺)
54		pm2.21 123	. . . . . 6 ⊢ (¬ +∞ ∈ ℂ → (+∞ ∈ ℂ → (abs‘(-∞ − 𝐴)) ≤ (abs‘(+∞ − 𝐴))))
55	54	imp 407	. . . . 5 ⊢ ((¬ +∞ ∈ ℂ ∧ +∞ ∈ ℂ) → (abs‘(-∞ − 𝐴)) ≤ (abs‘(+∞ − 𝐴)))
56	55	ad4ant24 752	. . . 4 ⊢ ((((𝜑 ∧ ¬ +∞ ∈ ℂ) ∧ -∞ ∈ ℂ) ∧ +∞ ∈ ℂ) → (abs‘(-∞ − 𝐴)) ≤ (abs‘(+∞ − 𝐴)))
57	28	rpred 13020	. . . . . 6 ⊢ ((𝜑 ∧ -∞ ∈ ℂ) → (abs‘(-∞ − 𝐴)) ∈ ℝ)
58	57	leidd 11784	. . . . 5 ⊢ ((𝜑 ∧ -∞ ∈ ℂ) → (abs‘(-∞ − 𝐴)) ≤ (abs‘(-∞ − 𝐴)))
59	58	ad4ant13 749	. . . 4 ⊢ ((((𝜑 ∧ ¬ +∞ ∈ ℂ) ∧ -∞ ∈ ℂ) ∧ -∞ ∈ ℂ) → (abs‘(-∞ − 𝐴)) ≤ (abs‘(-∞ − 𝐴)))
60	50, 3, 51, 52, 53, 56, 59	climxrrelem 44764	. . 3 ⊢ (((𝜑 ∧ ¬ +∞ ∈ ℂ) ∧ -∞ ∈ ℂ) → ∃𝑗 ∈ 𝑍 (𝐹 ↾ (ℤ_≥‘𝑗)):(ℤ_≥‘𝑗)⟶ℝ)
61		nfv 1917	. . . . . . 7 ⊢ Ⅎ𝑘((𝜑 ∧ ¬ +∞ ∈ ℂ) ∧ ¬ -∞ ∈ ℂ)
62		nfv 1917	. . . . . . . 8 ⊢ Ⅎ𝑘 𝑗 ∈ 𝑍
63		nfra1 3281	. . . . . . . 8 ⊢ Ⅎ𝑘∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) ∈ ℂ
64	62, 63	nfan 1902	. . . . . . 7 ⊢ Ⅎ𝑘(𝑗 ∈ 𝑍 ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) ∈ ℂ)
65	61, 64	nfan 1902	. . . . . 6 ⊢ Ⅎ𝑘(((𝜑 ∧ ¬ +∞ ∈ ℂ) ∧ ¬ -∞ ∈ ℂ) ∧ (𝑗 ∈ 𝑍 ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) ∈ ℂ))
66		simp-4l 781	. . . . . . . 8 ⊢ (((((𝜑 ∧ ¬ +∞ ∈ ℂ) ∧ ¬ -∞ ∈ ℂ) ∧ (𝑗 ∈ 𝑍 ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) ∈ ℂ)) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → 𝜑)
67	3	uztrn2 12845	. . . . . . . . . 10 ⊢ ((𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → 𝑘 ∈ 𝑍)
68	67	adantlr 713	. . . . . . . . 9 ⊢ (((𝑗 ∈ 𝑍 ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) ∈ ℂ) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → 𝑘 ∈ 𝑍)
69	68	adantll 712	. . . . . . . 8 ⊢ (((((𝜑 ∧ ¬ +∞ ∈ ℂ) ∧ ¬ -∞ ∈ ℂ) ∧ (𝑗 ∈ 𝑍 ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) ∈ ℂ)) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → 𝑘 ∈ 𝑍)
70		simpr 485	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 𝑘 ∈ 𝑍)
71	4	fdmd 6728	. . . . . . . . . 10 ⊢ (𝜑 → dom 𝐹 = 𝑍)
72	71	adantr 481	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → dom 𝐹 = 𝑍)
73	70, 72	eleqtrrd 2836	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 𝑘 ∈ dom 𝐹)
74	66, 69, 73	syl2anc 584	. . . . . . 7 ⊢ (((((𝜑 ∧ ¬ +∞ ∈ ℂ) ∧ ¬ -∞ ∈ ℂ) ∧ (𝑗 ∈ 𝑍 ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) ∈ ℂ)) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → 𝑘 ∈ dom 𝐹)
75	4	ffvelcdmda 7086	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ ℝ^*)
76	66, 69, 75	syl2anc 584	. . . . . . . 8 ⊢ (((((𝜑 ∧ ¬ +∞ ∈ ℂ) ∧ ¬ -∞ ∈ ℂ) ∧ (𝑗 ∈ 𝑍 ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) ∈ ℂ)) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → (𝐹‘𝑘) ∈ ℝ^*)
77		rspa 3245	. . . . . . . . . . 11 ⊢ ((∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) ∈ ℂ ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → (𝐹‘𝑘) ∈ ℂ)
78	77	adantll 712	. . . . . . . . . 10 ⊢ (((𝑗 ∈ 𝑍 ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) ∈ ℂ) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → (𝐹‘𝑘) ∈ ℂ)
79	78	adantll 712	. . . . . . . . 9 ⊢ (((((𝜑 ∧ ¬ +∞ ∈ ℂ) ∧ ¬ -∞ ∈ ℂ) ∧ (𝑗 ∈ 𝑍 ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) ∈ ℂ)) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → (𝐹‘𝑘) ∈ ℂ)
80		simpllr 774	. . . . . . . . 9 ⊢ (((((𝜑 ∧ ¬ +∞ ∈ ℂ) ∧ ¬ -∞ ∈ ℂ) ∧ (𝑗 ∈ 𝑍 ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) ∈ ℂ)) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → ¬ -∞ ∈ ℂ)
81		nelne2 3040	. . . . . . . . 9 ⊢ (((𝐹‘𝑘) ∈ ℂ ∧ ¬ -∞ ∈ ℂ) → (𝐹‘𝑘) ≠ -∞)
82	79, 80, 81	syl2anc 584	. . . . . . . 8 ⊢ (((((𝜑 ∧ ¬ +∞ ∈ ℂ) ∧ ¬ -∞ ∈ ℂ) ∧ (𝑗 ∈ 𝑍 ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) ∈ ℂ)) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → (𝐹‘𝑘) ≠ -∞)
83		simp-4r 782	. . . . . . . . 9 ⊢ (((((𝜑 ∧ ¬ +∞ ∈ ℂ) ∧ ¬ -∞ ∈ ℂ) ∧ (𝑗 ∈ 𝑍 ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) ∈ ℂ)) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → ¬ +∞ ∈ ℂ)
84		nelne2 3040	. . . . . . . . 9 ⊢ (((𝐹‘𝑘) ∈ ℂ ∧ ¬ +∞ ∈ ℂ) → (𝐹‘𝑘) ≠ +∞)
85	79, 83, 84	syl2anc 584	. . . . . . . 8 ⊢ (((((𝜑 ∧ ¬ +∞ ∈ ℂ) ∧ ¬ -∞ ∈ ℂ) ∧ (𝑗 ∈ 𝑍 ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) ∈ ℂ)) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → (𝐹‘𝑘) ≠ +∞)
86	76, 82, 85	xrred 44374	. . . . . . 7 ⊢ (((((𝜑 ∧ ¬ +∞ ∈ ℂ) ∧ ¬ -∞ ∈ ℂ) ∧ (𝑗 ∈ 𝑍 ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) ∈ ℂ)) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → (𝐹‘𝑘) ∈ ℝ)
87	74, 86	jca 512	. . . . . 6 ⊢ (((((𝜑 ∧ ¬ +∞ ∈ ℂ) ∧ ¬ -∞ ∈ ℂ) ∧ (𝑗 ∈ 𝑍 ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) ∈ ℂ)) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → (𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ ℝ))
88	65, 87	ralrimia 3255	. . . . 5 ⊢ ((((𝜑 ∧ ¬ +∞ ∈ ℂ) ∧ ¬ -∞ ∈ ℂ) ∧ (𝑗 ∈ 𝑍 ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) ∈ ℂ)) → ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ ℝ))
89	4	ffund 6721	. . . . . . 7 ⊢ (𝜑 → Fun 𝐹)
90		ffvresb 7126	. . . . . . 7 ⊢ (Fun 𝐹 → ((𝐹 ↾ (ℤ_≥‘𝑗)):(ℤ_≥‘𝑗)⟶ℝ ↔ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ ℝ)))
91	89, 90	syl 17	. . . . . 6 ⊢ (𝜑 → ((𝐹 ↾ (ℤ_≥‘𝑗)):(ℤ_≥‘𝑗)⟶ℝ ↔ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ ℝ)))
92	91	ad3antrrr 728	. . . . 5 ⊢ ((((𝜑 ∧ ¬ +∞ ∈ ℂ) ∧ ¬ -∞ ∈ ℂ) ∧ (𝑗 ∈ 𝑍 ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) ∈ ℂ)) → ((𝐹 ↾ (ℤ_≥‘𝑗)):(ℤ_≥‘𝑗)⟶ℝ ↔ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ ℝ)))
93	88, 92	mpbird 256	. . . 4 ⊢ ((((𝜑 ∧ ¬ +∞ ∈ ℂ) ∧ ¬ -∞ ∈ ℂ) ∧ (𝑗 ∈ 𝑍 ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) ∈ ℂ)) → (𝐹 ↾ (ℤ_≥‘𝑗)):(ℤ_≥‘𝑗)⟶ℝ)
94		r19.26 3111	. . . . . . . . 9 ⊢ (∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 1) ↔ (∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) ∈ ℂ ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘((𝐹‘𝑘) − 𝐴)) < 1))
95	94	simplbi 498	. . . . . . . 8 ⊢ (∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 1) → ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) ∈ ℂ)
96	95	ad2antll 727	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑗 ∈ ℤ ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 1))) → ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) ∈ ℂ)
97		breq2 5152	. . . . . . . . . 10 ⊢ (𝑥 = 1 → ((abs‘((𝐹‘𝑘) − 𝐴)) < 𝑥 ↔ (abs‘((𝐹‘𝑘) − 𝐴)) < 1))
98	97	anbi2d 629	. . . . . . . . 9 ⊢ (𝑥 = 1 → (((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝑥) ↔ ((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 1)))
99	98	rexralbidv 3220	. . . . . . . 8 ⊢ (𝑥 = 1 → (∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝑥) ↔ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 1)))
100	3	fvexi 6905	. . . . . . . . . . . . 13 ⊢ 𝑍 ∈ V
101	100	a1i 11	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑍 ∈ V)
102	4, 101	fexd 7231	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐹 ∈ V)
103		eqidd 2733	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ ℤ) → (𝐹‘𝑘) = (𝐹‘𝑘))
104	102, 103	clim 15442	. . . . . . . . . 10 ⊢ (𝜑 → (𝐹 ⇝ 𝐴 ↔ (𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝑥))))
105	6, 104	mpbid 231	. . . . . . . . 9 ⊢ (𝜑 → (𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝑥)))
106	105	simprd 496	. . . . . . . 8 ⊢ (𝜑 → ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝑥))
107		1rp 12982	. . . . . . . . 9 ⊢ 1 ∈ ℝ⁺
108	107	a1i 11	. . . . . . . 8 ⊢ (𝜑 → 1 ∈ ℝ⁺)
109	99, 106, 108	rspcdva 3613	. . . . . . 7 ⊢ (𝜑 → ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 1))
110	96, 109	reximddv 3171	. . . . . 6 ⊢ (𝜑 → ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) ∈ ℂ)
111	3	rexuz3 15299	. . . . . . 7 ⊢ (𝑀 ∈ ℤ → (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) ∈ ℂ ↔ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) ∈ ℂ))
112	1, 111	syl 17	. . . . . 6 ⊢ (𝜑 → (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) ∈ ℂ ↔ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) ∈ ℂ))
113	110, 112	mpbird 256	. . . . 5 ⊢ (𝜑 → ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) ∈ ℂ)
114	113	ad2antrr 724	. . . 4 ⊢ (((𝜑 ∧ ¬ +∞ ∈ ℂ) ∧ ¬ -∞ ∈ ℂ) → ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) ∈ ℂ)
115	93, 114	reximddv 3171	. . 3 ⊢ (((𝜑 ∧ ¬ +∞ ∈ ℂ) ∧ ¬ -∞ ∈ ℂ) → ∃𝑗 ∈ 𝑍 (𝐹 ↾ (ℤ_≥‘𝑗)):(ℤ_≥‘𝑗)⟶ℝ)
116	60, 115	pm2.61dan 811	. 2 ⊢ ((𝜑 ∧ ¬ +∞ ∈ ℂ) → ∃𝑗 ∈ 𝑍 (𝐹 ↾ (ℤ_≥‘𝑗)):(ℤ_≥‘𝑗)⟶ℝ)
117	49, 116	pm2.61dan 811	1 ⊢ (𝜑 → ∃𝑗 ∈ 𝑍 (𝐹 ↾ (ℤ_≥‘𝑗)):(ℤ_≥‘𝑗)⟶ℝ)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1541 ∈ wcel 2106 ≠ wne 2940 ∀wral 3061 ∃wrex 3070 Vcvv 3474 ifcif 4528 class class class wbr 5148 dom cdm 5676 ↾ cres 5678 Fun wfun 6537 ⟶wf 6539 ‘cfv 6543 (class class class)co 7411 ℂcc 11110 ℝcr 11111 1c1 11113 +∞cpnf 11249 -∞cmnf 11250 ℝ^*cxr 11251 < clt 11252 ≤ cle 11253 − cmin 11448 ℤcz 12562 ℤ_≥cuz 12826 ℝ⁺crp 12978 abscabs 15185 ⇝ cli 15432

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 7727 ax-cnex 11168 ax-resscn 11169 ax-1cn 11170 ax-icn 11171 ax-addcl 11172 ax-addrcl 11173 ax-mulcl 11174 ax-mulrcl 11175 ax-mulcom 11176 ax-addass 11177 ax-mulass 11178 ax-distr 11179 ax-i2m1 11180 ax-1ne0 11181 ax-1rid 11182 ax-rnegex 11183 ax-rrecex 11184 ax-cnre 11185 ax-pre-lttri 11186 ax-pre-lttrn 11187 ax-pre-ltadd 11188 ax-pre-mulgt0 11189 ax-pre-sup 11190

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-riota 7367 df-ov 7414 df-oprab 7415 df-mpo 7416 df-om 7858 df-2nd 7978 df-frecs 8268 df-wrecs 8299 df-recs 8373 df-rdg 8412 df-er 8705 df-en 8942 df-dom 8943 df-sdom 8944 df-sup 9439 df-pnf 11254 df-mnf 11255 df-xr 11256 df-ltxr 11257 df-le 11258 df-sub 11450 df-neg 11451 df-div 11876 df-nn 12217 df-2 12279 df-3 12280 df-n0 12477 df-z 12563 df-uz 12827 df-rp 12979 df-seq 13971 df-exp 14032 df-cj 15050 df-re 15051 df-im 15052 df-sqrt 15186 df-abs 15187 df-clim 15436

This theorem is referenced by: xlimclim2 44855

W3C validator