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

Theorem rereim 8124
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 497 . . . . 5  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  ->  A  e.  RR )
21recnd 7577 . . . 4  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  ->  A  e.  CC )
3 simplr 498 . . . . 5  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  ->  B  e.  RR )
43recnd 7577 . . . 4  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  ->  B  e.  CC )
5 simprr 500 . . . . . . 7  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  ->  A  =  ( B  +  ( _i  x.  C ) ) )
65eqcomd 2094 . . . . . 6  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  -> 
( B  +  ( _i  x.  C ) )  =  A )
7 ax-icn 7501 . . . . . . . . 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 499 . . . . . . . . 9  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  ->  C  e.  RR )
109recnd 7577 . . . . . . . 8  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  ->  C  e.  CC )
118, 10mulcld 7569 . . . . . . 7  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  -> 
( _i  x.  C
)  e.  CC )
122, 4, 11subaddd 7872 . . . . . 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 7920 . . . . . . . . 9  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  -> 
( A  -  B
)  e.  RR )
1513, 14eqeltrrd 2166 . . . . . . . 8  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  -> 
( _i  x.  C
)  e.  RR )
16 rimul 8123 . . . . . . . 8  |-  ( ( C  e.  RR  /\  ( _i  x.  C
)  e.  RR )  ->  C  =  0 )
179, 15, 16syl2anc 404 . . . . . . 7  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  ->  C  =  0 )
1817oveq2d 5682 . . . . . 6  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  -> 
( _i  x.  C
)  =  ( _i  x.  0 ) )
197mul01i 7930 . . . . . 6  |-  ( _i  x.  0 )  =  0
2018, 19syl6eq 2137 . . . . 5  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  -> 
( _i  x.  C
)  =  0 )
2113, 20eqtrd 2121 . . . 4  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  -> 
( A  -  B
)  =  0 )
222, 4, 21subeq0d 7862 . . 3  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  ->  A  =  B )
2322eqcomd 2094 . 2  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  ->  B  =  A )
2423, 17jca 301 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 1290    e. wcel 1439  (class class class)co 5666   CCcc 7409   RRcr 7410   0cc0 7411   _ici 7413    + caddc 7414    x. cmul 7416    - cmin 7714
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 580  ax-in2 581  ax-io 666  ax-5 1382  ax-7 1383  ax-gen 1384  ax-ie1 1428  ax-ie2 1429  ax-8 1441  ax-10 1442  ax-11 1443  ax-i12 1444  ax-bndl 1445  ax-4 1446  ax-13 1450  ax-14 1451  ax-17 1465  ax-i9 1469  ax-ial 1473  ax-i5r 1474  ax-ext 2071  ax-sep 3963  ax-pow 4015  ax-pr 4045  ax-un 4269  ax-setind 4366  ax-cnex 7497  ax-resscn 7498  ax-1cn 7499  ax-1re 7500  ax-icn 7501  ax-addcl 7502  ax-addrcl 7503  ax-mulcl 7504  ax-mulrcl 7505  ax-addcom 7506  ax-mulcom 7507  ax-addass 7508  ax-mulass 7509  ax-distr 7510  ax-i2m1 7511  ax-0lt1 7512  ax-1rid 7513  ax-0id 7514  ax-rnegex 7515  ax-precex 7516  ax-cnre 7517  ax-pre-ltirr 7518  ax-pre-lttrn 7520  ax-pre-apti 7521  ax-pre-ltadd 7522  ax-pre-mulgt0 7523
This theorem depends on definitions:  df-bi 116  df-3an 927  df-tru 1293  df-fal 1296  df-nf 1396  df-sb 1694  df-eu 1952  df-mo 1953  df-clab 2076  df-cleq 2082  df-clel 2085  df-nfc 2218  df-ne 2257  df-nel 2352  df-ral 2365  df-rex 2366  df-reu 2367  df-rab 2369  df-v 2622  df-sbc 2842  df-dif 3002  df-un 3004  df-in 3006  df-ss 3013  df-pw 3435  df-sn 3456  df-pr 3457  df-op 3459  df-uni 3660  df-br 3852  df-opab 3906  df-id 4129  df-xp 4458  df-rel 4459  df-cnv 4460  df-co 4461  df-dm 4462  df-iota 4993  df-fun 5030  df-fv 5036  df-riota 5622  df-ov 5669  df-oprab 5670  df-mpt2 5671  df-pnf 7585  df-mnf 7586  df-ltxr 7588  df-sub 7716  df-neg 7717  df-reap 8113
This theorem is referenced by:  apreap  8125
  Copyright terms: Public domain W3C validator