MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  replim Structured version   Unicode version

Theorem replim 12727
Description: Reconstruct a complex number from its real and imaginary parts. (Contributed by NM, 10-May-1999.) (Revised by Mario Carneiro, 7-Nov-2013.)
Assertion
Ref Expression
replim  |-  ( A  e.  CC  ->  A  =  ( ( Re
`  A )  +  ( _i  x.  (
Im `  A )
) ) )

Proof of Theorem replim
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 cnre 9497 . 2  |-  ( A  e.  CC  ->  E. x  e.  RR  E. y  e.  RR  A  =  ( x  +  ( _i  x.  y ) ) )
2 crre 12725 . . . . . 6  |-  ( ( x  e.  RR  /\  y  e.  RR )  ->  ( Re `  (
x  +  ( _i  x.  y ) ) )  =  x )
3 crim 12726 . . . . . . 7  |-  ( ( x  e.  RR  /\  y  e.  RR )  ->  ( Im `  (
x  +  ( _i  x.  y ) ) )  =  y )
43oveq2d 6219 . . . . . 6  |-  ( ( x  e.  RR  /\  y  e.  RR )  ->  ( _i  x.  (
Im `  ( x  +  ( _i  x.  y ) ) ) )  =  ( _i  x.  y ) )
52, 4oveq12d 6221 . . . . 5  |-  ( ( x  e.  RR  /\  y  e.  RR )  ->  ( ( Re `  ( x  +  (
_i  x.  y )
) )  +  ( _i  x.  ( Im
`  ( x  +  ( _i  x.  y
) ) ) ) )  =  ( x  +  ( _i  x.  y ) ) )
65eqcomd 2462 . . . 4  |-  ( ( x  e.  RR  /\  y  e.  RR )  ->  ( x  +  ( _i  x.  y ) )  =  ( ( Re `  ( x  +  ( _i  x.  y ) ) )  +  ( _i  x.  ( Im `  ( x  +  ( _i  x.  y ) ) ) ) ) )
7 id 22 . . . . 5  |-  ( A  =  ( x  +  ( _i  x.  y
) )  ->  A  =  ( x  +  ( _i  x.  y
) ) )
8 fveq2 5802 . . . . . 6  |-  ( A  =  ( x  +  ( _i  x.  y
) )  ->  (
Re `  A )  =  ( Re `  ( x  +  (
_i  x.  y )
) ) )
9 fveq2 5802 . . . . . . 7  |-  ( A  =  ( x  +  ( _i  x.  y
) )  ->  (
Im `  A )  =  ( Im `  ( x  +  (
_i  x.  y )
) ) )
109oveq2d 6219 . . . . . 6  |-  ( A  =  ( x  +  ( _i  x.  y
) )  ->  (
_i  x.  ( Im `  A ) )  =  ( _i  x.  (
Im `  ( x  +  ( _i  x.  y ) ) ) ) )
118, 10oveq12d 6221 . . . . 5  |-  ( A  =  ( x  +  ( _i  x.  y
) )  ->  (
( Re `  A
)  +  ( _i  x.  ( Im `  A ) ) )  =  ( ( Re
`  ( x  +  ( _i  x.  y
) ) )  +  ( _i  x.  (
Im `  ( x  +  ( _i  x.  y ) ) ) ) ) )
127, 11eqeq12d 2476 . . . 4  |-  ( A  =  ( x  +  ( _i  x.  y
) )  ->  ( A  =  ( (
Re `  A )  +  ( _i  x.  ( Im `  A ) ) )  <->  ( x  +  ( _i  x.  y ) )  =  ( ( Re `  ( x  +  (
_i  x.  y )
) )  +  ( _i  x.  ( Im
`  ( x  +  ( _i  x.  y
) ) ) ) ) ) )
136, 12syl5ibrcom 222 . . 3  |-  ( ( x  e.  RR  /\  y  e.  RR )  ->  ( A  =  ( x  +  ( _i  x.  y ) )  ->  A  =  ( ( Re `  A
)  +  ( _i  x.  ( Im `  A ) ) ) ) )
1413rexlimivv 2952 . 2  |-  ( E. x  e.  RR  E. y  e.  RR  A  =  ( x  +  ( _i  x.  y
) )  ->  A  =  ( ( Re
`  A )  +  ( _i  x.  (
Im `  A )
) ) )
151, 14syl 16 1  |-  ( A  e.  CC  ->  A  =  ( ( Re
`  A )  +  ( _i  x.  (
Im `  A )
) ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ wa 369    = wceq 1370    e. wcel 1758   E.wrex 2800   ` cfv 5529  (class class class)co 6203   CCcc 9395   RRcr 9396   _ici 9399    + caddc 9400    x. cmul 9402   Recre 12708   Imcim 12709
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1592  ax-4 1603  ax-5 1671  ax-6 1710  ax-7 1730  ax-8 1760  ax-9 1762  ax-10 1777  ax-11 1782  ax-12 1794  ax-13 1955  ax-ext 2432  ax-sep 4524  ax-nul 4532  ax-pow 4581  ax-pr 4642  ax-un 6485  ax-resscn 9454  ax-1cn 9455  ax-icn 9456  ax-addcl 9457  ax-addrcl 9458  ax-mulcl 9459  ax-mulrcl 9460  ax-mulcom 9461  ax-addass 9462  ax-mulass 9463  ax-distr 9464  ax-i2m1 9465  ax-1ne0 9466  ax-1rid 9467  ax-rnegex 9468  ax-rrecex 9469  ax-cnre 9470  ax-pre-lttri 9471  ax-pre-lttrn 9472  ax-pre-ltadd 9473  ax-pre-mulgt0 9474
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3or 966  df-3an 967  df-tru 1373  df-ex 1588  df-nf 1591  df-sb 1703  df-eu 2266  df-mo 2267  df-clab 2440  df-cleq 2446  df-clel 2449  df-nfc 2604  df-ne 2650  df-nel 2651  df-ral 2804  df-rex 2805  df-reu 2806  df-rmo 2807  df-rab 2808  df-v 3080  df-sbc 3295  df-csb 3399  df-dif 3442  df-un 3444  df-in 3446  df-ss 3453  df-nul 3749  df-if 3903  df-pw 3973  df-sn 3989  df-pr 3991  df-op 3995  df-uni 4203  df-br 4404  df-opab 4462  df-mpt 4463  df-id 4747  df-po 4752  df-so 4753  df-xp 4957  df-rel 4958  df-cnv 4959  df-co 4960  df-dm 4961  df-rn 4962  df-res 4963  df-ima 4964  df-iota 5492  df-fun 5531  df-fn 5532  df-f 5533  df-f1 5534  df-fo 5535  df-f1o 5536  df-fv 5537  df-riota 6164  df-ov 6206  df-oprab 6207  df-mpt2 6208  df-er 7214  df-en 7424  df-dom 7425  df-sdom 7426  df-pnf 9535  df-mnf 9536  df-xr 9537  df-ltxr 9538  df-le 9539  df-sub 9712  df-neg 9713  df-div 10109  df-2 10495  df-cj 12710  df-re 12711  df-im 12712
This theorem is referenced by:  remim  12728  reim0b  12730  rereb  12731  mulre  12732  cjreb  12734  reneg  12736  readd  12737  remullem  12739  imneg  12744  imadd  12745  cjcj  12751  imval2  12762  cnrecnv  12776  replimi  12781  replimd  12808  recan  12946  efeul  13568  absef  13603  absefib  13604  efieq1re  13605  cnsubrg  18008  itgconst  21439  tanregt0  22138  tanarg  22211
  Copyright terms: Public domain W3C validator