Theorem climuz 46172

Description: Express the predicate: The limit of complex number sequence 𝐹 is 𝐴, or 𝐹 converges to 𝐴. (Contributed by Glauco Siliprandi, 2-Jan-2022.)

Hypotheses

Ref	Expression
climuz.k	⊢ Ⅎ𝑘𝐹
climuz.m	⊢ (𝜑 → 𝑀 ∈ ℤ)
climuz.z	⊢ 𝑍 = (ℤ≥‘𝑀)
climuz.f	⊢ (𝜑 → 𝐹:𝑍⟶ℂ)

Assertion

Ref	Expression
climuz	⊢ (𝜑 → (𝐹 ⇝ 𝐴 ↔ (𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(abs‘((𝐹‘𝑘) − 𝐴)) < 𝑥)))

Distinct variable groups:   𝐴,𝑗,𝑘,𝑥   𝑗,𝐹,𝑥   𝑗,𝑍,𝑥

Allowed substitution hints:   𝜑(𝑥,𝑗,𝑘)   𝐹(𝑘)   𝑀(𝑥,𝑗,𝑘)   𝑍(𝑘)

Proof of Theorem climuz

Dummy variables 𝑖 𝑙 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		climuz.m	. . 3 ⊢ (𝜑 → 𝑀 ∈ ℤ)
2		climuz.z	. . 3 ⊢ 𝑍 = (ℤ≥‘𝑀)
3		climuz.f	. . 3 ⊢ (𝜑 → 𝐹:𝑍⟶ℂ)
4	1, 2, 3	climuzlem 46171	. 2 ⊢ (𝜑 → (𝐹 ⇝ 𝐴 ↔ (𝐴 ∈ ℂ ∧ ∀𝑦 ∈ ℝ+ ∃𝑖 ∈ 𝑍 ∀𝑙 ∈ (ℤ≥‘𝑖)(abs‘((𝐹‘𝑙) − 𝐴)) < 𝑦)))
5		breq2 5089	. . . . . . . 8 ⊢ (𝑦 = 𝑥 → ((abs‘((𝐹‘𝑙) − 𝐴)) < 𝑦 ↔ (abs‘((𝐹‘𝑙) − 𝐴)) < 𝑥))
6	5	ralbidv 3160	. . . . . . 7 ⊢ (𝑦 = 𝑥 → (∀𝑙 ∈ (ℤ≥‘𝑖)(abs‘((𝐹‘𝑙) − 𝐴)) < 𝑦 ↔ ∀𝑙 ∈ (ℤ≥‘𝑖)(abs‘((𝐹‘𝑙) − 𝐴)) < 𝑥))
7	6	rexbidv 3161	. . . . . 6 ⊢ (𝑦 = 𝑥 → (∃𝑖 ∈ 𝑍 ∀𝑙 ∈ (ℤ≥‘𝑖)(abs‘((𝐹‘𝑙) − 𝐴)) < 𝑦 ↔ ∃𝑖 ∈ 𝑍 ∀𝑙 ∈ (ℤ≥‘𝑖)(abs‘((𝐹‘𝑙) − 𝐴)) < 𝑥))
8		fveq2 6840	. . . . . . . . . 10 ⊢ (𝑖 = 𝑗 → (ℤ≥‘𝑖) = (ℤ≥‘𝑗))
9	8	raleqdv 3295	. . . . . . . . 9 ⊢ (𝑖 = 𝑗 → (∀𝑙 ∈ (ℤ≥‘𝑖)(abs‘((𝐹‘𝑙) − 𝐴)) < 𝑥 ↔ ∀𝑙 ∈ (ℤ≥‘𝑗)(abs‘((𝐹‘𝑙) − 𝐴)) < 𝑥))
10		nfcv 2898	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑘abs
11		climuz.k	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑘𝐹
12		nfcv 2898	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑘𝑙
13	11, 12	nffv 6850	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑘(𝐹‘𝑙)
14		nfcv 2898	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑘 −
15		nfcv 2898	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑘𝐴
16	13, 14, 15	nfov 7397	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑘((𝐹‘𝑙) − 𝐴)
17	10, 16	nffv 6850	. . . . . . . . . . . 12 ⊢ Ⅎ𝑘(abs‘((𝐹‘𝑙) − 𝐴))
18		nfcv 2898	. . . . . . . . . . . 12 ⊢ Ⅎ𝑘 <
19		nfcv 2898	. . . . . . . . . . . 12 ⊢ Ⅎ𝑘𝑥
20	17, 18, 19	nfbr 5132	. . . . . . . . . . 11 ⊢ Ⅎ𝑘(abs‘((𝐹‘𝑙) − 𝐴)) < 𝑥
21		nfv 1916	. . . . . . . . . . 11 ⊢ Ⅎ𝑙(abs‘((𝐹‘𝑘) − 𝐴)) < 𝑥
22		fveq2 6840	. . . . . . . . . . . . 13 ⊢ (𝑙 = 𝑘 → (𝐹‘𝑙) = (𝐹‘𝑘))
23	22	fvoveq1d 7389	. . . . . . . . . . . 12 ⊢ (𝑙 = 𝑘 → (abs‘((𝐹‘𝑙) − 𝐴)) = (abs‘((𝐹‘𝑘) − 𝐴)))
24	23	breq1d 5095	. . . . . . . . . . 11 ⊢ (𝑙 = 𝑘 → ((abs‘((𝐹‘𝑙) − 𝐴)) < 𝑥 ↔ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝑥))
25	20, 21, 24	cbvralw 3279	. . . . . . . . . 10 ⊢ (∀𝑙 ∈ (ℤ≥‘𝑗)(abs‘((𝐹‘𝑙) − 𝐴)) < 𝑥 ↔ ∀𝑘 ∈ (ℤ≥‘𝑗)(abs‘((𝐹‘𝑘) − 𝐴)) < 𝑥)
26	25	a1i 11	. . . . . . . . 9 ⊢ (𝑖 = 𝑗 → (∀𝑙 ∈ (ℤ≥‘𝑗)(abs‘((𝐹‘𝑙) − 𝐴)) < 𝑥 ↔ ∀𝑘 ∈ (ℤ≥‘𝑗)(abs‘((𝐹‘𝑘) − 𝐴)) < 𝑥))
27	9, 26	bitrd 279	. . . . . . . 8 ⊢ (𝑖 = 𝑗 → (∀𝑙 ∈ (ℤ≥‘𝑖)(abs‘((𝐹‘𝑙) − 𝐴)) < 𝑥 ↔ ∀𝑘 ∈ (ℤ≥‘𝑗)(abs‘((𝐹‘𝑘) − 𝐴)) < 𝑥))
28	27	cbvrexvw 3216	. . . . . . 7 ⊢ (∃𝑖 ∈ 𝑍 ∀𝑙 ∈ (ℤ≥‘𝑖)(abs‘((𝐹‘𝑙) − 𝐴)) < 𝑥 ↔ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(abs‘((𝐹‘𝑘) − 𝐴)) < 𝑥)
29	28	a1i 11	. . . . . 6 ⊢ (𝑦 = 𝑥 → (∃𝑖 ∈ 𝑍 ∀𝑙 ∈ (ℤ≥‘𝑖)(abs‘((𝐹‘𝑙) − 𝐴)) < 𝑥 ↔ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(abs‘((𝐹‘𝑘) − 𝐴)) < 𝑥))
30	7, 29	bitrd 279	. . . . 5 ⊢ (𝑦 = 𝑥 → (∃𝑖 ∈ 𝑍 ∀𝑙 ∈ (ℤ≥‘𝑖)(abs‘((𝐹‘𝑙) − 𝐴)) < 𝑦 ↔ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(abs‘((𝐹‘𝑘) − 𝐴)) < 𝑥))
31	30	cbvralvw 3215	. . . 4 ⊢ (∀𝑦 ∈ ℝ+ ∃𝑖 ∈ 𝑍 ∀𝑙 ∈ (ℤ≥‘𝑖)(abs‘((𝐹‘𝑙) − 𝐴)) < 𝑦 ↔ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(abs‘((𝐹‘𝑘) − 𝐴)) < 𝑥)
32	31	anbi2i 624	. . 3 ⊢ ((𝐴 ∈ ℂ ∧ ∀𝑦 ∈ ℝ+ ∃𝑖 ∈ 𝑍 ∀𝑙 ∈ (ℤ≥‘𝑖)(abs‘((𝐹‘𝑙) − 𝐴)) < 𝑦) ↔ (𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(abs‘((𝐹‘𝑘) − 𝐴)) < 𝑥))
33	32	a1i 11	. 2 ⊢ (𝜑 → ((𝐴 ∈ ℂ ∧ ∀𝑦 ∈ ℝ+ ∃𝑖 ∈ 𝑍 ∀𝑙 ∈ (ℤ≥‘𝑖)(abs‘((𝐹‘𝑙) − 𝐴)) < 𝑦) ↔ (𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(abs‘((𝐹‘𝑘) − 𝐴)) < 𝑥)))
34	4, 33	bitrd 279	1 ⊢ (𝜑 → (𝐹 ⇝ 𝐴 ↔ (𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(abs‘((𝐹‘𝑘) − 𝐴)) < 𝑥)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1542   ∈ wcel 2114  Ⅎwnfc 2883  ∀wral 3051  ∃wrex 3061   class class class wbr 5085  ⟶wf 6494  ‘cfv 6498  (class class class)co 7367  ℂcc 11036   < clt 11179   − cmin 11377  ℤcz 12524  ℤ_≥cuz 12788  ℝ⁺crp 12942  abscabs 15196   ⇝ cli 15446

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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689  ax-cnex 11094  ax-resscn 11095  ax-pre-lttri 11112  ax-pre-lttrn 11113

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-nel 3037  df-ral 3052  df-rex 3062  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-iun 4935  df-br 5086  df-opab 5148  df-mpt 5167  df-id 5526  df-po 5539  df-so 5540  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-ov 7370  df-er 8643  df-en 8894  df-dom 8895  df-sdom 8896  df-pnf 11181  df-mnf 11182  df-xr 11183  df-ltxr 11184  df-le 11185  df-neg 11380  df-z 12525  df-uz 12789  df-clim 15450

This theorem is referenced by:  liminflimsupclim  46235  climxlim2lem  46273