ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  crim Unicode version

Theorem crim 11604
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 8305 . . . 4  |-  ( A  e.  RR  ->  A  e.  CC )
2 ax-icn 8267 . . . . 5  |-  _i  e.  CC
3 recn 8305 . . . . 5  |-  ( B  e.  RR  ->  B  e.  CC )
4 mulcl 8299 . . . . 5  |-  ( ( _i  e.  CC  /\  B  e.  CC )  ->  ( _i  x.  B
)  e.  CC )
52, 3, 4sylancr 418 . . . 4  |-  ( B  e.  RR  ->  (
_i  x.  B )  e.  CC )
6 addcl 8297 . . . 4  |-  ( ( A  e.  CC  /\  ( _i  x.  B
)  e.  CC )  ->  ( A  +  ( _i  x.  B
) )  e.  CC )
71, 5, 6syl2an 289 . . 3  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( A  +  ( _i  x.  B ) )  e.  CC )
8 imval 11596 . . 3  |-  ( ( A  +  ( _i  x.  B ) )  e.  CC  ->  (
Im `  ( A  +  ( _i  x.  B ) ) )  =  ( Re `  ( ( A  +  ( _i  x.  B
) )  /  _i ) ) )
97, 8syl 14 . 2  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( Im `  ( A  +  ( _i  x.  B ) ) )  =  ( Re `  ( ( A  +  ( _i  x.  B
) )  /  _i ) ) )
102, 4mpan 428 . . . . . 6  |-  ( B  e.  CC  ->  (
_i  x.  B )  e.  CC )
11 iap0 9510 . . . . . . 7  |-  _i #  0
12 divdirap 9020 . . . . . . . 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 1234 . . . . . . 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 443 . . . . . 6  |-  ( ( A  e.  CC  /\  ( _i  x.  B
)  e.  CC )  ->  ( ( A  +  ( _i  x.  B ) )  /  _i )  =  (
( A  /  _i )  +  ( (
_i  x.  B )  /  _i ) ) )
1510, 14sylan2 286 . . . . 5  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( ( A  +  ( _i  x.  B
) )  /  _i )  =  ( ( A  /  _i )  +  ( ( _i  x.  B )  /  _i ) ) )
16 divrecap2 9012 . . . . . . . 8  |-  ( ( A  e.  CC  /\  _i  e.  CC  /\  _i #  0 )  ->  ( A  /  _i )  =  ( ( 1  /  _i )  x.  A
) )
172, 11, 16mp3an23 1370 . . . . . . 7  |-  ( A  e.  CC  ->  ( A  /  _i )  =  ( ( 1  /  _i )  x.  A
) )
18 irec 11057 . . . . . . . . 9  |-  ( 1  /  _i )  = 
-u _i
1918oveq1i 6088 . . . . . . . 8  |-  ( ( 1  /  _i )  x.  A )  =  ( -u _i  x.  A )
2019a1i 9 . . . . . . 7  |-  ( A  e.  CC  ->  (
( 1  /  _i )  x.  A )  =  ( -u _i  x.  A ) )
21 mulneg12 8717 . . . . . . . 8  |-  ( ( _i  e.  CC  /\  A  e.  CC )  ->  ( -u _i  x.  A )  =  ( _i  x.  -u A
) )
222, 21mpan 428 . . . . . . 7  |-  ( A  e.  CC  ->  ( -u _i  x.  A )  =  ( _i  x.  -u A ) )
2317, 20, 223eqtrd 2275 . . . . . 6  |-  ( A  e.  CC  ->  ( A  /  _i )  =  ( _i  x.  -u A
) )
24 divcanap3 9021 . . . . . . 7  |-  ( ( B  e.  CC  /\  _i  e.  CC  /\  _i #  0 )  ->  (
( _i  x.  B
)  /  _i )  =  B )
252, 11, 24mp3an23 1370 . . . . . 6  |-  ( B  e.  CC  ->  (
( _i  x.  B
)  /  _i )  =  B )
2623, 25oveqan12d 6097 . . . . 5  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( ( A  /  _i )  +  (
( _i  x.  B
)  /  _i ) )  =  ( ( _i  x.  -u A
)  +  B ) )
27 negcl 8519 . . . . . . 7  |-  ( A  e.  CC  ->  -u A  e.  CC )
28 mulcl 8299 . . . . . . 7  |-  ( ( _i  e.  CC  /\  -u A  e.  CC )  ->  ( _i  x.  -u A )  e.  CC )
292, 27, 28sylancr 418 . . . . . 6  |-  ( A  e.  CC  ->  (
_i  x.  -u A )  e.  CC )
30 addcom 8456 . . . . . 6  |-  ( ( ( _i  x.  -u A
)  e.  CC  /\  B  e.  CC )  ->  ( ( _i  x.  -u A )  +  B
)  =  ( B  +  ( _i  x.  -u A ) ) )
3129, 30sylan 283 . . . . 5  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( ( _i  x.  -u A )  +  B
)  =  ( B  +  ( _i  x.  -u A ) ) )
3215, 26, 313eqtrrd 2276 . . . 4  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( B  +  ( _i  x.  -u A
) )  =  ( ( A  +  ( _i  x.  B ) )  /  _i ) )
331, 3, 32syl2an 289 . . 3  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( B  +  ( _i  x.  -u A
) )  =  ( ( A  +  ( _i  x.  B ) )  /  _i ) )
3433fveq2d 5697 . 2  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( Re `  ( B  +  ( _i  x.  -u A ) ) )  =  ( Re
`  ( ( A  +  ( _i  x.  B ) )  /  _i ) ) )
35 id 19 . . 3  |-  ( B  e.  RR  ->  B  e.  RR )
36 renegcl 8580 . . 3  |-  ( A  e.  RR  ->  -u A  e.  RR )
37 crre 11603 . . 3  |-  ( ( B  e.  RR  /\  -u A  e.  RR )  ->  ( Re `  ( B  +  (
_i  x.  -u A ) ) )  =  B )
3835, 36, 37syl2anr 290 . 2  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( Re `  ( B  +  ( _i  x.  -u A ) ) )  =  B )
399, 34, 383eqtr2d 2277 1  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( Im `  ( A  +  ( _i  x.  B ) ) )  =  B )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1402    e. wcel 2209   class class class wbr 4128   ` cfv 5375  (class class class)co 6078   CCcc 8170   RRcr 8171   0cc0 8172   1c1 8173   _ici 8174    + caddc 8175    x. cmul 8177   -ucneg 8491   # cap 8902    / cdiv 8995   Recre 11586   Imcim 11587
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4247  ax-pow 4309  ax-pr 4344  ax-un 4576  ax-setind 4682  ax-cnex 8263  ax-resscn 8264  ax-1cn 8265  ax-1re 8266  ax-icn 8267  ax-addcl 8268  ax-addrcl 8269  ax-mulcl 8270  ax-mulrcl 8271  ax-addcom 8272  ax-mulcom 8273  ax-addass 8274  ax-mulass 8275  ax-distr 8276  ax-i2m1 8277  ax-0lt1 8278  ax-1rid 8279  ax-0id 8280  ax-rnegex 8281  ax-precex 8282  ax-cnre 8283  ax-pre-ltirr 8284  ax-pre-ltwlin 8285  ax-pre-lttrn 8286  ax-pre-apti 8287  ax-pre-ltadd 8288  ax-pre-mulgt0 8289  ax-pre-mulext 8290
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3714  df-pr 3715  df-op 3717  df-uni 3934  df-br 4129  df-opab 4191  df-mpt 4192  df-id 4436  df-po 4439  df-iso 4440  df-xp 4778  df-rel 4779  df-cnv 4780  df-co 4781  df-dm 4782  df-rn 4783  df-res 4784  df-ima 4785  df-iota 5335  df-fun 5377  df-fn 5378  df-f 5379  df-fv 5383  df-riota 6031  df-ov 6081  df-oprab 6082  df-mpo 6083  df-pnf 8355  df-mnf 8356  df-xr 8357  df-ltxr 8358  df-le 8359  df-sub 8492  df-neg 8493  df-reap 8896  df-ap 8903  df-div 8996  df-2 9345  df-cj 11588  df-re 11589  df-im 11590
This theorem is referenced by:  replim  11605  reim0  11607  remullem  11617  imcj  11621  imneg  11622  imadd  11623  imi  11647  crimi  11684  crimd  11724  absreimsq  11814  4sqlem4  13152  2sqlem2  16151
  Copyright terms: Public domain W3C validator