Metamath Proof Explorer


Theorem dvrelog3

Description: The derivative of the logarithm on an open interval. (Contributed by metakunt, 11-Aug-2024)

Ref Expression
Hypotheses dvrelog3.1 ⊢ φ → A ∈ ℝ *
dvrelog3.2 ⊢ φ → B ∈ ℝ *
dvrelog3.3 ⊢ φ → 0 ≤ A
dvrelog3.4 ⊢ φ → A ≤ B
dvrelog3.5 ⊢ F = x ∈ A B ⟼ log ⁡ x
dvrelog3.6 ⊢ G = x ∈ A B ⟼ 1 x
Assertion dvrelog3 ⊢ φ → ℝ D F = G

Proof

Step Hyp Ref Expression
1 dvrelog3.1 ⊢ φ → A ∈ ℝ *
2 dvrelog3.2 ⊢ φ → B ∈ ℝ *
3 dvrelog3.3 ⊢ φ → 0 ≤ A
4 dvrelog3.4 ⊢ φ → A ≤ B
5 dvrelog3.5 ⊢ F = x ∈ A B ⟼ log ⁡ x
6 dvrelog3.6 ⊢ G = x ∈ A B ⟼ 1 x
7 5 a1i ⊢ φ → F = x ∈ A B ⟼ log ⁡ x
8 7 oveq2d ⊢ φ → ℝ D F = dx ∈ A B log ⁡ x d ℝ x
9 reelprrecn ⊢ ℝ ∈ ℝ ℂ
10 9 a1i ⊢ φ → ℝ ∈ ℝ ℂ
11 rpcn ⊢ x ∈ ℝ + → x ∈ ℂ
12 11 adantl ⊢ φ ∧ x ∈ ℝ + → x ∈ ℂ
13 rpne0 ⊢ x ∈ ℝ + → x ≠ 0
14 13 adantl ⊢ φ ∧ x ∈ ℝ + → x ≠ 0
15 12 14 logcld ⊢ φ ∧ x ∈ ℝ + → log ⁡ x ∈ ℂ
16 1red ⊢ φ ∧ x ∈ ℝ + → 1 ∈ ℝ
17 rpre ⊢ x ∈ ℝ + → x ∈ ℝ
18 17 adantl ⊢ φ ∧ x ∈ ℝ + → x ∈ ℝ
19 16 18 14 redivcld ⊢ φ ∧ x ∈ ℝ + → 1 x ∈ ℝ
20 logf1o ⊢ log : ℂ ∖ 0 ⟶ 1-1 onto ran ⁡ log
21 f1of ⊢ log : ℂ ∖ 0 ⟶ 1-1 onto ran ⁡ log → log : ℂ ∖ 0 ⟶ ran ⁡ log
22 20 21 ax-mp ⊢ log : ℂ ∖ 0 ⟶ ran ⁡ log
23 22 a1i ⊢ φ → log : ℂ ∖ 0 ⟶ ran ⁡ log
24 0nrp ⊢ ¬ 0 ∈ ℝ +
25 disjsn ⊢ ℝ + ∩ 0 = ∅ ↔ ¬ 0 ∈ ℝ +
26 24 25 mpbir ⊢ ℝ + ∩ 0 = ∅
27 disjdif2 ⊢ ℝ + ∩ 0 = ∅ → ℝ + ∖ 0 = ℝ +
28 26 27 ax-mp ⊢ ℝ + ∖ 0 = ℝ +
29 rpssre ⊢ ℝ + ⊆ ℝ
30 ax-resscn ⊢ ℝ ⊆ ℂ
31 29 30 sstri ⊢ ℝ + ⊆ ℂ
32 ssdif ⊢ ℝ + ⊆ ℂ → ℝ + ∖ 0 ⊆ ℂ ∖ 0
33 31 32 ax-mp ⊢ ℝ + ∖ 0 ⊆ ℂ ∖ 0
34 28 33 eqsstrri ⊢ ℝ + ⊆ ℂ ∖ 0
35 34 a1i ⊢ φ → ℝ + ⊆ ℂ ∖ 0
36 23 35 feqresmpt ⊢ φ → log ↾ ℝ + = x ∈ ℝ + ⟼ log ⁡ x
37 36 eqcomd ⊢ φ → x ∈ ℝ + ⟼ log ⁡ x = log ↾ ℝ +
38 37 oveq2d ⊢ φ → dx ∈ ℝ + log ⁡ x d ℝ x = ℝ D log ↾ ℝ +
39 dvrelog ⊢ ℝ D log ↾ ℝ + = x ∈ ℝ + ⟼ 1 x
40 39 a1i ⊢ φ → ℝ D log ↾ ℝ + = x ∈ ℝ + ⟼ 1 x
41 38 40 eqtrd ⊢ φ → dx ∈ ℝ + log ⁡ x d ℝ x = x ∈ ℝ + ⟼ 1 x
42 elioo2 ⊢ A ∈ ℝ * ∧ B ∈ ℝ * → y ∈ A B ↔ y ∈ ℝ ∧ A < y ∧ y < B
43 1 2 42 syl2anc ⊢ φ → y ∈ A B ↔ y ∈ ℝ ∧ A < y ∧ y < B
44 43 biimpa ⊢ φ ∧ y ∈ A B → y ∈ ℝ ∧ A < y ∧ y < B
45 44 simp1d ⊢ φ ∧ y ∈ A B → y ∈ ℝ
46 0red ⊢ φ ∧ y ∈ A B → 0 ∈ ℝ
47 46 rexrd ⊢ φ ∧ y ∈ A B → 0 ∈ ℝ *
48 1 adantr ⊢ φ ∧ y ∈ A B → A ∈ ℝ *
49 45 rexrd ⊢ φ ∧ y ∈ A B → y ∈ ℝ *
50 3 adantr ⊢ φ ∧ y ∈ A B → 0 ≤ A
51 44 simp2d ⊢ φ ∧ y ∈ A B → A < y
52 47 48 49 50 51 xrlelttrd ⊢ φ ∧ y ∈ A B → 0 < y
53 45 52 jca ⊢ φ ∧ y ∈ A B → y ∈ ℝ ∧ 0 < y
54 elrp ⊢ y ∈ ℝ + ↔ y ∈ ℝ ∧ 0 < y
55 53 54 sylibr ⊢ φ ∧ y ∈ A B → y ∈ ℝ +
56 55 ex ⊢ φ → y ∈ A B → y ∈ ℝ +
57 56 ssrdv ⊢ φ → A B ⊆ ℝ +
58 tgioo4 ⊢ topGen ⁡ ran ⁡ . = TopOpen ⁡ ℂ fld ↾ 𝑡 ℝ
59 eqid ⊢ TopOpen ⁡ ℂ fld = TopOpen ⁡ ℂ fld
60 retop ⊢ topGen ⁡ ran ⁡ . ∈ Top
61 60 a1i ⊢ φ → topGen ⁡ ran ⁡ . ∈ Top
62 iooretop ⊢ A B ∈ topGen ⁡ ran ⁡ .
63 62 a1i ⊢ φ → A B ∈ topGen ⁡ ran ⁡ .
64 isopn3i ⊢ topGen ⁡ ran ⁡ . ∈ Top ∧ A B ∈ topGen ⁡ ran ⁡ . → int ⁡ topGen ⁡ ran ⁡ . ⁡ A B = A B
65 61 63 64 syl2anc ⊢ φ → int ⁡ topGen ⁡ ran ⁡ . ⁡ A B = A B
66 10 15 19 41 57 58 59 65 dvmptres2 ⊢ φ → dx ∈ A B log ⁡ x d ℝ x = x ∈ A B ⟼ 1 x
67 8 66 eqtrd ⊢ φ → ℝ D F = x ∈ A B ⟼ 1 x
68 6 a1i ⊢ φ → G = x ∈ A B ⟼ 1 x
69 68 eqcomd ⊢ φ → x ∈ A B ⟼ 1 x = G
70 67 69 eqtrd ⊢ φ → ℝ D F = G