Theorem rlim 15448

Description: Express the predicate: The limit of complex number function 𝐹 is 𝐶, or 𝐹 converges to 𝐶, in the real sense. This means that for any real 𝑥, no matter how small, there always exists a number 𝑦 such that the absolute difference of any number in the function beyond 𝑦 and the limit is less than 𝑥. (Contributed by Mario Carneiro, 16-Sep-2014.) (Revised by Mario Carneiro, 28-Apr-2015.)

Hypotheses

Ref	Expression
rlim.1	⊢ (𝜑 → 𝐹:𝐴⟶ℂ)
rlim.2	⊢ (𝜑 → 𝐴 ⊆ ℝ)
rlim.4	⊢ ((𝜑 ∧ 𝑧 ∈ 𝐴) → (𝐹‘𝑧) = 𝐵)

Assertion

Ref	Expression
rlim	⊢ (𝜑 → (𝐹 ⇝𝑟 𝐶 ↔ (𝐶 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℝ ∀𝑧 ∈ 𝐴 (𝑦 ≤ 𝑧 → (abs‘(𝐵 − 𝐶)) < 𝑥))))

Distinct variable groups:   𝑧,𝐴   𝑥,𝑦,𝑧,𝐶   𝑥,𝐹,𝑦,𝑧   𝜑,𝑥,𝑦,𝑧

Allowed substitution hints:   𝐴(𝑥,𝑦)   𝐵(𝑥,𝑦,𝑧)

Proof of Theorem rlim

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

