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

Theorem cjth 11592
Description: The defining property of the complex conjugate. (Contributed by Mario Carneiro, 6-Nov-2013.)
Assertion
Ref Expression
cjth  |-  ( A  e.  CC  ->  (
( A  +  ( * `  A ) )  e.  RR  /\  ( _i  x.  ( A  -  ( * `  A ) ) )  e.  RR ) )

Proof of Theorem cjth
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 cju 9284 . . . 4  |-  ( A  e.  CC  ->  E! x  e.  CC  (
( A  +  x
)  e.  RR  /\  ( _i  x.  ( A  -  x )
)  e.  RR ) )
2 riotasbc 6048 . . . 4  |-  ( E! x  e.  CC  (
( A  +  x
)  e.  RR  /\  ( _i  x.  ( A  -  x )
)  e.  RR )  ->  [. ( iota_ x  e.  CC  ( ( A  +  x )  e.  RR  /\  ( _i  x.  ( A  -  x ) )  e.  RR ) )  /  x ]. ( ( A  +  x )  e.  RR  /\  ( _i  x.  ( A  -  x ) )  e.  RR ) )
31, 2syl 14 . . 3  |-  ( A  e.  CC  ->  [. ( iota_ x  e.  CC  (
( A  +  x
)  e.  RR  /\  ( _i  x.  ( A  -  x )
)  e.  RR ) )  /  x ]. ( ( A  +  x )  e.  RR  /\  ( _i  x.  ( A  -  x )
)  e.  RR ) )
4 cjval 11591 . . . 4  |-  ( A  e.  CC  ->  (
* `  A )  =  ( iota_ x  e.  CC  ( ( A  +  x )  e.  RR  /\  ( _i  x.  ( A  -  x ) )  e.  RR ) ) )
54sbceq1d 3056 . . 3  |-  ( A  e.  CC  ->  ( [. ( * `  A
)  /  x ]. ( ( A  +  x )  e.  RR  /\  ( _i  x.  ( A  -  x )
)  e.  RR )  <->  [. ( iota_ x  e.  CC  ( ( A  +  x )  e.  RR  /\  ( _i  x.  ( A  -  x )
)  e.  RR ) )  /  x ]. ( ( A  +  x )  e.  RR  /\  ( _i  x.  ( A  -  x )
)  e.  RR ) ) )
63, 5mpbird 167 . 2  |-  ( A  e.  CC  ->  [. (
* `  A )  /  x ]. ( ( A  +  x )  e.  RR  /\  (
_i  x.  ( A  -  x ) )  e.  RR ) )
7 riotacl 6047 . . . . 5  |-  ( E! x  e.  CC  (
( A  +  x
)  e.  RR  /\  ( _i  x.  ( A  -  x )
)  e.  RR )  ->  ( iota_ x  e.  CC  ( ( A  +  x )  e.  RR  /\  ( _i  x.  ( A  -  x ) )  e.  RR ) )  e.  CC )
81, 7syl 14 . . . 4  |-  ( A  e.  CC  ->  ( iota_ x  e.  CC  (
( A  +  x
)  e.  RR  /\  ( _i  x.  ( A  -  x )
)  e.  RR ) )  e.  CC )
94, 8eqeltrd 2315 . . 3  |-  ( A  e.  CC  ->  (
* `  A )  e.  CC )
10 oveq2 6086 . . . . . 6  |-  ( x  =  ( * `  A )  ->  ( A  +  x )  =  ( A  +  ( * `  A
) ) )
1110eleq1d 2307 . . . . 5  |-  ( x  =  ( * `  A )  ->  (
( A  +  x
)  e.  RR  <->  ( A  +  ( * `  A ) )  e.  RR ) )
12 oveq2 6086 . . . . . . 7  |-  ( x  =  ( * `  A )  ->  ( A  -  x )  =  ( A  -  ( * `  A
) ) )
1312oveq2d 6094 . . . . . 6  |-  ( x  =  ( * `  A )  ->  (
_i  x.  ( A  -  x ) )  =  ( _i  x.  ( A  -  ( * `  A ) ) ) )
1413eleq1d 2307 . . . . 5  |-  ( x  =  ( * `  A )  ->  (
( _i  x.  ( A  -  x )
)  e.  RR  <->  ( _i  x.  ( A  -  (
* `  A )
) )  e.  RR ) )
1511, 14anbi12d 477 . . . 4  |-  ( x  =  ( * `  A )  ->  (
( ( A  +  x )  e.  RR  /\  ( _i  x.  ( A  -  x )
)  e.  RR )  <-> 
( ( A  +  ( * `  A
) )  e.  RR  /\  ( _i  x.  ( A  -  ( * `  A ) ) )  e.  RR ) ) )
1615sbcieg 3084 . . 3  |-  ( ( * `  A )  e.  CC  ->  ( [. ( * `  A
)  /  x ]. ( ( A  +  x )  e.  RR  /\  ( _i  x.  ( A  -  x )
)  e.  RR )  <-> 
( ( A  +  ( * `  A
) )  e.  RR  /\  ( _i  x.  ( A  -  ( * `  A ) ) )  e.  RR ) ) )
179, 16syl 14 . 2  |-  ( A  e.  CC  ->  ( [. ( * `  A
)  /  x ]. ( ( A  +  x )  e.  RR  /\  ( _i  x.  ( A  -  x )
)  e.  RR )  <-> 
( ( A  +  ( * `  A
) )  e.  RR  /\  ( _i  x.  ( A  -  ( * `  A ) ) )  e.  RR ) ) )
186, 17mpbid 147 1  |-  ( A  e.  CC  ->  (
( A  +  ( * `  A ) )  e.  RR  /\  ( _i  x.  ( A  -  ( * `  A ) ) )  e.  RR ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1402    e. wcel 2209   E!wreu 2530   [.wsbc 3051   ` cfv 5375   iota_crio 6030  (class class class)co 6078   CCcc 8170   RRcr 8171   _ici 8174    + caddc 8175    x. cmul 8177    - cmin 8490   *ccj 11585
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 4247  ax-pow 4309  ax-pr 4344  ax-un 4576  ax-setind 4682  ax-cnex 8263  ax-resscn 8264  ax-1cn 8265  ax-1re 8266  ax-icn 8267  ax-addcl 8268  ax-addrcl 8269  ax-mulcl 8270  ax-mulrcl 8271  ax-addcom 8272  ax-mulcom 8273  ax-addass 8274  ax-mulass 8275  ax-distr 8276  ax-i2m1 8277  ax-0lt1 8278  ax-1rid 8279  ax-0id 8280  ax-rnegex 8281  ax-precex 8282  ax-cnre 8283  ax-pre-ltirr 8284  ax-pre-lttrn 8286  ax-pre-apti 8287  ax-pre-ltadd 8288  ax-pre-mulgt0 8289
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-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3714  df-pr 3715  df-op 3717  df-uni 3934  df-br 4129  df-opab 4191  df-mpt 4192  df-id 4436  df-xp 4778  df-rel 4779  df-cnv 4780  df-co 4781  df-dm 4782  df-iota 5335  df-fun 5377  df-fv 5383  df-riota 6031  df-ov 6081  df-oprab 6082  df-mpo 6083  df-pnf 8355  df-mnf 8356  df-ltxr 8358  df-sub 8492  df-neg 8493  df-reap 8896  df-cj 11588
This theorem is referenced by:  recl  11599  crre  11603
  Copyright terms: Public domain W3C validator