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

Theorem sraip 18027
Description: The inner product operation of a subring algebra. (Contributed by Thierry Arnoux, 16-Jun-2019.)
Hypotheses
Ref Expression
srapart.a  |-  ( ph  ->  A  =  ( (subringAlg  `  W ) `  S
) )
srapart.s  |-  ( ph  ->  S  C_  ( Base `  W ) )
Assertion
Ref Expression
sraip  |-  ( ph  ->  ( .r `  W
)  =  ( .i
`  A ) )

Proof of Theorem sraip
StepHypRef Expression
1 srapart.a . . . . . 6  |-  ( ph  ->  A  =  ( (subringAlg  `  W ) `  S
) )
21adantl 464 . . . . 5  |-  ( ( W  e.  _V  /\  ph )  ->  A  =  ( (subringAlg  `  W ) `  S ) )
3 srapart.s . . . . . 6  |-  ( ph  ->  S  C_  ( Base `  W ) )
4 sraval 18020 . . . . . 6  |-  ( ( W  e.  _V  /\  S  C_  ( Base `  W
) )  ->  (
(subringAlg  `  W ) `  S )  =  ( ( ( W sSet  <. (Scalar `  ndx ) ,  ( Ws  S ) >. ) sSet  <.
( .s `  ndx ) ,  ( .r `  W ) >. ) sSet  <.
( .i `  ndx ) ,  ( .r `  W ) >. )
)
53, 4sylan2 472 . . . . 5  |-  ( ( W  e.  _V  /\  ph )  ->  ( (subringAlg  `  W ) `  S
)  =  ( ( ( W sSet  <. (Scalar ` 
ndx ) ,  ( Ws  S ) >. ) sSet  <.
( .s `  ndx ) ,  ( .r `  W ) >. ) sSet  <.
( .i `  ndx ) ,  ( .r `  W ) >. )
)
62, 5eqtrd 2495 . . . 4  |-  ( ( W  e.  _V  /\  ph )  ->  A  =  ( ( ( W sSet  <. (Scalar `  ndx ) ,  ( Ws  S ) >. ) sSet  <.
( .s `  ndx ) ,  ( .r `  W ) >. ) sSet  <.
( .i `  ndx ) ,  ( .r `  W ) >. )
)
76fveq2d 5852 . . 3  |-  ( ( W  e.  _V  /\  ph )  ->  ( .i `  A )  =  ( .i `  ( ( ( W sSet  <. (Scalar ` 
ndx ) ,  ( Ws  S ) >. ) sSet  <.
( .s `  ndx ) ,  ( .r `  W ) >. ) sSet  <.
( .i `  ndx ) ,  ( .r `  W ) >. )
) )
8 ovex 6298 . . . 4  |-  ( ( W sSet  <. (Scalar `  ndx ) ,  ( Ws  S
) >. ) sSet  <. ( .s `  ndx ) ,  ( .r `  W
) >. )  e.  _V
9 fvex 5858 . . . 4  |-  ( .r
`  W )  e. 
_V
10 ipid 14861 . . . . 5  |-  .i  = Slot  ( .i `  ndx )
1110setsid 14762 . . . 4  |-  ( ( ( ( W sSet  <. (Scalar `  ndx ) ,  ( Ws  S ) >. ) sSet  <.
( .s `  ndx ) ,  ( .r `  W ) >. )  e.  _V  /\  ( .r
`  W )  e. 
_V )  ->  ( .r `  W )  =  ( .i `  (
( ( W sSet  <. (Scalar `  ndx ) ,  ( Ws  S ) >. ) sSet  <.
( .s `  ndx ) ,  ( .r `  W ) >. ) sSet  <.
( .i `  ndx ) ,  ( .r `  W ) >. )
) )
128, 9, 11mp2an 670 . . 3  |-  ( .r
`  W )  =  ( .i `  (
( ( W sSet  <. (Scalar `  ndx ) ,  ( Ws  S ) >. ) sSet  <.
( .s `  ndx ) ,  ( .r `  W ) >. ) sSet  <.
( .i `  ndx ) ,  ( .r `  W ) >. )
)
137, 12syl6reqr 2514 . 2  |-  ( ( W  e.  _V  /\  ph )  ->  ( .r `  W )  =  ( .i `  A ) )
1410str0 14759 . . 3  |-  (/)  =  ( .i `  (/) )
15 fvprc 5842 . . . 4  |-  ( -.  W  e.  _V  ->  ( .r `  W )  =  (/) )
1615adantr 463 . . 3  |-  ( ( -.  W  e.  _V  /\ 
ph )  ->  ( .r `  W )  =  (/) )
17 fvprc 5842 . . . . . . 7  |-  ( -.  W  e.  _V  ->  (subringAlg  `  W )  =  (/) )
1817fveq1d 5850 . . . . . 6  |-  ( -.  W  e.  _V  ->  ( (subringAlg  `  W ) `  S )  =  (
(/) `  S )
)
19 0fv 5881 . . . . . 6  |-  ( (/) `  S )  =  (/)
2018, 19syl6eq 2511 . . . . 5  |-  ( -.  W  e.  _V  ->  ( (subringAlg  `  W ) `  S )  =  (/) )
211, 20sylan9eqr 2517 . . . 4  |-  ( ( -.  W  e.  _V  /\ 
ph )  ->  A  =  (/) )
2221fveq2d 5852 . . 3  |-  ( ( -.  W  e.  _V  /\ 
ph )  ->  ( .i `  A )  =  ( .i `  (/) ) )
2314, 16, 223eqtr4a 2521 . 2  |-  ( ( -.  W  e.  _V  /\ 
ph )  ->  ( .r `  W )  =  ( .i `  A
) )
2413, 23pm2.61ian 788 1  |-  ( ph  ->  ( .r `  W
)  =  ( .i
`  A ) )
Colors of variables: wff setvar class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 367    = wceq 1398    e. wcel 1823   _Vcvv 3106    C_ wss 3461   (/)c0 3783   <.cop 4022   ` cfv 5570  (class class class)co 6270   ndxcnx 14716   sSet csts 14717   Basecbs 14719   ↾s cress 14720   .rcmulr 14788  Scalarcsca 14790   .scvsca 14791   .icip 14792  subringAlg csra 18012
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1623  ax-4 1636  ax-5 1709  ax-6 1752  ax-7 1795  ax-8 1825  ax-9 1827  ax-10 1842  ax-11 1847  ax-12 1859  ax-13 2004  ax-ext 2432  ax-rep 4550  ax-sep 4560  ax-nul 4568  ax-pow 4615  ax-pr 4676  ax-un 6565  ax-cnex 9537  ax-resscn 9538  ax-1cn 9539  ax-icn 9540  ax-addcl 9541  ax-addrcl 9542  ax-mulcl 9543  ax-mulrcl 9544  ax-i2m1 9549  ax-1ne0 9550  ax-rrecex 9553  ax-cnre 9554
This theorem depends on definitions:  df-bi 185  df-or 368  df-an 369  df-3or 972  df-3an 973  df-tru 1401  df-ex 1618  df-nf 1622  df-sb 1745  df-eu 2288  df-mo 2289  df-clab 2440  df-cleq 2446  df-clel 2449  df-nfc 2604  df-ne 2651  df-ral 2809  df-rex 2810  df-reu 2811  df-rab 2813  df-v 3108  df-sbc 3325  df-csb 3421  df-dif 3464  df-un 3466  df-in 3468  df-ss 3475  df-pss 3477  df-nul 3784  df-if 3930  df-pw 4001  df-sn 4017  df-pr 4019  df-tp 4021  df-op 4023  df-uni 4236  df-iun 4317  df-br 4440  df-opab 4498  df-mpt 4499  df-tr 4533  df-eprel 4780  df-id 4784  df-po 4789  df-so 4790  df-fr 4827  df-we 4829  df-ord 4870  df-on 4871  df-lim 4872  df-suc 4873  df-xp 4994  df-rel 4995  df-cnv 4996  df-co 4997  df-dm 4998  df-rn 4999  df-res 5000  df-ima 5001  df-iota 5534  df-fun 5572  df-fn 5573  df-f 5574  df-f1 5575  df-fo 5576  df-f1o 5577  df-fv 5578  df-ov 6273  df-oprab 6274  df-mpt2 6275  df-om 6674  df-recs 7034  df-rdg 7068  df-nn 10532  df-2 10590  df-3 10591  df-4 10592  df-5 10593  df-6 10594  df-7 10595  df-8 10596  df-ndx 14722  df-slot 14723  df-sets 14725  df-ip 14805  df-sra 18016
This theorem is referenced by:  frlmip  18983  rrxip  21991
  Copyright terms: Public domain W3C validator