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

Theorem creui 9139
Description: The imaginary part of a complex number is unique. Proposition 10-1.3 of [Gleason] p. 130. (Contributed by NM, 9-May-1999.) (Proof shortened by Mario Carneiro, 27-May-2016.)
Assertion
Ref Expression
creui  |-  ( A  e.  CC  ->  E! y  e.  RR  E. x  e.  RR  A  =  ( x  +  ( _i  x.  y ) ) )
Distinct variable group:    x, y, A

Proof of Theorem creui
Dummy variables  z  w are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 cnre 8174 . 2  |-  ( A  e.  CC  ->  E. z  e.  RR  E. w  e.  RR  A  =  ( z  +  ( _i  x.  w ) ) )
2 simpr 110 . . . . 5  |-  ( ( z  e.  RR  /\  w  e.  RR )  ->  w  e.  RR )
3 eqcom 2233 . . . . . . . . . 10  |-  ( ( z  +  ( _i  x.  w ) )  =  ( x  +  ( _i  x.  y
) )  <->  ( x  +  ( _i  x.  y ) )  =  ( z  +  ( _i  x.  w ) ) )
4 cru 8781 . . . . . . . . . . 11  |-  ( ( ( x  e.  RR  /\  y  e.  RR )  /\  ( z  e.  RR  /\  w  e.  RR ) )  -> 
( ( x  +  ( _i  x.  y
) )  =  ( z  +  ( _i  x.  w ) )  <-> 
( x  =  z  /\  y  =  w ) ) )
54ancoms 268 . . . . . . . . . 10  |-  ( ( ( z  e.  RR  /\  w  e.  RR )  /\  ( x  e.  RR  /\  y  e.  RR ) )  -> 
( ( x  +  ( _i  x.  y
) )  =  ( z  +  ( _i  x.  w ) )  <-> 
( x  =  z  /\  y  =  w ) ) )
63, 5bitrid 192 . . . . . . . . 9  |-  ( ( ( z  e.  RR  /\  w  e.  RR )  /\  ( x  e.  RR  /\  y  e.  RR ) )  -> 
( ( z  +  ( _i  x.  w
) )  =  ( x  +  ( _i  x.  y ) )  <-> 
( x  =  z  /\  y  =  w ) ) )
76anass1rs 573 . . . . . . . 8  |-  ( ( ( ( z  e.  RR  /\  w  e.  RR )  /\  y  e.  RR )  /\  x  e.  RR )  ->  (
( z  +  ( _i  x.  w ) )  =  ( x  +  ( _i  x.  y ) )  <->  ( x  =  z  /\  y  =  w ) ) )
87rexbidva 2529 . . . . . . 7  |-  ( ( ( z  e.  RR  /\  w  e.  RR )  /\  y  e.  RR )  ->  ( E. x  e.  RR  ( z  +  ( _i  x.  w
) )  =  ( x  +  ( _i  x.  y ) )  <->  E. x  e.  RR  ( x  =  z  /\  y  =  w
) ) )
9 biidd 172 . . . . . . . . 9  |-  ( x  =  z  ->  (
y  =  w  <->  y  =  w ) )
109ceqsrexv 2936 . . . . . . . 8  |-  ( z  e.  RR  ->  ( E. x  e.  RR  ( x  =  z  /\  y  =  w
)  <->  y  =  w ) )
1110ad2antrr 488 . . . . . . 7  |-  ( ( ( z  e.  RR  /\  w  e.  RR )  /\  y  e.  RR )  ->  ( E. x  e.  RR  ( x  =  z  /\  y  =  w )  <->  y  =  w ) )
128, 11bitrd 188 . . . . . 6  |-  ( ( ( z  e.  RR  /\  w  e.  RR )  /\  y  e.  RR )  ->  ( E. x  e.  RR  ( z  +  ( _i  x.  w
) )  =  ( x  +  ( _i  x.  y ) )  <-> 
y  =  w ) )
1312ralrimiva 2605 . . . . 5  |-  ( ( z  e.  RR  /\  w  e.  RR )  ->  A. y  e.  RR  ( E. x  e.  RR  ( z  +  ( _i  x.  w ) )  =  ( x  +  ( _i  x.  y ) )  <->  y  =  w ) )
14 reu6i 2997 . . . . 5  |-  ( ( w  e.  RR  /\  A. y  e.  RR  ( E. x  e.  RR  ( z  +  ( _i  x.  w ) )  =  ( x  +  ( _i  x.  y ) )  <->  y  =  w ) )  ->  E! y  e.  RR  E. x  e.  RR  (
z  +  ( _i  x.  w ) )  =  ( x  +  ( _i  x.  y
) ) )
152, 13, 14syl2anc 411 . . . 4  |-  ( ( z  e.  RR  /\  w  e.  RR )  ->  E! y  e.  RR  E. x  e.  RR  (
z  +  ( _i  x.  w ) )  =  ( x  +  ( _i  x.  y
) ) )
16 eqeq1 2238 . . . . . 6  |-  ( A  =  ( z  +  ( _i  x.  w
) )  ->  ( A  =  ( x  +  ( _i  x.  y ) )  <->  ( z  +  ( _i  x.  w ) )  =  ( x  +  ( _i  x.  y ) ) ) )
1716rexbidv 2533 . . . . 5  |-  ( A  =  ( z  +  ( _i  x.  w
) )  ->  ( E. x  e.  RR  A  =  ( x  +  ( _i  x.  y ) )  <->  E. x  e.  RR  ( z  +  ( _i  x.  w
) )  =  ( x  +  ( _i  x.  y ) ) ) )
1817reubidv 2718 . . . 4  |-  ( A  =  ( z  +  ( _i  x.  w
) )  ->  ( E! y  e.  RR  E. x  e.  RR  A  =  ( x  +  ( _i  x.  y
) )  <->  E! y  e.  RR  E. x  e.  RR  ( z  +  ( _i  x.  w
) )  =  ( x  +  ( _i  x.  y ) ) ) )
1915, 18syl5ibrcom 157 . . 3  |-  ( ( z  e.  RR  /\  w  e.  RR )  ->  ( A  =  ( z  +  ( _i  x.  w ) )  ->  E! y  e.  RR  E. x  e.  RR  A  =  ( x  +  ( _i  x.  y ) ) ) )
2019rexlimivv 2656 . 2  |-  ( E. z  e.  RR  E. w  e.  RR  A  =  ( z  +  ( _i  x.  w
) )  ->  E! y  e.  RR  E. x  e.  RR  A  =  ( x  +  ( _i  x.  y ) ) )
211, 20syl 14 1  |-  ( A  e.  CC  ->  E! y  e.  RR  E. x  e.  RR  A  =  ( x  +  ( _i  x.  y ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1397    e. wcel 2202   A.wral 2510   E.wrex 2511   E!wreu 2512  (class class class)co 6017   CCcc 8029   RRcr 8030   _ici 8033    + caddc 8034    x. cmul 8036
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-cnex 8122  ax-resscn 8123  ax-1cn 8124  ax-1re 8125  ax-icn 8126  ax-addcl 8127  ax-addrcl 8128  ax-mulcl 8129  ax-mulrcl 8130  ax-addcom 8131  ax-mulcom 8132  ax-addass 8133  ax-mulass 8134  ax-distr 8135  ax-i2m1 8136  ax-0lt1 8137  ax-1rid 8138  ax-0id 8139  ax-rnegex 8140  ax-precex 8141  ax-cnre 8142  ax-pre-ltirr 8143  ax-pre-lttrn 8145  ax-pre-apti 8146  ax-pre-ltadd 8147  ax-pre-mulgt0 8148
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-br 4089  df-opab 4151  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-iota 5286  df-fun 5328  df-fv 5334  df-riota 5970  df-ov 6020  df-oprab 6021  df-mpo 6022  df-pnf 8215  df-mnf 8216  df-ltxr 8218  df-sub 8351  df-neg 8352  df-reap 8754
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator