Theorem climf2 46949

Description: Express the predicate: The limit of complex number sequence 𝐹 is 𝐴, or 𝐹 converges to 𝐴. Similar to clim 15705, 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 15703	. . . . 5 ⊢ Rel ⇝
2	1	brrelex2i 5715	. . . 4 ⊢ (𝐹 ⇝ 𝐴 → 𝐴 ∈ V)
3	2	a1i 11	. . 3 ⊢ (𝜑 → (𝐹 ⇝ 𝐴 → 𝐴 ∈ V))
4		elex 3475	. . . . 5 ⊢ (𝐴 ∈ ℂ → 𝐴 ∈ V)
5	4	adantr 486	. . . 4 ⊢ ((𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝑥)) → 𝐴 ∈ V)
6	5	a1i 11	. . 3 ⊢ (𝜑 → ((𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝑥)) → 𝐴 ∈ V))
7		climf2.f	. . . 4 ⊢ (𝜑 → 𝐹 ∈ 𝑉)
8		simpr 490	. . . . . . . 8 ⊢ ((𝑓 = 𝐹 ∧ 𝑦 = 𝐴) → 𝑦 = 𝐴)
9	8	eleq1d 2849	. . . . . . 7 ⊢ ((𝑓 = 𝐹 ∧ 𝑦 = 𝐴) → (𝑦 ∈ ℂ ↔ 𝐴 ∈ ℂ))
10		nfv 1949	. . . . . . . 8 ⊢ Ⅎ𝑥(𝑓 = 𝐹 ∧ 𝑦 = 𝐴)
11		climf2.nf	. . . . . . . . . . . 12 ⊢ Ⅎ𝑘𝐹
12	11	nfeq2 2943	. . . . . . . . . . 11 ⊢ Ⅎ𝑘 𝑓 = 𝐹
13		nfv 1949	. . . . . . . . . . 11 ⊢ Ⅎ𝑘 𝑦 = 𝐴
14	12, 13	nfan 1934	. . . . . . . . . 10 ⊢ Ⅎ𝑘(𝑓 = 𝐹 ∧ 𝑦 = 𝐴)
15		fveq1 6915	. . . . . . . . . . . . 13 ⊢ (𝑓 = 𝐹 → (𝑓‘𝑘) = (𝐹‘𝑘))
16	15	adantr 486	. . . . . . . . . . . 12 ⊢ ((𝑓 = 𝐹 ∧ 𝑦 = 𝐴) → (𝑓‘𝑘) = (𝐹‘𝑘))
17	16	eleq1d 2849	. . . . . . . . . . 11 ⊢ ((𝑓 = 𝐹 ∧ 𝑦 = 𝐴) → ((𝑓‘𝑘) ∈ ℂ ↔ (𝐹‘𝑘) ∈ ℂ))
18		oveq12 7460	. . . . . . . . . . . . . 14 ⊢ (((𝑓‘𝑘) = (𝐹‘𝑘) ∧ 𝑦 = 𝐴) → ((𝑓‘𝑘) − 𝑦) = ((𝐹‘𝑘) − 𝐴))
19	15, 18	sylan 592	. . . . . . . . . . . . 13 ⊢ ((𝑓 = 𝐹 ∧ 𝑦 = 𝐴) → ((𝑓‘𝑘) − 𝑦) = ((𝐹‘𝑘) − 𝐴))
20	19	fveq2d 6920	. . . . . . . . . . . 12 ⊢ ((𝑓 = 𝐹 ∧ 𝑦 = 𝐴) → (abs‘((𝑓‘𝑘) − 𝑦)) = (abs‘((𝐹‘𝑘) − 𝐴)))
21	20	breq1d 5118	. . . . . . . . . . 11 ⊢ ((𝑓 = 𝐹 ∧ 𝑦 = 𝐴) → ((abs‘((𝑓‘𝑘) − 𝑦)) < 𝑥 ↔ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝑥))
22	17, 21	anbi12d 644	. . . . . . . . . 10 ⊢ ((𝑓 = 𝐹 ∧ 𝑦 = 𝐴) → (((𝑓‘𝑘) ∈ ℂ ∧ (abs‘((𝑓‘𝑘) − 𝑦)) < 𝑥) ↔ ((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝑥)))
23	14, 22	ralbid 3279	. . . . . . . . 9 ⊢ ((𝑓 = 𝐹 ∧ 𝑦 = 𝐴) → (∀𝑘 ∈ (ℤ≥‘𝑗)((𝑓‘𝑘) ∈ ℂ ∧ (abs‘((𝑓‘𝑘) − 𝑦)) < 𝑥) ↔ ∀𝑘 ∈ (ℤ≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝑥)))
24	23	rexbidv 3190	. . . . . . . 8 ⊢ ((𝑓 = 𝐹 ∧ 𝑦 = 𝐴) → (∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)((𝑓‘𝑘) ∈ ℂ ∧ (abs‘((𝑓‘𝑘) − 𝑦)) < 𝑥) ↔ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝑥)))
25	10, 24	ralbid 3279	. . . . . . 7 ⊢ ((𝑓 = 𝐹 ∧ 𝑦 = 𝐴) → (∀𝑥 ∈ ℝ+ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)((𝑓‘𝑘) ∈ ℂ ∧ (abs‘((𝑓‘𝑘) − 𝑦)) < 𝑥) ↔ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝑥)))
26	9, 25	anbi12d 644	. . . . . 6 ⊢ ((𝑓 = 𝐹 ∧ 𝑦 = 𝐴) → ((𝑦 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)((𝑓‘𝑘) ∈ ℂ ∧ (abs‘((𝑓‘𝑘) − 𝑦)) < 𝑥)) ↔ (𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝑥))))
27		df-clim 15699	. . . . . 6 ⊢ ⇝ = {⟨𝑓, 𝑦⟩ ∣ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)((𝑓‘𝑘) ∈ ℂ ∧ (abs‘((𝑓‘𝑘) − 𝑦)) < 𝑥))}
28	26, 27	brabga 5515	. . . . 5 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝐴 ∈ V) → (𝐹 ⇝ 𝐴 ↔ (𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝑥))))
29	28	ex 418	. . . 4 ⊢ (𝐹 ∈ 𝑉 → (𝐴 ∈ V → (𝐹 ⇝ 𝐴 ↔ (𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝑥)))))
30	7, 29	syl 18	. . 3 ⊢ (𝜑 → (𝐴 ∈ V → (𝐹 ⇝ 𝐴 ↔ (𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝑥)))))
31	3, 6, 30	pm5.21ndd 382	. 2 ⊢ (𝜑 → (𝐹 ⇝ 𝐴 ↔ (𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝑥))))
32		climf2.1	. . . . . 6 ⊢ Ⅎ𝑘𝜑
33		eluzelz 13015	. . . . . . 7 ⊢ (𝑘 ∈ (ℤ≥‘𝑗) → 𝑘 ∈ ℤ)
34		climf2.fv	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ ℤ) → (𝐹‘𝑘) = 𝐵)
35	34	eleq1d 2849	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ ℤ) → ((𝐹‘𝑘) ∈ ℂ ↔ 𝐵 ∈ ℂ))
36	34	fvoveq1d 7473	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ ℤ) → (abs‘((𝐹‘𝑘) − 𝐴)) = (abs‘(𝐵 − 𝐴)))
37	36	breq1d 5118	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ ℤ) → ((abs‘((𝐹‘𝑘) − 𝐴)) < 𝑥 ↔ (abs‘(𝐵 − 𝐴)) < 𝑥))
38	35, 37	anbi12d 644	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ ℤ) → (((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝑥) ↔ (𝐵 ∈ ℂ ∧ (abs‘(𝐵 − 𝐴)) < 𝑥)))
39	33, 38	sylan2 605	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ≥‘𝑗)) → (((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝑥) ↔ (𝐵 ∈ ℂ ∧ (abs‘(𝐵 − 𝐴)) < 𝑥)))
40	32, 39	ralbida 3277	. . . . 5 ⊢ (𝜑 → (∀𝑘 ∈ (ℤ≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝑥) ↔ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝐵 ∈ ℂ ∧ (abs‘(𝐵 − 𝐴)) < 𝑥)))
41	40	rexbidv 3190	. . . 4 ⊢ (𝜑 → (∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝑥) ↔ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝐵 ∈ ℂ ∧ (abs‘(𝐵 − 𝐴)) < 𝑥)))
42	41	ralbidv 3189	. . 3 ⊢ (𝜑 → (∀𝑥 ∈ ℝ+ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝑥) ↔ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝐵 ∈ ℂ ∧ (abs‘(𝐵 − 𝐴)) < 𝑥)))
43	42	anbi2d 642	. 2 ⊢ (𝜑 → ((𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)((𝐹‘𝑘) ∈ ℂ ∧ (abs‘((𝐹‘𝑘) − 𝐴)) < 𝑥)) ↔ (𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝐵 ∈ ℂ ∧ (abs‘(𝐵 − 𝐴)) < 𝑥))))
44	31, 43	bitrd 282	1 ⊢ (𝜑 → (𝐹 ⇝ 𝐴 ↔ (𝐴 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝐵 ∈ ℂ ∧ (abs‘(𝐵 − 𝐴)) < 𝑥))))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570  Ⅎwnf 1816   ∈ wcel 2147  Ⅎwnfc 2911  ∀wral 3080  ∃wrex 3090  Vcvv 3454   class class class wbr 5108  ‘cfv 6566  (class class class)co 7451  ℂcc 11237   < clt 11382   − cmin 11580  ℤcz 12733  ℤ_≥cuz 13005  ℝ⁺crp 13160  abscabs 15444   ⇝ cli 15695

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pr 5398  ax-cnex 11295  ax-resscn 11296

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-fv 6574  df-ov 7454  df-neg 11583  df-z 12734  df-uz 13006  df-clim 15699

This theorem is used by:  clim2f2  46953