climxrrelem - Mathbox for Glauco Siliprandi

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

Theorem climxrrelem 46496

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. (Contributed by Glauco Siliprandi, 5-Feb-2022.)

**Hypotheses**
Ref	Expression
climxrrelem.m	⊢ (𝜑 → 𝑀 ∈ ℤ)
climxrrelem.z	⊢ 𝑍 = (ℤ_≥‘𝑀)
climxrrelem.f	⊢ (𝜑 → 𝐹:𝑍⟶ℝ^*)
climxrrelem.c	⊢ (𝜑 → 𝐹 ⇝ 𝐴)
climxrrelem.d	⊢ (𝜑 → 𝐷 ∈ ℝ⁺)
climxrrelem.p	⊢ ((𝜑 ∧ +∞ ∈ ℂ) → 𝐷 ≤ (abs‘(+∞ − 𝐴)))
climxrrelem.n	⊢ ((𝜑 ∧ -∞ ∈ ℂ) → 𝐷 ≤ (abs‘(-∞ − 𝐴)))

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

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

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

Step	Hyp	Ref	Expression
1		nfv 1947	. . . . 5 ⊢ Ⅎ𝑘𝜑
2		nfv 1947	. . . . . 6 ⊢ Ⅎ𝑘 𝑗 ∈ 𝑍
3		nfra1 3291	. . . . . 6 ⊢ Ⅎ𝑘∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝐷)
4	2, 3	nfan 1932	. . . . 5 ⊢ Ⅎ𝑘(𝑗 ∈ 𝑍 ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝐷))
5	1, 4	nfan 1932	. . . 4 ⊢ Ⅎ𝑘(𝜑 ∧ (𝑗 ∈ 𝑍 ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝐷)))
6		climxrrelem.z	. . . . . . . . 9 ⊢ 𝑍 = (ℤ_≥‘𝑀)
7	6	uztrn2 12893	. . . . . . . 8 ⊢ ((𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → 𝑘 ∈ 𝑍)
8	7	adantll 727	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → 𝑘 ∈ 𝑍)
9		climxrrelem.f	. . . . . . . . 9 ⊢ (𝜑 → 𝐹:𝑍⟶ℝ^*)
10	9	fdmd 6720	. . . . . . . 8 ⊢ (𝜑 → dom 𝐹 = 𝑍)
11	10	ad2antrr 739	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → dom 𝐹 = 𝑍)
12	8, 11	eleqtrrd 2868	. . . . . 6 ⊢ (((𝜑 ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → 𝑘 ∈ dom 𝐹)
13	12	adantlrr 734	. . . . 5 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝐷))) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → 𝑘 ∈ dom 𝐹)
14		simpll 779	. . . . . 6 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝐷))) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → 𝜑)
15	8	adantlrr 734	. . . . . 6 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝐷))) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → 𝑘 ∈ 𝑍)
16		rspa 3256	. . . . . . . 8 ⊢ ((∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝐷) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → ((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝐷))
17	16	adantll 727	. . . . . . 7 ⊢ (((𝑗 ∈ 𝑍 ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝐷)) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → ((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝐷))
18	17	adantll 727	. . . . . 6 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝐷))) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → ((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝐷))
19	9	ffvelcdmda 7083	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ ℝ^*)
20	19	3adant3 1150	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍 ∧ ((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝐷)) → (𝐹‘𝑘) ∈ ℝ^*)
21		simpll 779	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐹‘𝑘) ∈ ℂ) ∧ (𝐹‘𝑘) = -∞) → 𝜑)
22		simpr 490	. . . . . . . . . . . . . 14 ⊢ (((𝐹‘𝑘) ∈ ℂ ∧ (𝐹‘𝑘) = -∞) → (𝐹‘𝑘) = -∞)
23		simpl 488	. . . . . . . . . . . . . 14 ⊢ (((𝐹‘𝑘) ∈ ℂ ∧ (𝐹‘𝑘) = -∞) → (𝐹‘𝑘) ∈ ℂ)
24	22, 23	eqeltrrd 2866	. . . . . . . . . . . . 13 ⊢ (((𝐹‘𝑘) ∈ ℂ ∧ (𝐹‘𝑘) = -∞) → -∞ ∈ ℂ)
25	24	adantll 727	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐹‘𝑘) ∈ ℂ) ∧ (𝐹‘𝑘) = -∞) → -∞ ∈ ℂ)
26		climxrrelem.n	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ -∞ ∈ ℂ) → 𝐷 ≤ (abs‘(-∞ − 𝐴)))
27	21, 25, 26	syl2anc 596	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝐹‘𝑘) ∈ ℂ) ∧ (𝐹‘𝑘) = -∞) → 𝐷 ≤ (abs‘(-∞ − 𝐴)))
28	27	adantlrr 734	. . . . . . . . . 10 ⊢ (((𝜑 ∧ ((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝐷)) ∧ (𝐹‘𝑘) = -∞) → 𝐷 ≤ (abs‘(-∞ − 𝐴)))
29		fvoveq1 7439	. . . . . . . . . . . . . . 15 ⊢ ((𝐹‘𝑘) = -∞ → (abs‘((𝐹‘𝑘) − 𝐴)) = (abs‘(-∞ − 𝐴)))
30	29	adantl 487	. . . . . . . . . . . . . 14 ⊢ (((abs‘((𝐹‘𝑘) − 𝐴)) < 𝐷 ∧ (𝐹‘𝑘) = -∞) → (abs‘((𝐹‘𝑘) − 𝐴)) = (abs‘(-∞ − 𝐴)))
31		simpl 488	. . . . . . . . . . . . . 14 ⊢ (((abs‘((𝐹‘𝑘) − 𝐴)) < 𝐷 ∧ (𝐹‘𝑘) = -∞) → (abs‘((𝐹‘𝑘) − 𝐴)) < 𝐷)
32	30, 31	eqbrtrrd 5137	. . . . . . . . . . . . 13 ⊢ (((abs‘((𝐹‘𝑘) − 𝐴)) < 𝐷 ∧ (𝐹‘𝑘) = -∞) → (abs‘(-∞ − 𝐴)) < 𝐷)
33	32	adantll 727	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝐷) ∧ (𝐹‘𝑘) = -∞) → (abs‘(-∞ − 𝐴)) < 𝐷)
34	33	adantlrl 733	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ ((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝐷)) ∧ (𝐹‘𝑘) = -∞) → (abs‘(-∞ − 𝐴)) < 𝐷)
35		climxrrelem.c	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → 𝐹 ⇝ 𝐴)
36	6	fvexi 6899	. . . . . . . . . . . . . . . . . . . . 21 ⊢ 𝑍 ∈ V
37	36	a1i 11	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝜑 → 𝑍 ∈ V)
38	9, 37	fexd 7229	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → 𝐹 ∈ V)
39		eqidd 2766	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑘 ∈ ℤ) → (𝐹‘𝑘) = (𝐹‘𝑘))
40	38, 39	clim 15565	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → (𝐹 ⇝ 𝐴 ↔ (𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝑥))))
41	35, 40	mpbid 235	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → (𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝑥)))
42	41	simpld 500	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 𝐴 ∈ ℂ)
43	42	ad2antrr 739	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝐹‘𝑘) ∈ ℂ) ∧ (𝐹‘𝑘) = -∞) → 𝐴 ∈ ℂ)
44	25, 43	subcld 11580	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝐹‘𝑘) ∈ ℂ) ∧ (𝐹‘𝑘) = -∞) → (-∞ − 𝐴) ∈ ℂ)
45	44	abscld 15510	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝐹‘𝑘) ∈ ℂ) ∧ (𝐹‘𝑘) = -∞) → (abs‘(-∞ − 𝐴)) ∈ ℝ)
46	45	adantlrr 734	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ ((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝐷)) ∧ (𝐹‘𝑘) = -∞) → (abs‘(-∞ − 𝐴)) ∈ ℝ)
47		climxrrelem.d	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝐷 ∈ ℝ⁺)
48	47	rpred 13072	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐷 ∈ ℝ)
49	48	ad2antrr 739	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ ((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝐷)) ∧ (𝐹‘𝑘) = -∞) → 𝐷 ∈ ℝ)
50	46, 49	ltnled 11368	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ ((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝐷)) ∧ (𝐹‘𝑘) = -∞) → ((abs‘(-∞ − 𝐴)) < 𝐷 ↔ ¬ 𝐷 ≤ (abs‘(-∞ − 𝐴))))
51	34, 50	mpbid 235	. . . . . . . . . 10 ⊢ (((𝜑 ∧ ((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝐷)) ∧ (𝐹‘𝑘) = -∞) → ¬ 𝐷 ≤ (abs‘(-∞ − 𝐴)))
52	28, 51	pm2.65da 829	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝐷)) → ¬ (𝐹‘𝑘) = -∞)
53	52	3adant2 1149	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍 ∧ ((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝐷)) → ¬ (𝐹‘𝑘) = -∞)
54	53	neqned 2967	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍 ∧ ((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝐷)) → (𝐹‘𝑘) ≠ -∞)
55		simpll 779	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐹‘𝑘) ∈ ℂ) ∧ (𝐹‘𝑘) = +∞) → 𝜑)
56		simpr 490	. . . . . . . . . . . . . 14 ⊢ (((𝐹‘𝑘) ∈ ℂ ∧ (𝐹‘𝑘) = +∞) → (𝐹‘𝑘) = +∞)
57		simpl 488	. . . . . . . . . . . . . 14 ⊢ (((𝐹‘𝑘) ∈ ℂ ∧ (𝐹‘𝑘) = +∞) → (𝐹‘𝑘) ∈ ℂ)
58	56, 57	eqeltrrd 2866	. . . . . . . . . . . . 13 ⊢ (((𝐹‘𝑘) ∈ ℂ ∧ (𝐹‘𝑘) = +∞) → +∞ ∈ ℂ)
59	58	adantll 727	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐹‘𝑘) ∈ ℂ) ∧ (𝐹‘𝑘) = +∞) → +∞ ∈ ℂ)
60		climxrrelem.p	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ +∞ ∈ ℂ) → 𝐷 ≤ (abs‘(+∞ − 𝐴)))
61	55, 59, 60	syl2anc 596	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝐹‘𝑘) ∈ ℂ) ∧ (𝐹‘𝑘) = +∞) → 𝐷 ≤ (abs‘(+∞ − 𝐴)))
62	61	adantlrr 734	. . . . . . . . . 10 ⊢ (((𝜑 ∧ ((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝐷)) ∧ (𝐹‘𝑘) = +∞) → 𝐷 ≤ (abs‘(+∞ − 𝐴)))
63		fvoveq1 7439	. . . . . . . . . . . . . . 15 ⊢ ((𝐹‘𝑘) = +∞ → (abs‘((𝐹‘𝑘) − 𝐴)) = (abs‘(+∞ − 𝐴)))
64	63	adantl 487	. . . . . . . . . . . . . 14 ⊢ (((abs‘((𝐹‘𝑘) − 𝐴)) < 𝐷 ∧ (𝐹‘𝑘) = +∞) → (abs‘((𝐹‘𝑘) − 𝐴)) = (abs‘(+∞ − 𝐴)))
65		simpl 488	. . . . . . . . . . . . . 14 ⊢ (((abs‘((𝐹‘𝑘) − 𝐴)) < 𝐷 ∧ (𝐹‘𝑘) = +∞) → (abs‘((𝐹‘𝑘) − 𝐴)) < 𝐷)
66	64, 65	eqbrtrrd 5137	. . . . . . . . . . . . 13 ⊢ (((abs‘((𝐹‘𝑘) − 𝐴)) < 𝐷 ∧ (𝐹‘𝑘) = +∞) → (abs‘(+∞ − 𝐴)) < 𝐷)
67	66	adantll 727	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝐷) ∧ (𝐹‘𝑘) = +∞) → (abs‘(+∞ − 𝐴)) < 𝐷)
68	67	adantlrl 733	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ ((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝐷)) ∧ (𝐹‘𝑘) = +∞) → (abs‘(+∞ − 𝐴)) < 𝐷)
69	42	ad2antrr 739	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝐹‘𝑘) ∈ ℂ) ∧ (𝐹‘𝑘) = +∞) → 𝐴 ∈ ℂ)
70	59, 69	subcld 11580	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝐹‘𝑘) ∈ ℂ) ∧ (𝐹‘𝑘) = +∞) → (+∞ − 𝐴) ∈ ℂ)
71	70	abscld 15510	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝐹‘𝑘) ∈ ℂ) ∧ (𝐹‘𝑘) = +∞) → (abs‘(+∞ − 𝐴)) ∈ ℝ)
72	71	adantlrr 734	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ ((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝐷)) ∧ (𝐹‘𝑘) = +∞) → (abs‘(+∞ − 𝐴)) ∈ ℝ)
73	48	ad2antrr 739	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ ((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝐷)) ∧ (𝐹‘𝑘) = +∞) → 𝐷 ∈ ℝ)
74	72, 73	ltnled 11368	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ ((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝐷)) ∧ (𝐹‘𝑘) = +∞) → ((abs‘(+∞ − 𝐴)) < 𝐷 ↔ ¬ 𝐷 ≤ (abs‘(+∞ − 𝐴))))
75	68, 74	mpbid 235	. . . . . . . . . 10 ⊢ (((𝜑 ∧ ((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝐷)) ∧ (𝐹‘𝑘) = +∞) → ¬ 𝐷 ≤ (abs‘(+∞ − 𝐴)))
76	62, 75	pm2.65da 829	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝐷)) → ¬ (𝐹‘𝑘) = +∞)
77	76	3adant2 1149	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍 ∧ ((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝐷)) → ¬ (𝐹‘𝑘) = +∞)
78	77	neqned 2967	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍 ∧ ((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝐷)) → (𝐹‘𝑘) ≠ +∞)
79	20, 54, 78	xrred 46113	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍 ∧ ((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝐷)) → (𝐹‘𝑘) ∈ ℝ)
80	14, 15, 18, 79	syl3anc 1398	. . . . 5 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝐷))) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → (𝐹‘𝑘) ∈ ℝ)
81	13, 80	jca 521	. . . 4 ⊢ (((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝐷))) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → (𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ ℝ))
82	5, 81	ralrimia 3266	. . 3 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝐷))) → ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ ℝ))
83	9	ffund 6714	. . . . 5 ⊢ (𝜑 → Fun 𝐹)
84		ffvresb 7125	. . . . 5 ⊢ (Fun 𝐹 → ((𝐹 ↾ (ℤ_≥‘𝑗)):(ℤ_≥‘𝑗)⟶ℝ ↔ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ ℝ)))
85	83, 84	syl 18	. . . 4 ⊢ (𝜑 → ((𝐹 ↾ (ℤ_≥‘𝑗)):(ℤ_≥‘𝑗)⟶ℝ ↔ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ ℝ)))
86	85	adantr 486	. . 3 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝐷))) → ((𝐹 ↾ (ℤ_≥‘𝑗)):(ℤ_≥‘𝑗)⟶ℝ ↔ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ ℝ)))
87	82, 86	mpbird 260	. 2 ⊢ ((𝜑 ∧ (𝑗 ∈ 𝑍 ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝐷))) → (𝐹 ↾ (ℤ_≥‘𝑗)):(ℤ_≥‘𝑗)⟶ℝ)
88		breq2 5115	. . . . . 6 ⊢ (𝑥 = 𝐷 → ((abs‘((𝐹‘𝑘) − 𝐴)) < 𝑥 ↔ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝐷))
89	88	anbi2d 642	. . . . 5 ⊢ (𝑥 = 𝐷 → (((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝑥) ↔ ((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝐷)))
90	89	rexralbidv 3233	. . . 4 ⊢ (𝑥 = 𝐷 → (∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝑥) ↔ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝐷)))
91	41	simprd 501	. . . 4 ⊢ (𝜑 → ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝑥))
92	90, 91, 47	rspcdva 3584	. . 3 ⊢ (𝜑 → ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝐷))
93		climxrrelem.m	. . . 4 ⊢ (𝜑 → 𝑀 ∈ ℤ)
94	6	rexuz3 15420	. . . 4 ⊢ (𝑀 ∈ ℤ → (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝐷) ↔ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝐷)))
95	93, 94	syl 18	. . 3 ⊢ (𝜑 → (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝐷) ↔ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝐷)))
96	92, 95	mpbird 260	. 2 ⊢ (𝜑 → ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝐷))
97	87, 96	reximddv 3183	1 ⊢ (𝜑 → ∃𝑗 ∈ 𝑍 (𝐹 ↾ (ℤ_≥‘𝑗)):(ℤ_≥‘𝑗)⟶ℝ)

