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

Theorem crim 9458
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 7014 . . . 4  |-  ( A  e.  RR  ->  A  e.  CC )
2 ax-icn 6979 . . . . 5  |-  _i  e.  CC
3 recn 7014 . . . . 5  |-  ( B  e.  RR  ->  B  e.  CC )
4 mulcl 7008 . . . . 5  |-  ( ( _i  e.  CC  /\  B  e.  CC )  ->  ( _i  x.  B
)  e.  CC )
52, 3, 4sylancr 393 . . . 4  |-  ( B  e.  RR  ->  (
_i  x.  B )  e.  CC )
6 addcl 7006 . . . 4  |-  ( ( A  e.  CC  /\  ( _i  x.  B
)  e.  CC )  ->  ( A  +  ( _i  x.  B
) )  e.  CC )
71, 5, 6syl2an 273 . . 3  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( A  +  ( _i  x.  B ) )  e.  CC )
8 imval 9450 . . 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 400 . . . . . 6  |-  ( B  e.  CC  ->  (
_i  x.  B )  e.  CC )
11 iap0 8148 . . . . . . 7  |-  _i #  0
12 divdirap 7674 . . . . . . . 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 1104 . . . . . . 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 415 . . . . . 6  |-  ( ( A  e.  CC  /\  ( _i  x.  B
)  e.  CC )  ->  ( ( A  +  ( _i  x.  B ) )  /  _i )  =  (
( A  /  _i )  +  ( (
_i  x.  B )  /  _i ) ) )
1510, 14sylan2 270 . . . . 5  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( ( A  +  ( _i  x.  B
) )  /  _i )  =  ( ( A  /  _i )  +  ( ( _i  x.  B )  /  _i ) ) )
16 divrecap2 7668 . . . . . . . 8  |-  ( ( A  e.  CC  /\  _i  e.  CC  /\  _i #  0 )  ->  ( A  /  _i )  =  ( ( 1  /  _i )  x.  A
) )
172, 11, 16mp3an23 1224 . . . . . . 7  |-  ( A  e.  CC  ->  ( A  /  _i )  =  ( ( 1  /  _i )  x.  A
) )
18 irec 9352 . . . . . . . . 9  |-  ( 1  /  _i )  = 
-u _i
1918oveq1i 5522 . . . . . . . 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 7394 . . . . . . . 8  |-  ( ( _i  e.  CC  /\  A  e.  CC )  ->  ( -u _i  x.  A )  =  ( _i  x.  -u A
) )
222, 21mpan 400 . . . . . . 7  |-  ( A  e.  CC  ->  ( -u _i  x.  A )  =  ( _i  x.  -u A ) )
2317, 20, 223eqtrd 2076 . . . . . 6  |-  ( A  e.  CC  ->  ( A  /  _i )  =  ( _i  x.  -u A
) )
24 divcanap3 7675 . . . . . . 7  |-  ( ( B  e.  CC  /\  _i  e.  CC  /\  _i #  0 )  ->  (
( _i  x.  B
)  /  _i )  =  B )
252, 11, 24mp3an23 1224 . . . . . 6  |-  ( B  e.  CC  ->  (
( _i  x.  B
)  /  _i )  =  B )
2623, 25oveqan12d 5531 . . . . 5  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( ( A  /  _i )  +  (
( _i  x.  B
)  /  _i ) )  =  ( ( _i  x.  -u A
)  +  B ) )
27 negcl 7211 . . . . . . 7  |-  ( A  e.  CC  ->  -u A  e.  CC )
28 mulcl 7008 . . . . . . 7  |-  ( ( _i  e.  CC  /\  -u A  e.  CC )  ->  ( _i  x.  -u A )  e.  CC )
292, 27, 28sylancr 393 . . . . . 6  |-  ( A  e.  CC  ->  (
_i  x.  -u A )  e.  CC )
30 addcom 7150 . . . . . 6  |-  ( ( ( _i  x.  -u A
)  e.  CC  /\  B  e.  CC )  ->  ( ( _i  x.  -u A )  +  B
)  =  ( B  +  ( _i  x.  -u A ) ) )
3129, 30sylan 267 . . . . 5  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( ( _i  x.  -u A )  +  B
)  =  ( B  +  ( _i  x.  -u A ) ) )
3215, 26, 313eqtrrd 2077 . . . 4  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( B  +  ( _i  x.  -u A
) )  =  ( ( A  +  ( _i  x.  B ) )  /  _i ) )
331, 3, 32syl2an 273 . . 3  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( B  +  ( _i  x.  -u A
) )  =  ( ( A  +  ( _i  x.  B ) )  /  _i ) )
3433fveq2d 5182 . 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 7272 . . 3  |-  ( A  e.  RR  ->  -u A  e.  RR )
37 crre 9457 . . 3  |-  ( ( B  e.  RR  /\  -u A  e.  RR )  ->  ( Re `  ( B  +  (
_i  x.  -u A ) ) )  =  B )
3835, 36, 37syl2anr 274 . 2  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( Re `  ( B  +  ( _i  x.  -u A ) ) )  =  B )
399, 34, 383eqtr2d 2078 1  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  ( Im `  ( A  +  ( _i  x.  B ) ) )  =  B )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 97    = wceq 1243    e. wcel 1393   class class class wbr 3764   ` cfv 4902  (class class class)co 5512   CCcc 6887   RRcr 6888   0cc0 6889   1c1 6890   _ici 6891    + caddc 6892    x. cmul 6894   -ucneg 7183   # cap 7572    / cdiv 7651   Recre 9440   Imcim 9441
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-in1 544  ax-in2 545  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-13 1404  ax-14 1405  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022  ax-coll 3872  ax-sep 3875  ax-nul 3883  ax-pow 3927  ax-pr 3944  ax-un 4170  ax-setind 4262  ax-iinf 4311  ax-cnex 6975  ax-resscn 6976  ax-1cn 6977  ax-1re 6978  ax-icn 6979  ax-addcl 6980  ax-addrcl 6981  ax-mulcl 6982  ax-mulrcl 6983  ax-addcom 6984  ax-mulcom 6985  ax-addass 6986  ax-mulass 6987  ax-distr 6988  ax-i2m1 6989  ax-1rid 6991  ax-0id 6992  ax-rnegex 6993  ax-precex 6994  ax-cnre 6995  ax-pre-ltirr 6996  ax-pre-ltwlin 6997  ax-pre-lttrn 6998  ax-pre-apti 6999  ax-pre-ltadd 7000  ax-pre-mulgt0 7001  ax-pre-mulext 7002
This theorem depends on definitions:  df-bi 110  df-dc 743  df-3or 886  df-3an 887  df-tru 1246  df-fal 1249  df-nf 1350  df-sb 1646  df-eu 1903  df-mo 1904  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-ne 2206  df-nel 2207  df-ral 2311  df-rex 2312  df-reu 2313  df-rmo 2314  df-rab 2315  df-v 2559  df-sbc 2765  df-csb 2853  df-dif 2920  df-un 2922  df-in 2924  df-ss 2931  df-nul 3225  df-pw 3361  df-sn 3381  df-pr 3382  df-op 3384  df-uni 3581  df-int 3616  df-iun 3659  df-br 3765  df-opab 3819  df-mpt 3820  df-tr 3855  df-eprel 4026  df-id 4030  df-po 4033  df-iso 4034  df-iord 4103  df-on 4105  df-suc 4108  df-iom 4314  df-xp 4351  df-rel 4352  df-cnv 4353  df-co 4354  df-dm 4355  df-rn 4356  df-res 4357  df-ima 4358  df-iota 4867  df-fun 4904  df-fn 4905  df-f 4906  df-f1 4907  df-fo 4908  df-f1o 4909  df-fv 4910  df-riota 5468  df-ov 5515  df-oprab 5516  df-mpt2 5517  df-1st 5767  df-2nd 5768  df-recs 5920  df-irdg 5957  df-1o 6001  df-2o 6002  df-oadd 6005  df-omul 6006  df-er 6106  df-ec 6108  df-qs 6112  df-ni 6402  df-pli 6403  df-mi 6404  df-lti 6405  df-plpq 6442  df-mpq 6443  df-enq 6445  df-nqqs 6446  df-plqqs 6447  df-mqqs 6448  df-1nqqs 6449  df-rq 6450  df-ltnqqs 6451  df-enq0 6522  df-nq0 6523  df-0nq0 6524  df-plq0 6525  df-mq0 6526  df-inp 6564  df-i1p 6565  df-iplp 6566  df-iltp 6568  df-enr 6811  df-nr 6812  df-ltr 6815  df-0r 6816  df-1r 6817  df-0 6896  df-1 6897  df-r 6899  df-lt 6902  df-pnf 7062  df-mnf 7063  df-xr 7064  df-ltxr 7065  df-le 7066  df-sub 7184  df-neg 7185  df-reap 7566  df-ap 7573  df-div 7652  df-2 7973  df-cj 9442  df-re 9443  df-im 9444
This theorem is referenced by:  replim  9459  reim0  9461  remullem  9471  imcj  9475  imneg  9476  imadd  9477  imi  9500  crimi  9537  crimd  9577  absreimsq  9665
  Copyright terms: Public domain W3C validator