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

Theorem crim 12715
Description: The real part of a complex number representation. Definition 10-3.1 of [Gleason] p. 132. (Contributed by NM, 12-May-2005.) (Revised by Mario Carneiro, 7-Nov-2013.)
Assertion
Ref Expression
crim  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( Im `  ( A  +  ( _i  x.  B ) ) )  =  B )

Proof of Theorem crim
StepHypRef Expression
1 recn 9476 . . . 4  |-  ( A  e.  RR  ->  A  e.  CC )
2 ax-icn 9445 . . . . 5  |-  _i  e.  CC
3 recn 9476 . . . . 5  |-  ( B  e.  RR  ->  B  e.  CC )
4 mulcl 9470 . . . . 5  |-  ( ( _i  e.  CC  /\  B  e.  CC )  ->  ( _i  x.  B
)  e.  CC )
52, 3, 4sylancr 663 . . . 4  |-  ( B  e.  RR  ->  (
_i  x.  B )  e.  CC )
6 addcl 9468 . . . 4  |-  ( ( A  e.  CC  /\  ( _i  x.  B
)  e.  CC )  ->  ( A  +  ( _i  x.  B
) )  e.  CC )
71, 5, 6syl2an 477 . . 3  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( A  +  ( _i  x.  B ) )  e.  CC )
8 imval 12707 . . 3  |-  ( ( A  +  ( _i  x.  B ) )  e.  CC  ->  (
Im `  ( A  +  ( _i  x.  B ) ) )  =  ( Re `  ( ( A  +  ( _i  x.  B
) )  /  _i ) ) )
97, 8syl 16 . 2  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( Im `  ( A  +  ( _i  x.  B ) ) )  =  ( Re `  ( ( A  +  ( _i  x.  B
) )  /  _i ) ) )
102, 4mpan 670 . . . . . 6  |-  ( B  e.  CC  ->  (
_i  x.  B )  e.  CC )
11 ine0 9884 . . . . . . 7  |-  _i  =/=  0
12 divdir 10121 . . . . . . . 8  |-  ( ( A  e.  CC  /\  ( _i  x.  B
)  e.  CC  /\  ( _i  e.  CC  /\  _i  =/=  0 ) )  ->  ( ( A  +  ( _i  x.  B ) )  /  _i )  =  (
( A  /  _i )  +  ( (
_i  x.  B )  /  _i ) ) )
13123expa 1188 . . . . . . 7  |-  ( ( ( A  e.  CC  /\  ( _i  x.  B
)  e.  CC )  /\  ( _i  e.  CC  /\  _i  =/=  0
) )  ->  (
( A  +  ( _i  x.  B ) )  /  _i )  =  ( ( A  /  _i )  +  ( ( _i  x.  B )  /  _i ) ) )
142, 11, 13mpanr12 685 . . . . . 6  |-  ( ( A  e.  CC  /\  ( _i  x.  B
)  e.  CC )  ->  ( ( A  +  ( _i  x.  B ) )  /  _i )  =  (
( A  /  _i )  +  ( (
_i  x.  B )  /  _i ) ) )
1510, 14sylan2 474 . . . . 5  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( ( A  +  ( _i  x.  B
) )  /  _i )  =  ( ( A  /  _i )  +  ( ( _i  x.  B )  /  _i ) ) )
16 divrec2 10115 . . . . . . . 8  |-  ( ( A  e.  CC  /\  _i  e.  CC  /\  _i  =/=  0 )  ->  ( A  /  _i )  =  ( ( 1  /  _i )  x.  A
) )
172, 11, 16mp3an23 1307 . . . . . . 7  |-  ( A  e.  CC  ->  ( A  /  _i )  =  ( ( 1  /  _i )  x.  A
) )
18 irec 12075 . . . . . . . . 9  |-  ( 1  /  _i )  = 
-u _i
1918oveq1i 6203 . . . . . . . 8  |-  ( ( 1  /  _i )  x.  A )  =  ( -u _i  x.  A )
2019a1i 11 . . . . . . 7  |-  ( A  e.  CC  ->  (
( 1  /  _i )  x.  A )  =  ( -u _i  x.  A ) )
21 mulneg12 9887 . . . . . . . 8  |-  ( ( _i  e.  CC  /\  A  e.  CC )  ->  ( -u _i  x.  A )  =  ( _i  x.  -u A
) )
222, 21mpan 670 . . . . . . 7  |-  ( A  e.  CC  ->  ( -u _i  x.  A )  =  ( _i  x.  -u A ) )
2317, 20, 223eqtrd 2496 . . . . . 6  |-  ( A  e.  CC  ->  ( A  /  _i )  =  ( _i  x.  -u A
) )
24 divcan3 10122 . . . . . . 7  |-  ( ( B  e.  CC  /\  _i  e.  CC  /\  _i  =/=  0 )  ->  (
( _i  x.  B
)  /  _i )  =  B )
252, 11, 24mp3an23 1307 . . . . . 6  |-  ( B  e.  CC  ->  (
( _i  x.  B
)  /  _i )  =  B )
2623, 25oveqan12d 6212 . . . . 5  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( ( A  /  _i )  +  (
( _i  x.  B
)  /  _i ) )  =  ( ( _i  x.  -u A
)  +  B ) )
27 negcl 9714 . . . . . . 7  |-  ( A  e.  CC  ->  -u A  e.  CC )
28 mulcl 9470 . . . . . . 7  |-  ( ( _i  e.  CC  /\  -u A  e.  CC )  ->  ( _i  x.  -u A )  e.  CC )
292, 27, 28sylancr 663 . . . . . 6  |-  ( A  e.  CC  ->  (
_i  x.  -u A )  e.  CC )
30 addcom 9659 . . . . . 6  |-  ( ( ( _i  x.  -u A
)  e.  CC  /\  B  e.  CC )  ->  ( ( _i  x.  -u A )  +  B
)  =  ( B  +  ( _i  x.  -u A ) ) )
3129, 30sylan 471 . . . . 5  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( ( _i  x.  -u A )  +  B
)  =  ( B  +  ( _i  x.  -u A ) ) )
3215, 26, 313eqtrrd 2497 . . . 4  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( B  +  ( _i  x.  -u A
) )  =  ( ( A  +  ( _i  x.  B ) )  /  _i ) )
331, 3, 32syl2an 477 . . 3  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( B  +  ( _i  x.  -u A
) )  =  ( ( A  +  ( _i  x.  B ) )  /  _i ) )
3433fveq2d 5796 . 2  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( Re `  ( B  +  ( _i  x.  -u A ) ) )  =  ( Re
`  ( ( A  +  ( _i  x.  B ) )  /  _i ) ) )
35 id 22 . . 3  |-  ( B  e.  RR  ->  B  e.  RR )
36 renegcl 9776 . . 3  |-  ( A  e.  RR  ->  -u A  e.  RR )
37 crre 12714 . . 3  |-  ( ( B  e.  RR  /\  -u A  e.  RR )  ->  ( Re `  ( B  +  (
_i  x.  -u A ) ) )  =  B )
3835, 36, 37syl2anr 478 . 2  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( Re `  ( B  +  ( _i  x.  -u A ) ) )  =  B )
399, 34, 383eqtr2d 2498 1  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( Im `  ( A  +  ( _i  x.  B ) ) )  =  B )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ wa 369    = wceq 1370    e. wcel 1758    =/= wne 2644   ` cfv 5519  (class class class)co 6193   CCcc 9384   RRcr 9385   0cc0 9386   1c1 9387   _ici 9388    + caddc 9389    x. cmul 9391   -ucneg 9700    / cdiv 10097   Recre 12697   Imcim 12698
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 1952  ax-ext 2430  ax-sep 4514  ax-nul 4522  ax-pow 4571  ax-pr 4632  ax-un 6475  ax-resscn 9443  ax-1cn 9444  ax-icn 9445  ax-addcl 9446  ax-addrcl 9447  ax-mulcl 9448  ax-mulrcl 9449  ax-mulcom 9450  ax-addass 9451  ax-mulass 9452  ax-distr 9453  ax-i2m1 9454  ax-1ne0 9455  ax-1rid 9456  ax-rnegex 9457  ax-rrecex 9458  ax-cnre 9459  ax-pre-lttri 9460  ax-pre-lttrn 9461  ax-pre-ltadd 9462  ax-pre-mulgt0 9463
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 2264  df-mo 2265  df-clab 2437  df-cleq 2443  df-clel 2446  df-nfc 2601  df-ne 2646  df-nel 2647  df-ral 2800  df-rex 2801  df-reu 2802  df-rmo 2803  df-rab 2804  df-v 3073  df-sbc 3288  df-csb 3390  df-dif 3432  df-un 3434  df-in 3436  df-ss 3443  df-nul 3739  df-if 3893  df-pw 3963  df-sn 3979  df-pr 3981  df-op 3985  df-uni 4193  df-br 4394  df-opab 4452  df-mpt 4453  df-id 4737  df-po 4742  df-so 4743  df-xp 4947  df-rel 4948  df-cnv 4949  df-co 4950  df-dm 4951  df-rn 4952  df-res 4953  df-ima 4954  df-iota 5482  df-fun 5521  df-fn 5522  df-f 5523  df-f1 5524  df-fo 5525  df-f1o 5526  df-fv 5527  df-riota 6154  df-ov 6196  df-oprab 6197  df-mpt2 6198  df-er 7204  df-en 7414  df-dom 7415  df-sdom 7416  df-pnf 9524  df-mnf 9525  df-xr 9526  df-ltxr 9527  df-le 9528  df-sub 9701  df-neg 9702  df-div 10098  df-2 10484  df-cj 12699  df-re 12700  df-im 12701
This theorem is referenced by:  replim  12716  reim0  12718  remullem  12728  imcj  12732  imneg  12733  imadd  12734  imi  12757  crimi  12793  crimd  12832  absreimsq  12892  4sqlem4  14124  logneg  22162  lognegb  22164  basellem3  22546  2sqlem2  22829  cnre2csqima  26479
  Copyright terms: Public domain W3C validator