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

Theorem rereim 8825
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 8267 . . . 4  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  ->  A  e.  CC )
3 simplr 529 . . . . 5  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  ->  B  e.  RR )
43recnd 8267 . . . 4  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  ->  B  e.  CC )
5 simprr 533 . . . . . . 7  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  ->  A  =  ( B  +  ( _i  x.  C ) ) )
65eqcomd 2237 . . . . . 6  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  -> 
( B  +  ( _i  x.  C ) )  =  A )
7 ax-icn 8187 . . . . . . . . 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 531 . . . . . . . . 9  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  ->  C  e.  RR )
109recnd 8267 . . . . . . . 8  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  ->  C  e.  CC )
118, 10mulcld 8259 . . . . . . 7  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  -> 
( _i  x.  C
)  e.  CC )
122, 4, 11subaddd 8567 . . . . . 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 8619 . . . . . . . . 9  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  -> 
( A  -  B
)  e.  RR )
1513, 14eqeltrrd 2309 . . . . . . . 8  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  -> 
( _i  x.  C
)  e.  RR )
16 rimul 8824 . . . . . . . 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 6044 . . . . . 6  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  -> 
( _i  x.  C
)  =  ( _i  x.  0 ) )
197mul01i 8629 . . . . . 6  |-  ( _i  x.  0 )  =  0
2018, 19eqtrdi 2280 . . . . 5  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  -> 
( _i  x.  C
)  =  0 )
2113, 20eqtrd 2264 . . . 4  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  -> 
( A  -  B
)  =  0 )
222, 4, 21subeq0d 8557 . . 3  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( C  e.  RR  /\  A  =  ( B  +  ( _i  x.  C ) ) ) )  ->  A  =  B )
2322eqcomd 2237 . 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 1398    e. wcel 2202  (class class class)co 6028   CCcc 8090   RRcr 8091   0cc0 8092   _ici 8094    + caddc 8095    x. cmul 8097    - cmin 8409
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-cnex 8183  ax-resscn 8184  ax-1cn 8185  ax-1re 8186  ax-icn 8187  ax-addcl 8188  ax-addrcl 8189  ax-mulcl 8190  ax-mulrcl 8191  ax-addcom 8192  ax-mulcom 8193  ax-addass 8194  ax-mulass 8195  ax-distr 8196  ax-i2m1 8197  ax-0lt1 8198  ax-1rid 8199  ax-0id 8200  ax-rnegex 8201  ax-precex 8202  ax-cnre 8203  ax-pre-ltirr 8204  ax-pre-lttrn 8206  ax-pre-apti 8207  ax-pre-ltadd 8208  ax-pre-mulgt0 8209
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-nel 2499  df-ral 2516  df-rex 2517  df-reu 2518  df-rab 2520  df-v 2805  df-sbc 3033  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-br 4094  df-opab 4156  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-iota 5293  df-fun 5335  df-fv 5341  df-riota 5981  df-ov 6031  df-oprab 6032  df-mpo 6033  df-pnf 8275  df-mnf 8276  df-ltxr 8278  df-sub 8411  df-neg 8412  df-reap 8814
This theorem is referenced by:  apreap  8826
  Copyright terms: Public domain W3C validator