ftc1lem6 - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > ftc1lem6		Structured version Visualization version GIF version

Theorem ftc1lem6 23804

Description: Lemma for ftc1 23805. (Contributed by Mario Carneiro, 14-Aug-2014.) (Proof shortened by Mario Carneiro, 28-Dec-2016.)

**Hypotheses**
Ref	Expression
ftc1.g	⊢ 𝐺 = (𝑥 ∈ (𝐴[,]𝐵) ↦ ∫(𝐴(,)𝑥)(𝐹‘𝑡) d𝑡)
ftc1.a	⊢ (𝜑 → 𝐴 ∈ ℝ)
ftc1.b	⊢ (𝜑 → 𝐵 ∈ ℝ)
ftc1.le	⊢ (𝜑 → 𝐴 ≤ 𝐵)
ftc1.s	⊢ (𝜑 → (𝐴(,)𝐵) ⊆ 𝐷)
ftc1.d	⊢ (𝜑 → 𝐷 ⊆ ℝ)
ftc1.i	⊢ (𝜑 → 𝐹 ∈ 𝐿¹)
ftc1.c	⊢ (𝜑 → 𝐶 ∈ (𝐴(,)𝐵))
ftc1.f	⊢ (𝜑 → 𝐹 ∈ ((𝐾 CnP 𝐿)‘𝐶))
ftc1.j	⊢ 𝐽 = (𝐿 ↾_t ℝ)
ftc1.k	⊢ 𝐾 = (𝐿 ↾_t 𝐷)
ftc1.l	⊢ 𝐿 = (TopOpen‘ℂ_fld)
ftc1.h	⊢ 𝐻 = (𝑧 ∈ ((𝐴[,]𝐵) ∖ {𝐶}) ↦ (((𝐺‘𝑧) − (𝐺‘𝐶)) / (𝑧 − 𝐶)))

**Assertion**
Ref	Expression
ftc1lem6	⊢ (𝜑 → (𝐹‘𝐶) ∈ (𝐻 lim_ℂ 𝐶))

Distinct variable groups: 𝑥,𝑡,𝑧,𝐶 𝑡,𝐷,𝑥,𝑧 𝑧,𝐺 𝑡,𝐴,𝑥,𝑧 𝑡,𝐵,𝑥,𝑧 𝜑,𝑡,𝑥,𝑧 𝑡,𝐹,𝑥,𝑧 𝑥,𝐿,𝑧 Allowed substitution hints: 𝐺(𝑥,𝑡) 𝐻(𝑥,𝑧,𝑡) 𝐽(𝑥,𝑧,𝑡) 𝐾(𝑥,𝑧,𝑡) 𝐿(𝑡)

