MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ipcj Unicode version

Theorem ipcj 16790
Description: Conjugate of an inner product in a pre-Hilbert space. (Contributed by Mario Carneiro, 7-Oct-2015.)
Hypotheses
Ref Expression
phlsrng.f  |-  F  =  (Scalar `  W )
phllmhm.h  |-  .,  =  ( .i `  W )
phllmhm.v  |-  V  =  ( Base `  W
)
ipcj.i  |-  .*  =  ( * r `  F )
Assertion
Ref Expression
ipcj  |-  ( ( W  e.  PreHil  /\  A  e.  V  /\  B  e.  V )  ->  (  .*  `  ( A  .,  B ) )  =  ( B  .,  A
) )

Proof of Theorem ipcj
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 phllmhm.v . . . . . 6  |-  V  =  ( Base `  W
)
2 phlsrng.f . . . . . 6  |-  F  =  (Scalar `  W )
3 phllmhm.h . . . . . 6  |-  .,  =  ( .i `  W )
4 eqid 2389 . . . . . 6  |-  ( 0g
`  W )  =  ( 0g `  W
)
5 ipcj.i . . . . . 6  |-  .*  =  ( * r `  F )
6 eqid 2389 . . . . . 6  |-  ( 0g
`  F )  =  ( 0g `  F
)
71, 2, 3, 4, 5, 6isphl 16784 . . . . 5  |-  ( W  e.  PreHil 
<->  ( W  e.  LVec  /\  F  e.  *Ring  /\  A. x  e.  V  (
( y  e.  V  |->  ( y  .,  x
) )  e.  ( W LMHom  (ringLMod `  F )
)  /\  ( (
x  .,  x )  =  ( 0g `  F )  ->  x  =  ( 0g `  W ) )  /\  A. y  e.  V  (  .*  `  ( x 
.,  y ) )  =  ( y  .,  x ) ) ) )
87simp3bi 974 . . . 4  |-  ( W  e.  PreHil  ->  A. x  e.  V  ( ( y  e.  V  |->  ( y  .,  x ) )  e.  ( W LMHom  (ringLMod `  F
) )  /\  (
( x  .,  x
)  =  ( 0g
`  F )  ->  x  =  ( 0g `  W ) )  /\  A. y  e.  V  (  .*  `  ( x 
.,  y ) )  =  ( y  .,  x ) ) )
9 simp3 959 . . . . 5  |-  ( ( ( y  e.  V  |->  ( y  .,  x
) )  e.  ( W LMHom  (ringLMod `  F )
)  /\  ( (
x  .,  x )  =  ( 0g `  F )  ->  x  =  ( 0g `  W ) )  /\  A. y  e.  V  (  .*  `  ( x 
.,  y ) )  =  ( y  .,  x ) )  ->  A. y  e.  V  (  .*  `  ( x 
.,  y ) )  =  ( y  .,  x ) )
109ralimi 2726 . . . 4  |-  ( A. x  e.  V  (
( y  e.  V  |->  ( y  .,  x
) )  e.  ( W LMHom  (ringLMod `  F )
)  /\  ( (
x  .,  x )  =  ( 0g `  F )  ->  x  =  ( 0g `  W ) )  /\  A. y  e.  V  (  .*  `  ( x 
.,  y ) )  =  ( y  .,  x ) )  ->  A. x  e.  V  A. y  e.  V  (  .*  `  ( x 
.,  y ) )  =  ( y  .,  x ) )
118, 10syl 16 . . 3  |-  ( W  e.  PreHil  ->  A. x  e.  V  A. y  e.  V  (  .*  `  ( x 
.,  y ) )  =  ( y  .,  x ) )
12 oveq1 6029 . . . . . 6  |-  ( x  =  A  ->  (
x  .,  y )  =  ( A  .,  y ) )
1312fveq2d 5674 . . . . 5  |-  ( x  =  A  ->  (  .*  `  ( x  .,  y ) )  =  (  .*  `  ( A  .,  y ) ) )
14 oveq2 6030 . . . . 5  |-  ( x  =  A  ->  (
y  .,  x )  =  ( y  .,  A ) )
1513, 14eqeq12d 2403 . . . 4  |-  ( x  =  A  ->  (
(  .*  `  (
x  .,  y )
)  =  ( y 
.,  x )  <->  (  .*  `  ( A  .,  y
) )  =  ( y  .,  A ) ) )
16 oveq2 6030 . . . . . 6  |-  ( y  =  B  ->  ( A  .,  y )  =  ( A  .,  B
) )
1716fveq2d 5674 . . . . 5  |-  ( y  =  B  ->  (  .*  `  ( A  .,  y ) )  =  (  .*  `  ( A  .,  B ) ) )
18 oveq1 6029 . . . . 5  |-  ( y  =  B  ->  (
y  .,  A )  =  ( B  .,  A ) )
1917, 18eqeq12d 2403 . . . 4  |-  ( y  =  B  ->  (
(  .*  `  ( A  .,  y ) )  =  ( y  .,  A )  <->  (  .*  `  ( A  .,  B
) )  =  ( B  .,  A ) ) )
2015, 19rspc2v 3003 . . 3  |-  ( ( A  e.  V  /\  B  e.  V )  ->  ( A. x  e.  V  A. y  e.  V  (  .*  `  ( x  .,  y ) )  =  ( y 
.,  x )  -> 
(  .*  `  ( A  .,  B ) )  =  ( B  .,  A ) ) )
2111, 20syl5com 28 . 2  |-  ( W  e.  PreHil  ->  ( ( A  e.  V  /\  B  e.  V )  ->  (  .*  `  ( A  .,  B ) )  =  ( B  .,  A
) ) )
22213impib 1151 1  |-  ( ( W  e.  PreHil  /\  A  e.  V  /\  B  e.  V )  ->  (  .*  `  ( A  .,  B ) )  =  ( B  .,  A
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 359    /\ w3a 936    = wceq 1649    e. wcel 1717   A.wral 2651    e. cmpt 4209   ` cfv 5396  (class class class)co 6022   Basecbs 13398   * rcstv 13460  Scalarcsca 13461   .icip 13463   0gc0g 13652   *Ringcsr 15861   LMHom clmhm 16024   LVecclvec 16103  ringLModcrglmod 16170   PreHilcphl 16780
This theorem is referenced by:  iporthcom  16791  ip0r  16793  ipdi  16796  ipassr  16802  cphipcj  19035  tchcphlem3  19063  ipcau2  19064  tchcphlem1  19065
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1552  ax-5 1563  ax-17 1623  ax-9 1661  ax-8 1682  ax-6 1736  ax-7 1741  ax-11 1753  ax-12 1939  ax-ext 2370  ax-nul 4281
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3an 938  df-tru 1325  df-ex 1548  df-nf 1551  df-sb 1656  df-eu 2244  df-clab 2376  df-cleq 2382  df-clel 2385  df-nfc 2514  df-ne 2554  df-ral 2656  df-rex 2657  df-rab 2660  df-v 2903  df-sbc 3107  df-dif 3268  df-un 3270  df-in 3272  df-ss 3279  df-nul 3574  df-if 3685  df-sn 3765  df-pr 3766  df-op 3768  df-uni 3960  df-br 4156  df-opab 4210  df-mpt 4211  df-iota 5360  df-fv 5404  df-ov 6025  df-phl 16782
  Copyright terms: Public domain W3C validator