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

Theorem logbfval 26219
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 26194 . 2 logb = (𝑥 ∈ (ℂ ∖ {0, 1}), 𝑦 ∈ (ℂ ∖ {0}) ↦ ((log‘𝑦) / (log‘𝑥)))
2 ovexd 7427 . . 3 ((((𝐵 ∈ ℂ ∧ 𝐵 ≠ 0 ∧ 𝐵 ≠ 1) ∧ 𝑋 ∈ (ℂ ∖ {0})) ∧ (𝑥 ∈ (ℂ ∖ {0, 1}) ∧ 𝑦 ∈ (ℂ ∖ {0}))) → ((log‘𝑦) / (log‘𝑥)) ∈ V)
32ralrimivva 3199 . 2 (((𝐵 ∈ ℂ ∧ 𝐵 ≠ 0 ∧ 𝐵 ≠ 1) ∧ 𝑋 ∈ (ℂ ∖ {0})) → ∀𝑥 ∈ (ℂ ∖ {0, 1})∀𝑦 ∈ (ℂ ∖ {0})((log‘𝑦) / (log‘𝑥)) ∈ V)
4 cnex 11172 . . 3 ℂ ∈ V
5 difexg 5319 . . 3 (ℂ ∈ V → (ℂ ∖ {0}) ∈ V)
64, 5mp1i 13 . 2 (((𝐵 ∈ ℂ ∧ 𝐵 ≠ 0 ∧ 𝐵 ≠ 1) ∧ 𝑋 ∈ (ℂ ∖ {0})) → (ℂ ∖ {0}) ∈ V)
7 eldifpr 4653 . . . 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 8237 1 (((𝐵 ∈ ℂ ∧ 𝐵 ≠ 0 ∧ 𝐵 ≠ 1) ∧ 𝑋 ∈ (ℂ ∖ {0})) → ((curry logb𝐵)‘𝑋) = (𝐵 logb 𝑋))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396  w3a 1087   = wceq 1541  wcel 2106  wne 2939  Vcvv 3472  cdif 3940  {csn 4621  {cpr 4623  cfv 6531  (class class class)co 7392  curry ccur 8231  cc 11089  0cc0 11091  1c1 11092   / cdiv 11852  logclog 25989   logb clogb 26193
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2702  ax-rep 5277  ax-sep 5291  ax-nul 5298  ax-pr 5419  ax-un 7707  ax-cnex 11147
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2533  df-eu 2562  df-clab 2709  df-cleq 2723  df-clel 2809  df-nfc 2884  df-ne 2940  df-ral 3061  df-rex 3070  df-reu 3376  df-rab 3432  df-v 3474  df-sbc 3773  df-csb 3889  df-dif 3946  df-un 3948  df-in 3950  df-ss 3960  df-nul 4318  df-if 4522  df-sn 4622  df-pr 4624  df-op 4628  df-uni 4901  df-iun 4991  df-br 5141  df-opab 5203  df-mpt 5224  df-id 5566  df-xp 5674  df-rel 5675  df-cnv 5676  df-co 5677  df-dm 5678  df-rn 5679  df-res 5680  df-ima 5681  df-iota 6483  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-ov 7395  df-oprab 7396  df-mpo 7397  df-1st 7956  df-2nd 7957  df-cur 8233  df-logb 26194
This theorem is referenced by:  relogbf  26220
  Copyright terms: Public domain W3C validator