Theorem climf2 42825

Description: Express the predicate: The limit of complex number sequence 𝐹 is 𝐴, or 𝐹 converges to 𝐴. Similar to clim 15020, but without the disjoint var constraint 𝜑𝑘 and 𝐹𝑘. (Contributed by Glauco Siliprandi, 26-Jun-2021.)

Hypotheses

Ref	Expression
climf2.1	⊢ Ⅎ𝑘𝜑
climf2.nf	⊢ Ⅎ𝑘𝐹
climf2.f	⊢ (𝜑 → 𝐹 ∈ 𝑉)
climf2.fv	⊢ ((𝜑 ∧ 𝑘 ∈ ℤ) → (𝐹‘𝑘) = 𝐵)

Assertion

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

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

Allowed substitution hints:   𝜑(𝑘)   𝐵(𝑥,𝑗,𝑘)   𝐹(𝑘)   𝑉(𝑥,𝑗,𝑘)

Proof of Theorem climf2

Dummy variables 𝑓 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		climrel 15018	. . . . 5 ⊢ Rel ⇝
2	1	brrelex2i 5591	. . . 4 ⊢ (𝐹 ⇝ 𝐴 → 𝐴 ∈ V)
3	2	a1i 11	. . 3 ⊢ (𝜑 → (𝐹 ⇝ 𝐴 → 𝐴 ∈ V))
4		elex 3416	. . . . 5 ⊢ (𝐴 ∈ ℂ → 𝐴 ∈ V)
5	4	adantr 484	. . . 4 ⊢ ((𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝑥)) → 𝐴 ∈ V)
6	5	a1i 11	. . 3 ⊢ (𝜑 → ((𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝑥)) → 𝐴 ∈ V))
7		climf2.f	. . . 4 ⊢ (𝜑 → 𝐹 ∈ 𝑉)
8		simpr 488	. . . . . . . 8 ⊢ ((𝑓 = 𝐹 ∧ 𝑦 = 𝐴) → 𝑦 = 𝐴)
9	8	eleq1d 2815	. . . . . . 7 ⊢ ((𝑓 = 𝐹 ∧ 𝑦 = 𝐴) → (𝑦 ∈ ℂ ↔ 𝐴 ∈ ℂ))
10		nfv 1922	. . . . . . . 8 ⊢ Ⅎ𝑥(𝑓 = 𝐹 ∧ 𝑦 = 𝐴)
11		climf2.nf	. . . . . . . . . . . 12 ⊢ Ⅎ𝑘𝐹
12	11	nfeq2 2914	. . . . . . . . . . 11 ⊢ Ⅎ𝑘 𝑓 = 𝐹
13		nfv 1922	. . . . . . . . . . 11 ⊢ Ⅎ𝑘 𝑦 = 𝐴
14	12, 13	nfan 1907	. . . . . . . . . 10 ⊢ Ⅎ𝑘(𝑓 = 𝐹 ∧ 𝑦 = 𝐴)
15		fveq1 6694	. . . . . . . . . . . . 13 ⊢ (𝑓 = 𝐹 → (𝑓‘𝑘) = (𝐹‘𝑘))
16	15	adantr 484	. . . . . . . . . . . 12 ⊢ ((𝑓 = 𝐹 ∧ 𝑦 = 𝐴) → (𝑓‘𝑘) = (𝐹‘𝑘))
17	16	eleq1d 2815	. . . . . . . . . . 11 ⊢ ((𝑓 = 𝐹 ∧ 𝑦 = 𝐴) → ((𝑓‘𝑘) ∈ ℂ ↔ (𝐹‘𝑘) ∈ ℂ))
18		oveq12 7200	. . . . . . . . . . . . . 14 ⊢ (((𝑓‘𝑘) = (𝐹‘𝑘) ∧ 𝑦 = 𝐴) → ((𝑓‘𝑘) − 𝑦) = ((𝐹‘𝑘) − 𝐴))
19	15, 18	sylan 583	. . . . . . . . . . . . 13 ⊢ ((𝑓 = 𝐹 ∧ 𝑦 = 𝐴) → ((𝑓‘𝑘) − 𝑦) = ((𝐹‘𝑘) − 𝐴))
20	19	fveq2d 6699	. . . . . . . . . . . 12 ⊢ ((𝑓 = 𝐹 ∧ 𝑦 = 𝐴) → (abs‘((𝑓‘𝑘) − 𝑦)) = (abs‘((𝐹‘𝑘) − 𝐴)))
21	20	breq1d 5049	. . . . . . . . . . 11 ⊢ ((𝑓 = 𝐹 ∧ 𝑦 = 𝐴) → ((abs‘((𝑓‘𝑘) − 𝑦)) < 𝑥 ↔ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝑥))
22	17, 21	anbi12d 634	. . . . . . . . . 10 ⊢ ((𝑓 = 𝐹 ∧ 𝑦 = 𝐴) → (((𝑓‘𝑘) ∈ ℂ ∧ (abs‘((𝑓‘𝑘) − 𝑦)) < 𝑥) ↔ ((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝑥)))
23	14, 22	ralbid 3144	. . . . . . . . 9 ⊢ ((𝑓 = 𝐹 ∧ 𝑦 = 𝐴) → (∀𝑘 ∈ (ℤ≥‘𝑗)((𝑓‘𝑘) ∈ ℂ ∧ (abs‘((𝑓‘𝑘) − 𝑦)) < 𝑥) ↔ ∀𝑘 ∈ (ℤ≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝑥)))
24	23	rexbidv 3206	. . . . . . . 8 ⊢ ((𝑓 = 𝐹 ∧ 𝑦 = 𝐴) → (∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)((𝑓‘𝑘) ∈ ℂ ∧ (abs‘((𝑓‘𝑘) − 𝑦)) < 𝑥) ↔ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝑥)))
25	10, 24	ralbid 3144	. . . . . . 7 ⊢ ((𝑓 = 𝐹 ∧ 𝑦 = 𝐴) → (∀𝑥 ∈ ℝ+ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)((𝑓‘𝑘) ∈ ℂ ∧ (abs‘((𝑓‘𝑘) − 𝑦)) < 𝑥) ↔ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝑥)))
26	9, 25	anbi12d 634	. . . . . 6 ⊢ ((𝑓 = 𝐹 ∧ 𝑦 = 𝐴) → ((𝑦 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)((𝑓‘𝑘) ∈ ℂ ∧ (abs‘((𝑓‘𝑘) − 𝑦)) < 𝑥)) ↔ (𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝑥))))
27		df-clim 15014	. . . . . 6 ⊢ ⇝ = {⟨𝑓, 𝑦⟩ ∣ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)((𝑓‘𝑘) ∈ ℂ ∧ (abs‘((𝑓‘𝑘) − 𝑦)) < 𝑥))}
28	26, 27	brabga 5400	. . . . 5 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝐴 ∈ V) → (𝐹 ⇝ 𝐴 ↔ (𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝑥))))
29	28	ex 416	. . . 4 ⊢ (𝐹 ∈ 𝑉 → (𝐴 ∈ V → (𝐹 ⇝ 𝐴 ↔ (𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝑥)))))
30	7, 29	syl 17	. . 3 ⊢ (𝜑 → (𝐴 ∈ V → (𝐹 ⇝ 𝐴 ↔ (𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝑥)))))
31	3, 6, 30	pm5.21ndd 384	. 2 ⊢ (𝜑 → (𝐹 ⇝ 𝐴 ↔ (𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝑥))))
32		climf2.1	. . . . . 6 ⊢ Ⅎ𝑘𝜑
33		eluzelz 12413	. . . . . . 7 ⊢ (𝑘 ∈ (ℤ≥‘𝑗) → 𝑘 ∈ ℤ)
34		climf2.fv	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ ℤ) → (𝐹‘𝑘) = 𝐵)
35	34	eleq1d 2815	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ ℤ) → ((𝐹‘𝑘) ∈ ℂ ↔ 𝐵 ∈ ℂ))
36	34	fvoveq1d 7213	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ ℤ) → (abs‘((𝐹‘𝑘) − 𝐴)) = (abs‘(𝐵 − 𝐴)))
37	36	breq1d 5049	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ ℤ) → ((abs‘((𝐹‘𝑘) − 𝐴)) < 𝑥 ↔ (abs‘(𝐵 − 𝐴)) < 𝑥))
38	35, 37	anbi12d 634	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ ℤ) → (((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝑥) ↔ (𝐵 ∈ ℂ ∧ (abs‘(𝐵 − 𝐴)) < 𝑥)))
39	33, 38	sylan2 596	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝑗)) → (((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝑥) ↔ (𝐵 ∈ ℂ ∧ (abs‘(𝐵 − 𝐴)) < 𝑥)))
40	32, 39	ralbida 3143	. . . . 5 ⊢ (𝜑 → (∀𝑘 ∈ (ℤ≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝑥) ↔ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝐵 ∈ ℂ ∧ (abs‘(𝐵 − 𝐴)) < 𝑥)))
41	40	rexbidv 3206	. . . 4 ⊢ (𝜑 → (∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝑥) ↔ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝐵 ∈ ℂ ∧ (abs‘(𝐵 − 𝐴)) < 𝑥)))
42	41	ralbidv 3108	. . 3 ⊢ (𝜑 → (∀𝑥 ∈ ℝ+ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝑥) ↔ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝐵 ∈ ℂ ∧ (abs‘(𝐵 − 𝐴)) < 𝑥)))
43	42	anbi2d 632	. 2 ⊢ (𝜑 → ((𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝑥)) ↔ (𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝐵 ∈ ℂ ∧ (abs‘(𝐵 − 𝐴)) < 𝑥))))
44	31, 43	bitrd 282	1 ⊢ (𝜑 → (𝐹 ⇝ 𝐴 ↔ (𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝐵 ∈ ℂ ∧ (abs‘(𝐵 − 𝐴)) < 𝑥))))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399   = wceq 1543  Ⅎwnf 1791   ∈ wcel 2112  Ⅎwnfc 2877  ∀wral 3051  ∃wrex 3052  Vcvv 3398   class class class wbr 5039  ‘cfv 6358  (class class class)co 7191  ℂcc 10692   < clt 10832   − cmin 11027  ℤcz 12141  ℤ_≥cuz 12403  ℝ⁺crp 12551  abscabs 14762   ⇝ cli 15010

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1976  ax-7 2018  ax-8 2114  ax-9 2122  ax-10 2143  ax-11 2160  ax-12 2177  ax-ext 2708  ax-sep 5177  ax-nul 5184  ax-pr 5307  ax-cnex 10750  ax-resscn 10751

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 848  df-3or 1090  df-3an 1091  df-tru 1546  df-fal 1556  df-ex 1788  df-nf 1792  df-sb 2073  df-mo 2539  df-eu 2568  df-clab 2715  df-cleq 2728  df-clel 2809  df-nfc 2879  df-ne 2933  df-ral 3056  df-rex 3057  df-rab 3060  df-v 3400  df-sbc 3684  df-dif 3856  df-un 3858  df-in 3860  df-ss 3870  df-nul 4224  df-if 4426  df-pw 4501  df-sn 4528  df-pr 4530  df-op 4534  df-uni 4806  df-br 5040  df-opab 5102  df-mpt 5121  df-id 5440  df-xp 5542  df-rel 5543  df-cnv 5544  df-co 5545  df-dm 5546  df-rn 5547  df-res 5548  df-ima 5549  df-iota 6316  df-fun 6360  df-fn 6361  df-f 6362  df-fv 6366  df-ov 7194  df-neg 11030  df-z 12142  df-uz 12404  df-clim 15014

This theorem is referenced by:  clim2f2  42829