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

Theorem cxpval 27022
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 2765 . . 3 ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝑥 = 0 ↔ 𝐴 = 0))
3 simpr 490 . . . . 5 ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → 𝑦 = 𝐵)
43eqeq1d 2765 . . . 4 ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝑦 = 0 ↔ 𝐵 = 0))
54ifbid 4509 . . 3 ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → if(𝑦 = 0, 1, 0) = if(𝐵 = 0, 1, 0))
61fveq2d 6912 . . . . 5 ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (log‘𝑥) = (log‘𝐴))
73, 6oveq12d 7461 . . . 4 ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝑦 · (log‘𝑥)) = (𝐵 · (log‘𝐴)))
87fveq2d 6912 . . 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 26915 . 2 ↑𝑐 = (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ if(𝑥 = 0, if(𝑦 = 0, 1, 0), (exp‘(𝑦 · (log‘𝑥)))))
11 ax-1cn 11285 . . . . 5 1 ∈ ℂ
12 0cn 11325 . . . . 5 0 ∈ ℂ
1311, 12ifcli 4533 . . . 4 if(𝐵 = 0, 1, 0) ∈ ℂ
1413elexi 3476 . . 3 if(𝐵 = 0, 1, 0) ∈ V
15 fvex 6921 . . 3 (exp‘(𝐵 · (log‘𝐴))) ∈ V
1614, 15ifex 4536 . 2 if(𝐴 = 0, if(𝐵 = 0, 1, 0), (exp‘(𝐵 · (log‘𝐴)))) ∈ V
179, 10, 16ovmpoa 7599 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 2147  ifcif 4485  ‘cfv 6558  (class class class)co 7443  ℂcc 11225  0cc0 11227  1c1 11228   · cmul 11232  expce 16256  logclog 26912  ↑𝑐ccxp 26913
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pr 5395  ax-1cn 11285  ax-icn 11286  ax-addcl 11287  ax-mulcl 11289  ax-i2m1 11295
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5171  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-iota 6512  df-fun 6560  df-fv 6566  df-ov 7446  df-oprab 7447  df-mpo 7448  df-cxp 26915
This theorem is used by:  cxpef  27023  0cxp  27024  cxpexp  27026  cxpcl  27032  recxpcl  27033
  Copyright terms: Public domain W3C validator