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

Theorem cjth 10245
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 8393 . . . 4  |-  ( A  e.  CC  ->  E! x  e.  CC  (
( A  +  x
)  e.  RR  /\  ( _i  x.  ( A  -  x )
)  e.  RR ) )
2 riotasbc 5605 . . . 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 10244 . . . 4  |-  ( A  e.  CC  ->  (
* `  A )  =  ( iota_ x  e.  CC  ( ( A  +  x )  e.  RR  /\  ( _i  x.  ( A  -  x ) )  e.  RR ) ) )
54sbceq1d 2843 . . 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 165 . 2  |-  ( A  e.  CC  ->  [. (
* `  A )  /  x ]. ( ( A  +  x )  e.  RR  /\  (
_i  x.  ( A  -  x ) )  e.  RR ) )
7 riotacl 5604 . . . . 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 2164 . . 3  |-  ( A  e.  CC  ->  (
* `  A )  e.  CC )
10 oveq2 5642 . . . . . 6  |-  ( x  =  ( * `  A )  ->  ( A  +  x )  =  ( A  +  ( * `  A
) ) )
1110eleq1d 2156 . . . . 5  |-  ( x  =  ( * `  A )  ->  (
( A  +  x
)  e.  RR  <->  ( A  +  ( * `  A ) )  e.  RR ) )
12 oveq2 5642 . . . . . . 7  |-  ( x  =  ( * `  A )  ->  ( A  -  x )  =  ( A  -  ( * `  A
) ) )
1312oveq2d 5650 . . . . . 6  |-  ( x  =  ( * `  A )  ->  (
_i  x.  ( A  -  x ) )  =  ( _i  x.  ( A  -  ( * `  A ) ) ) )
1413eleq1d 2156 . . . . 5  |-  ( x  =  ( * `  A )  ->  (
( _i  x.  ( A  -  x )
)  e.  RR  <->  ( _i  x.  ( A  -  (
* `  A )
) )  e.  RR ) )
1511, 14anbi12d 457 . . . 4  |-  ( x  =  ( * `  A )  ->  (
( ( A  +  x )  e.  RR  /\  ( _i  x.  ( A  -  x )
)  e.  RR )  <-> 
( ( A  +  ( * `  A
) )  e.  RR  /\  ( _i  x.  ( A  -  ( * `  A ) ) )  e.  RR ) ) )
1615sbcieg 2869 . . 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 145 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 102    <-> wb 103    = wceq 1289    e. wcel 1438   E!wreu 2361   [.wsbc 2838   ` cfv 5002   iota_crio 5589  (class class class)co 5634   CCcc 7327   RRcr 7328   _ici 7331    + caddc 7332    x. cmul 7334    - cmin 7632   *ccj 10238
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 579  ax-in2 580  ax-io 665  ax-5 1381  ax-7 1382  ax-gen 1383  ax-ie1 1427  ax-ie2 1428  ax-8 1440  ax-10 1441  ax-11 1442  ax-i12 1443  ax-bndl 1444  ax-4 1445  ax-13 1449  ax-14 1450  ax-17 1464  ax-i9 1468  ax-ial 1472  ax-i5r 1473  ax-ext 2070  ax-sep 3949  ax-pow 4001  ax-pr 4027  ax-un 4251  ax-setind 4343  ax-cnex 7415  ax-resscn 7416  ax-1cn 7417  ax-1re 7418  ax-icn 7419  ax-addcl 7420  ax-addrcl 7421  ax-mulcl 7422  ax-mulrcl 7423  ax-addcom 7424  ax-mulcom 7425  ax-addass 7426  ax-mulass 7427  ax-distr 7428  ax-i2m1 7429  ax-0lt1 7430  ax-1rid 7431  ax-0id 7432  ax-rnegex 7433  ax-precex 7434  ax-cnre 7435  ax-pre-ltirr 7436  ax-pre-lttrn 7438  ax-pre-apti 7439  ax-pre-ltadd 7440  ax-pre-mulgt0 7441
This theorem depends on definitions:  df-bi 115  df-3an 926  df-tru 1292  df-fal 1295  df-nf 1395  df-sb 1693  df-eu 1951  df-mo 1952  df-clab 2075  df-cleq 2081  df-clel 2084  df-nfc 2217  df-ne 2256  df-nel 2351  df-ral 2364  df-rex 2365  df-reu 2366  df-rmo 2367  df-rab 2368  df-v 2621  df-sbc 2839  df-dif 2999  df-un 3001  df-in 3003  df-ss 3010  df-pw 3427  df-sn 3447  df-pr 3448  df-op 3450  df-uni 3649  df-br 3838  df-opab 3892  df-mpt 3893  df-id 4111  df-xp 4434  df-rel 4435  df-cnv 4436  df-co 4437  df-dm 4438  df-iota 4967  df-fun 5004  df-fv 5010  df-riota 5590  df-ov 5637  df-oprab 5638  df-mpt2 5639  df-pnf 7503  df-mnf 7504  df-ltxr 7506  df-sub 7634  df-neg 7635  df-reap 8028  df-cj 10241
This theorem is referenced by:  recl  10252  crre  10256
  Copyright terms: Public domain W3C validator