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

Theorem logbfval 25295
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 25270 . 2 logb = (𝑥 ∈ (ℂ ∖ {0, 1}), 𝑦 ∈ (ℂ ∖ {0}) ↦ ((log‘𝑦) / (log‘𝑥)))
2 ovexd 7180 . . 3 ((((𝐵 ∈ ℂ ∧ 𝐵 ≠ 0 ∧ 𝐵 ≠ 1) ∧ 𝑋 ∈ (ℂ ∖ {0})) ∧ (𝑥 ∈ (ℂ ∖ {0, 1}) ∧ 𝑦 ∈ (ℂ ∖ {0}))) → ((log‘𝑦) / (log‘𝑥)) ∈ V)
32ralrimivva 3188 . 2 (((𝐵 ∈ ℂ ∧ 𝐵 ≠ 0 ∧ 𝐵 ≠ 1) ∧ 𝑋 ∈ (ℂ ∖ {0})) → ∀𝑥 ∈ (ℂ ∖ {0, 1})∀𝑦 ∈ (ℂ ∖ {0})((log‘𝑦) / (log‘𝑥)) ∈ V)
4 cnex 10606 . . 3 ℂ ∈ V
5 difexg 5222 . . 3 (ℂ ∈ V → (ℂ ∖ {0}) ∈ V)
64, 5mp1i 13 . 2 (((𝐵 ∈ ℂ ∧ 𝐵 ≠ 0 ∧ 𝐵 ≠ 1) ∧ 𝑋 ∈ (ℂ ∖ {0})) → (ℂ ∖ {0}) ∈ V)
7 eldifpr 4587 . . . 4 (𝐵 ∈ (ℂ ∖ {0, 1}) ↔ (𝐵 ∈ ℂ ∧ 𝐵 ≠ 0 ∧ 𝐵 ≠ 1))
87biimpri 229 . . 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 7926 1 (((𝐵 ∈ ℂ ∧ 𝐵 ≠ 0 ∧ 𝐵 ≠ 1) ∧ 𝑋 ∈ (ℂ ∖ {0})) → ((curry logb𝐵)‘𝑋) = (𝐵 logb 𝑋))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396  w3a 1079   = wceq 1528  wcel 2105  wne 3013  Vcvv 3492  cdif 3930  {csn 4557  {cpr 4559  cfv 6348  (class class class)co 7145  curry ccur 7920  cc 10523  0cc0 10525  1c1 10526   / cdiv 11285  logclog 25065   logb clogb 25269
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1787  ax-4 1801  ax-5 1902  ax-6 1961  ax-7 2006  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2151  ax-12 2167  ax-ext 2790  ax-rep 5181  ax-sep 5194  ax-nul 5201  ax-pow 5257  ax-pr 5320  ax-un 7450  ax-cnex 10581
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 842  df-3an 1081  df-tru 1531  df-fal 1541  df-ex 1772  df-nf 1776  df-sb 2061  df-mo 2615  df-eu 2647  df-clab 2797  df-cleq 2811  df-clel 2890  df-nfc 2960  df-ne 3014  df-ral 3140  df-rex 3141  df-reu 3142  df-rab 3144  df-v 3494  df-sbc 3770  df-csb 3881  df-dif 3936  df-un 3938  df-in 3940  df-ss 3949  df-nul 4289  df-if 4464  df-sn 4558  df-pr 4560  df-op 4564  df-uni 4831  df-iun 4912  df-br 5058  df-opab 5120  df-mpt 5138  df-id 5453  df-xp 5554  df-rel 5555  df-cnv 5556  df-co 5557  df-dm 5558  df-rn 5559  df-res 5560  df-ima 5561  df-iota 6307  df-fun 6350  df-fn 6351  df-f 6352  df-f1 6353  df-fo 6354  df-f1o 6355  df-fv 6356  df-ov 7148  df-oprab 7149  df-mpo 7150  df-1st 7678  df-2nd 7679  df-cur 7922  df-logb 25270
This theorem is referenced by:  relogbf  25296
  Copyright terms: Public domain W3C validator