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 23608

Description: Lemma for ftc1 23609. (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 23605	. . 3 ⊢ (𝜑 → 𝐹:𝐷⟶ℂ)
14	5, 8	sseldd 3569	. . 3 ⊢ (𝜑 → 𝐶 ∈ 𝐷)
15	13, 14	ffvelrnd 6268	. 2 ⊢ (𝜑 → (𝐹‘𝐶) ∈ ℂ)
16		cnxmet 22386	. . . . . 6 ⊢ (abs ∘ − ) ∈ (∞Met‘ℂ)
17		ax-resscn 9872	. . . . . . . 8 ⊢ ℝ ⊆ ℂ
18	6, 17	syl6ss 3580	. . . . . . 7 ⊢ (𝜑 → 𝐷 ⊆ ℂ)
19	18	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ 𝑤 ∈ ℝ⁺) → 𝐷 ⊆ ℂ)
20		xmetres2 21976	. . . . . 6 ⊢ (((abs ∘ − ) ∈ (∞Met‘ℂ) ∧ 𝐷 ⊆ ℂ) → ((abs ∘ − ) ↾ (𝐷 × 𝐷)) ∈ (∞Met‘𝐷))
21	16, 19, 20	sylancr 694	. . . . 5 ⊢ ((𝜑 ∧ 𝑤 ∈ ℝ⁺) → ((abs ∘ − ) ↾ (𝐷 × 𝐷)) ∈ (∞Met‘𝐷))
22	16	a1i 11	. . . . 5 ⊢ ((𝜑 ∧ 𝑤 ∈ ℝ⁺) → (abs ∘ − ) ∈ (∞Met‘ℂ))
23		eqid 2610	. . . . . . . . . . . 12 ⊢ ((abs ∘ − ) ↾ (𝐷 × 𝐷)) = ((abs ∘ − ) ↾ (𝐷 × 𝐷))
24	12	cnfldtopn 22395	. . . . . . . . . . . 12 ⊢ 𝐿 = (MetOpen‘(abs ∘ − ))
25		eqid 2610	. . . . . . . . . . . 12 ⊢ (MetOpen‘((abs ∘ − ) ↾ (𝐷 × 𝐷))) = (MetOpen‘((abs ∘ − ) ↾ (𝐷 × 𝐷)))
26	23, 24, 25	metrest 22139	. . . . . . . . . . 11 ⊢ (((abs ∘ − ) ∈ (∞Met‘ℂ) ∧ 𝐷 ⊆ ℂ) → (𝐿 ↾_t 𝐷) = (MetOpen‘((abs ∘ − ) ↾ (𝐷 × 𝐷))))
27	16, 18, 26	sylancr 694	. . . . . . . . . 10 ⊢ (𝜑 → (𝐿 ↾_t 𝐷) = (MetOpen‘((abs ∘ − ) ↾ (𝐷 × 𝐷))))
28	11, 27	syl5eq 2656	. . . . . . . . 9 ⊢ (𝜑 → 𝐾 = (MetOpen‘((abs ∘ − ) ↾ (𝐷 × 𝐷))))
29	28	oveq1d 6564	. . . . . . . 8 ⊢ (𝜑 → (𝐾 CnP 𝐿) = ((MetOpen‘((abs ∘ − ) ↾ (𝐷 × 𝐷))) CnP 𝐿))
30	29	fveq1d 6105	. . . . . . 7 ⊢ (𝜑 → ((𝐾 CnP 𝐿)‘𝐶) = (((MetOpen‘((abs ∘ − ) ↾ (𝐷 × 𝐷))) CnP 𝐿)‘𝐶))
31	9, 30	eleqtrd 2690	. . . . . 6 ⊢ (𝜑 → 𝐹 ∈ (((MetOpen‘((abs ∘ − ) ↾ (𝐷 × 𝐷))) CnP 𝐿)‘𝐶))
32	31	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ 𝑤 ∈ ℝ⁺) → 𝐹 ∈ (((MetOpen‘((abs ∘ − ) ↾ (𝐷 × 𝐷))) CnP 𝐿)‘𝐶))
33		simpr 476	. . . . 5 ⊢ ((𝜑 ∧ 𝑤 ∈ ℝ⁺) → 𝑤 ∈ ℝ⁺)
34	25, 24	metcnpi2 22160	. . . . 5 ⊢ (((((abs ∘ − ) ↾ (𝐷 × 𝐷)) ∈ (∞Met‘𝐷) ∧ (abs ∘ − ) ∈ (∞Met‘ℂ)) ∧ (𝐹 ∈ (((MetOpen‘((abs ∘ − ) ↾ (𝐷 × 𝐷))) CnP 𝐿)‘𝐶) ∧ 𝑤 ∈ ℝ⁺)) → ∃𝑣 ∈ ℝ⁺ ∀𝑦 ∈ 𝐷 ((𝑦((abs ∘ − ) ↾ (𝐷 × 𝐷))𝐶) < 𝑣 → ((𝐹‘𝑦)(abs ∘ − )(𝐹‘𝐶)) < 𝑤))
35	21, 22, 32, 33, 34	syl22anc 1319	. . . 4 ⊢ ((𝜑 ∧ 𝑤 ∈ ℝ⁺) → ∃𝑣 ∈ ℝ⁺ ∀𝑦 ∈ 𝐷 ((𝑦((abs ∘ − ) ↾ (𝐷 × 𝐷))𝐶) < 𝑣 → ((𝐹‘𝑦)(abs ∘ − )(𝐹‘𝐶)) < 𝑤))
36		simpr 476	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ 𝑦 ∈ 𝐷) → 𝑦 ∈ 𝐷)
37	14	ad2antrr 758	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ 𝑦 ∈ 𝐷) → 𝐶 ∈ 𝐷)
38	36, 37	ovresd 6699	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ 𝑦 ∈ 𝐷) → (𝑦((abs ∘ − ) ↾ (𝐷 × 𝐷))𝐶) = (𝑦(abs ∘ − )𝐶))
39	18	adantr 480	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) → 𝐷 ⊆ ℂ)
40	39	sselda 3568	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ 𝑦 ∈ 𝐷) → 𝑦 ∈ ℂ)
41		iccssre 12126	. . . . . . . . . . . . . . . 16 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴[,]𝐵) ⊆ ℝ)
42	2, 3, 41	syl2anc 691	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (𝐴[,]𝐵) ⊆ ℝ)
43	42, 17	syl6ss 3580	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝐴[,]𝐵) ⊆ ℂ)
44		ioossicc 12130	. . . . . . . . . . . . . . 15 ⊢ (𝐴(,)𝐵) ⊆ (𝐴[,]𝐵)
45	44, 8	sseldi 3566	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝐶 ∈ (𝐴[,]𝐵))
46	43, 45	sseldd 3569	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐶 ∈ ℂ)
47	46	ad2antrr 758	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ 𝑦 ∈ 𝐷) → 𝐶 ∈ ℂ)
48		eqid 2610	. . . . . . . . . . . . 13 ⊢ (abs ∘ − ) = (abs ∘ − )
49	48	cnmetdval 22384	. . . . . . . . . . . 12 ⊢ ((𝑦 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝑦(abs ∘ − )𝐶) = (abs‘(𝑦 − 𝐶)))
50	40, 47, 49	syl2anc 691	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ 𝑦 ∈ 𝐷) → (𝑦(abs ∘ − )𝐶) = (abs‘(𝑦 − 𝐶)))
51	38, 50	eqtrd 2644	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ 𝑦 ∈ 𝐷) → (𝑦((abs ∘ − ) ↾ (𝐷 × 𝐷))𝐶) = (abs‘(𝑦 − 𝐶)))
52	51	breq1d 4593	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ 𝑦 ∈ 𝐷) → ((𝑦((abs ∘ − ) ↾ (𝐷 × 𝐷))𝐶) < 𝑣 ↔ (abs‘(𝑦 − 𝐶)) < 𝑣))
53	13	adantr 480	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) → 𝐹:𝐷⟶ℂ)
54	53	ffvelrnda 6267	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ 𝑦 ∈ 𝐷) → (𝐹‘𝑦) ∈ ℂ)
55	15	ad2antrr 758	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ 𝑦 ∈ 𝐷) → (𝐹‘𝐶) ∈ ℂ)
56	48	cnmetdval 22384	. . . . . . . . . . 11 ⊢ (((𝐹‘𝑦) ∈ ℂ ∧ (𝐹‘𝐶) ∈ ℂ) → ((𝐹‘𝑦)(abs ∘ − )(𝐹‘𝐶)) = (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))))
57	54, 55, 56	syl2anc 691	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ 𝑦 ∈ 𝐷) → ((𝐹‘𝑦)(abs ∘ − )(𝐹‘𝐶)) = (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))))
58	57	breq1d 4593	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ 𝑦 ∈ 𝐷) → (((𝐹‘𝑦)(abs ∘ − )(𝐹‘𝐶)) < 𝑤 ↔ (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < 𝑤))
59	52, 58	imbi12d 333	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ 𝑦 ∈ 𝐷) → (((𝑦((abs ∘ − ) ↾ (𝐷 × 𝐷))𝐶) < 𝑣 → ((𝐹‘𝑦)(abs ∘ − )(𝐹‘𝐶)) < 𝑤) ↔ ((abs‘(𝑦 − 𝐶)) < 𝑣 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < 𝑤)))
60	59	ralbidva 2968	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) → (∀𝑦 ∈ 𝐷 ((𝑦((abs ∘ − ) ↾ (𝐷 × 𝐷))𝐶) < 𝑣 → ((𝐹‘𝑦)(abs ∘ − )(𝐹‘𝐶)) < 𝑤) ↔ ∀𝑦 ∈ 𝐷 ((abs‘(𝑦 − 𝐶)) < 𝑣 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < 𝑤)))
61		simprll 798	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ ((𝑠 ∈ ((𝐴[,]𝐵) ∖ {𝐶}) ∧ ∀𝑦 ∈ 𝐷 ((abs‘(𝑦 − 𝐶)) < 𝑣 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < 𝑤)) ∧ (abs‘(𝑠 − 𝐶)) < 𝑣)) → 𝑠 ∈ ((𝐴[,]𝐵) ∖ {𝐶}))
62		eldifsni 4261	. . . . . . . . . . . . 13 ⊢ (𝑠 ∈ ((𝐴[,]𝐵) ∖ {𝐶}) → 𝑠 ≠ 𝐶)
63	61, 62	syl 17	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ ((𝑠 ∈ ((𝐴[,]𝐵) ∖ {𝐶}) ∧ ∀𝑦 ∈ 𝐷 ((abs‘(𝑦 − 𝐶)) < 𝑣 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < 𝑤)) ∧ (abs‘(𝑠 − 𝐶)) < 𝑣)) → 𝑠 ≠ 𝐶)
64	2	ad2antrr 758	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ ((𝑠 ∈ ((𝐴[,]𝐵) ∖ {𝐶}) ∧ ∀𝑦 ∈ 𝐷 ((abs‘(𝑦 − 𝐶)) < 𝑣 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < 𝑤)) ∧ (abs‘(𝑠 − 𝐶)) < 𝑣)) → 𝐴 ∈ ℝ)
65	3	ad2antrr 758	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ ((𝑠 ∈ ((𝐴[,]𝐵) ∖ {𝐶}) ∧ ∀𝑦 ∈ 𝐷 ((abs‘(𝑦 − 𝐶)) < 𝑣 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < 𝑤)) ∧ (abs‘(𝑠 − 𝐶)) < 𝑣)) → 𝐵 ∈ ℝ)
66	4	ad2antrr 758	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ ((𝑠 ∈ ((𝐴[,]𝐵) ∖ {𝐶}) ∧ ∀𝑦 ∈ 𝐷 ((abs‘(𝑦 − 𝐶)) < 𝑣 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < 𝑤)) ∧ (abs‘(𝑠 − 𝐶)) < 𝑣)) → 𝐴 ≤ 𝐵)
67	5	ad2antrr 758	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ ((𝑠 ∈ ((𝐴[,]𝐵) ∖ {𝐶}) ∧ ∀𝑦 ∈ 𝐷 ((abs‘(𝑦 − 𝐶)) < 𝑣 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < 𝑤)) ∧ (abs‘(𝑠 − 𝐶)) < 𝑣)) → (𝐴(,)𝐵) ⊆ 𝐷)
68	6	ad2antrr 758	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ ((𝑠 ∈ ((𝐴[,]𝐵) ∖ {𝐶}) ∧ ∀𝑦 ∈ 𝐷 ((abs‘(𝑦 − 𝐶)) < 𝑣 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < 𝑤)) ∧ (abs‘(𝑠 − 𝐶)) < 𝑣)) → 𝐷 ⊆ ℝ)
69	7	ad2antrr 758	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ ((𝑠 ∈ ((𝐴[,]𝐵) ∖ {𝐶}) ∧ ∀𝑦 ∈ 𝐷 ((abs‘(𝑦 − 𝐶)) < 𝑣 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < 𝑤)) ∧ (abs‘(𝑠 − 𝐶)) < 𝑣)) → 𝐹 ∈ 𝐿¹)
70	8	ad2antrr 758	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ ((𝑠 ∈ ((𝐴[,]𝐵) ∖ {𝐶}) ∧ ∀𝑦 ∈ 𝐷 ((abs‘(𝑦 − 𝐶)) < 𝑣 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < 𝑤)) ∧ (abs‘(𝑠 − 𝐶)) < 𝑣)) → 𝐶 ∈ (𝐴(,)𝐵))
71	9	ad2antrr 758	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ ((𝑠 ∈ ((𝐴[,]𝐵) ∖ {𝐶}) ∧ ∀𝑦 ∈ 𝐷 ((abs‘(𝑦 − 𝐶)) < 𝑣 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < 𝑤)) ∧ (abs‘(𝑠 − 𝐶)) < 𝑣)) → 𝐹 ∈ ((𝐾 CnP 𝐿)‘𝐶))
72		ftc1.h	. . . . . . . . . . . . 13 ⊢ 𝐻 = (𝑧 ∈ ((𝐴[,]𝐵) ∖ {𝐶}) ↦ (((𝐺‘𝑧) − (𝐺‘𝐶)) / (𝑧 − 𝐶)))
73		simplrl 796	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ ((𝑠 ∈ ((𝐴[,]𝐵) ∖ {𝐶}) ∧ ∀𝑦 ∈ 𝐷 ((abs‘(𝑦 − 𝐶)) < 𝑣 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < 𝑤)) ∧ (abs‘(𝑠 − 𝐶)) < 𝑣)) → 𝑤 ∈ ℝ⁺)
74		simplrr 797	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ ((𝑠 ∈ ((𝐴[,]𝐵) ∖ {𝐶}) ∧ ∀𝑦 ∈ 𝐷 ((abs‘(𝑦 − 𝐶)) < 𝑣 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < 𝑤)) ∧ (abs‘(𝑠 − 𝐶)) < 𝑣)) → 𝑣 ∈ ℝ⁺)
75		simprlr 799	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ ((𝑠 ∈ ((𝐴[,]𝐵) ∖ {𝐶}) ∧ ∀𝑦 ∈ 𝐷 ((abs‘(𝑦 − 𝐶)) < 𝑣 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < 𝑤)) ∧ (abs‘(𝑠 − 𝐶)) < 𝑣)) → ∀𝑦 ∈ 𝐷 ((abs‘(𝑦 − 𝐶)) < 𝑣 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < 𝑤))
76		oveq1 6556	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑦 = 𝑢 → (𝑦 − 𝐶) = (𝑢 − 𝐶))
77	76	fveq2d 6107	. . . . . . . . . . . . . . . . 17 ⊢ (𝑦 = 𝑢 → (abs‘(𝑦 − 𝐶)) = (abs‘(𝑢 − 𝐶)))
78	77	breq1d 4593	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 = 𝑢 → ((abs‘(𝑦 − 𝐶)) < 𝑣 ↔ (abs‘(𝑢 − 𝐶)) < 𝑣))
79		fveq2 6103	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑦 = 𝑢 → (𝐹‘𝑦) = (𝐹‘𝑢))
80	79	oveq1d 6564	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑦 = 𝑢 → ((𝐹‘𝑦) − (𝐹‘𝐶)) = ((𝐹‘𝑢) − (𝐹‘𝐶)))
81	80	fveq2d 6107	. . . . . . . . . . . . . . . . 17 ⊢ (𝑦 = 𝑢 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) = (abs‘((𝐹‘𝑢) − (𝐹‘𝐶))))
82	81	breq1d 4593	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 = 𝑢 → ((abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < 𝑤 ↔ (abs‘((𝐹‘𝑢) − (𝐹‘𝐶))) < 𝑤))
83	78, 82	imbi12d 333	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = 𝑢 → (((abs‘(𝑦 − 𝐶)) < 𝑣 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < 𝑤) ↔ ((abs‘(𝑢 − 𝐶)) < 𝑣 → (abs‘((𝐹‘𝑢) − (𝐹‘𝐶))) < 𝑤)))
84	83	rspccva 3281	. . . . . . . . . . . . . 14 ⊢ ((∀𝑦 ∈ 𝐷 ((abs‘(𝑦 − 𝐶)) < 𝑣 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < 𝑤) ∧ 𝑢 ∈ 𝐷) → ((abs‘(𝑢 − 𝐶)) < 𝑣 → (abs‘((𝐹‘𝑢) − (𝐹‘𝐶))) < 𝑤))
85	75, 84	sylan 487	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ ((𝑠 ∈ ((𝐴[,]𝐵) ∖ {𝐶}) ∧ ∀𝑦 ∈ 𝐷 ((abs‘(𝑦 − 𝐶)) < 𝑣 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < 𝑤)) ∧ (abs‘(𝑠 − 𝐶)) < 𝑣)) ∧ 𝑢 ∈ 𝐷) → ((abs‘(𝑢 − 𝐶)) < 𝑣 → (abs‘((𝐹‘𝑢) − (𝐹‘𝐶))) < 𝑤))
86	61	eldifad 3552	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ ((𝑠 ∈ ((𝐴[,]𝐵) ∖ {𝐶}) ∧ ∀𝑦 ∈ 𝐷 ((abs‘(𝑦 − 𝐶)) < 𝑣 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < 𝑤)) ∧ (abs‘(𝑠 − 𝐶)) < 𝑣)) → 𝑠 ∈ (𝐴[,]𝐵))
87		simprr 792	. . . . . . . . . . . . 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 23607	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ ((𝑠 ∈ ((𝐴[,]𝐵) ∖ {𝐶}) ∧ ∀𝑦 ∈ 𝐷 ((abs‘(𝑦 − 𝐶)) < 𝑣 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < 𝑤)) ∧ (abs‘(𝑠 − 𝐶)) < 𝑣)) ∧ 𝑠 ≠ 𝐶) → (abs‘((𝐻‘𝑠) − (𝐹‘𝐶))) < 𝑤)
89	63, 88	mpdan 699	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ ((𝑠 ∈ ((𝐴[,]𝐵) ∖ {𝐶}) ∧ ∀𝑦 ∈ 𝐷 ((abs‘(𝑦 − 𝐶)) < 𝑣 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < 𝑤)) ∧ (abs‘(𝑠 − 𝐶)) < 𝑣)) → (abs‘((𝐻‘𝑠) − (𝐹‘𝐶))) < 𝑤)
90	89	expr 641	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ (𝑠 ∈ ((𝐴[,]𝐵) ∖ {𝐶}) ∧ ∀𝑦 ∈ 𝐷 ((abs‘(𝑦 − 𝐶)) < 𝑣 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < 𝑤))) → ((abs‘(𝑠 − 𝐶)) < 𝑣 → (abs‘((𝐻‘𝑠) − (𝐹‘𝐶))) < 𝑤))
91	90	adantld 482	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ (𝑠 ∈ ((𝐴[,]𝐵) ∖ {𝐶}) ∧ ∀𝑦 ∈ 𝐷 ((abs‘(𝑦 − 𝐶)) < 𝑣 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < 𝑤))) → ((𝑠 ≠ 𝐶 ∧ (abs‘(𝑠 − 𝐶)) < 𝑣) → (abs‘((𝐻‘𝑠) − (𝐹‘𝐶))) < 𝑤))
92	91	expr 641	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) ∧ 𝑠 ∈ ((𝐴[,]𝐵) ∖ {𝐶})) → (∀𝑦 ∈ 𝐷 ((abs‘(𝑦 − 𝐶)) < 𝑣 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < 𝑤) → ((𝑠 ≠ 𝐶 ∧ (abs‘(𝑠 − 𝐶)) < 𝑣) → (abs‘((𝐻‘𝑠) − (𝐹‘𝐶))) < 𝑤)))
93	92	ralrimdva 2952	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) → (∀𝑦 ∈ 𝐷 ((abs‘(𝑦 − 𝐶)) < 𝑣 → (abs‘((𝐹‘𝑦) − (𝐹‘𝐶))) < 𝑤) → ∀𝑠 ∈ ((𝐴[,]𝐵) ∖ {𝐶})((𝑠 ≠ 𝐶 ∧ (abs‘(𝑠 − 𝐶)) < 𝑣) → (abs‘((𝐻‘𝑠) − (𝐹‘𝐶))) < 𝑤)))
94	60, 93	sylbid 229	. . . . . 6 ⊢ ((𝜑 ∧ (𝑤 ∈ ℝ⁺ ∧ 𝑣 ∈ ℝ⁺)) → (∀𝑦 ∈ 𝐷 ((𝑦((abs ∘ − ) ↾ (𝐷 × 𝐷))𝐶) < 𝑣 → ((𝐹‘𝑦)(abs ∘ − )(𝐹‘𝐶)) < 𝑤) → ∀𝑠 ∈ ((𝐴[,]𝐵) ∖ {𝐶})((𝑠 ≠ 𝐶 ∧ (abs‘(𝑠 − 𝐶)) < 𝑣) → (abs‘((𝐻‘𝑠) − (𝐹‘𝐶))) < 𝑤)))
95	94	anassrs 678	. . . . 5 ⊢ (((𝜑 ∧ 𝑤 ∈ ℝ⁺) ∧ 𝑣 ∈ ℝ⁺) → (∀𝑦 ∈ 𝐷 ((𝑦((abs ∘ − ) ↾ (𝐷 × 𝐷))𝐶) < 𝑣 → ((𝐹‘𝑦)(abs ∘ − )(𝐹‘𝐶)) < 𝑤) → ∀𝑠 ∈ ((𝐴[,]𝐵) ∖ {𝐶})((𝑠 ≠ 𝐶 ∧ (abs‘(𝑠 − 𝐶)) < 𝑣) → (abs‘((𝐻‘𝑠) − (𝐹‘𝐶))) < 𝑤)))
96	95	reximdva 3000	. . . 4 ⊢ ((𝜑 ∧ 𝑤 ∈ ℝ⁺) → (∃𝑣 ∈ ℝ⁺ ∀𝑦 ∈ 𝐷 ((𝑦((abs ∘ − ) ↾ (𝐷 × 𝐷))𝐶) < 𝑣 → ((𝐹‘𝑦)(abs ∘ − )(𝐹‘𝐶)) < 𝑤) → ∃𝑣 ∈ ℝ⁺ ∀𝑠 ∈ ((𝐴[,]𝐵) ∖ {𝐶})((𝑠 ≠ 𝐶 ∧ (abs‘(𝑠 − 𝐶)) < 𝑣) → (abs‘((𝐻‘𝑠) − (𝐹‘𝐶))) < 𝑤)))
97	35, 96	mpd 15	. . 3 ⊢ ((𝜑 ∧ 𝑤 ∈ ℝ⁺) → ∃𝑣 ∈ ℝ⁺ ∀𝑠 ∈ ((𝐴[,]𝐵) ∖ {𝐶})((𝑠 ≠ 𝐶 ∧ (abs‘(𝑠 − 𝐶)) < 𝑣) → (abs‘((𝐻‘𝑠) − (𝐹‘𝐶))) < 𝑤))
98	97	ralrimiva 2949	. 2 ⊢ (𝜑 → ∀𝑤 ∈ ℝ⁺ ∃𝑣 ∈ ℝ⁺ ∀𝑠 ∈ ((𝐴[,]𝐵) ∖ {𝐶})((𝑠 ≠ 𝐶 ∧ (abs‘(𝑠 − 𝐶)) < 𝑣) → (abs‘((𝐻‘𝑠) − (𝐹‘𝐶))) < 𝑤))
99	1, 2, 3, 4, 5, 6, 7, 13	ftc1lem2 23603	. . . . 5 ⊢ (𝜑 → 𝐺:(𝐴[,]𝐵)⟶ℂ)
100	99, 43, 45	dvlem 23466	. . . 4 ⊢ ((𝜑 ∧ 𝑧 ∈ ((𝐴[,]𝐵) ∖ {𝐶})) → (((𝐺‘𝑧) − (𝐺‘𝐶)) / (𝑧 − 𝐶)) ∈ ℂ)
101	100, 72	fmptd 6292	. . 3 ⊢ (𝜑 → 𝐻:((𝐴[,]𝐵) ∖ {𝐶})⟶ℂ)
102	43	ssdifssd 3710	. . 3 ⊢ (𝜑 → ((𝐴[,]𝐵) ∖ {𝐶}) ⊆ ℂ)
103	101, 102, 46	ellimc3 23449	. 2 ⊢ (𝜑 → ((𝐹‘𝐶) ∈ (𝐻 lim_ℂ 𝐶) ↔ ((𝐹‘𝐶) ∈ ℂ ∧ ∀𝑤 ∈ ℝ⁺ ∃𝑣 ∈ ℝ⁺ ∀𝑠 ∈ ((𝐴[,]𝐵) ∖ {𝐶})((𝑠 ≠ 𝐶 ∧ (abs‘(𝑠 − 𝐶)) < 𝑣) → (abs‘((𝐻‘𝑠) − (𝐹‘𝐶))) < 𝑤))))
104	15, 98, 103	mpbir2and 959	1 ⊢ (𝜑 → (𝐹‘𝐶) ∈ (𝐻 lim_ℂ 𝐶))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 383 = wceq 1475 ∈ wcel 1977 ≠ wne 2780 ∀wral 2896 ∃wrex 2897 ∖ cdif 3537 ⊆ wss 3540 {csn 4125 class class class wbr 4583 ↦ cmpt 4643 × cxp 5036 ↾ cres 5040 ∘ ccom 5042 ⟶wf 5800 ‘cfv 5804 (class class class)co 6549 ℂcc 9813 ℝcr 9814 < clt 9953 ≤ cle 9954 − cmin 10145 / cdiv 10563 ℝ⁺crp 11708 (,)cioo 12046 [,]cicc 12049 abscabs 13822 ↾_t crest 15904 TopOpenctopn 15905 ∞Metcxmt 19552 MetOpencmopn 19557 ℂ_fldccnfld 19567 CnP ccnp 20839 𝐿¹cibl 23192 ∫citg 23193 lim_ℂ climc 23432

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-rep 4699 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 ax-inf2 8421 ax-cc 9140 ax-cnex 9871 ax-resscn 9872 ax-1cn 9873 ax-icn 9874 ax-addcl 9875 ax-addrcl 9876 ax-mulcl 9877 ax-mulrcl 9878 ax-mulcom 9879 ax-addass 9880 ax-mulass 9881 ax-distr 9882 ax-i2m1 9883 ax-1ne0 9884 ax-1rid 9885 ax-rnegex 9886 ax-rrecex 9887 ax-cnre 9888 ax-pre-lttri 9889 ax-pre-lttrn 9890 ax-pre-ltadd 9891 ax-pre-mulgt0 9892 ax-pre-sup 9893 ax-addf 9894 ax-mulf 9895

This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-fal 1481 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-nel 2783 df-ral 2901 df-rex 2902 df-reu 2903 df-rmo 2904 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-pss 3556 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-tp 4130 df-op 4132 df-uni 4373 df-int 4411 df-iun 4457 df-iin 4458 df-disj 4554 df-br 4584 df-opab 4644 df-mpt 4645 df-tr 4681 df-eprel 4949 df-id 4953 df-po 4959 df-so 4960 df-fr 4997 df-se 4998 df-we 4999 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-pred 5597 df-ord 5643 df-on 5644 df-lim 5645 df-suc 5646 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-isom 5813 df-riota 6511 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-of 6795 df-ofr 6796 df-om 6958 df-1st 7059 df-2nd 7060 df-supp 7183 df-wrecs 7294 df-recs 7355 df-rdg 7393 df-1o 7447 df-2o 7448 df-oadd 7451 df-omul 7452 df-er 7629 df-map 7746 df-pm 7747 df-ixp 7795 df-en 7842 df-dom 7843 df-sdom 7844 df-fin 7845 df-fsupp 8159 df-fi 8200 df-sup 8231 df-inf 8232 df-oi 8298 df-card 8648 df-acn 8651 df-cda 8873 df-pnf 9955 df-mnf 9956 df-xr 9957 df-ltxr 9958 df-le 9959 df-sub 10147 df-neg 10148 df-div 10564 df-nn 10898 df-2 10956 df-3 10957 df-4 10958 df-5 10959 df-6 10960 df-7 10961 df-8 10962 df-9 10963 df-n0 11170 df-z 11255 df-dec 11370 df-uz 11564 df-q 11665 df-rp 11709 df-xneg 11822 df-xadd 11823 df-xmul 11824 df-ioo 12050 df-ioc 12051 df-ico 12052 df-icc 12053 df-fz 12198 df-fzo 12335 df-fl 12455 df-mod 12531 df-seq 12664 df-exp 12723 df-hash 12980 df-cj 13687 df-re 13688 df-im 13689 df-sqrt 13823 df-abs 13824 df-clim 14067 df-rlim 14068 df-sum 14265 df-struct 15697 df-ndx 15698 df-slot 15699 df-base 15700 df-sets 15701 df-ress 15702 df-plusg 15781 df-mulr 15782 df-starv 15783 df-sca 15784 df-vsca 15785 df-ip 15786 df-tset 15787 df-ple 15788 df-ds 15791 df-unif 15792 df-hom 15793 df-cco 15794 df-rest 15906 df-topn 15907 df-0g 15925 df-gsum 15926 df-topgen 15927 df-pt 15928 df-prds 15931 df-xrs 15985 df-qtop 15990 df-imas 15991 df-xps 15993 df-mre 16069 df-mrc 16070 df-acs 16072 df-mgm 17065 df-sgrp 17107 df-mnd 17118 df-submnd 17159 df-mulg 17364 df-cntz 17573 df-cmn 18018 df-psmet 19559 df-xmet 19560 df-met 19561 df-bl 19562 df-mopn 19563 df-cnfld 19568 df-top 20521 df-bases 20522 df-topon 20523 df-topsp 20524 df-cn 20841 df-cnp 20842 df-cmp 21000 df-tx 21175 df-hmeo 21368 df-xms 21935 df-ms 21936 df-tms 21937 df-cncf 22489 df-ovol 23040 df-vol 23041 df-mbf 23194 df-itg1 23195 df-itg2 23196 df-ibl 23197 df-itg 23198 df-0p 23243 df-limc 23436

This theorem is referenced by: ftc1 23609

W3C validator