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

Theorem creui 9182
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 8218 . 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 8824 . . . . . . . . . . 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 2530 . . . . . . 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 2937 . . . . . . . 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 2606 . . . . 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 2998 . . . . 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 2534 . . . . 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 2719 . . . 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 2657 . 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 1398    e. wcel 2202   A.wral 2511   E.wrex 2512   E!wreu 2513  (class class class)co 6028   CCcc 8073   RRcr 8074   _ici 8077    + caddc 8078    x. cmul 8080
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 8166  ax-resscn 8167  ax-1cn 8168  ax-1re 8169  ax-icn 8170  ax-addcl 8171  ax-addrcl 8172  ax-mulcl 8173  ax-mulrcl 8174  ax-addcom 8175  ax-mulcom 8176  ax-addass 8177  ax-mulass 8178  ax-distr 8179  ax-i2m1 8180  ax-0lt1 8181  ax-1rid 8182  ax-0id 8183  ax-rnegex 8184  ax-precex 8185  ax-cnre 8186  ax-pre-ltirr 8187  ax-pre-lttrn 8189  ax-pre-apti 8190  ax-pre-ltadd 8191  ax-pre-mulgt0 8192
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 8258  df-mnf 8259  df-ltxr 8261  df-sub 8394  df-neg 8395  df-reap 8797
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator