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

Theorem rereim 8484
Description: Decomposition of a real number into real part (itself) and imaginary part (zero). (Contributed by Jim Kingdon, 30-Jan-2020.)
Assertion
Ref Expression
rereim  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  -> 
( B  =  A  /\  C  =  0 ) )

Proof of Theorem rereim
StepHypRef Expression
1 simpll 519 . . . . 5  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  ->  A  e.  RR )
21recnd 7927 . . . 4  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  ->  A  e.  CC )
3 simplr 520 . . . . 5  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  ->  B  e.  RR )
43recnd 7927 . . . 4  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  ->  B  e.  CC )
5 simprr 522 . . . . . . 7  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  ->  A  =  ( B  +  ( _i  x.  C ) ) )
65eqcomd 2171 . . . . . 6  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  -> 
( B  +  ( _i  x.  C ) )  =  A )
7 ax-icn 7848 . . . . . . . . 9  |-  _i  e.  CC
87a1i 9 . . . . . . . 8  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  ->  _i  e.  CC )
9 simprl 521 . . . . . . . . 9  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  ->  C  e.  RR )
109recnd 7927 . . . . . . . 8  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  ->  C  e.  CC )
118, 10mulcld 7919 . . . . . . 7  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  -> 
( _i  x.  C
)  e.  CC )
122, 4, 11subaddd 8227 . . . . . 6  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  -> 
( ( A  -  B )  =  ( _i  x.  C )  <-> 
( B  +  ( _i  x.  C ) )  =  A ) )
136, 12mpbird 166 . . . . 5  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  -> 
( A  -  B
)  =  ( _i  x.  C ) )
141, 3resubcld 8279 . . . . . . . . 9  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  -> 
( A  -  B
)  e.  RR )
1513, 14eqeltrrd 2244 . . . . . . . 8  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  -> 
( _i  x.  C
)  e.  RR )
16 rimul 8483 . . . . . . . 8  |-  ( ( C  e.  RR  /\  ( _i  x.  C
)  e.  RR )  ->  C  =  0 )
179, 15, 16syl2anc 409 . . . . . . 7  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  ->  C  =  0 )
1817oveq2d 5858 . . . . . 6  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  -> 
( _i  x.  C
)  =  ( _i  x.  0 ) )
197mul01i 8289 . . . . . 6  |-  ( _i  x.  0 )  =  0
2018, 19eqtrdi 2215 . . . . 5  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  -> 
( _i  x.  C
)  =  0 )
2113, 20eqtrd 2198 . . . 4  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  -> 
( A  -  B
)  =  0 )
222, 4, 21subeq0d 8217 . . 3  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  ->  A  =  B )
2322eqcomd 2171 . 2  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  ->  B  =  A )
2423, 17jca 304 1  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  -> 
( B  =  A  /\  C  =  0 ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    = wceq 1343    e. wcel 2136  (class class class)co 5842   CCcc 7751   RRcr 7752   0cc0 7753   _ici 7755    + caddc 7756    x. cmul 7758    - cmin 8069
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-13 2138  ax-14 2139  ax-ext 2147  ax-sep 4100  ax-pow 4153  ax-pr 4187  ax-un 4411  ax-setind 4514  ax-cnex 7844  ax-resscn 7845  ax-1cn 7846  ax-1re 7847  ax-icn 7848  ax-addcl 7849  ax-addrcl 7850  ax-mulcl 7851  ax-mulrcl 7852  ax-addcom 7853  ax-mulcom 7854  ax-addass 7855  ax-mulass 7856  ax-distr 7857  ax-i2m1 7858  ax-0lt1 7859  ax-1rid 7860  ax-0id 7861  ax-rnegex 7862  ax-precex 7863  ax-cnre 7864  ax-pre-ltirr 7865  ax-pre-lttrn 7867  ax-pre-apti 7868  ax-pre-ltadd 7869  ax-pre-mulgt0 7870
This theorem depends on definitions:  df-bi 116  df-3an 970  df-tru 1346  df-fal 1349  df-nf 1449  df-sb 1751  df-eu 2017  df-mo 2018  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ne 2337  df-nel 2432  df-ral 2449  df-rex 2450  df-reu 2451  df-rab 2453  df-v 2728  df-sbc 2952  df-dif 3118  df-un 3120  df-in 3122  df-ss 3129  df-pw 3561  df-sn 3582  df-pr 3583  df-op 3585  df-uni 3790  df-br 3983  df-opab 4044  df-id 4271  df-xp 4610  df-rel 4611  df-cnv 4612  df-co 4613  df-dm 4614  df-iota 5153  df-fun 5190  df-fv 5196  df-riota 5798  df-ov 5845  df-oprab 5846  df-mpo 5847  df-pnf 7935  df-mnf 7936  df-ltxr 7938  df-sub 8071  df-neg 8072  df-reap 8473
This theorem is referenced by:  apreap  8485
  Copyright terms: Public domain W3C validator