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

Theorem rimul 8504
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 8503 . . 3  |-  -.  _i  e.  RR
2 recexre 8497 . . . . . 6  |-  ( ( A  e.  RR  /\  A #  0 )  ->  E. x  e.  RR  ( A  x.  x )  =  1 )
32adantlr 474 . . . . 5  |-  ( ( ( A  e.  RR  /\  ( _i  x.  A
)  e.  RR )  /\  A #  0 )  ->  E. x  e.  RR  ( A  x.  x
)  =  1 )
4 simplll 528 . . . . . . . . 9  |-  ( ( ( ( A  e.  RR  /\  ( _i  x.  A )  e.  RR )  /\  A #  0
)  /\  ( x  e.  RR  /\  ( A  x.  x )  =  1 ) )  ->  A  e.  RR )
54recnd 7948 . . . . . . . 8  |-  ( ( ( ( A  e.  RR  /\  ( _i  x.  A )  e.  RR )  /\  A #  0
)  /\  ( x  e.  RR  /\  ( A  x.  x )  =  1 ) )  ->  A  e.  CC )
6 simprl 526 . . . . . . . . 9  |-  ( ( ( ( A  e.  RR  /\  ( _i  x.  A )  e.  RR )  /\  A #  0
)  /\  ( x  e.  RR  /\  ( A  x.  x )  =  1 ) )  ->  x  e.  RR )
76recnd 7948 . . . . . . . 8  |-  ( ( ( ( A  e.  RR  /\  ( _i  x.  A )  e.  RR )  /\  A #  0
)  /\  ( x  e.  RR  /\  ( A  x.  x )  =  1 ) )  ->  x  e.  CC )
8 ax-icn 7869 . . . . . . . . 9  |-  _i  e.  CC
9 mulass 7905 . . . . . . . . 9  |-  ( ( _i  e.  CC  /\  A  e.  CC  /\  x  e.  CC )  ->  (
( _i  x.  A
)  x.  x )  =  ( _i  x.  ( A  x.  x
) ) )
108, 9mp3an1 1319 . . . . . . . 8  |-  ( ( A  e.  CC  /\  x  e.  CC )  ->  ( ( _i  x.  A )  x.  x
)  =  ( _i  x.  ( A  x.  x ) ) )
115, 7, 10syl2anc 409 . . . . . . 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 5861 . . . . . . . . 9  |-  ( ( A  x.  x )  =  1  ->  (
_i  x.  ( A  x.  x ) )  =  ( _i  x.  1 ) )
138mulid1i 7922 . . . . . . . . 9  |-  ( _i  x.  1 )  =  _i
1412, 13eqtrdi 2219 . . . . . . . 8  |-  ( ( A  x.  x )  =  1  ->  (
_i  x.  ( A  x.  x ) )  =  _i )
1514ad2antll 488 . . . . . . 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 2203 . . . . . 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 529 . . . . . . 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 7950 . . . . . 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 2248 . . . . 5  |-  ( ( ( ( A  e.  RR  /\  ( _i  x.  A )  e.  RR )  /\  A #  0
)  /\  ( x  e.  RR  /\  ( A  x.  x )  =  1 ) )  ->  _i  e.  RR )
203, 19rexlimddv 2592 . . . 4  |-  ( ( ( A  e.  RR  /\  ( _i  x.  A
)  e.  RR )  /\  A #  0 )  ->  _i  e.  RR )
2120ex 114 . . 3  |-  ( ( A  e.  RR  /\  ( _i  x.  A
)  e.  RR )  ->  ( A #  0  ->  _i  e.  RR ) )
221, 21mtoi 659 . 2  |-  ( ( A  e.  RR  /\  ( _i  x.  A
)  e.  RR )  ->  -.  A #  0 )
23 0re 7920 . . . 4  |-  0  e.  RR
24 reapti 8498 . . . 4  |-  ( ( A  e.  RR  /\  0  e.  RR )  ->  ( A  =  0  <->  -.  A #  0 ) )
2523, 24mpan2 423 . . 3  |-  ( A  e.  RR  ->  ( A  =  0  <->  -.  A #  0
) )
2625adantr 274 . 2  |-  ( ( A  e.  RR  /\  ( _i  x.  A
)  e.  RR )  ->  ( A  =  0  <->  -.  A #  0 ) )
2722, 26mpbird 166 1  |-  ( ( A  e.  RR  /\  ( _i  x.  A
)  e.  RR )  ->  A  =  0 )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 103    <-> wb 104    = wceq 1348    e. wcel 2141   E.wrex 2449   class class class wbr 3989  (class class class)co 5853   CCcc 7772   RRcr 7773   0cc0 7774   1c1 7775   _ici 7776    x. cmul 7779   # creap 8493
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 609  ax-in2 610  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-13 2143  ax-14 2144  ax-ext 2152  ax-sep 4107  ax-pow 4160  ax-pr 4194  ax-un 4418  ax-setind 4521  ax-cnex 7865  ax-resscn 7866  ax-1cn 7867  ax-1re 7868  ax-icn 7869  ax-addcl 7870  ax-addrcl 7871  ax-mulcl 7872  ax-mulrcl 7873  ax-addcom 7874  ax-mulcom 7875  ax-addass 7876  ax-mulass 7877  ax-distr 7878  ax-i2m1 7879  ax-0lt1 7880  ax-1rid 7881  ax-0id 7882  ax-rnegex 7883  ax-precex 7884  ax-cnre 7885  ax-pre-ltirr 7886  ax-pre-lttrn 7888  ax-pre-apti 7889  ax-pre-ltadd 7890  ax-pre-mulgt0 7891
This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-fal 1354  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ne 2341  df-nel 2436  df-ral 2453  df-rex 2454  df-reu 2455  df-rab 2457  df-v 2732  df-sbc 2956  df-dif 3123  df-un 3125  df-in 3127  df-ss 3134  df-pw 3568  df-sn 3589  df-pr 3590  df-op 3592  df-uni 3797  df-br 3990  df-opab 4051  df-id 4278  df-xp 4617  df-rel 4618  df-cnv 4619  df-co 4620  df-dm 4621  df-iota 5160  df-fun 5200  df-fv 5206  df-riota 5809  df-ov 5856  df-oprab 5857  df-mpo 5858  df-pnf 7956  df-mnf 7957  df-ltxr 7959  df-sub 8092  df-neg 8093  df-reap 8494
This theorem is referenced by:  rereim  8505  cru  8521  cju  8877  crre  10821
  Copyright terms: Public domain W3C validator