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

Theorem rereim 8520
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 527 . . . . 5  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  ->  A  e.  RR )
21recnd 7963 . . . 4  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  ->  A  e.  CC )
3 simplr 528 . . . . 5  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  ->  B  e.  RR )
43recnd 7963 . . . 4  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  ->  B  e.  CC )
5 simprr 531 . . . . . . 7  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  ->  A  =  ( B  +  ( _i  x.  C ) ) )
65eqcomd 2183 . . . . . 6  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  -> 
( B  +  ( _i  x.  C ) )  =  A )
7 ax-icn 7884 . . . . . . . . 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 529 . . . . . . . . 9  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  ->  C  e.  RR )
109recnd 7963 . . . . . . . 8  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  ->  C  e.  CC )
118, 10mulcld 7955 . . . . . . 7  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  -> 
( _i  x.  C
)  e.  CC )
122, 4, 11subaddd 8263 . . . . . 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 167 . . . . 5  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  -> 
( A  -  B
)  =  ( _i  x.  C ) )
141, 3resubcld 8315 . . . . . . . . 9  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  -> 
( A  -  B
)  e.  RR )
1513, 14eqeltrrd 2255 . . . . . . . 8  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  -> 
( _i  x.  C
)  e.  RR )
16 rimul 8519 . . . . . . . 8  |-  ( ( C  e.  RR  /\  ( _i  x.  C
)  e.  RR )  ->  C  =  0 )
179, 15, 16syl2anc 411 . . . . . . 7  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  ->  C  =  0 )
1817oveq2d 5884 . . . . . 6  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  -> 
( _i  x.  C
)  =  ( _i  x.  0 ) )
197mul01i 8325 . . . . . 6  |-  ( _i  x.  0 )  =  0
2018, 19eqtrdi 2226 . . . . 5  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  -> 
( _i  x.  C
)  =  0 )
2113, 20eqtrd 2210 . . . 4  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  -> 
( A  -  B
)  =  0 )
222, 4, 21subeq0d 8253 . . 3  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  ->  A  =  B )
2322eqcomd 2183 . 2  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  ->  B  =  A )
2423, 17jca 306 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 104    = wceq 1353    e. wcel 2148  (class class class)co 5868   CCcc 7787   RRcr 7788   0cc0 7789   _ici 7791    + caddc 7792    x. cmul 7794    - cmin 8105
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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-sep 4118  ax-pow 4171  ax-pr 4205  ax-un 4429  ax-setind 4532  ax-cnex 7880  ax-resscn 7881  ax-1cn 7882  ax-1re 7883  ax-icn 7884  ax-addcl 7885  ax-addrcl 7886  ax-mulcl 7887  ax-mulrcl 7888  ax-addcom 7889  ax-mulcom 7890  ax-addass 7891  ax-mulass 7892  ax-distr 7893  ax-i2m1 7894  ax-0lt1 7895  ax-1rid 7896  ax-0id 7897  ax-rnegex 7898  ax-precex 7899  ax-cnre 7900  ax-pre-ltirr 7901  ax-pre-lttrn 7903  ax-pre-apti 7904  ax-pre-ltadd 7905  ax-pre-mulgt0 7906
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-nel 2443  df-ral 2460  df-rex 2461  df-reu 2462  df-rab 2464  df-v 2739  df-sbc 2963  df-dif 3131  df-un 3133  df-in 3135  df-ss 3142  df-pw 3576  df-sn 3597  df-pr 3598  df-op 3600  df-uni 3808  df-br 4001  df-opab 4062  df-id 4289  df-xp 4628  df-rel 4629  df-cnv 4630  df-co 4631  df-dm 4632  df-iota 5173  df-fun 5213  df-fv 5219  df-riota 5824  df-ov 5871  df-oprab 5872  df-mpo 5873  df-pnf 7971  df-mnf 7972  df-ltxr 7974  df-sub 8107  df-neg 8108  df-reap 8509
This theorem is referenced by:  apreap  8521
  Copyright terms: Public domain W3C validator