Colors of variables: wff setvar class

This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2146 ∀wral 3081 ∃wrex 3091 Vcvv 3457 class class class wbr 5111 dom cdm 5663 ↾ cres 5665 Fun wfun 6534 ⟶wf 6536 ‘cfv 6540 (class class class)co 7416 ℂcc 11109 ℝcr 11110 +∞cpnf 11251 -∞cmnf 11252 ℝ^*cxr 11253 < clt 11254 ≤ cle 11255 − cmin 11452 ℤcz 12602 ℤ_≥cuz 12874 ℝ⁺crp 13028 abscabs 15305 ⇝ cli 15555

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7738 ax-cnex 11167 ax-resscn 11168 ax-1cn 11169 ax-icn 11170 ax-addcl 11171 ax-addrcl 11172 ax-mulcl 11173 ax-mulrcl 11174 ax-mulcom 11175 ax-addass 11176 ax-mulass 11177 ax-distr 11178 ax-i2m1 11179 ax-1ne0 11180 ax-1rid 11181 ax-rnegex 11182 ax-rrecex 11183 ax-cnre 11184 ax-pre-lttri 11185 ax-pre-lttrn 11186 ax-pre-ltadd 11187 ax-pre-mulgt0 11188 ax-pre-sup 11189

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3067 df-ral 3082 df-rex 3092 df-rmo 3371 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7373 df-ov 7419 df-oprab 7420 df-mpo 7421 df-om 7865 df-2nd 7989 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-rdg 8399 df-er 8696 df-en 8946 df-dom 8947 df-sdom 8948 df-sup 9405 df-pnf 11256 df-mnf 11257 df-xr 11258 df-ltxr 11259 df-le 11260 df-sub 11454 df-neg 11455 df-div 11883 df-nn 12245 df-2 12314 df-3 12315 df-n0 12516 df-z 12603 df-uz 12875 df-rp 13029 df-seq 14052 df-exp 14112 df-cj 15170 df-re 15171 df-im 15172 df-sqrt 15306 df-abs 15307 df-clim 15559

This theorem is used by: climxrre 46497

W3C validator