Step	Hyp	Ref	Expression
1		rlimrel 15446	. . . . 5 ⊢ Rel ⇝𝑟
2	1	brrelex2i 5681	. . . 4 ⊢ (𝐹 ⇝𝑟 𝐶 → 𝐶 ∈ V)
3	2	a1i 11	. . 3 ⊢ (𝜑 → (𝐹 ⇝𝑟 𝐶 → 𝐶 ∈ V))
4		elex 3451	. . . . 5 ⊢ (𝐶 ∈ ℂ → 𝐶 ∈ V)
5	4	ad2antrl 729	. . . 4 ⊢ ((𝐹 ∈ (ℂ ↑pm ℝ) ∧ (𝐶 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℝ ∀𝑧 ∈ dom 𝐹(𝑦 ≤ 𝑧 → (abs‘((𝐹‘𝑧) − 𝐶)) < 𝑥))) → 𝐶 ∈ V)
6	5	a1i 11	. . 3 ⊢ (𝜑 → ((𝐹 ∈ (ℂ ↑pm ℝ) ∧ (𝐶 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℝ ∀𝑧 ∈ dom 𝐹(𝑦 ≤ 𝑧 → (abs‘((𝐹‘𝑧) − 𝐶)) < 𝑥))) → 𝐶 ∈ V))
7		rlim.1	. . . . 5 ⊢ (𝜑 → 𝐹:𝐴⟶ℂ)
8		rlim.2	. . . . 5 ⊢ (𝜑 → 𝐴 ⊆ ℝ)
9		cnex 11110	. . . . . 6 ⊢ ℂ ∈ V
10		reex 11120	. . . . . 6 ⊢ ℝ ∈ V
11		elpm2r 8785	. . . . . 6 ⊢ (((ℂ ∈ V ∧ ℝ ∈ V) ∧ (𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℝ)) → 𝐹 ∈ (ℂ ↑pm ℝ))
12	9, 10, 11	mpanl12 703	. . . . 5 ⊢ ((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℝ) → 𝐹 ∈ (ℂ ↑pm ℝ))
13	7, 8, 12	syl2anc 585	. . . 4 ⊢ (𝜑 → 𝐹 ∈ (ℂ ↑pm ℝ))
14		eleq1 2825	. . . . . . . . 9 ⊢ (𝑓 = 𝐹 → (𝑓 ∈ (ℂ ↑pm ℝ) ↔ 𝐹 ∈ (ℂ ↑pm ℝ)))
15		eleq1 2825	. . . . . . . . 9 ⊢ (𝑤 = 𝐶 → (𝑤 ∈ ℂ ↔ 𝐶 ∈ ℂ))
16	14, 15	bi2anan9 639	. . . . . . . 8 ⊢ ((𝑓 = 𝐹 ∧ 𝑤 = 𝐶) → ((𝑓 ∈ (ℂ ↑pm ℝ) ∧ 𝑤 ∈ ℂ) ↔ (𝐹 ∈ (ℂ ↑pm ℝ) ∧ 𝐶 ∈ ℂ)))
17		simpl 482	. . . . . . . . . . . 12 ⊢ ((𝑓 = 𝐹 ∧ 𝑤 = 𝐶) → 𝑓 = 𝐹)
18	17	dmeqd 5854	. . . . . . . . . . 11 ⊢ ((𝑓 = 𝐹 ∧ 𝑤 = 𝐶) → dom 𝑓 = dom 𝐹)
19		fveq1 6833	. . . . . . . . . . . . . . 15 ⊢ (𝑓 = 𝐹 → (𝑓‘𝑧) = (𝐹‘𝑧))
20		oveq12 7369	. . . . . . . . . . . . . . 15 ⊢ (((𝑓‘𝑧) = (𝐹‘𝑧) ∧ 𝑤 = 𝐶) → ((𝑓‘𝑧) − 𝑤) = ((𝐹‘𝑧) − 𝐶))
21	19, 20	sylan 581	. . . . . . . . . . . . . 14 ⊢ ((𝑓 = 𝐹 ∧ 𝑤 = 𝐶) → ((𝑓‘𝑧) − 𝑤) = ((𝐹‘𝑧) − 𝐶))
22	21	fveq2d 6838	. . . . . . . . . . . . 13 ⊢ ((𝑓 = 𝐹 ∧ 𝑤 = 𝐶) → (abs‘((𝑓‘𝑧) − 𝑤)) = (abs‘((𝐹‘𝑧) − 𝐶)))
23	22	breq1d 5096	. . . . . . . . . . . 12 ⊢ ((𝑓 = 𝐹 ∧ 𝑤 = 𝐶) → ((abs‘((𝑓‘𝑧) − 𝑤)) < 𝑥 ↔ (abs‘((𝐹‘𝑧) − 𝐶)) < 𝑥))
24	23	imbi2d 340	. . . . . . . . . . 11 ⊢ ((𝑓 = 𝐹 ∧ 𝑤 = 𝐶) → ((𝑦 ≤ 𝑧 → (abs‘((𝑓‘𝑧) − 𝑤)) < 𝑥) ↔ (𝑦 ≤ 𝑧 → (abs‘((𝐹‘𝑧) − 𝐶)) < 𝑥)))
25	18, 24	raleqbidv 3312	. . . . . . . . . 10 ⊢ ((𝑓 = 𝐹 ∧ 𝑤 = 𝐶) → (∀𝑧 ∈ dom 𝑓(𝑦 ≤ 𝑧 → (abs‘((𝑓‘𝑧) − 𝑤)) < 𝑥) ↔ ∀𝑧 ∈ dom 𝐹(𝑦 ≤ 𝑧 → (abs‘((𝐹‘𝑧) − 𝐶)) < 𝑥)))
26	25	rexbidv 3162	. . . . . . . . 9 ⊢ ((𝑓 = 𝐹 ∧ 𝑤 = 𝐶) → (∃𝑦 ∈ ℝ ∀𝑧 ∈ dom 𝑓(𝑦 ≤ 𝑧 → (abs‘((𝑓‘𝑧) − 𝑤)) < 𝑥) ↔ ∃𝑦 ∈ ℝ ∀𝑧 ∈ dom 𝐹(𝑦 ≤ 𝑧 → (abs‘((𝐹‘𝑧) − 𝐶)) < 𝑥)))
27	26	ralbidv 3161	. . . . . . . 8 ⊢ ((𝑓 = 𝐹 ∧ 𝑤 = 𝐶) → (∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℝ ∀𝑧 ∈ dom 𝑓(𝑦 ≤ 𝑧 → (abs‘((𝑓‘𝑧) − 𝑤)) < 𝑥) ↔ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℝ ∀𝑧 ∈ dom 𝐹(𝑦 ≤ 𝑧 → (abs‘((𝐹‘𝑧) − 𝐶)) < 𝑥)))
28	16, 27	anbi12d 633	. . . . . . 7 ⊢ ((𝑓 = 𝐹 ∧ 𝑤 = 𝐶) → (((𝑓 ∈ (ℂ ↑pm ℝ) ∧ 𝑤 ∈ ℂ) ∧ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℝ ∀𝑧 ∈ dom 𝑓(𝑦 ≤ 𝑧 → (abs‘((𝑓‘𝑧) − 𝑤)) < 𝑥)) ↔ ((𝐹 ∈ (ℂ ↑pm ℝ) ∧ 𝐶 ∈ ℂ) ∧ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℝ ∀𝑧 ∈ dom 𝐹(𝑦 ≤ 𝑧 → (abs‘((𝐹‘𝑧) − 𝐶)) < 𝑥))))
29		df-rlim 15442	. . . . . . 7 ⊢ ⇝𝑟 = {⟨𝑓, 𝑤⟩ ∣ ((𝑓 ∈ (ℂ ↑pm ℝ) ∧ 𝑤 ∈ ℂ) ∧ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℝ ∀𝑧 ∈ dom 𝑓(𝑦 ≤ 𝑧 → (abs‘((𝑓‘𝑧) − 𝑤)) < 𝑥))}
30	28, 29	brabga 5482	. . . . . 6 ⊢ ((𝐹 ∈ (ℂ ↑pm ℝ) ∧ 𝐶 ∈ V) → (𝐹 ⇝𝑟 𝐶 ↔ ((𝐹 ∈ (ℂ ↑pm ℝ) ∧ 𝐶 ∈ ℂ) ∧ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℝ ∀𝑧 ∈ dom 𝐹(𝑦 ≤ 𝑧 → (abs‘((𝐹‘𝑧) − 𝐶)) < 𝑥))))
31		anass 468	. . . . . 6 ⊢ (((𝐹 ∈ (ℂ ↑pm ℝ) ∧ 𝐶 ∈ ℂ) ∧ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℝ ∀𝑧 ∈ dom 𝐹(𝑦 ≤ 𝑧 → (abs‘((𝐹‘𝑧) − 𝐶)) < 𝑥)) ↔ (𝐹 ∈ (ℂ ↑pm ℝ) ∧ (𝐶 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℝ ∀𝑧 ∈ dom 𝐹(𝑦 ≤ 𝑧 → (abs‘((𝐹‘𝑧) − 𝐶)) < 𝑥))))
32	30, 31	bitrdi 287	. . . . 5 ⊢ ((𝐹 ∈ (ℂ ↑pm ℝ) ∧ 𝐶 ∈ V) → (𝐹 ⇝𝑟 𝐶 ↔ (𝐹 ∈ (ℂ ↑pm ℝ) ∧ (𝐶 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℝ ∀𝑧 ∈ dom 𝐹(𝑦 ≤ 𝑧 → (abs‘((𝐹‘𝑧) − 𝐶)) < 𝑥)))))
33	32	ex 412	. . . 4 ⊢ (𝐹 ∈ (ℂ ↑pm ℝ) → (𝐶 ∈ V → (𝐹 ⇝𝑟 𝐶 ↔ (𝐹 ∈ (ℂ ↑pm ℝ) ∧ (𝐶 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℝ ∀𝑧 ∈ dom 𝐹(𝑦 ≤ 𝑧 → (abs‘((𝐹‘𝑧) − 𝐶)) < 𝑥))))))
34	13, 33	syl 17	. . 3 ⊢ (𝜑 → (𝐶 ∈ V → (𝐹 ⇝𝑟 𝐶 ↔ (𝐹 ∈ (ℂ ↑pm ℝ) ∧ (𝐶 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℝ ∀𝑧 ∈ dom 𝐹(𝑦 ≤ 𝑧 → (abs‘((𝐹‘𝑧) − 𝐶)) < 𝑥))))))
35	3, 6, 34	pm5.21ndd 379	. 2 ⊢ (𝜑 → (𝐹 ⇝𝑟 𝐶 ↔ (𝐹 ∈ (ℂ ↑pm ℝ) ∧ (𝐶 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℝ ∀𝑧 ∈ dom 𝐹(𝑦 ≤ 𝑧 → (abs‘((𝐹‘𝑧) − 𝐶)) < 𝑥)))))
36	13	biantrurd 532	. 2 ⊢ (𝜑 → ((𝐶 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℝ ∀𝑧 ∈ dom 𝐹(𝑦 ≤ 𝑧 → (abs‘((𝐹‘𝑧) − 𝐶)) < 𝑥)) ↔ (𝐹 ∈ (ℂ ↑pm ℝ) ∧ (𝐶 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℝ ∀𝑧 ∈ dom 𝐹(𝑦 ≤ 𝑧 → (abs‘((𝐹‘𝑧) − 𝐶)) < 𝑥)))))
37	7	fdmd 6672	. . . . . . 7 ⊢ (𝜑 → dom 𝐹 = 𝐴)
38	37	raleqdv 3296	. . . . . 6 ⊢ (𝜑 → (∀𝑧 ∈ dom 𝐹(𝑦 ≤ 𝑧 → (abs‘((𝐹‘𝑧) − 𝐶)) < 𝑥) ↔ ∀𝑧 ∈ 𝐴 (𝑦 ≤ 𝑧 → (abs‘((𝐹‘𝑧) − 𝐶)) < 𝑥)))
39		rlim.4	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐴) → (𝐹‘𝑧) = 𝐵)
40	39	fvoveq1d 7382	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐴) → (abs‘((𝐹‘𝑧) − 𝐶)) = (abs‘(𝐵 − 𝐶)))
41	40	breq1d 5096	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐴) → ((abs‘((𝐹‘𝑧) − 𝐶)) < 𝑥 ↔ (abs‘(𝐵 − 𝐶)) < 𝑥))
42	41	imbi2d 340	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐴) → ((𝑦 ≤ 𝑧 → (abs‘((𝐹‘𝑧) − 𝐶)) < 𝑥) ↔ (𝑦 ≤ 𝑧 → (abs‘(𝐵 − 𝐶)) < 𝑥)))
43	42	ralbidva 3159	. . . . . 6 ⊢ (𝜑 → (∀𝑧 ∈ 𝐴 (𝑦 ≤ 𝑧 → (abs‘((𝐹‘𝑧) − 𝐶)) < 𝑥) ↔ ∀𝑧 ∈ 𝐴 (𝑦 ≤ 𝑧 → (abs‘(𝐵 − 𝐶)) < 𝑥)))
44	38, 43	bitrd 279	. . . . 5 ⊢ (𝜑 → (∀𝑧 ∈ dom 𝐹(𝑦 ≤ 𝑧 → (abs‘((𝐹‘𝑧) − 𝐶)) < 𝑥) ↔ ∀𝑧 ∈ 𝐴 (𝑦 ≤ 𝑧 → (abs‘(𝐵 − 𝐶)) < 𝑥)))
45	44	rexbidv 3162	. . . 4 ⊢ (𝜑 → (∃𝑦 ∈ ℝ ∀𝑧 ∈ dom 𝐹(𝑦 ≤ 𝑧 → (abs‘((𝐹‘𝑧) − 𝐶)) < 𝑥) ↔ ∃𝑦 ∈ ℝ ∀𝑧 ∈ 𝐴 (𝑦 ≤ 𝑧 → (abs‘(𝐵 − 𝐶)) < 𝑥)))
46	45	ralbidv 3161	. . 3 ⊢ (𝜑 → (∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℝ ∀𝑧 ∈ dom 𝐹(𝑦 ≤ 𝑧 → (abs‘((𝐹‘𝑧) − 𝐶)) < 𝑥) ↔ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℝ ∀𝑧 ∈ 𝐴 (𝑦 ≤ 𝑧 → (abs‘(𝐵 − 𝐶)) < 𝑥)))
47	46	anbi2d 631	. 2 ⊢ (𝜑 → ((𝐶 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℝ ∀𝑧 ∈ dom 𝐹(𝑦 ≤ 𝑧 → (abs‘((𝐹‘𝑧) − 𝐶)) < 𝑥)) ↔ (𝐶 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℝ ∀𝑧 ∈ 𝐴 (𝑦 ≤ 𝑧 → (abs‘(𝐵 − 𝐶)) < 𝑥))))
48	35, 36, 47	3bitr2d 307	1 ⊢ (𝜑 → (𝐹 ⇝𝑟 𝐶 ↔ (𝐶 ∈ ℂ ∧ ∀𝑥 ∈ ℝ+ ∃𝑦 ∈ ℝ ∀𝑧 ∈ 𝐴 (𝑦 ≤ 𝑧 → (abs‘(𝐵 − 𝐶)) < 𝑥))))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1542   ∈ wcel 2114  ∀wral 3052  ∃wrex 3062  Vcvv 3430   ⊆ wss 3890   class class class wbr 5086  dom cdm 5624  ⟶wf 6488  ‘cfv 6492  (class class class)co 7360   ↑_pm cpm 8767  ℂcc 11027  ℝcr 11028   < clt 11170   ≤ cle 11171   − cmin 11368  ℝ⁺crp 12933  abscabs 15187   ⇝_𝑟 crli 15438

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 2709  ax-sep 5231  ax-pow 5302  ax-pr 5370  ax-un 7682  ax-cnex 11085  ax-resscn 11086

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3391  df-v 3432  df-sbc 3730  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-br 5087  df-opab 5149  df-id 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-fv 6500  df-ov 7363  df-oprab 7364  df-mpo 7365  df-pm 8769  df-rlim 15442

This theorem is referenced by:  rlim2  15449  rlimcl  15456  rlimclim  15499  rlimres  15511  caurcvgr  15627