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

Theorem cxpval 26840
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 487 . . . 4 ((𝑥 = 𝐴𝑦 = 𝐵) → 𝑥 = 𝐴)
21eqeq1d 2764 . . 3 ((𝑥 = 𝐴𝑦 = 𝐵) → (𝑥 = 0 ↔ 𝐴 = 0))
3 simpr 489 . . . . 5 ((𝑥 = 𝐴𝑦 = 𝐵) → 𝑦 = 𝐵)
43eqeq1d 2764 . . . 4 ((𝑥 = 𝐴𝑦 = 𝐵) → (𝑦 = 0 ↔ 𝐵 = 0))
54ifbid 4510 . . 3 ((𝑥 = 𝐴𝑦 = 𝐵) → if(𝑦 = 0, 1, 0) = if(𝐵 = 0, 1, 0))
61fveq2d 6885 . . . . 5 ((𝑥 = 𝐴𝑦 = 𝐵) → (log‘𝑥) = (log‘𝐴))
73, 6oveq12d 7430 . . . 4 ((𝑥 = 𝐴𝑦 = 𝐵) → (𝑦 · (log‘𝑥)) = (𝐵 · (log‘𝐴)))
87fveq2d 6885 . . 3 ((𝑥 = 𝐴𝑦 = 𝐵) → (exp‘(𝑦 · (log‘𝑥))) = (exp‘(𝐵 · (log‘𝐴))))
92, 5, 8ifbieq12d 4515 . 2 ((𝑥 = 𝐴𝑦 = 𝐵) → if(𝑥 = 0, if(𝑦 = 0, 1, 0), (exp‘(𝑦 · (log‘𝑥)))) = if(𝐴 = 0, if(𝐵 = 0, 1, 0), (exp‘(𝐵 · (log‘𝐴)))))
10 df-cxp 26733 . 2 𝑐 = (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ if(𝑥 = 0, if(𝑦 = 0, 1, 0), (exp‘(𝑦 · (log‘𝑥)))))
11 ax-1cn 11164 . . . . 5 1 ∈ ℂ
12 0cn 11204 . . . . 5 0 ∈ ℂ
1311, 12ifcli 4534 . . . 4 if(𝐵 = 0, 1, 0) ∈ ℂ
1413elexi 3476 . . 3 if(𝐵 = 0, 1, 0) ∈ V
15 fvex 6894 . . 3 (exp‘(𝐵 · (log‘𝐴))) ∈ V
1614, 15ifex 4537 . 2 if(𝐴 = 0, if(𝐵 = 0, 1, 0), (exp‘(𝐵 · (log‘𝐴)))) ∈ V
179, 10, 16ovmpoa 7567 1 ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴𝑐𝐵) = if(𝐴 = 0, if(𝐵 = 0, 1, 0), (exp‘(𝐵 · (log‘𝐴)))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 400   = wceq 1569  wcel 2142  ifcif 4486  cfv 6536  (class class class)co 7412  cc 11104  0cc0 11106  1c1 11107   · cmul 11111  expce 16121  logclog 26730  𝑐ccxp 26731
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-sep 5256  ax-nul 5268  ax-pr 5403  ax-1cn 11164  ax-icn 11165  ax-addcl 11166  ax-mulcl 11168  ax-i2m1 11174
This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3416  df-v 3456  df-sbc 3744  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-br 5109  df-opab 5173  df-id 5555  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-iota 6492  df-fun 6538  df-fv 6544  df-ov 7415  df-oprab 7416  df-mpo 7417  df-cxp 26733
This theorem is used by:  cxpef  26841  0cxp  26842  cxpexp  26844  cxpcl  26850  recxpcl  26851
  Copyright terms: Public domain W3C validator