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

Theorem creur 8677
Description: The real 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
creur  |-  ( A  e.  CC  ->  E! x  e.  RR  E. y  e.  RR  A  =  ( x  +  ( _i  x.  y ) ) )
Distinct variable group:    x, y, A

Proof of Theorem creur
Dummy variables  z  w are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 cnre 7726 . 2  |-  ( A  e.  CC  ->  E. z  e.  RR  E. w  e.  RR  A  =  ( z  +  ( _i  x.  w ) ) )
2 cru 8327 . . . . . . . . . . 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 ) ) )
32ancoms 266 . . . . . . . . . 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 ) ) )
4 eqcom 2117 . . . . . . . . . 10  |-  ( ( z  +  ( _i  x.  w ) )  =  ( x  +  ( _i  x.  y
) )  <->  ( x  +  ( _i  x.  y ) )  =  ( z  +  ( _i  x.  w ) ) )
5 ancom 264 . . . . . . . . . 10  |-  ( ( y  =  w  /\  x  =  z )  <->  ( x  =  z  /\  y  =  w )
)
63, 4, 53bitr4g 222 . . . . . . . . 9  |-  ( ( ( z  e.  RR  /\  w  e.  RR )  /\  ( x  e.  RR  /\  y  e.  RR ) )  -> 
( ( z  +  ( _i  x.  w
) )  =  ( x  +  ( _i  x.  y ) )  <-> 
( y  =  w  /\  x  =  z ) ) )
76anassrs 395 . . . . . . . 8  |-  ( ( ( ( z  e.  RR  /\  w  e.  RR )  /\  x  e.  RR )  /\  y  e.  RR )  ->  (
( z  +  ( _i  x.  w ) )  =  ( x  +  ( _i  x.  y ) )  <->  ( y  =  w  /\  x  =  z ) ) )
87rexbidva 2409 . . . . . . 7  |-  ( ( ( z  e.  RR  /\  w  e.  RR )  /\  x  e.  RR )  ->  ( E. y  e.  RR  ( z  +  ( _i  x.  w
) )  =  ( x  +  ( _i  x.  y ) )  <->  E. y  e.  RR  ( y  =  w  /\  x  =  z ) ) )
9 biidd 171 . . . . . . . . 9  |-  ( y  =  w  ->  (
x  =  z  <->  x  =  z ) )
109ceqsrexv 2787 . . . . . . . 8  |-  ( w  e.  RR  ->  ( E. y  e.  RR  ( y  =  w  /\  x  =  z )  <->  x  =  z
) )
1110ad2antlr 478 . . . . . . 7  |-  ( ( ( z  e.  RR  /\  w  e.  RR )  /\  x  e.  RR )  ->  ( E. y  e.  RR  ( y  =  w  /\  x  =  z )  <->  x  =  z ) )
128, 11bitrd 187 . . . . . 6  |-  ( ( ( z  e.  RR  /\  w  e.  RR )  /\  x  e.  RR )  ->  ( E. y  e.  RR  ( z  +  ( _i  x.  w
) )  =  ( x  +  ( _i  x.  y ) )  <-> 
x  =  z ) )
1312ralrimiva 2480 . . . . 5  |-  ( ( z  e.  RR  /\  w  e.  RR )  ->  A. x  e.  RR  ( E. y  e.  RR  ( z  +  ( _i  x.  w ) )  =  ( x  +  ( _i  x.  y ) )  <->  x  =  z ) )
14 reu6i 2846 . . . . 5  |-  ( ( z  e.  RR  /\  A. x  e.  RR  ( E. y  e.  RR  ( z  +  ( _i  x.  w ) )  =  ( x  +  ( _i  x.  y ) )  <->  x  =  z ) )  ->  E! x  e.  RR  E. y  e.  RR  (
z  +  ( _i  x.  w ) )  =  ( x  +  ( _i  x.  y
) ) )
1513, 14syldan 278 . . . 4  |-  ( ( z  e.  RR  /\  w  e.  RR )  ->  E! x  e.  RR  E. y  e.  RR  (
z  +  ( _i  x.  w ) )  =  ( x  +  ( _i  x.  y
) ) )
16 eqeq1 2122 . . . . . 6  |-  ( A  =  ( z  +  ( _i  x.  w
) )  ->  ( A  =  ( x  +  ( _i  x.  y ) )  <->  ( z  +  ( _i  x.  w ) )  =  ( x  +  ( _i  x.  y ) ) ) )
1716rexbidv 2413 . . . . 5  |-  ( A  =  ( z  +  ( _i  x.  w
) )  ->  ( E. y  e.  RR  A  =  ( x  +  ( _i  x.  y ) )  <->  E. y  e.  RR  ( z  +  ( _i  x.  w
) )  =  ( x  +  ( _i  x.  y ) ) ) )
1817reubidv 2589 . . . 4  |-  ( A  =  ( z  +  ( _i  x.  w
) )  ->  ( E! x  e.  RR  E. y  e.  RR  A  =  ( x  +  ( _i  x.  y
) )  <->  E! x  e.  RR  E. y  e.  RR  ( z  +  ( _i  x.  w
) )  =  ( x  +  ( _i  x.  y ) ) ) )
1915, 18syl5ibrcom 156 . . 3  |-  ( ( z  e.  RR  /\  w  e.  RR )  ->  ( A  =  ( z  +  ( _i  x.  w ) )  ->  E! x  e.  RR  E. y  e.  RR  A  =  ( x  +  ( _i  x.  y ) ) ) )
2019rexlimivv 2530 . 2  |-  ( E. z  e.  RR  E. w  e.  RR  A  =  ( z  +  ( _i  x.  w
) )  ->  E! x  e.  RR  E. y  e.  RR  A  =  ( x  +  ( _i  x.  y ) ) )
211, 20syl 14 1  |-  ( A  e.  CC  ->  E! x  e.  RR  E. y  e.  RR  A  =  ( x  +  ( _i  x.  y ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    <-> wb 104    = wceq 1314    e. wcel 1463   A.wral 2391   E.wrex 2392   E!wreu 2393  (class class class)co 5740   CCcc 7582   RRcr 7583   _ici 7586    + caddc 7587    x. cmul 7589
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 586  ax-in2 587  ax-io 681  ax-5 1406  ax-7 1407  ax-gen 1408  ax-ie1 1452  ax-ie2 1453  ax-8 1465  ax-10 1466  ax-11 1467  ax-i12 1468  ax-bndl 1469  ax-4 1470  ax-13 1474  ax-14 1475  ax-17 1489  ax-i9 1493  ax-ial 1497  ax-i5r 1498  ax-ext 2097  ax-sep 4014  ax-pow 4066  ax-pr 4099  ax-un 4323  ax-setind 4420  ax-cnex 7675  ax-resscn 7676  ax-1cn 7677  ax-1re 7678  ax-icn 7679  ax-addcl 7680  ax-addrcl 7681  ax-mulcl 7682  ax-mulrcl 7683  ax-addcom 7684  ax-mulcom 7685  ax-addass 7686  ax-mulass 7687  ax-distr 7688  ax-i2m1 7689  ax-0lt1 7690  ax-1rid 7691  ax-0id 7692  ax-rnegex 7693  ax-precex 7694  ax-cnre 7695  ax-pre-ltirr 7696  ax-pre-lttrn 7698  ax-pre-apti 7699  ax-pre-ltadd 7700  ax-pre-mulgt0 7701
This theorem depends on definitions:  df-bi 116  df-3an 947  df-tru 1317  df-fal 1320  df-nf 1420  df-sb 1719  df-eu 1978  df-mo 1979  df-clab 2102  df-cleq 2108  df-clel 2111  df-nfc 2245  df-ne 2284  df-nel 2379  df-ral 2396  df-rex 2397  df-reu 2398  df-rab 2400  df-v 2660  df-sbc 2881  df-dif 3041  df-un 3043  df-in 3045  df-ss 3052  df-pw 3480  df-sn 3501  df-pr 3502  df-op 3504  df-uni 3705  df-br 3898  df-opab 3958  df-id 4183  df-xp 4513  df-rel 4514  df-cnv 4515  df-co 4516  df-dm 4517  df-iota 5056  df-fun 5093  df-fv 5099  df-riota 5696  df-ov 5743  df-oprab 5744  df-mpo 5745  df-pnf 7766  df-mnf 7767  df-ltxr 7769  df-sub 7899  df-neg 7900  df-reap 8300
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator