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

Theorem logbfval 26046
Description: The general logarithm of a complex number to a fixed base. (Contributed by AV, 11-Jun-2020.)
Assertion
Ref Expression
logbfval (((𝐵 ∈ ℂ ∧ 𝐵 ≠ 0 ∧ 𝐵 ≠ 1) ∧ 𝑋 ∈ (ℂ ∖ {0})) → ((curry logb𝐵)‘𝑋) = (𝐵 logb 𝑋))

Proof of Theorem logbfval
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-logb 26021 . 2 logb = (𝑥 ∈ (ℂ ∖ {0, 1}), 𝑦 ∈ (ℂ ∖ {0}) ↦ ((log‘𝑦) / (log‘𝑥)))
2 ovexd 7372 . . 3 ((((𝐵 ∈ ℂ ∧ 𝐵 ≠ 0 ∧ 𝐵 ≠ 1) ∧ 𝑋 ∈ (ℂ ∖ {0})) ∧ (𝑥 ∈ (ℂ ∖ {0, 1}) ∧ 𝑦 ∈ (ℂ ∖ {0}))) → ((log‘𝑦) / (log‘𝑥)) ∈ V)
32ralrimivva 3193 . 2 (((𝐵 ∈ ℂ ∧ 𝐵 ≠ 0 ∧ 𝐵 ≠ 1) ∧ 𝑋 ∈ (ℂ ∖ {0})) → ∀𝑥 ∈ (ℂ ∖ {0, 1})∀𝑦 ∈ (ℂ ∖ {0})((log‘𝑦) / (log‘𝑥)) ∈ V)
4 cnex 11053 . . 3 ℂ ∈ V
5 difexg 5271 . . 3 (ℂ ∈ V → (ℂ ∖ {0}) ∈ V)
64, 5mp1i 13 . 2 (((𝐵 ∈ ℂ ∧ 𝐵 ≠ 0 ∧ 𝐵 ≠ 1) ∧ 𝑋 ∈ (ℂ ∖ {0})) → (ℂ ∖ {0}) ∈ V)
7 eldifpr 4605 . . . 4 (𝐵 ∈ (ℂ ∖ {0, 1}) ↔ (𝐵 ∈ ℂ ∧ 𝐵 ≠ 0 ∧ 𝐵 ≠ 1))
87biimpri 227 . . 3 ((𝐵 ∈ ℂ ∧ 𝐵 ≠ 0 ∧ 𝐵 ≠ 1) → 𝐵 ∈ (ℂ ∖ {0, 1}))
98adantr 481 . 2 (((𝐵 ∈ ℂ ∧ 𝐵 ≠ 0 ∧ 𝐵 ≠ 1) ∧ 𝑋 ∈ (ℂ ∖ {0})) → 𝐵 ∈ (ℂ ∖ {0, 1}))
10 simpr 485 . 2 (((𝐵 ∈ ℂ ∧ 𝐵 ≠ 0 ∧ 𝐵 ≠ 1) ∧ 𝑋 ∈ (ℂ ∖ {0})) → 𝑋 ∈ (ℂ ∖ {0}))
111, 3, 6, 9, 10fvmpocurryd 8157 1 (((𝐵 ∈ ℂ ∧ 𝐵 ≠ 0 ∧ 𝐵 ≠ 1) ∧ 𝑋 ∈ (ℂ ∖ {0})) → ((curry logb𝐵)‘𝑋) = (𝐵 logb 𝑋))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396  w3a 1086   = wceq 1540  wcel 2105  wne 2940  Vcvv 3441  cdif 3895  {csn 4573  {cpr 4575  cfv 6479  (class class class)co 7337  curry ccur 8151  cc 10970  0cc0 10972  1c1 10973   / cdiv 11733  logclog 25816   logb clogb 26020
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1912  ax-6 1970  ax-7 2010  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2153  ax-12 2170  ax-ext 2707  ax-rep 5229  ax-sep 5243  ax-nul 5250  ax-pr 5372  ax-un 7650  ax-cnex 11028
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1781  df-nf 1785  df-sb 2067  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2886  df-ne 2941  df-ral 3062  df-rex 3071  df-reu 3350  df-rab 3404  df-v 3443  df-sbc 3728  df-csb 3844  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4270  df-if 4474  df-sn 4574  df-pr 4576  df-op 4580  df-uni 4853  df-iun 4943  df-br 5093  df-opab 5155  df-mpt 5176  df-id 5518  df-xp 5626  df-rel 5627  df-cnv 5628  df-co 5629  df-dm 5630  df-rn 5631  df-res 5632  df-ima 5633  df-iota 6431  df-fun 6481  df-fn 6482  df-f 6483  df-f1 6484  df-fo 6485  df-f1o 6486  df-fv 6487  df-ov 7340  df-oprab 7341  df-mpo 7342  df-1st 7899  df-2nd 7900  df-cur 8153  df-logb 26021
This theorem is referenced by:  relogbf  26047
  Copyright terms: Public domain W3C validator