addlimc - Mathbox for Glauco Siliprandi

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

Theorem addlimc 44849

Description: Sum of two limits. (Contributed by Glauco Siliprandi, 11-Dec-2019.)

**Hypotheses**
Ref	Expression
addlimc.f	⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵)
addlimc.g	⊢ 𝐺 = (𝑥 ∈ 𝐴 ↦ 𝐶)
addlimc.h	⊢ 𝐻 = (𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶))
addlimc.b	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℂ)
addlimc.c	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐶 ∈ ℂ)
addlimc.e	⊢ (𝜑 → 𝐸 ∈ (𝐹 lim_ℂ 𝐷))
addlimc.i	⊢ (𝜑 → 𝐼 ∈ (𝐺 lim_ℂ 𝐷))

**Assertion**
Ref	Expression
addlimc	⊢ (𝜑 → (𝐸 + 𝐼) ∈ (𝐻 lim_ℂ 𝐷))

Distinct variable groups: 𝑥,𝐴 𝜑,𝑥 Allowed substitution hints: 𝐵(𝑥) 𝐶(𝑥) 𝐷(𝑥) 𝐸(𝑥) 𝐹(𝑥) 𝐺(𝑥) 𝐻(𝑥) 𝐼(𝑥)

Proof of Theorem addlimc Dummy variables 𝑎 𝑏 𝑣 𝑤 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		limccl 25726	. . . 4 ⊢ (𝐹 lim_ℂ 𝐷) ⊆ ℂ
2		addlimc.e	. . . 4 ⊢ (𝜑 → 𝐸 ∈ (𝐹 lim_ℂ 𝐷))
3	1, 2	sselid 3972	. . 3 ⊢ (𝜑 → 𝐸 ∈ ℂ)
4		limccl 25726	. . . 4 ⊢ (𝐺 lim_ℂ 𝐷) ⊆ ℂ
5		addlimc.i	. . . 4 ⊢ (𝜑 → 𝐼 ∈ (𝐺 lim_ℂ 𝐷))
6	4, 5	sselid 3972	. . 3 ⊢ (𝜑 → 𝐼 ∈ ℂ)
7	3, 6	addcld 11230	. 2 ⊢ (𝜑 → (𝐸 + 𝐼) ∈ ℂ)
8		addlimc.b	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℂ)
9		addlimc.f	. . . . . . . . . 10 ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵)
10	8, 9	fmptd 7105	. . . . . . . . 9 ⊢ (𝜑 → 𝐹:𝐴⟶ℂ)
11	9, 8, 2	limcmptdm 44836	. . . . . . . . 9 ⊢ (𝜑 → 𝐴 ⊆ ℂ)
12		limcrcl 25725	. . . . . . . . . . 11 ⊢ (𝐸 ∈ (𝐹 lim_ℂ 𝐷) → (𝐹:dom 𝐹⟶ℂ ∧ dom 𝐹 ⊆ ℂ ∧ 𝐷 ∈ ℂ))
13	2, 12	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → (𝐹:dom 𝐹⟶ℂ ∧ dom 𝐹 ⊆ ℂ ∧ 𝐷 ∈ ℂ))
14	13	simp3d 1141	. . . . . . . . 9 ⊢ (𝜑 → 𝐷 ∈ ℂ)
15	10, 11, 14	ellimc3 25730	. . . . . . . 8 ⊢ (𝜑 → (𝐸 ∈ (𝐹 lim_ℂ 𝐷) ↔ (𝐸 ∈ ℂ ∧ ∀𝑧 ∈ ℝ⁺ ∃𝑎 ∈ ℝ⁺ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑎) → (abs‘((𝐹‘𝑣) − 𝐸)) < 𝑧))))
16	2, 15	mpbid 231	. . . . . . 7 ⊢ (𝜑 → (𝐸 ∈ ℂ ∧ ∀𝑧 ∈ ℝ⁺ ∃𝑎 ∈ ℝ⁺ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑎) → (abs‘((𝐹‘𝑣) − 𝐸)) < 𝑧)))
17	16	simprd 495	. . . . . 6 ⊢ (𝜑 → ∀𝑧 ∈ ℝ⁺ ∃𝑎 ∈ ℝ⁺ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑎) → (abs‘((𝐹‘𝑣) − 𝐸)) < 𝑧))
18		rphalfcl 12998	. . . . . 6 ⊢ (𝑦 ∈ ℝ⁺ → (𝑦 / 2) ∈ ℝ⁺)
19		breq2 5142	. . . . . . . . 9 ⊢ (𝑧 = (𝑦 / 2) → ((abs‘((𝐹‘𝑣) − 𝐸)) < 𝑧 ↔ (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)))
20	19	imbi2d 340	. . . . . . . 8 ⊢ (𝑧 = (𝑦 / 2) → (((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑎) → (abs‘((𝐹‘𝑣) − 𝐸)) < 𝑧) ↔ ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑎) → (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2))))
21	20	rexralbidv 3212	. . . . . . 7 ⊢ (𝑧 = (𝑦 / 2) → (∃𝑎 ∈ ℝ⁺ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑎) → (abs‘((𝐹‘𝑣) − 𝐸)) < 𝑧) ↔ ∃𝑎 ∈ ℝ⁺ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑎) → (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2))))
22	21	rspccva 3603	. . . . . 6 ⊢ ((∀𝑧 ∈ ℝ⁺ ∃𝑎 ∈ ℝ⁺ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑎) → (abs‘((𝐹‘𝑣) − 𝐸)) < 𝑧) ∧ (𝑦 / 2) ∈ ℝ⁺) → ∃𝑎 ∈ ℝ⁺ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑎) → (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)))
23	17, 18, 22	syl2an 595	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ⁺) → ∃𝑎 ∈ ℝ⁺ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑎) → (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)))
24		addlimc.c	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐶 ∈ ℂ)
25		addlimc.g	. . . . . . . . . 10 ⊢ 𝐺 = (𝑥 ∈ 𝐴 ↦ 𝐶)
26	24, 25	fmptd 7105	. . . . . . . . 9 ⊢ (𝜑 → 𝐺:𝐴⟶ℂ)
27	26, 11, 14	ellimc3 25730	. . . . . . . 8 ⊢ (𝜑 → (𝐼 ∈ (𝐺 lim_ℂ 𝐷) ↔ (𝐼 ∈ ℂ ∧ ∀𝑧 ∈ ℝ⁺ ∃𝑏 ∈ ℝ⁺ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑏) → (abs‘((𝐺‘𝑣) − 𝐼)) < 𝑧))))
28	5, 27	mpbid 231	. . . . . . 7 ⊢ (𝜑 → (𝐼 ∈ ℂ ∧ ∀𝑧 ∈ ℝ⁺ ∃𝑏 ∈ ℝ⁺ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑏) → (abs‘((𝐺‘𝑣) − 𝐼)) < 𝑧)))
29	28	simprd 495	. . . . . 6 ⊢ (𝜑 → ∀𝑧 ∈ ℝ⁺ ∃𝑏 ∈ ℝ⁺ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑏) → (abs‘((𝐺‘𝑣) − 𝐼)) < 𝑧))
30		breq2 5142	. . . . . . . . 9 ⊢ (𝑧 = (𝑦 / 2) → ((abs‘((𝐺‘𝑣) − 𝐼)) < 𝑧 ↔ (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)))
31	30	imbi2d 340	. . . . . . . 8 ⊢ (𝑧 = (𝑦 / 2) → (((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑏) → (abs‘((𝐺‘𝑣) − 𝐼)) < 𝑧) ↔ ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑏) → (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2))))
32	31	rexralbidv 3212	. . . . . . 7 ⊢ (𝑧 = (𝑦 / 2) → (∃𝑏 ∈ ℝ⁺ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑏) → (abs‘((𝐺‘𝑣) − 𝐼)) < 𝑧) ↔ ∃𝑏 ∈ ℝ⁺ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑏) → (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2))))
33	32	rspccva 3603	. . . . . 6 ⊢ ((∀𝑧 ∈ ℝ⁺ ∃𝑏 ∈ ℝ⁺ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑏) → (abs‘((𝐺‘𝑣) − 𝐼)) < 𝑧) ∧ (𝑦 / 2) ∈ ℝ⁺) → ∃𝑏 ∈ ℝ⁺ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑏) → (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)))
34	29, 18, 33	syl2an 595	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ⁺) → ∃𝑏 ∈ ℝ⁺ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑏) → (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)))
35		reeanv 3218	. . . . 5 ⊢ (∃𝑎 ∈ ℝ⁺ ∃𝑏 ∈ ℝ⁺ (∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑎) → (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑏) → (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2))) ↔ (∃𝑎 ∈ ℝ⁺ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑎) → (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ ∃𝑏 ∈ ℝ⁺ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑏) → (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2))))
36	23, 34, 35	sylanbrc 582	. . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ⁺) → ∃𝑎 ∈ ℝ⁺ ∃𝑏 ∈ ℝ⁺ (∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑎) → (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑏) → (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2))))
37		ifcl 4565	. . . . . . . 8 ⊢ ((𝑎 ∈ ℝ⁺ ∧ 𝑏 ∈ ℝ⁺) → if(𝑎 ≤ 𝑏, 𝑎, 𝑏) ∈ ℝ⁺)
38	37	3ad2ant2 1131	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ (𝑎 ∈ ℝ⁺ ∧ 𝑏 ∈ ℝ⁺) ∧ (∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑎) → (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑏) → (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)))) → if(𝑎 ≤ 𝑏, 𝑎, 𝑏) ∈ ℝ⁺)
39		nfv 1909	. . . . . . . . 9 ⊢ Ⅎ𝑣(𝜑 ∧ 𝑦 ∈ ℝ⁺)
40		nfv 1909	. . . . . . . . 9 ⊢ Ⅎ𝑣(𝑎 ∈ ℝ⁺ ∧ 𝑏 ∈ ℝ⁺)
41		nfra1 3273	. . . . . . . . . 10 ⊢ Ⅎ𝑣∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑎) → (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2))
42		nfra1 3273	. . . . . . . . . 10 ⊢ Ⅎ𝑣∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑏) → (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2))
43	41, 42	nfan 1894	. . . . . . . . 9 ⊢ Ⅎ𝑣(∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑎) → (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑏) → (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)))
44	39, 40, 43	nf3an 1896	. . . . . . . 8 ⊢ Ⅎ𝑣((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ (𝑎 ∈ ℝ⁺ ∧ 𝑏 ∈ ℝ⁺) ∧ (∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑎) → (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑏) → (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2))))
45		simp11l 1281	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ (𝑎 ∈ ℝ⁺ ∧ 𝑏 ∈ ℝ⁺) ∧ (∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑎) → (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑏) → (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)))) ∧ 𝑣 ∈ 𝐴 ∧ (𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < if(𝑎 ≤ 𝑏, 𝑎, 𝑏))) → 𝜑)
46		simp2 1134	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ (𝑎 ∈ ℝ⁺ ∧ 𝑏 ∈ ℝ⁺) ∧ (∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑎) → (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑏) → (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)))) ∧ 𝑣 ∈ 𝐴 ∧ (𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < if(𝑎 ≤ 𝑏, 𝑎, 𝑏))) → 𝑣 ∈ 𝐴)
47	45, 46	jca 511	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ (𝑎 ∈ ℝ⁺ ∧ 𝑏 ∈ ℝ⁺) ∧ (∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑎) → (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑏) → (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)))) ∧ 𝑣 ∈ 𝐴 ∧ (𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < if(𝑎 ≤ 𝑏, 𝑎, 𝑏))) → (𝜑 ∧ 𝑣 ∈ 𝐴))
48		rpre 12979	. . . . . . . . . . . . . 14 ⊢ (𝑦 ∈ ℝ⁺ → 𝑦 ∈ ℝ)
49	48	adantl 481	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ⁺) → 𝑦 ∈ ℝ)
50	49	3ad2ant1 1130	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ (𝑎 ∈ ℝ⁺ ∧ 𝑏 ∈ ℝ⁺) ∧ (∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑎) → (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑏) → (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)))) → 𝑦 ∈ ℝ)
51	50	3ad2ant1 1130	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ (𝑎 ∈ ℝ⁺ ∧ 𝑏 ∈ ℝ⁺) ∧ (∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑎) → (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑏) → (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)))) ∧ 𝑣 ∈ 𝐴 ∧ (𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < if(𝑎 ≤ 𝑏, 𝑎, 𝑏))) → 𝑦 ∈ ℝ)
52		simp13l 1285	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ (𝑎 ∈ ℝ⁺ ∧ 𝑏 ∈ ℝ⁺) ∧ (∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑎) → (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑏) → (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)))) ∧ 𝑣 ∈ 𝐴 ∧ (𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < if(𝑎 ≤ 𝑏, 𝑎, 𝑏))) → ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑎) → (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)))
53		simp3l 1198	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ (𝑎 ∈ ℝ⁺ ∧ 𝑏 ∈ ℝ⁺) ∧ (∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑎) → (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑏) → (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)))) ∧ 𝑣 ∈ 𝐴 ∧ (𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < if(𝑎 ≤ 𝑏, 𝑎, 𝑏))) → 𝑣 ≠ 𝐷)
54	11	sselda 3974	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝐴) → 𝑣 ∈ ℂ)
55	45, 46, 54	syl2anc 583	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ (𝑎 ∈ ℝ⁺ ∧ 𝑏 ∈ ℝ⁺) ∧ (∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑎) → (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑏) → (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)))) ∧ 𝑣 ∈ 𝐴 ∧ (𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < if(𝑎 ≤ 𝑏, 𝑎, 𝑏))) → 𝑣 ∈ ℂ)
56	45, 14	syl 17	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ (𝑎 ∈ ℝ⁺ ∧ 𝑏 ∈ ℝ⁺) ∧ (∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑎) → (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑏) → (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)))) ∧ 𝑣 ∈ 𝐴 ∧ (𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < if(𝑎 ≤ 𝑏, 𝑎, 𝑏))) → 𝐷 ∈ ℂ)
57	55, 56	subcld 11568	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ (𝑎 ∈ ℝ⁺ ∧ 𝑏 ∈ ℝ⁺) ∧ (∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑎) → (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑏) → (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)))) ∧ 𝑣 ∈ 𝐴 ∧ (𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < if(𝑎 ≤ 𝑏, 𝑎, 𝑏))) → (𝑣 − 𝐷) ∈ ℂ)
58	57	abscld 15380	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ (𝑎 ∈ ℝ⁺ ∧ 𝑏 ∈ ℝ⁺) ∧ (∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑎) → (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑏) → (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)))) ∧ 𝑣 ∈ 𝐴 ∧ (𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < if(𝑎 ≤ 𝑏, 𝑎, 𝑏))) → (abs‘(𝑣 − 𝐷)) ∈ ℝ)
59	38	rpred 13013	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ (𝑎 ∈ ℝ⁺ ∧ 𝑏 ∈ ℝ⁺) ∧ (∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑎) → (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑏) → (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)))) → if(𝑎 ≤ 𝑏, 𝑎, 𝑏) ∈ ℝ)
60	59	3ad2ant1 1130	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ (𝑎 ∈ ℝ⁺ ∧ 𝑏 ∈ ℝ⁺) ∧ (∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑎) → (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑏) → (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)))) ∧ 𝑣 ∈ 𝐴 ∧ (𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < if(𝑎 ≤ 𝑏, 𝑎, 𝑏))) → if(𝑎 ≤ 𝑏, 𝑎, 𝑏) ∈ ℝ)
61		simpl 482	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑎 ∈ ℝ⁺ ∧ 𝑏 ∈ ℝ⁺) → 𝑎 ∈ ℝ⁺)
62	61	rpred 13013	. . . . . . . . . . . . . . . 16 ⊢ ((𝑎 ∈ ℝ⁺ ∧ 𝑏 ∈ ℝ⁺) → 𝑎 ∈ ℝ)
63	62	3ad2ant2 1131	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ (𝑎 ∈ ℝ⁺ ∧ 𝑏 ∈ ℝ⁺) ∧ (∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑎) → (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑏) → (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)))) → 𝑎 ∈ ℝ)
64	63	3ad2ant1 1130	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ (𝑎 ∈ ℝ⁺ ∧ 𝑏 ∈ ℝ⁺) ∧ (∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑎) → (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑏) → (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)))) ∧ 𝑣 ∈ 𝐴 ∧ (𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < if(𝑎 ≤ 𝑏, 𝑎, 𝑏))) → 𝑎 ∈ ℝ)
65		simp3r 1199	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ (𝑎 ∈ ℝ⁺ ∧ 𝑏 ∈ ℝ⁺) ∧ (∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑎) → (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑏) → (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)))) ∧ 𝑣 ∈ 𝐴 ∧ (𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < if(𝑎 ≤ 𝑏, 𝑎, 𝑏))) → (abs‘(𝑣 − 𝐷)) < if(𝑎 ≤ 𝑏, 𝑎, 𝑏))
66		simpr 484	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑎 ∈ ℝ⁺ ∧ 𝑏 ∈ ℝ⁺) → 𝑏 ∈ ℝ⁺)
67	66	rpred 13013	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑎 ∈ ℝ⁺ ∧ 𝑏 ∈ ℝ⁺) → 𝑏 ∈ ℝ)
68		min1 13165	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ) → if(𝑎 ≤ 𝑏, 𝑎, 𝑏) ≤ 𝑎)
69	62, 67, 68	syl2anc 583	. . . . . . . . . . . . . . . 16 ⊢ ((𝑎 ∈ ℝ⁺ ∧ 𝑏 ∈ ℝ⁺) → if(𝑎 ≤ 𝑏, 𝑎, 𝑏) ≤ 𝑎)
70	69	3ad2ant2 1131	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ (𝑎 ∈ ℝ⁺ ∧ 𝑏 ∈ ℝ⁺) ∧ (∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑎) → (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑏) → (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)))) → if(𝑎 ≤ 𝑏, 𝑎, 𝑏) ≤ 𝑎)
71	70	3ad2ant1 1130	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ (𝑎 ∈ ℝ⁺ ∧ 𝑏 ∈ ℝ⁺) ∧ (∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑎) → (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑏) → (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)))) ∧ 𝑣 ∈ 𝐴 ∧ (𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < if(𝑎 ≤ 𝑏, 𝑎, 𝑏))) → if(𝑎 ≤ 𝑏, 𝑎, 𝑏) ≤ 𝑎)
72	58, 60, 64, 65, 71	ltletrd 11371	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ (𝑎 ∈ ℝ⁺ ∧ 𝑏 ∈ ℝ⁺) ∧ (∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑎) → (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑏) → (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)))) ∧ 𝑣 ∈ 𝐴 ∧ (𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < if(𝑎 ≤ 𝑏, 𝑎, 𝑏))) → (abs‘(𝑣 − 𝐷)) < 𝑎)
73	53, 72	jca 511	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ (𝑎 ∈ ℝ⁺ ∧ 𝑏 ∈ ℝ⁺) ∧ (∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑎) → (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑏) → (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)))) ∧ 𝑣 ∈ 𝐴 ∧ (𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < if(𝑎 ≤ 𝑏, 𝑎, 𝑏))) → (𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑎))
74		rsp 3236	. . . . . . . . . . . 12 ⊢ (∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑎) → (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) → (𝑣 ∈ 𝐴 → ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑎) → (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2))))
75	52, 46, 73, 74	syl3c 66	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ (𝑎 ∈ ℝ⁺ ∧ 𝑏 ∈ ℝ⁺) ∧ (∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑎) → (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑏) → (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)))) ∧ 𝑣 ∈ 𝐴 ∧ (𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < if(𝑎 ≤ 𝑏, 𝑎, 𝑏))) → (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2))
76	47, 51, 75	jca31 514	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ (𝑎 ∈ ℝ⁺ ∧ 𝑏 ∈ ℝ⁺) ∧ (∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑎) → (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑏) → (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)))) ∧ 𝑣 ∈ 𝐴 ∧ (𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < if(𝑎 ≤ 𝑏, 𝑎, 𝑏))) → (((𝜑 ∧ 𝑣 ∈ 𝐴) ∧ 𝑦 ∈ ℝ) ∧ (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)))
77		simp13r 1286	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ (𝑎 ∈ ℝ⁺ ∧ 𝑏 ∈ ℝ⁺) ∧ (∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑎) → (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑏) → (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)))) ∧ 𝑣 ∈ 𝐴 ∧ (𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < if(𝑎 ≤ 𝑏, 𝑎, 𝑏))) → ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑏) → (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)))
78	67	3ad2ant2 1131	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ (𝑎 ∈ ℝ⁺ ∧ 𝑏 ∈ ℝ⁺) ∧ (∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑎) → (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑏) → (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)))) → 𝑏 ∈ ℝ)
79	78	3ad2ant1 1130	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ (𝑎 ∈ ℝ⁺ ∧ 𝑏 ∈ ℝ⁺) ∧ (∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑎) → (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑏) → (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)))) ∧ 𝑣 ∈ 𝐴 ∧ (𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < if(𝑎 ≤ 𝑏, 𝑎, 𝑏))) → 𝑏 ∈ ℝ)
80		min2 13166	. . . . . . . . . . . . . . . 16 ⊢ ((𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ) → if(𝑎 ≤ 𝑏, 𝑎, 𝑏) ≤ 𝑏)
81	62, 67, 80	syl2anc 583	. . . . . . . . . . . . . . 15 ⊢ ((𝑎 ∈ ℝ⁺ ∧ 𝑏 ∈ ℝ⁺) → if(𝑎 ≤ 𝑏, 𝑎, 𝑏) ≤ 𝑏)
82	81	3ad2ant2 1131	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ (𝑎 ∈ ℝ⁺ ∧ 𝑏 ∈ ℝ⁺) ∧ (∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑎) → (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑏) → (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)))) → if(𝑎 ≤ 𝑏, 𝑎, 𝑏) ≤ 𝑏)
83	82	3ad2ant1 1130	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ (𝑎 ∈ ℝ⁺ ∧ 𝑏 ∈ ℝ⁺) ∧ (∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑎) → (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑏) → (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)))) ∧ 𝑣 ∈ 𝐴 ∧ (𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < if(𝑎 ≤ 𝑏, 𝑎, 𝑏))) → if(𝑎 ≤ 𝑏, 𝑎, 𝑏) ≤ 𝑏)
84	58, 60, 79, 65, 83	ltletrd 11371	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ (𝑎 ∈ ℝ⁺ ∧ 𝑏 ∈ ℝ⁺) ∧ (∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑎) → (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑏) → (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)))) ∧ 𝑣 ∈ 𝐴 ∧ (𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < if(𝑎 ≤ 𝑏, 𝑎, 𝑏))) → (abs‘(𝑣 − 𝐷)) < 𝑏)
85	53, 84	jca 511	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ (𝑎 ∈ ℝ⁺ ∧ 𝑏 ∈ ℝ⁺) ∧ (∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑎) → (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑏) → (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)))) ∧ 𝑣 ∈ 𝐴 ∧ (𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < if(𝑎 ≤ 𝑏, 𝑎, 𝑏))) → (𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑏))
86		rsp 3236	. . . . . . . . . . 11 ⊢ (∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑏) → (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)) → (𝑣 ∈ 𝐴 → ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑏) → (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2))))
87	77, 46, 85, 86	syl3c 66	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ (𝑎 ∈ ℝ⁺ ∧ 𝑏 ∈ ℝ⁺) ∧ (∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑎) → (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑏) → (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)))) ∧ 𝑣 ∈ 𝐴 ∧ (𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < if(𝑎 ≤ 𝑏, 𝑎, 𝑏))) → (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2))
88	8, 24	addcld 11230	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐵 + 𝐶) ∈ ℂ)
89		addlimc.h	. . . . . . . . . . . . . . . 16 ⊢ 𝐻 = (𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶))
90	88, 89	fmptd 7105	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝐻:𝐴⟶ℂ)
91	90	ffvelcdmda 7076	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝐴) → (𝐻‘𝑣) ∈ ℂ)
92	91	ad3antrrr 727	. . . . . . . . . . . . 13 ⊢ (((((𝜑 ∧ 𝑣 ∈ 𝐴) ∧ 𝑦 ∈ ℝ) ∧ (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)) → (𝐻‘𝑣) ∈ ℂ)
93		simp-4l 780	. . . . . . . . . . . . . 14 ⊢ (((((𝜑 ∧ 𝑣 ∈ 𝐴) ∧ 𝑦 ∈ ℝ) ∧ (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)) → 𝜑)
94	93, 7	syl 17	. . . . . . . . . . . . 13 ⊢ (((((𝜑 ∧ 𝑣 ∈ 𝐴) ∧ 𝑦 ∈ ℝ) ∧ (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)) → (𝐸 + 𝐼) ∈ ℂ)
95	92, 94	subcld 11568	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ 𝑣 ∈ 𝐴) ∧ 𝑦 ∈ ℝ) ∧ (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)) → ((𝐻‘𝑣) − (𝐸 + 𝐼)) ∈ ℂ)
96	95	abscld 15380	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ 𝑣 ∈ 𝐴) ∧ 𝑦 ∈ ℝ) ∧ (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)) → (abs‘((𝐻‘𝑣) − (𝐸 + 𝐼))) ∈ ℝ)
97	10	ffvelcdmda 7076	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝐴) → (𝐹‘𝑣) ∈ ℂ)
98	97	ad3antrrr 727	. . . . . . . . . . . . . 14 ⊢ (((((𝜑 ∧ 𝑣 ∈ 𝐴) ∧ 𝑦 ∈ ℝ) ∧ (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)) → (𝐹‘𝑣) ∈ ℂ)
99	93, 3	syl 17	. . . . . . . . . . . . . 14 ⊢ (((((𝜑 ∧ 𝑣 ∈ 𝐴) ∧ 𝑦 ∈ ℝ) ∧ (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)) → 𝐸 ∈ ℂ)
100	98, 99	subcld 11568	. . . . . . . . . . . . 13 ⊢ (((((𝜑 ∧ 𝑣 ∈ 𝐴) ∧ 𝑦 ∈ ℝ) ∧ (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)) → ((𝐹‘𝑣) − 𝐸) ∈ ℂ)
101	100	abscld 15380	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ 𝑣 ∈ 𝐴) ∧ 𝑦 ∈ ℝ) ∧ (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)) → (abs‘((𝐹‘𝑣) − 𝐸)) ∈ ℝ)
102	26	ffvelcdmda 7076	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝐴) → (𝐺‘𝑣) ∈ ℂ)
103	102	ad3antrrr 727	. . . . . . . . . . . . . 14 ⊢ (((((𝜑 ∧ 𝑣 ∈ 𝐴) ∧ 𝑦 ∈ ℝ) ∧ (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)) → (𝐺‘𝑣) ∈ ℂ)
104	93, 6	syl 17	. . . . . . . . . . . . . 14 ⊢ (((((𝜑 ∧ 𝑣 ∈ 𝐴) ∧ 𝑦 ∈ ℝ) ∧ (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)) → 𝐼 ∈ ℂ)
105	103, 104	subcld 11568	. . . . . . . . . . . . 13 ⊢ (((((𝜑 ∧ 𝑣 ∈ 𝐴) ∧ 𝑦 ∈ ℝ) ∧ (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)) → ((𝐺‘𝑣) − 𝐼) ∈ ℂ)
106	105	abscld 15380	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ 𝑣 ∈ 𝐴) ∧ 𝑦 ∈ ℝ) ∧ (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)) → (abs‘((𝐺‘𝑣) − 𝐼)) ∈ ℝ)
107	101, 106	readdcld 11240	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ 𝑣 ∈ 𝐴) ∧ 𝑦 ∈ ℝ) ∧ (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)) → ((abs‘((𝐹‘𝑣) − 𝐸)) + (abs‘((𝐺‘𝑣) − 𝐼))) ∈ ℝ)
108		simpllr 773	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ 𝑣 ∈ 𝐴) ∧ 𝑦 ∈ ℝ) ∧ (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)) → 𝑦 ∈ ℝ)
109		nfv 1909	. . . . . . . . . . . . . . . . . 18 ⊢ Ⅎ𝑥(𝜑 ∧ 𝑣 ∈ 𝐴)
110		nfmpt1 5246	. . . . . . . . . . . . . . . . . . . . 21 ⊢ Ⅎ𝑥(𝑥 ∈ 𝐴 ↦ (𝐵 + 𝐶))
111	89, 110	nfcxfr 2893	. . . . . . . . . . . . . . . . . . . 20 ⊢ Ⅎ𝑥𝐻
112		nfcv 2895	. . . . . . . . . . . . . . . . . . . 20 ⊢ Ⅎ𝑥𝑣
113	111, 112	nffv 6891	. . . . . . . . . . . . . . . . . . 19 ⊢ Ⅎ𝑥(𝐻‘𝑣)
114		nfmpt1 5246	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ Ⅎ𝑥(𝑥 ∈ 𝐴 ↦ 𝐵)
115	9, 114	nfcxfr 2893	. . . . . . . . . . . . . . . . . . . . 21 ⊢ Ⅎ𝑥𝐹
116	115, 112	nffv 6891	. . . . . . . . . . . . . . . . . . . 20 ⊢ Ⅎ𝑥(𝐹‘𝑣)
117		nfcv 2895	. . . . . . . . . . . . . . . . . . . 20 ⊢ Ⅎ𝑥 +
118		nfmpt1 5246	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ Ⅎ𝑥(𝑥 ∈ 𝐴 ↦ 𝐶)
119	25, 118	nfcxfr 2893	. . . . . . . . . . . . . . . . . . . . 21 ⊢ Ⅎ𝑥𝐺
120	119, 112	nffv 6891	. . . . . . . . . . . . . . . . . . . 20 ⊢ Ⅎ𝑥(𝐺‘𝑣)
121	116, 117, 120	nfov 7431	. . . . . . . . . . . . . . . . . . 19 ⊢ Ⅎ𝑥((𝐹‘𝑣) + (𝐺‘𝑣))
122	113, 121	nfeq 2908	. . . . . . . . . . . . . . . . . 18 ⊢ Ⅎ𝑥(𝐻‘𝑣) = ((𝐹‘𝑣) + (𝐺‘𝑣))
123	109, 122	nfim 1891	. . . . . . . . . . . . . . . . 17 ⊢ Ⅎ𝑥((𝜑 ∧ 𝑣 ∈ 𝐴) → (𝐻‘𝑣) = ((𝐹‘𝑣) + (𝐺‘𝑣)))
124		eleq1w 2808	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑥 = 𝑣 → (𝑥 ∈ 𝐴 ↔ 𝑣 ∈ 𝐴))
125	124	anbi2d 628	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 = 𝑣 → ((𝜑 ∧ 𝑥 ∈ 𝐴) ↔ (𝜑 ∧ 𝑣 ∈ 𝐴)))
126		fveq2 6881	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑥 = 𝑣 → (𝐻‘𝑥) = (𝐻‘𝑣))
127		fveq2 6881	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑥 = 𝑣 → (𝐹‘𝑥) = (𝐹‘𝑣))
128		fveq2 6881	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑥 = 𝑣 → (𝐺‘𝑥) = (𝐺‘𝑣))
129	127, 128	oveq12d 7419	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑥 = 𝑣 → ((𝐹‘𝑥) + (𝐺‘𝑥)) = ((𝐹‘𝑣) + (𝐺‘𝑣)))
130	126, 129	eqeq12d 2740	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 = 𝑣 → ((𝐻‘𝑥) = ((𝐹‘𝑥) + (𝐺‘𝑥)) ↔ (𝐻‘𝑣) = ((𝐹‘𝑣) + (𝐺‘𝑣))))
131	125, 130	imbi12d 344	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 = 𝑣 → (((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐻‘𝑥) = ((𝐹‘𝑥) + (𝐺‘𝑥))) ↔ ((𝜑 ∧ 𝑣 ∈ 𝐴) → (𝐻‘𝑣) = ((𝐹‘𝑣) + (𝐺‘𝑣)))))
132		simpr 484	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝐴)
133	89	fvmpt2 6999	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑥 ∈ 𝐴 ∧ (𝐵 + 𝐶) ∈ ℂ) → (𝐻‘𝑥) = (𝐵 + 𝐶))
134	132, 88, 133	syl2anc 583	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐻‘𝑥) = (𝐵 + 𝐶))
135	9	fvmpt2 6999	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝐵 ∈ ℂ) → (𝐹‘𝑥) = 𝐵)
136	132, 8, 135	syl2anc 583	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) = 𝐵)
137	136	eqcomd 2730	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 = (𝐹‘𝑥))
138	25	fvmpt2 6999	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝐶 ∈ ℂ) → (𝐺‘𝑥) = 𝐶)
139	132, 24, 138	syl2anc 583	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐺‘𝑥) = 𝐶)
140	139	eqcomd 2730	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐶 = (𝐺‘𝑥))
141	137, 140	oveq12d 7419	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐵 + 𝐶) = ((𝐹‘𝑥) + (𝐺‘𝑥)))
142	134, 141	eqtrd 2764	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐻‘𝑥) = ((𝐹‘𝑥) + (𝐺‘𝑥)))
143	123, 131, 142	chvarfv 2225	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝐴) → (𝐻‘𝑣) = ((𝐹‘𝑣) + (𝐺‘𝑣)))
144	143	ad3antrrr 727	. . . . . . . . . . . . . . 15 ⊢ (((((𝜑 ∧ 𝑣 ∈ 𝐴) ∧ 𝑦 ∈ ℝ) ∧ (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)) → (𝐻‘𝑣) = ((𝐹‘𝑣) + (𝐺‘𝑣)))
145	144	oveq1d 7416	. . . . . . . . . . . . . 14 ⊢ (((((𝜑 ∧ 𝑣 ∈ 𝐴) ∧ 𝑦 ∈ ℝ) ∧ (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)) → ((𝐻‘𝑣) − (𝐸 + 𝐼)) = (((𝐹‘𝑣) + (𝐺‘𝑣)) − (𝐸 + 𝐼)))
146	98, 103, 99, 104	addsub4d 11615	. . . . . . . . . . . . . 14 ⊢ (((((𝜑 ∧ 𝑣 ∈ 𝐴) ∧ 𝑦 ∈ ℝ) ∧ (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)) → (((𝐹‘𝑣) + (𝐺‘𝑣)) − (𝐸 + 𝐼)) = (((𝐹‘𝑣) − 𝐸) + ((𝐺‘𝑣) − 𝐼)))
147	145, 146	eqtrd 2764	. . . . . . . . . . . . 13 ⊢ (((((𝜑 ∧ 𝑣 ∈ 𝐴) ∧ 𝑦 ∈ ℝ) ∧ (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)) → ((𝐻‘𝑣) − (𝐸 + 𝐼)) = (((𝐹‘𝑣) − 𝐸) + ((𝐺‘𝑣) − 𝐼)))
148	147	fveq2d 6885	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ 𝑣 ∈ 𝐴) ∧ 𝑦 ∈ ℝ) ∧ (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)) → (abs‘((𝐻‘𝑣) − (𝐸 + 𝐼))) = (abs‘(((𝐹‘𝑣) − 𝐸) + ((𝐺‘𝑣) − 𝐼))))
149	100, 105	abstrid 15400	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ 𝑣 ∈ 𝐴) ∧ 𝑦 ∈ ℝ) ∧ (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)) → (abs‘(((𝐹‘𝑣) − 𝐸) + ((𝐺‘𝑣) − 𝐼))) ≤ ((abs‘((𝐹‘𝑣) − 𝐸)) + (abs‘((𝐺‘𝑣) − 𝐼))))
150	148, 149	eqbrtrd 5160	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ 𝑣 ∈ 𝐴) ∧ 𝑦 ∈ ℝ) ∧ (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)) → (abs‘((𝐻‘𝑣) − (𝐸 + 𝐼))) ≤ ((abs‘((𝐹‘𝑣) − 𝐸)) + (abs‘((𝐺‘𝑣) − 𝐼))))
151		simplr 766	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ 𝑣 ∈ 𝐴) ∧ 𝑦 ∈ ℝ) ∧ (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)) → (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2))
152		simpr 484	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ 𝑣 ∈ 𝐴) ∧ 𝑦 ∈ ℝ) ∧ (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)) → (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2))
153	101, 106, 108, 151, 152	lt2halvesd 12457	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ 𝑣 ∈ 𝐴) ∧ 𝑦 ∈ ℝ) ∧ (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)) → ((abs‘((𝐹‘𝑣) − 𝐸)) + (abs‘((𝐺‘𝑣) − 𝐼))) < 𝑦)
154	96, 107, 108, 150, 153	lelttrd 11369	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑣 ∈ 𝐴) ∧ 𝑦 ∈ ℝ) ∧ (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)) → (abs‘((𝐻‘𝑣) − (𝐸 + 𝐼))) < 𝑦)
155	76, 87, 154	syl2anc 583	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ (𝑎 ∈ ℝ⁺ ∧ 𝑏 ∈ ℝ⁺) ∧ (∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑎) → (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑏) → (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)))) ∧ 𝑣 ∈ 𝐴 ∧ (𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < if(𝑎 ≤ 𝑏, 𝑎, 𝑏))) → (abs‘((𝐻‘𝑣) − (𝐸 + 𝐼))) < 𝑦)
156	155	3exp 1116	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ (𝑎 ∈ ℝ⁺ ∧ 𝑏 ∈ ℝ⁺) ∧ (∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑎) → (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑏) → (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)))) → (𝑣 ∈ 𝐴 → ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < if(𝑎 ≤ 𝑏, 𝑎, 𝑏)) → (abs‘((𝐻‘𝑣) − (𝐸 + 𝐼))) < 𝑦)))
157	44, 156	ralrimi 3246	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ (𝑎 ∈ ℝ⁺ ∧ 𝑏 ∈ ℝ⁺) ∧ (∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑎) → (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑏) → (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)))) → ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < if(𝑎 ≤ 𝑏, 𝑎, 𝑏)) → (abs‘((𝐻‘𝑣) − (𝐸 + 𝐼))) < 𝑦))
158		brimralrspcev 5199	. . . . . . 7 ⊢ ((if(𝑎 ≤ 𝑏, 𝑎, 𝑏) ∈ ℝ⁺ ∧ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < if(𝑎 ≤ 𝑏, 𝑎, 𝑏)) → (abs‘((𝐻‘𝑣) − (𝐸 + 𝐼))) < 𝑦)) → ∃𝑤 ∈ ℝ⁺ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑤) → (abs‘((𝐻‘𝑣) − (𝐸 + 𝐼))) < 𝑦))
159	38, 157, 158	syl2anc 583	. . . . . 6 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ⁺) ∧ (𝑎 ∈ ℝ⁺ ∧ 𝑏 ∈ ℝ⁺) ∧ (∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑎) → (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑏) → (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2)))) → ∃𝑤 ∈ ℝ⁺ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑤) → (abs‘((𝐻‘𝑣) − (𝐸 + 𝐼))) < 𝑦))
160	159	3exp 1116	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ⁺) → ((𝑎 ∈ ℝ⁺ ∧ 𝑏 ∈ ℝ⁺) → ((∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑎) → (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑏) → (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2))) → ∃𝑤 ∈ ℝ⁺ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑤) → (abs‘((𝐻‘𝑣) − (𝐸 + 𝐼))) < 𝑦))))
161	160	rexlimdvv 3202	. . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ⁺) → (∃𝑎 ∈ ℝ⁺ ∃𝑏 ∈ ℝ⁺ (∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑎) → (abs‘((𝐹‘𝑣) − 𝐸)) < (𝑦 / 2)) ∧ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑏) → (abs‘((𝐺‘𝑣) − 𝐼)) < (𝑦 / 2))) → ∃𝑤 ∈ ℝ⁺ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑤) → (abs‘((𝐻‘𝑣) − (𝐸 + 𝐼))) < 𝑦)))
162	36, 161	mpd 15	. . 3 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ⁺) → ∃𝑤 ∈ ℝ⁺ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑤) → (abs‘((𝐻‘𝑣) − (𝐸 + 𝐼))) < 𝑦))
163	162	ralrimiva 3138	. 2 ⊢ (𝜑 → ∀𝑦 ∈ ℝ⁺ ∃𝑤 ∈ ℝ⁺ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑤) → (abs‘((𝐻‘𝑣) − (𝐸 + 𝐼))) < 𝑦))
164	90, 11, 14	ellimc3 25730	. 2 ⊢ (𝜑 → ((𝐸 + 𝐼) ∈ (𝐻 lim_ℂ 𝐷) ↔ ((𝐸 + 𝐼) ∈ ℂ ∧ ∀𝑦 ∈ ℝ⁺ ∃𝑤 ∈ ℝ⁺ ∀𝑣 ∈ 𝐴 ((𝑣 ≠ 𝐷 ∧ (abs‘(𝑣 − 𝐷)) < 𝑤) → (abs‘((𝐻‘𝑣) − (𝐸 + 𝐼))) < 𝑦))))
165	7, 163, 164	mpbir2and 710	1 ⊢ (𝜑 → (𝐸 + 𝐼) ∈ (𝐻 lim_ℂ 𝐷))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1084 = wceq 1533 ∈ wcel 2098 ≠ wne 2932 ∀wral 3053 ∃wrex 3062 ⊆ wss 3940 ifcif 4520 class class class wbr 5138 ↦ cmpt 5221 dom cdm 5666 ⟶wf 6529 ‘cfv 6533 (class class class)co 7401 ℂcc 11104 ℝcr 11105 + caddc 11109 < clt 11245 ≤ cle 11246 − cmin 11441 / cdiv 11868 2c2 12264 ℝ⁺crp 12971 abscabs 15178 lim_ℂ climc 25713

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2163 ax-ext 2695 ax-rep 5275 ax-sep 5289 ax-nul 5296 ax-pow 5353 ax-pr 5417 ax-un 7718 ax-cnex 11162 ax-resscn 11163 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-mulcom 11170 ax-addass 11171 ax-mulass 11172 ax-distr 11173 ax-i2m1 11174 ax-1ne0 11175 ax-1rid 11176 ax-rnegex 11177 ax-rrecex 11178 ax-cnre 11179 ax-pre-lttri 11180 ax-pre-lttrn 11181 ax-pre-ltadd 11182 ax-pre-mulgt0 11183 ax-pre-sup 11184

