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

Theorem rimul 8903
Description: A real number times the imaginary unit is real only if the number is 0. (Contributed by NM, 28-May-1999.) (Revised by Mario Carneiro, 27-May-2016.)
Assertion
Ref Expression
rimul  |-  ( ( A  e.  RR  /\  ( _i  x.  A
)  e.  RR )  ->  A  =  0 )

Proof of Theorem rimul
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 inelr 8902 . . 3  |-  -.  _i  e.  RR
2 recexre 8896 . . . . . 6  |-  ( ( A  e.  RR  /\  A #  0 )  ->  E. x  e.  RR  ( A  x.  x )  =  1 )
32adantlr 481 . . . . 5  |-  ( ( ( A  e.  RR  /\  ( _i  x.  A
)  e.  RR )  /\  A #  0 )  ->  E. x  e.  RR  ( A  x.  x
)  =  1 )
4 simplll 539 . . . . . . . . 9  |-  ( ( ( ( A  e.  RR  /\  ( _i  x.  A )  e.  RR )  /\  A #  0
)  /\  ( x  e.  RR  /\  ( A  x.  x )  =  1 ) )  ->  A  e.  RR )
54recnd 8344 . . . . . . . 8  |-  ( ( ( ( A  e.  RR  /\  ( _i  x.  A )  e.  RR )  /\  A #  0
)  /\  ( x  e.  RR  /\  ( A  x.  x )  =  1 ) )  ->  A  e.  CC )
6 simprl 535 . . . . . . . . 9  |-  ( ( ( ( A  e.  RR  /\  ( _i  x.  A )  e.  RR )  /\  A #  0
)  /\  ( x  e.  RR  /\  ( A  x.  x )  =  1 ) )  ->  x  e.  RR )
76recnd 8344 . . . . . . . 8  |-  ( ( ( ( A  e.  RR  /\  ( _i  x.  A )  e.  RR )  /\  A #  0
)  /\  ( x  e.  RR  /\  ( A  x.  x )  =  1 ) )  ->  x  e.  CC )
8 ax-icn 8264 . . . . . . . . 9  |-  _i  e.  CC
9 mulass 8300 . . . . . . . . 9  |-  ( ( _i  e.  CC  /\  A  e.  CC  /\  x  e.  CC )  ->  (
( _i  x.  A
)  x.  x )  =  ( _i  x.  ( A  x.  x
) ) )
108, 9mp3an1 1365 . . . . . . . 8  |-  ( ( A  e.  CC  /\  x  e.  CC )  ->  ( ( _i  x.  A )  x.  x
)  =  ( _i  x.  ( A  x.  x ) ) )
115, 7, 10syl2anc 415 . . . . . . 7  |-  ( ( ( ( A  e.  RR  /\  ( _i  x.  A )  e.  RR )  /\  A #  0
)  /\  ( x  e.  RR  /\  ( A  x.  x )  =  1 ) )  -> 
( ( _i  x.  A )  x.  x
)  =  ( _i  x.  ( A  x.  x ) ) )
12 oveq2 6083 . . . . . . . . 9  |-  ( ( A  x.  x )  =  1  ->  (
_i  x.  ( A  x.  x ) )  =  ( _i  x.  1 ) )
138mulridi 8318 . . . . . . . . 9  |-  ( _i  x.  1 )  =  _i
1412, 13eqtrdi 2287 . . . . . . . 8  |-  ( ( A  x.  x )  =  1  ->  (
_i  x.  ( A  x.  x ) )  =  _i )
1514ad2antll 495 . . . . . . 7  |-  ( ( ( ( A  e.  RR  /\  ( _i  x.  A )  e.  RR )  /\  A #  0
)  /\  ( x  e.  RR  /\  ( A  x.  x )  =  1 ) )  -> 
( _i  x.  ( A  x.  x )
)  =  _i )
1611, 15eqtrd 2271 . . . . . 6  |-  ( ( ( ( A  e.  RR  /\  ( _i  x.  A )  e.  RR )  /\  A #  0
)  /\  ( x  e.  RR  /\  ( A  x.  x )  =  1 ) )  -> 
( ( _i  x.  A )  x.  x
)  =  _i )
17 simpllr 540 . . . . . . 7  |-  ( ( ( ( A  e.  RR  /\  ( _i  x.  A )  e.  RR )  /\  A #  0
)  /\  ( x  e.  RR  /\  ( A  x.  x )  =  1 ) )  -> 
( _i  x.  A
)  e.  RR )
1817, 6remulcld 8346 . . . . . 6  |-  ( ( ( ( A  e.  RR  /\  ( _i  x.  A )  e.  RR )  /\  A #  0
)  /\  ( x  e.  RR  /\  ( A  x.  x )  =  1 ) )  -> 
( ( _i  x.  A )  x.  x
)  e.  RR )
1916, 18eqeltrrd 2316 . . . . 5  |-  ( ( ( ( A  e.  RR  /\  ( _i  x.  A )  e.  RR )  /\  A #  0
)  /\  ( x  e.  RR  /\  ( A  x.  x )  =  1 ) )  ->  _i  e.  RR )
203, 19rexlimddv 2673 . . . 4  |-  ( ( ( A  e.  RR  /\  ( _i  x.  A
)  e.  RR )  /\  A #  0 )  ->  _i  e.  RR )
2120ex 115 . . 3  |-  ( ( A  e.  RR  /\  ( _i  x.  A
)  e.  RR )  ->  ( A #  0  ->  _i  e.  RR ) )
221, 21mtoi 674 . 2  |-  ( ( A  e.  RR  /\  ( _i  x.  A
)  e.  RR )  ->  -.  A #  0 )
23 0re 8316 . . . 4  |-  0  e.  RR
24 reapti 8897 . . . 4  |-  ( ( A  e.  RR  /\  0  e.  RR )  ->  ( A  =  0  <->  -.  A #  0 ) )
2523, 24mpan2 429 . . 3  |-  ( A  e.  RR  ->  ( A  =  0  <->  -.  A #  0
) )
2625adantr 276 . 2  |-  ( ( A  e.  RR  /\  ( _i  x.  A
)  e.  RR )  ->  ( A  =  0  <->  -.  A #  0 ) )
2722, 26mpbird 167 1  |-  ( ( A  e.  RR  /\  ( _i  x.  A
)  e.  RR )  ->  A  =  0 )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1402    e. wcel 2209   E.wrex 2529   class class class wbr 4125  (class class class)co 6075   CCcc 8167   RRcr 8168   0cc0 8169   1c1 8170   _ici 8171    x. cmul 8174   # creap 8892
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 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4244  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-cnex 8260  ax-resscn 8261  ax-1cn 8262  ax-1re 8263  ax-icn 8264  ax-addcl 8265  ax-addrcl 8266  ax-mulcl 8267  ax-mulrcl 8268  ax-addcom 8269  ax-mulcom 8270  ax-addass 8271  ax-mulass 8272  ax-distr 8273  ax-i2m1 8274  ax-0lt1 8275  ax-1rid 8276  ax-0id 8277  ax-rnegex 8278  ax-precex 8279  ax-cnre 8280  ax-pre-ltirr 8281  ax-pre-lttrn 8283  ax-pre-apti 8284  ax-pre-ltadd 8285  ax-pre-mulgt0 8286
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-br 4126  df-opab 4188  df-id 4433  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-iota 5332  df-fun 5374  df-fv 5380  df-riota 6028  df-ov 6078  df-oprab 6079  df-mpo 6080  df-pnf 8352  df-mnf 8353  df-ltxr 8355  df-sub 8489  df-neg 8490  df-reap 8893
This theorem is referenced by:  rereim  8904  cru  8920  cju  9281  crre  11600
  Copyright terms: Public domain W3C validator