Proof of Theorem ftc1lem6 Dummy variables 𝑠 𝑢 𝑣 𝑤 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ftc1.g	. . . 4 ⊢ 𝐺 = (𝑥 ∈ (𝐴[,]𝐵) ↦ ∫(𝐴(,)𝑥)(𝐹‘𝑡) d𝑡)
2		ftc1.a	. . . 4 ⊢ (𝜑 → 𝐴 ∈ ℝ)
3		ftc1.b	. . . 4 ⊢ (𝜑 → 𝐵 ∈ ℝ)
4		ftc1.le	. . . 4 ⊢ (𝜑 → 𝐴 ≤ 𝐵)
5		ftc1.s	. . . 4 ⊢ (𝜑 → (𝐴(,)𝐵) ⊆ 𝐷)
6		ftc1.d	. . . 4 ⊢ (𝜑 → 𝐷 ⊆ ℝ)
7		ftc1.i	. . . 4 ⊢ (𝜑 → 𝐹 ∈ 𝐿¹)
8		ftc1.c	. . . 4 ⊢ (𝜑 → 𝐶 ∈ (𝐴(,)𝐵))
9		ftc1.f	. . . 4 ⊢ (𝜑 → 𝐹 ∈ ((𝐾 CnP 𝐿)‘𝐶))
10		ftc1.j	. . . 4 ⊢ 𝐽 = (𝐿 ↾_t ℝ)
11		ftc1.k	. . . 4 ⊢ 𝐾 = (𝐿 ↾_t 𝐷)
12		ftc1.l	. . . 4 ⊢ 𝐿 = (TopOpen‘ℂ_fld)
13	1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12	ftc1lem3 23801	. . 3 ⊢ (𝜑 → 𝐹:𝐷⟶ℂ)
14	5, 8	sseldd 3604	. . 3 ⊢ (𝜑 → 𝐶 ∈ 𝐷)
15	13, 14	ffvelrnd 6360	. 2 ⊢ (𝜑 → (𝐹‘𝐶) ∈ ℂ)
16		cnxmet 22576	. . . . . 6 ⊢ (abs ∘ − ) ∈ (∞Met‘ℂ)
17		ax-resscn 9993	. . . . . . . 8 ⊢ ℝ ⊆ ℂ
18	6, 17	syl6ss 3615	. . . . . . 7 ⊢ (𝜑 → 𝐷 ⊆ ℂ)
19	18	adantr 481	. . . . . 6 ⊢ ((𝜑 ∧ 𝑤 ∈ ℝ⁺) → 𝐷 ⊆ ℂ)
20		xmetres2 22166	. . . . . 6 ⊢ (((abs ∘ − ) ∈ (∞Met‘ℂ) ∧ 𝐷 ⊆ ℂ) → ((abs ∘ − ) ↾ (𝐷 × 𝐷)) ∈ (∞Met‘𝐷))
21	16, 19, 20	sylancr 695	. . . . 5 ⊢ ((𝜑 ∧ 𝑤 ∈ ℝ⁺) → ((abs ∘ − ) ↾ (𝐷 × 𝐷)) ∈ (∞Met‘𝐷))
22	16	a1i 11	. . . . 5 ⊢ ((𝜑 ∧ 𝑤 ∈ ℝ⁺) → (abs ∘ − ) ∈ (∞Met‘ℂ))
23		eqid 2622	. . . . . . . . . . . 12 ⊢ ((abs ∘ − ) ↾ (𝐷 × 𝐷)) = ((abs ∘ − ) ↾ (𝐷 × 𝐷))
24	12	cnfldtopn 22585	. . . . . . . . . . . 12 ⊢ 𝐿 = (MetOpen‘(abs ∘ − ))
25		eqid 2622	. . . . . . . . . . . 12 ⊢ (MetOpen‘((abs ∘ − ) ↾ (𝐷 × 𝐷))) = (MetOpen‘((abs ∘ − ) ↾ (𝐷 × 𝐷)))
26	23, 24, 25	metrest 22329	. . . . . . . . . . 11 ⊢ (((abs ∘ − ) ∈ (∞Met‘ℂ) ∧ 𝐷 ⊆ ℂ) → (𝐿 ↾_t 𝐷) = (MetOpen‘((abs ∘ − ) ↾ (𝐷 × 𝐷))))
27	16, 18, 26	sylancr 695	. . . . . . . . . 10 ⊢ (𝜑 → (𝐿 ↾_t 𝐷) = (MetOpen‘((abs ∘ − ) ↾ (𝐷 × 𝐷))))
28	11, 27	syl5eq 2668	. . . . . . . . 9 ⊢ (𝜑 → 𝐾 = (MetOpen‘((abs ∘ − ) ↾ (𝐷 × 𝐷))))
29	28	oveq1d 6665	. . . . . . . 8 ⊢ (𝜑 → (𝐾 CnP 𝐿) = ((MetOpen‘((abs ∘ − ) ↾ (𝐷 × 𝐷))) CnP 𝐿))
30	29	fveq1d 6193	. . . . . . 7 ⊢ (𝜑 → ((𝐾 CnP 𝐿)‘𝐶) = (((MetOpen‘((abs ∘ − ) ↾ (𝐷 × 𝐷))) CnP 𝐿)‘𝐶))
31	9, 30	eleqtrd 2703	. . . . . 6 ⊢ (𝜑 → 𝐹 ∈ (((MetOpen‘((abs ∘ − ) ↾ (𝐷 × 𝐷))) CnP 𝐿)‘𝐶))
32	31	adantr 481	. . . . 5 ⊢ ((𝜑 ∧ 𝑤 ∈ ℝ⁺) → 𝐹 ∈ (((MetOpen‘((abs ∘ − ) ↾ (𝐷 × 𝐷))) CnP 𝐿)‘𝐶))
33		simpr 477	. . . . 5 ⊢ ((𝜑 ∧ 𝑤 ∈ ℝ⁺) → 𝑤 ∈ ℝ⁺)
34	25, 24	metcnpi2 22350	. . . . 5 ⊢ (((((abs ∘ − ) ↾ (𝐷 × 𝐷)) ∈ (∞Met‘𝐷) ∧ (abs ∘ − ) ∈ (∞Met‘ℂ)) ∧ (𝐹 ∈ (((MetOpen‘((abs ∘ − ) ↾ (𝐷 × 𝐷))) CnP 𝐿)‘𝐶) ∧ 𝑤 ∈ ℝ⁺)) → ∃𝑣 ∈ ℝ⁺ ∀𝑦 ∈ 𝐷 ((𝑦((abs ∘ − ) ↾ (𝐷 × 𝐷))𝐶) < 𝑣 → ((𝐹‘𝑦)(abs ∘ − )(𝐹‘𝐶)) < 𝑤))
35	21, 22, 32, 33, 34	syl22anc 1327	. . . 4 ⊢ ((𝜑 ∧ 𝑤 ∈ ℝ⁺) → ∃𝑣 ∈ ℝ⁺ ∀𝑦 ∈ 𝐷 ((𝑦((abs ∘ − ) ↾ (𝐷 × 𝐷))𝐶) < 𝑣 → ((𝐹‘𝑦)(abs ∘ − )(𝐹‘𝐶)) < 𝑤))
36		simpr 477	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ 𝑦 ∈ 𝐷) → 𝑦 ∈ 𝐷)
37	14	ad2antrr 762	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ 𝑦 ∈ 𝐷) → 𝐶 ∈ 𝐷)
38	36, 37	ovresd 6801	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ 𝑦 ∈ 𝐷) → (𝑦((abs ∘ − ) ↾ (𝐷 × 𝐷))𝐶) = (𝑦(abs ∘ − )𝐶))
39	18	adantr 481	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) → 𝐷 ⊆ ℂ)
40	39	sselda 3603	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ 𝑦 ∈ 𝐷) → 𝑦 ∈ ℂ)
41		iccssre 12255	. . . . . . . . . . . . . . . 16 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴[,]𝐵) ⊆ ℝ)
42	2, 3, 41	syl2anc 693	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (𝐴[,]𝐵) ⊆ ℝ)
43	42, 17	syl6ss 3615	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝐴[,]𝐵) ⊆ ℂ)
44		ioossicc 12259	. . . . . . . . . . . . . . 15 ⊢ (𝐴(,)𝐵) ⊆ (𝐴[,]𝐵)
45	44, 8	sseldi 3601	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝐶 ∈ (𝐴[,]𝐵))
46	43, 45	sseldd 3604	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐶 ∈ ℂ)
47	46	ad2antrr 762	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ 𝑦 ∈ 𝐷) → 𝐶 ∈ ℂ)
48		eqid 2622	. . . . . . . . . . . . 13 ⊢ (abs ∘ − ) = (abs ∘ − )
49	48	cnmetdval 22574	. . . . . . . . . . . 12 ⊢ ((𝑦 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝑦(abs ∘ − )𝐶) = (abs‘(𝑦 − 𝐶)))
50	40, 47, 49	syl2anc 693	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ 𝑦 ∈ 𝐷) → (𝑦(abs ∘ − )𝐶) = (abs‘(𝑦 − 𝐶)))
51	38, 50	eqtrd 2656	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ 𝑦 ∈ 𝐷) → (𝑦((abs ∘ − ) ↾ (𝐷 × 𝐷))𝐶) = (abs‘(𝑦 − 𝐶)))
52	51	breq1d 4663	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ 𝑦 ∈ 𝐷) → ((𝑦((abs ∘ − ) ↾ (𝐷 × 𝐷))𝐶) < 𝑣 ↔ (abs‘(𝑦 − 𝐶)) < 𝑣))
53	13	adantr 481	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) → 𝐹:𝐷⟶ℂ)
54	53	ffvelrnda 6359	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ 𝑦 ∈ 𝐷) → (𝐹‘𝑦) ∈ ℂ)
55	15	ad2antrr 762	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ 𝑦 ∈ 𝐷) → (𝐹‘𝐶) ∈ ℂ)
56	48	cnmetdval 22574	. . . . . . . . . . 11 ⊢ (((𝐹‘𝑦) ∈ ℂ ∧ (𝐹‘𝐶) ∈ ℂ) → ((𝐹‘𝑦)(abs ∘ − )(𝐹‘𝐶)) = (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))))
57	54, 55, 56	syl2anc 693	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ 𝑦 ∈ 𝐷) → ((𝐹‘𝑦)(abs ∘ − )(𝐹‘𝐶)) = (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))))
58	57	breq1d 4663	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ 𝑦 ∈ 𝐷) → (((𝐹‘𝑦)(abs ∘ − )(𝐹‘𝐶)) < 𝑤 ↔ (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < 𝑤))
59	52, 58	imbi12d 334	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ 𝑦 ∈ 𝐷) → (((𝑦((abs ∘ − ) ↾ (𝐷 × 𝐷))𝐶) < 𝑣 → ((𝐹‘𝑦)(abs ∘ − )(𝐹‘𝐶)) < 𝑤) ↔ ((abs‘(𝑦 − 𝐶)) < 𝑣 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < 𝑤)))
60	59	ralbidva 2985	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) → (∀𝑦 ∈ 𝐷 ((𝑦((abs ∘ − ) ↾ (𝐷 × 𝐷))𝐶) < 𝑣 → ((𝐹‘𝑦)(abs ∘ − )(𝐹‘𝐶)) < 𝑤) ↔ ∀𝑦 ∈ 𝐷 ((abs‘(𝑦 − 𝐶)) < 𝑣 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < 𝑤)))
61		simprll 802	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ ((𝑠 ∈ ((𝐴[,]𝐵) ∖ {𝐶}) ∧ ∀𝑦 ∈ 𝐷 ((abs‘(𝑦 − 𝐶)) < 𝑣 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < 𝑤)) ∧ (abs‘(𝑠 − 𝐶)) < 𝑣)) → 𝑠 ∈ ((𝐴[,]𝐵) ∖ {𝐶}))
62		eldifsni 4320	. . . . . . . . . . . . 13 ⊢ (𝑠 ∈ ((𝐴[,]𝐵) ∖ {𝐶}) → 𝑠 ≠ 𝐶)
63	61, 62	syl 17	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ ((𝑠 ∈ ((𝐴[,]𝐵) ∖ {𝐶}) ∧ ∀𝑦 ∈ 𝐷 ((abs‘(𝑦 − 𝐶)) < 𝑣 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < 𝑤)) ∧ (abs‘(𝑠 − 𝐶)) < 𝑣)) → 𝑠 ≠ 𝐶)
64	2	ad2antrr 762	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ ((𝑠 ∈ ((𝐴[,]𝐵) ∖ {𝐶}) ∧ ∀𝑦 ∈ 𝐷 ((abs‘(𝑦 − 𝐶)) < 𝑣 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < 𝑤)) ∧ (abs‘(𝑠 − 𝐶)) < 𝑣)) → 𝐴 ∈ ℝ)
65	3	ad2antrr 762	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ ((𝑠 ∈ ((𝐴[,]𝐵) ∖ {𝐶}) ∧ ∀𝑦 ∈ 𝐷 ((abs‘(𝑦 − 𝐶)) < 𝑣 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < 𝑤)) ∧ (abs‘(𝑠 − 𝐶)) < 𝑣)) → 𝐵 ∈ ℝ)
66	4	ad2antrr 762	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ ((𝑠 ∈ ((𝐴[,]𝐵) ∖ {𝐶}) ∧ ∀𝑦 ∈ 𝐷 ((abs‘(𝑦 − 𝐶)) < 𝑣 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < 𝑤)) ∧ (abs‘(𝑠 − 𝐶)) < 𝑣)) → 𝐴 ≤ 𝐵)
67	5	ad2antrr 762	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ ((𝑠 ∈ ((𝐴[,]𝐵) ∖ {𝐶}) ∧ ∀𝑦 ∈ 𝐷 ((abs‘(𝑦 − 𝐶)) < 𝑣 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < 𝑤)) ∧ (abs‘(𝑠 − 𝐶)) < 𝑣)) → (𝐴(,)𝐵) ⊆ 𝐷)
68	6	ad2antrr 762	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ ((𝑠 ∈ ((𝐴[,]𝐵) ∖ {𝐶}) ∧ ∀𝑦 ∈ 𝐷 ((abs‘(𝑦 − 𝐶)) < 𝑣 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < 𝑤)) ∧ (abs‘(𝑠 − 𝐶)) < 𝑣)) → 𝐷 ⊆ ℝ)
69	7	ad2antrr 762	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ ((𝑠 ∈ ((𝐴[,]𝐵) ∖ {𝐶}) ∧ ∀𝑦 ∈ 𝐷 ((abs‘(𝑦 − 𝐶)) < 𝑣 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < 𝑤)) ∧ (abs‘(𝑠 − 𝐶)) < 𝑣)) → 𝐹 ∈ 𝐿¹)
70	8	ad2antrr 762	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ ((𝑠 ∈ ((𝐴[,]𝐵) ∖ {𝐶}) ∧ ∀𝑦 ∈ 𝐷 ((abs‘(𝑦 − 𝐶)) < 𝑣 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < 𝑤)) ∧ (abs‘(𝑠 − 𝐶)) < 𝑣)) → 𝐶 ∈ (𝐴(,)𝐵))
71	9	ad2antrr 762	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ ((𝑠 ∈ ((𝐴[,]𝐵) ∖ {𝐶}) ∧ ∀𝑦 ∈ 𝐷 ((abs‘(𝑦 − 𝐶)) < 𝑣 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < 𝑤)) ∧ (abs‘(𝑠 − 𝐶)) < 𝑣)) → 𝐹 ∈ ((𝐾 CnP 𝐿)‘𝐶))
72		ftc1.h	. . . . . . . . . . . . 13 ⊢ 𝐻 = (𝑧 ∈ ((𝐴[,]𝐵) ∖ {𝐶}) ↦ (((𝐺‘𝑧) − (𝐺‘𝐶)) / (𝑧 − 𝐶)))
73		simplrl 800	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ ((𝑠 ∈ ((𝐴[,]𝐵) ∖ {𝐶}) ∧ ∀𝑦 ∈ 𝐷 ((abs‘(𝑦 − 𝐶)) < 𝑣 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < 𝑤)) ∧ (abs‘(𝑠 − 𝐶)) < 𝑣)) → 𝑤 ∈ ℝ⁺)
74		simplrr 801	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ ((𝑠 ∈ ((𝐴[,]𝐵) ∖ {𝐶}) ∧ ∀𝑦 ∈ 𝐷 ((abs‘(𝑦 − 𝐶)) < 𝑣 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < 𝑤)) ∧ (abs‘(𝑠 − 𝐶)) < 𝑣)) → 𝑣 ∈ ℝ⁺)
75		simprlr 803	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ ((𝑠 ∈ ((𝐴[,]𝐵) ∖ {𝐶}) ∧ ∀𝑦 ∈ 𝐷 ((abs‘(𝑦 − 𝐶)) < 𝑣 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < 𝑤)) ∧ (abs‘(𝑠 − 𝐶)) < 𝑣)) → ∀𝑦 ∈ 𝐷 ((abs‘(𝑦 − 𝐶)) < 𝑣 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < 𝑤))
76		oveq1 6657	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑦 = 𝑢 → (𝑦 − 𝐶) = (𝑢 − 𝐶))
77	76	fveq2d 6195	. . . . . . . . . . . . . . . . 17 ⊢ (𝑦 = 𝑢 → (abs‘(𝑦 − 𝐶)) = (abs‘(𝑢 − 𝐶)))
78	77	breq1d 4663	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 = 𝑢 → ((abs‘(𝑦 − 𝐶)) < 𝑣 ↔ (abs‘(𝑢 − 𝐶)) < 𝑣))
79		fveq2 6191	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑦 = 𝑢 → (𝐹‘𝑦) = (𝐹‘𝑢))
80	79	oveq1d 6665	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑦 = 𝑢 → ((𝐹‘𝑦) − (𝐹‘𝐶)) = ((𝐹‘𝑢) − (𝐹‘𝐶)))
81	80	fveq2d 6195	. . . . . . . . . . . . . . . . 17 ⊢ (𝑦 = 𝑢 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) = (abs‘((𝐹‘𝑢) − (𝐹‘𝐶))))
82	81	breq1d 4663	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 = 𝑢 → ((abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < 𝑤 ↔ (abs‘((𝐹‘𝑢) − (𝐹‘𝐶))) < 𝑤))
83	78, 82	imbi12d 334	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = 𝑢 → (((abs‘(𝑦 − 𝐶)) < 𝑣 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < 𝑤) ↔ ((abs‘(𝑢 − 𝐶)) < 𝑣 → (abs‘((𝐹‘𝑢) − (𝐹‘𝐶))) < 𝑤)))
84	83	rspccva 3308	. . . . . . . . . . . . . 14 ⊢ ((∀𝑦 ∈ 𝐷 ((abs‘(𝑦 − 𝐶)) < 𝑣 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < 𝑤) ∧ 𝑢 ∈ 𝐷) → ((abs‘(𝑢 − 𝐶)) < 𝑣 → (abs‘((𝐹‘𝑢) − (𝐹‘𝐶))) < 𝑤))
85	75, 84	sylan 488	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ ((𝑠 ∈ ((𝐴[,]𝐵) ∖ {𝐶}) ∧ ∀𝑦 ∈ 𝐷 ((abs‘(𝑦 − 𝐶)) < 𝑣 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < 𝑤)) ∧ (abs‘(𝑠 − 𝐶)) < 𝑣)) ∧ 𝑢 ∈ 𝐷) → ((abs‘(𝑢 − 𝐶)) < 𝑣 → (abs‘((𝐹‘𝑢) − (𝐹‘𝐶))) < 𝑤))
86	61	eldifad 3586	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ ((𝑠 ∈ ((𝐴[,]𝐵) ∖ {𝐶}) ∧ ∀𝑦 ∈ 𝐷 ((abs‘(𝑦 − 𝐶)) < 𝑣 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < 𝑤)) ∧ (abs‘(𝑠 − 𝐶)) < 𝑣)) → 𝑠 ∈ (𝐴[,]𝐵))
87		simprr 796	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ ((𝑠 ∈ ((𝐴[,]𝐵) ∖ {𝐶}) ∧ ∀𝑦 ∈ 𝐷 ((abs‘(𝑦 − 𝐶)) < 𝑣 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < 𝑤)) ∧ (abs‘(𝑠 − 𝐶)) < 𝑣)) → (abs‘(𝑠 − 𝐶)) < 𝑣)
88	1, 64, 65, 66, 67, 68, 69, 70, 71, 10, 11, 12, 72, 73, 74, 85, 86, 87	ftc1lem5 23803	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ ((𝑠 ∈ ((𝐴[,]𝐵) ∖ {𝐶}) ∧ ∀𝑦 ∈ 𝐷 ((abs‘(𝑦 − 𝐶)) < 𝑣 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < 𝑤)) ∧ (abs‘(𝑠 − 𝐶)) < 𝑣)) ∧ 𝑠 ≠ 𝐶) → (abs‘((𝐻‘𝑠) − (𝐹‘𝐶))) < 𝑤)
89	63, 88	mpdan 702	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ ((𝑠 ∈ ((𝐴[,]𝐵) ∖ {𝐶}) ∧ ∀𝑦 ∈ 𝐷 ((abs‘(𝑦 − 𝐶)) < 𝑣 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < 𝑤)) ∧ (abs‘(𝑠 − 𝐶)) < 𝑣)) → (abs‘((𝐻‘𝑠) − (𝐹‘𝐶))) < 𝑤)
90	89	expr 643	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ (𝑠 ∈ ((𝐴[,]𝐵) ∖ {𝐶}) ∧ ∀𝑦 ∈ 𝐷 ((abs‘(𝑦 − 𝐶)) < 𝑣 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < 𝑤))) → ((abs‘(𝑠 − 𝐶)) < 𝑣 → (abs‘((𝐻‘𝑠) − (𝐹‘𝐶))) < 𝑤))
91	90	adantld 483	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ (𝑠 ∈ ((𝐴[,]𝐵) ∖ {𝐶}) ∧ ∀𝑦 ∈ 𝐷 ((abs‘(𝑦 − 𝐶)) < 𝑣 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < 𝑤))) → ((𝑠 ≠ 𝐶 ∧ (abs‘(𝑠 − 𝐶)) < 𝑣) → (abs‘((𝐻‘𝑠) − (𝐹‘𝐶))) < 𝑤))
92	91	expr 643	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ 𝑠 ∈ ((𝐴[,]𝐵) ∖ {𝐶})) → (∀𝑦 ∈ 𝐷 ((abs‘(𝑦 − 𝐶)) < 𝑣 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < 𝑤) → ((𝑠 ≠ 𝐶 ∧ (abs‘(𝑠 − 𝐶)) < 𝑣) → (abs‘((𝐻‘𝑠) − (𝐹‘𝐶))) < 𝑤)))
93	92	ralrimdva 2969	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) → (∀𝑦 ∈ 𝐷 ((abs‘(𝑦 − 𝐶)) < 𝑣 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < 𝑤) → ∀𝑠 ∈ ((𝐴[,]𝐵) ∖ {𝐶})((𝑠 ≠ 𝐶 ∧ (abs‘(𝑠 − 𝐶)) < 𝑣) → (abs‘((𝐻‘𝑠) − (𝐹‘𝐶))) < 𝑤)))
94	60, 93	sylbid 230	. . . . . 6 ⊢ ((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) → (∀𝑦 ∈ 𝐷 ((𝑦((abs ∘ − ) ↾ (𝐷 × 𝐷))𝐶) < 𝑣 → ((𝐹‘𝑦)(abs ∘ − )(𝐹‘𝐶)) < 𝑤) → ∀𝑠 ∈ ((𝐴[,]𝐵) ∖ {𝐶})((𝑠 ≠ 𝐶 ∧ (abs‘(𝑠 − 𝐶)) < 𝑣) → (abs‘((𝐻‘𝑠) − (𝐹‘𝐶))) < 𝑤)))
95	94	anassrs 680	. . . . 5 ⊢ (((𝜑 ∧ 𝑤 ∈ ℝ⁺) ∧ 𝑣 ∈ ℝ⁺) → (∀𝑦 ∈ 𝐷 ((𝑦((abs ∘ − ) ↾ (𝐷 × 𝐷))𝐶) < 𝑣 → ((𝐹‘𝑦)(abs ∘ − )(𝐹‘𝐶)) < 𝑤) → ∀𝑠 ∈ ((𝐴[,]𝐵) ∖ {𝐶})((𝑠 ≠ 𝐶 ∧ (abs‘(𝑠 − 𝐶)) < 𝑣) → (abs‘((𝐻‘𝑠) − (𝐹‘𝐶))) < 𝑤)))
96	95	reximdva 3017	. . . 4 ⊢ ((𝜑 ∧ 𝑤 ∈ ℝ⁺) → (∃𝑣 ∈ ℝ⁺ ∀𝑦 ∈ 𝐷 ((𝑦((abs ∘ − ) ↾ (𝐷 × 𝐷))𝐶) < 𝑣 → ((𝐹‘𝑦)(abs ∘ − )(𝐹‘𝐶)) < 𝑤) → ∃𝑣 ∈ ℝ⁺ ∀𝑠 ∈ ((𝐴[,]𝐵) ∖ {𝐶})((𝑠 ≠ 𝐶 ∧ (abs‘(𝑠 − 𝐶)) < 𝑣) → (abs‘((𝐻‘𝑠) − (𝐹‘𝐶))) < 𝑤)))
97	35, 96	mpd 15	. . 3 ⊢ ((𝜑 ∧ 𝑤 ∈ ℝ⁺) → ∃𝑣 ∈ ℝ⁺ ∀𝑠 ∈ ((𝐴[,]𝐵) ∖ {𝐶})((𝑠 ≠ 𝐶 ∧ (abs‘(𝑠 − 𝐶)) < 𝑣) → (abs‘((𝐻‘𝑠) − (𝐹‘𝐶))) < 𝑤))
98	97	ralrimiva 2966	. 2 ⊢ (𝜑 → ∀𝑤 ∈ ℝ⁺ ∃𝑣 ∈ ℝ⁺ ∀𝑠 ∈ ((𝐴[,]𝐵) ∖ {𝐶})((𝑠 ≠ 𝐶 ∧ (abs‘(𝑠 − 𝐶)) < 𝑣) → (abs‘((𝐻‘𝑠) − (𝐹‘𝐶))) < 𝑤))
99	1, 2, 3, 4, 5, 6, 7, 13	ftc1lem2 23799	. . . . 5 ⊢ (𝜑 → 𝐺:(𝐴[,]𝐵)⟶ℂ)
100	99, 43, 45	dvlem 23660	. . . 4 ⊢ ((𝜑 ∧ 𝑧 ∈ ((𝐴[,]𝐵) ∖ {𝐶})) → (((𝐺‘𝑧) − (𝐺‘𝐶)) / (𝑧 − 𝐶)) ∈ ℂ)
101	100, 72	fmptd 6385	. . 3 ⊢ (𝜑 → 𝐻:((𝐴[,]𝐵) ∖ {𝐶})⟶ℂ)
102	43	ssdifssd 3748	. . 3 ⊢ (𝜑 → ((𝐴[,]𝐵) ∖ {𝐶}) ⊆ ℂ)
103	101, 102, 46	ellimc3 23643	. 2 ⊢ (𝜑 → ((𝐹‘𝐶) ∈ (𝐻 lim_ℂ 𝐶) ↔ ((𝐹‘𝐶) ∈ ℂ ∧ ∀𝑤 ∈ ℝ⁺ ∃𝑣 ∈ ℝ⁺ ∀𝑠 ∈ ((𝐴[,]𝐵) ∖ {𝐶})((𝑠 ≠ 𝐶 ∧ (abs‘(𝑠 − 𝐶)) < 𝑣) → (abs‘((𝐻‘𝑠) − (𝐹‘𝐶))) < 𝑤))))
104	15, 98, 103	mpbir2and 957	1 ⊢ (𝜑 → (𝐹‘𝐶) ∈ (𝐻 lim_ℂ 𝐶))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 384 = wceq 1483 ∈ wcel 1990 ≠ wne 2794 ∀wral 2912 ∃wrex 2913 ∖ cdif 3571 ⊆ wss 3574 {csn 4177 class class class wbr 4653 ↦ cmpt 4729 × cxp 5112 ↾ cres 5116 ∘ ccom 5118 ⟶wf 5884 ‘cfv 5888 (class class class)co 6650 ℂcc 9934 ℝcr 9935 < clt 10074 ≤ cle 10075 − cmin 10266 / cdiv 10684 ℝ⁺crp 11832 (,)cioo 12175 [,]cicc 12178 abscabs 13974 ↾_t crest 16081 TopOpenctopn 16082 ∞Metcxmt 19731 MetOpencmopn 19736 ℂ_fldccnfld 19746 CnP ccnp 21029 𝐿¹cibl 23386 ∫citg 23387 lim_ℂ climc 23626

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-rep 4771 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 ax-inf2 8538 ax-cc 9257 ax-cnex 9992 ax-resscn 9993 ax-1cn 9994 ax-icn 9995 ax-addcl 9996 ax-addrcl 9997 ax-mulcl 9998 ax-mulrcl 9999 ax-mulcom 10000 ax-addass 10001 ax-mulass 10002 ax-distr 10003 ax-i2m1 10004 ax-1ne0 10005 ax-1rid 10006 ax-rnegex 10007 ax-rrecex 10008 ax-cnre 10009 ax-pre-lttri 10010 ax-pre-lttrn 10011 ax-pre-ltadd 10012 ax-pre-mulgt0 10013 ax-pre-sup 10014 ax-addf 10015 ax-mulf 10016

This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-fal 1489 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-nel 2898 df-ral 2917 df-rex 2918 df-reu 2919 df-rmo 2920 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-pss 3590 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-tp 4182 df-op 4184 df-uni 4437 df-int 4476 df-iun 4522 df-iin 4523 df-disj 4621 df-br 4654 df-opab 4713 df-mpt 4730 df-tr 4753 df-id 5024 df-eprel 5029 df-po 5035 df-so 5036 df-fr 5073 df-se 5074 df-we 5075 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-pred 5680 df-ord 5726 df-on 5727 df-lim 5728 df-suc 5729 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-isom 5897 df-riota 6611 df-ov 6653 df-oprab 6654 df-mpt2 6655 df-of 6897 df-ofr 6898 df-om 7066 df-1st 7168 df-2nd 7169 df-supp 7296 df-wrecs 7407 df-recs 7468 df-rdg 7506 df-1o 7560 df-2o 7561 df-oadd 7564 df-omul 7565 df-er 7742 df-map 7859 df-pm 7860 df-ixp 7909 df-en 7956 df-dom 7957 df-sdom 7958 df-fin 7959 df-fsupp 8276 df-fi 8317 df-sup 8348 df-inf 8349 df-oi 8415 df-card 8765 df-acn 8768 df-cda 8990 df-pnf 10076 df-mnf 10077 df-xr 10078 df-ltxr 10079 df-le 10080 df-sub 10268 df-neg 10269 df-div 10685 df-nn 11021 df-2 11079 df-3 11080 df-4 11081 df-5 11082 df-6 11083 df-7 11084 df-8 11085 df-9 11086 df-n0 11293 df-z 11378 df-dec 11494 df-uz 11688 df-q 11789 df-rp 11833 df-xneg 11946 df-xadd 11947 df-xmul 11948 df-ioo 12179 df-ioc 12180 df-ico 12181 df-icc 12182 df-fz 12327 df-fzo 12466 df-fl 12593 df-mod 12669 df-seq 12802 df-exp 12861 df-hash 13118 df-cj 13839 df-re 13840 df-im 13841 df-sqrt 13975 df-abs 13976 df-clim 14219 df-rlim 14220 df-sum 14417 df-struct 15859 df-ndx 15860 df-slot 15861 df-base 15863 df-sets 15864 df-ress 15865 df-plusg 15954 df-mulr 15955 df-starv 15956 df-sca 15957 df-vsca 15958 df-ip 15959 df-tset 15960 df-ple 15961 df-ds 15964 df-unif 15965 df-hom 15966 df-cco 15967 df-rest 16083 df-topn 16084 df-0g 16102 df-gsum 16103 df-topgen 16104 df-pt 16105 df-prds 16108 df-xrs 16162 df-qtop 16167 df-imas 16168 df-xps 16170 df-mre 16246 df-mrc 16247 df-acs 16249 df-mgm 17242 df-sgrp 17284 df-mnd 17295 df-submnd 17336 df-mulg 17541 df-cntz 17750 df-cmn 18195 df-psmet 19738 df-xmet 19739 df-met 19740 df-bl 19741 df-mopn 19742 df-cnfld 19747 df-top 20699 df-topon 20716 df-topsp 20737 df-bases 20750 df-cn 21031 df-cnp 21032 df-cmp 21190 df-tx 21365 df-hmeo 21558 df-xms 22125 df-ms 22126 df-tms 22127 df-cncf 22681 df-ovol 23233 df-vol 23234 df-mbf 23388 df-itg1 23389 df-itg2 23390 df-ibl 23391 df-itg 23392 df-0p 23437 df-limc 23630

This theorem is referenced by: ftc1 23805

W3C validator