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

Theorem cxpval 26993
Description: Value of the complex power function. (Contributed by Mario Carneiro, 2-Aug-2014.)
Assertion
Ref Expression
cxpval ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴↑𝑐𝐵) = if(𝐴 = 0, if(𝐵 = 0, 1, 0), (exp‘(𝐵 · (log‘𝐴)))))

Proof of Theorem cxpval
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simpl 488 . . . 4 ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → 𝑥 = 𝐴)
21eqeq1d 2762 . . 3 ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝑥 = 0 ↔ 𝐴 = 0))
3 simpr 490 . . . . 5 ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → 𝑦 = 𝐵)
43eqeq1d 2762 . . . 4 ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝑦 = 0 ↔ 𝐵 = 0))
54ifbid 4505 . . 3 ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → if(𝑦 = 0, 1, 0) = if(𝐵 = 0, 1, 0))
61fveq2d 6889 . . . . 5 ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (log‘𝑥) = (log‘𝐴))
73, 6oveq12d 7438 . . . 4 ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝑦 · (log‘𝑥)) = (𝐵 · (log‘𝐴)))
87fveq2d 6889 . . 3 ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (exp‘(𝑦 · (log‘𝑥))) = (exp‘(𝐵 · (log‘𝐴))))
92, 5, 8ifbieq12d 4510 . 2 ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → if(𝑥 = 0, if(𝑦 = 0, 1, 0), (exp‘(𝑦 · (log‘𝑥)))) = if(𝐴 = 0, if(𝐵 = 0, 1, 0), (exp‘(𝐵 · (log‘𝐴)))))
10 df-cxp 26886 . 2 ↑𝑐 = (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ if(𝑥 = 0, if(𝑦 = 0, 1, 0), (exp‘(𝑦 · (log‘𝑥)))))
11 ax-1cn 11259 . . . . 5 1 ∈ ℂ
12 0cn 11299 . . . . 5 0 ∈ ℂ
1311, 12ifcli 4529 . . . 4 if(𝐵 = 0, 1, 0) ∈ ℂ
1413elexi 3472 . . 3 if(𝐵 = 0, 1, 0) ∈ V
15 fvex 6898 . . 3 (exp‘(𝐵 · (log‘𝐴))) ∈ V
1614, 15ifex 4532 . 2 if(𝐴 = 0, if(𝐵 = 0, 1, 0), (exp‘(𝐵 · (log‘𝐴)))) ∈ V
179, 10, 16ovmpoa 7575 1 ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴↑𝑐𝐵) = if(𝐴 = 0, if(𝐵 = 0, 1, 0), (exp‘(𝐵 · (log‘𝐴)))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144  ifcif 4481  ‘cfv 6538  (class class class)co 7420  ℂcc 11199  0cc0 11201  1c1 11202   · cmul 11206  expce 16228  logclog 26883  ↑𝑐ccxp 26884
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390  ax-1cn 11259  ax-icn 11260  ax-addcl 11261  ax-mulcl 11263  ax-i2m1 11269
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-br 5103  df-opab 5167  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-iota 6494  df-fun 6540  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-cxp 26886
This theorem is used by:  cxpef  26994  0cxp  26995  cxpexp  26997  cxpcl  27003  recxpcl  27004
  Copyright terms: Public domain W3C validator