Metamath Proof Explorer


Theorem logdiv2

Description: Generalization of relogdiv to a complex left argument. (Contributed by Mario Carneiro, 8-Jul-2017)

Ref Expression
Assertion logdiv2 ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ B ∈ ℝ + → log ⁡ A B = log ⁡ A − log ⁡ B

Proof

Step Hyp Ref Expression
1 logcl ⊢ A ∈ ℂ ∧ A ≠ 0 → log ⁡ A ∈ ℂ
2 1 3adant3 ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ B ∈ ℝ + → log ⁡ A ∈ ℂ
3 relogcl ⊢ B ∈ ℝ + → log ⁡ B ∈ ℝ
4 3 3ad2ant3 ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ B ∈ ℝ + → log ⁡ B ∈ ℝ
5 4 recnd ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ B ∈ ℝ + → log ⁡ B ∈ ℂ
6 efsub ⊢ log ⁡ A ∈ ℂ ∧ log ⁡ B ∈ ℂ → e log ⁡ A − log ⁡ B = e log ⁡ A e log ⁡ B
7 2 5 6 syl2anc ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ B ∈ ℝ + → e log ⁡ A − log ⁡ B = e log ⁡ A e log ⁡ B
8 eflog ⊢ A ∈ ℂ ∧ A ≠ 0 → e log ⁡ A = A
9 8 3adant3 ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ B ∈ ℝ + → e log ⁡ A = A
10 reeflog ⊢ B ∈ ℝ + → e log ⁡ B = B
11 10 3ad2ant3 ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ B ∈ ℝ + → e log ⁡ B = B
12 9 11 oveq12d ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ B ∈ ℝ + → e log ⁡ A e log ⁡ B = A B
13 7 12 eqtrd ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ B ∈ ℝ + → e log ⁡ A − log ⁡ B = A B
14 13 fveq2d ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ B ∈ ℝ + → log ⁡ e log ⁡ A − log ⁡ B = log ⁡ A B
15 2 5 negsubd ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ B ∈ ℝ + → log ⁡ A + − log ⁡ B = log ⁡ A − log ⁡ B
16 logrncl ⊢ A ∈ ℂ ∧ A ≠ 0 → log ⁡ A ∈ ran ⁡ log
17 16 3adant3 ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ B ∈ ℝ + → log ⁡ A ∈ ran ⁡ log
18 4 renegcld ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ B ∈ ℝ + → − log ⁡ B ∈ ℝ
19 logrnaddcl ⊢ log ⁡ A ∈ ran ⁡ log ∧ − log ⁡ B ∈ ℝ → log ⁡ A + − log ⁡ B ∈ ran ⁡ log
20 17 18 19 syl2anc ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ B ∈ ℝ + → log ⁡ A + − log ⁡ B ∈ ran ⁡ log
21 15 20 eqeltrrd ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ B ∈ ℝ + → log ⁡ A − log ⁡ B ∈ ran ⁡ log
22 logef ⊢ log ⁡ A − log ⁡ B ∈ ran ⁡ log → log ⁡ e log ⁡ A − log ⁡ B = log ⁡ A − log ⁡ B
23 21 22 syl ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ B ∈ ℝ + → log ⁡ e log ⁡ A − log ⁡ B = log ⁡ A − log ⁡ B
24 14 23 eqtr3d ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ B ∈ ℝ + → log ⁡ A B = log ⁡ A − log ⁡ B