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

Theorem cxpval 26902
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 2764 . . 3 ((𝑥 = 𝐴𝑦 = 𝐵) → (𝑥 = 0 ↔ 𝐴 = 0))
3 simpr 490 . . . . 5 ((𝑥 = 𝐴𝑦 = 𝐵) → 𝑦 = 𝐵)
43eqeq1d 2764 . . . 4 ((𝑥 = 𝐴𝑦 = 𝐵) → (𝑦 = 0 ↔ 𝐵 = 0))
54ifbid 4509 . . 3 ((𝑥 = 𝐴𝑦 = 𝐵) → if(𝑦 = 0, 1, 0) = if(𝐵 = 0, 1, 0))
61fveq2d 6886 . . . . 5 ((𝑥 = 𝐴𝑦 = 𝐵) → (log‘𝑥) = (log‘𝐴))
73, 6oveq12d 7434 . . . 4 ((𝑥 = 𝐴𝑦 = 𝐵) → (𝑦 · (log‘𝑥)) = (𝐵 · (log‘𝐴)))
87fveq2d 6886 . . 3 ((𝑥 = 𝐴𝑦 = 𝐵) → (exp‘(𝑦 · (log‘𝑥))) = (exp‘(𝐵 · (log‘𝐴))))
92, 5, 8ifbieq12d 4514 . 2 ((𝑥 = 𝐴𝑦 = 𝐵) → if(𝑥 = 0, if(𝑦 = 0, 1, 0), (exp‘(𝑦 · (log‘𝑥)))) = if(𝐴 = 0, if(𝐵 = 0, 1, 0), (exp‘(𝐵 · (log‘𝐴)))))
10 df-cxp 26795 . 2 𝑐 = (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ if(𝑥 = 0, if(𝑦 = 0, 1, 0), (exp‘(𝑦 · (log‘𝑥)))))
11 ax-1cn 11185 . . . . 5 1 ∈ ℂ
12 0cn 11225 . . . . 5 0 ∈ ℂ
1311, 12ifcli 4533 . . . 4 if(𝐵 = 0, 1, 0) ∈ ℂ
1413elexi 3475 . . 3 if(𝐵 = 0, 1, 0) ∈ V
15 fvex 6895 . . 3 (exp‘(𝐵 · (log‘𝐴))) ∈ V
1614, 15ifex 4536 . 2 if(𝐴 = 0, if(𝐵 = 0, 1, 0), (exp‘(𝐵 · (log‘𝐴)))) ∈ V
179, 10, 16ovmpoa 7571 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 1570  wcel 2145  ifcif 4485  cfv 6537  (class class class)co 7416  cc 11125  0cc0 11127  1c1 11128   · cmul 11132  expce 16151  logclog 26792  𝑐ccxp 26793
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pr 5402  ax-1cn 11185  ax-icn 11186  ax-addcl 11187  ax-mulcl 11189  ax-i2m1 11195
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  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 3415  df-v 3455  df-sbc 3743  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-opab 5172  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-iota 6493  df-fun 6539  df-fv 6545  df-ov 7419  df-oprab 7420  df-mpo 7421  df-cxp 26795
This theorem is used by:  cxpef  26903  0cxp  26904  cxpexp  26906  cxpcl  26912  recxpcl  26913
  Copyright terms: Public domain W3C validator