This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2526 df-eu 2555 df-clab 2702 df-cleq 2716 df-clel 2802 df-nfc 2877 df-ne 2933 df-nel 3039 df-ral 3054 df-rex 3063 df-rmo 3368 df-reu 3369 df-rab 3425 df-v 3468 df-sbc 3770 df-csb 3886 df-dif 3943 df-un 3945 df-in 3947 df-ss 3957 df-pss 3959 df-nul 4315 df-if 4521 df-pw 4596 df-sn 4621 df-pr 4623 df-tp 4625 df-op 4627 df-uni 4900 df-int 4941 df-iun 4989 df-br 5139 df-opab 5201 df-mpt 5222 df-tr 5256 df-id 5564 df-eprel 5570 df-po 5578 df-so 5579 df-fr 5621 df-we 5623 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 df-pred 6290 df-ord 6357 df-on 6358 df-lim 6359 df-suc 6360 df-iota 6485 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7357 df-ov 7404 df-oprab 7405 df-mpo 7406 df-om 7849 df-1st 7968 df-2nd 7969 df-frecs 8261 df-wrecs 8292 df-recs 8366 df-rdg 8405 df-1o 8461 df-er 8699 df-map 8818 df-pm 8819 df-en 8936 df-dom 8937 df-sdom 8938 df-fin 8939 df-fi 9402 df-sup 9433 df-inf 9434 df-pnf 11247 df-mnf 11248 df-xr 11249 df-ltxr 11250 df-le 11251 df-sub 11443 df-neg 11444 df-div 11869 df-nn 12210 df-2 12272 df-3 12273 df-4 12274 df-5 12275 df-6 12276 df-7 12277 df-8 12278 df-9 12279 df-n0 12470 df-z 12556 df-dec 12675 df-uz 12820 df-q 12930 df-rp 12972 df-xneg 13089 df-xadd 13090 df-xmul 13091 df-fz 13482 df-seq 13964 df-exp 14025 df-cj 15043 df-re 15044 df-im 15045 df-sqrt 15179 df-abs 15180 df-struct 17079 df-slot 17114 df-ndx 17126 df-base 17144 df-plusg 17209 df-mulr 17210 df-starv 17211 df-tset 17215 df-ple 17216 df-ds 17218 df-unif 17219 df-rest 17367 df-topn 17368 df-topgen 17388 df-psmet 21220 df-xmet 21221 df-met 21222 df-bl 21223 df-mopn 21224 df-cnfld 21229 df-top 22718 df-topon 22735 df-topsp 22757 df-bases 22771 df-cnp 23054 df-xms 24148 df-ms 24149 df-limc 25717

This theorem is referenced by: sublimc 44853 reclimc 44854 fourierdlem53 45360 fourierdlem60 45367 fourierdlem61 45368

W3C validator