Metamath Proof Explorer


Theorem ftc1cn

Description: Strengthen the assumptions of ftc1 to when the function F is continuous on the entire interval ( A , B ) ; in this case we can calculate _D G exactly. (Contributed by Mario Carneiro, 1-Sep-2014)

Ref Expression
Hypotheses ftc1cn.g ⊢ G = x ∈ A B ⟼ ∫ A x F ⁡ t dt
ftc1cn.a ⊢ φ → A ∈ ℝ
ftc1cn.b ⊢ φ → B ∈ ℝ
ftc1cn.le ⊢ φ → A ≤ B
ftc1cn.f ⊢ φ → F : A B ⟶cn ℂ
ftc1cn.i ⊢ φ → F ∈ 𝐿 1
Assertion ftc1cn ⊢ φ → ℝ D G = F

Proof

Step Hyp Ref Expression
1 ftc1cn.g ⊢ G = x ∈ A B ⟼ ∫ A x F ⁡ t dt
2 ftc1cn.a ⊢ φ → A ∈ ℝ
3 ftc1cn.b ⊢ φ → B ∈ ℝ
4 ftc1cn.le ⊢ φ → A ≤ B
5 ftc1cn.f ⊢ φ → F : A B ⟶cn ℂ
6 ftc1cn.i ⊢ φ → F ∈ 𝐿 1
7 dvf ⊢ G ℝ ′ : dom ⁡ G ℝ ′ ⟶ ℂ
8 7 a1i ⊢ φ → G ℝ ′ : dom ⁡ G ℝ ′ ⟶ ℂ
9 8 ffund ⊢ φ → Fun ⁡ G ℝ ′
10 ax-resscn ⊢ ℝ ⊆ ℂ
11 10 a1i ⊢ φ → ℝ ⊆ ℂ
12 ssidd ⊢ φ → A B ⊆ A B
13 ioossre ⊢ A B ⊆ ℝ
14 13 a1i ⊢ φ → A B ⊆ ℝ
15 cncff ⊢ F : A B ⟶cn ℂ → F : A B ⟶ ℂ
16 5 15 syl ⊢ φ → F : A B ⟶ ℂ
17 1 2 3 4 12 14 6 16 ftc1lem2 ⊢ φ → G : A B ⟶ ℂ
18 iccssre ⊢ A ∈ ℝ ∧ B ∈ ℝ → A B ⊆ ℝ
19 2 3 18 syl2anc ⊢ φ → A B ⊆ ℝ
20 tgioo4 ⊢ topGen ⁡ ran ⁡ . = TopOpen ⁡ ℂ fld ↾ 𝑡 ℝ
21 eqid ⊢ TopOpen ⁡ ℂ fld = TopOpen ⁡ ℂ fld
22 11 17 19 20 21 dvbssntr ⊢ φ → dom ⁡ G ℝ ′ ⊆ int ⁡ topGen ⁡ ran ⁡ . ⁡ A B
23 iccntr ⊢ A ∈ ℝ ∧ B ∈ ℝ → int ⁡ topGen ⁡ ran ⁡ . ⁡ A B = A B
24 2 3 23 syl2anc ⊢ φ → int ⁡ topGen ⁡ ran ⁡ . ⁡ A B = A B
25 22 24 sseqtrd ⊢ φ → dom ⁡ G ℝ ′ ⊆ A B
26 2 adantr ⊢ φ ∧ y ∈ A B → A ∈ ℝ
27 3 adantr ⊢ φ ∧ y ∈ A B → B ∈ ℝ
28 4 adantr ⊢ φ ∧ y ∈ A B → A ≤ B
29 ssidd ⊢ φ ∧ y ∈ A B → A B ⊆ A B
30 13 a1i ⊢ φ ∧ y ∈ A B → A B ⊆ ℝ
31 6 adantr ⊢ φ ∧ y ∈ A B → F ∈ 𝐿 1
32 simpr ⊢ φ ∧ y ∈ A B → y ∈ A B
33 13 10 sstri ⊢ A B ⊆ ℂ
34 ssid ⊢ ℂ ⊆ ℂ
35 eqid ⊢ TopOpen ⁡ ℂ fld ↾ 𝑡 A B = TopOpen ⁡ ℂ fld ↾ 𝑡 A B
36 21 cnfldtopon ⊢ TopOpen ⁡ ℂ fld ∈ TopOn ⁡ ℂ
37 36 toponrestid ⊢ TopOpen ⁡ ℂ fld = TopOpen ⁡ ℂ fld ↾ 𝑡 ℂ
38 21 35 37 cncfcn ⊢ A B ⊆ ℂ ∧ ℂ ⊆ ℂ → A B ⟶cn ℂ = TopOpen ⁡ ℂ fld ↾ 𝑡 A B Cn TopOpen ⁡ ℂ fld
39 33 34 38 mp2an ⊢ A B ⟶cn ℂ = TopOpen ⁡ ℂ fld ↾ 𝑡 A B Cn TopOpen ⁡ ℂ fld
40 5 39 eleqtrdi ⊢ φ → F ∈ TopOpen ⁡ ℂ fld ↾ 𝑡 A B Cn TopOpen ⁡ ℂ fld
41 40 adantr ⊢ φ ∧ y ∈ A B → F ∈ TopOpen ⁡ ℂ fld ↾ 𝑡 A B Cn TopOpen ⁡ ℂ fld
42 33 a1i ⊢ φ → A B ⊆ ℂ
43 resttopon ⊢ TopOpen ⁡ ℂ fld ∈ TopOn ⁡ ℂ ∧ A B ⊆ ℂ → TopOpen ⁡ ℂ fld ↾ 𝑡 A B ∈ TopOn ⁡ A B
44 36 42 43 sylancr ⊢ φ → TopOpen ⁡ ℂ fld ↾ 𝑡 A B ∈ TopOn ⁡ A B
45 toponuni ⊢ TopOpen ⁡ ℂ fld ↾ 𝑡 A B ∈ TopOn ⁡ A B → A B = ⋃ TopOpen ⁡ ℂ fld ↾ 𝑡 A B
46 44 45 syl ⊢ φ → A B = ⋃ TopOpen ⁡ ℂ fld ↾ 𝑡 A B
47 46 eleq2d ⊢ φ → y ∈ A B ↔ y ∈ ⋃ TopOpen ⁡ ℂ fld ↾ 𝑡 A B
48 47 biimpa ⊢ φ ∧ y ∈ A B → y ∈ ⋃ TopOpen ⁡ ℂ fld ↾ 𝑡 A B
49 eqid ⊢ ⋃ TopOpen ⁡ ℂ fld ↾ 𝑡 A B = ⋃ TopOpen ⁡ ℂ fld ↾ 𝑡 A B
50 49 cncnpi ⊢ F ∈ TopOpen ⁡ ℂ fld ↾ 𝑡 A B Cn TopOpen ⁡ ℂ fld ∧ y ∈ ⋃ TopOpen ⁡ ℂ fld ↾ 𝑡 A B → F ∈ TopOpen ⁡ ℂ fld ↾ 𝑡 A B CnP TopOpen ⁡ ℂ fld ⁡ y
51 41 48 50 syl2anc ⊢ φ ∧ y ∈ A B → F ∈ TopOpen ⁡ ℂ fld ↾ 𝑡 A B CnP TopOpen ⁡ ℂ fld ⁡ y
52 1 26 27 28 29 30 31 32 51 20 35 21 ftc1 ⊢ φ ∧ y ∈ A B → y G ℝ ′ F ⁡ y
53 vex ⊢ y ∈ V
54 fvex ⊢ F ⁡ y ∈ V
55 53 54 breldm ⊢ y G ℝ ′ F ⁡ y → y ∈ dom ⁡ G ℝ ′
56 52 55 syl ⊢ φ ∧ y ∈ A B → y ∈ dom ⁡ G ℝ ′
57 25 56 eqelssd ⊢ φ → dom ⁡ G ℝ ′ = A B
58 df-fn ⊢ G ℝ ′ Fn A B ↔ Fun ⁡ G ℝ ′ ∧ dom ⁡ G ℝ ′ = A B
59 9 57 58 sylanbrc ⊢ φ → G ℝ ′ Fn A B
60 16 ffnd ⊢ φ → F Fn A B
61 9 adantr ⊢ φ ∧ y ∈ A B → Fun ⁡ G ℝ ′
62 funbrfv ⊢ Fun ⁡ G ℝ ′ → y G ℝ ′ F ⁡ y → G ℝ ′ ⁡ y = F ⁡ y
63 61 52 62 sylc ⊢ φ ∧ y ∈ A B → G ℝ ′ ⁡ y = F ⁡ y
64 59 60 63 eqfnfvd ⊢ φ → ℝ D G = F