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

Theorem sravscag 14591
Description: The scalar product operation of a subring algebra. (Contributed by Stefan O'Rear, 27-Nov-2014.) (Revised by Mario Carneiro, 4-Oct-2015.) (Revised by Thierry Arnoux, 16-Jun-2019.) (Proof shortened by AV, 12-Nov-2024.)
Hypotheses
Ref Expression
srapart.a  |-  ( ph  ->  A  =  ( (subringAlg  `  W ) `  S
) )
srapart.s  |-  ( ph  ->  S  C_  ( Base `  W ) )
srapart.ex  |-  ( ph  ->  W  e.  X )
Assertion
Ref Expression
sravscag  |-  ( ph  ->  ( .r `  W
)  =  ( .s
`  A ) )

Proof of Theorem sravscag
StepHypRef Expression
1 srapart.ex . . . . 5  |-  ( ph  ->  W  e.  X )
2 scaslid 13366 . . . . . . 7  |-  (Scalar  = Slot  (Scalar `  ndx )  /\  (Scalar `  ndx )  e.  NN )
32simpri 113 . . . . . 6  |-  (Scalar `  ndx )  e.  NN
43a1i 9 . . . . 5  |-  ( ph  ->  (Scalar `  ndx )  e.  NN )
5 basfn 13271 . . . . . . . 8  |-  Base  Fn  _V
61elexd 2827 . . . . . . . 8  |-  ( ph  ->  W  e.  _V )
7 funfvex 5687 . . . . . . . . 9  |-  ( ( Fun  Base  /\  W  e. 
dom  Base )  ->  ( Base `  W )  e. 
_V )
87funfni 5458 . . . . . . . 8  |-  ( (
Base  Fn  _V  /\  W  e.  _V )  ->  ( Base `  W )  e. 
_V )
95, 6, 8sylancr 414 . . . . . . 7  |-  ( ph  ->  ( Base `  W
)  e.  _V )
10 srapart.s . . . . . . 7  |-  ( ph  ->  S  C_  ( Base `  W ) )
119, 10ssexd 4250 . . . . . 6  |-  ( ph  ->  S  e.  _V )
12 ressex 13278 . . . . . 6  |-  ( ( W  e.  X  /\  S  e.  _V )  ->  ( Ws  S )  e.  _V )
131, 11, 12syl2anc 411 . . . . 5  |-  ( ph  ->  ( Ws  S )  e.  _V )
14 setsex 13244 . . . . 5  |-  ( ( W  e.  X  /\  (Scalar `  ndx )  e.  NN  /\  ( Ws  S )  e.  _V )  ->  ( W sSet  <. (Scalar ` 
ndx ) ,  ( Ws  S ) >. )  e.  _V )
151, 4, 13, 14syl3anc 1274 . . . 4  |-  ( ph  ->  ( W sSet  <. (Scalar ` 
ndx ) ,  ( Ws  S ) >. )  e.  _V )
16 vscaslid 13376 . . . . . 6  |-  ( .s  = Slot  ( .s `  ndx )  /\  ( .s `  ndx )  e.  NN )
1716simpri 113 . . . . 5  |-  ( .s
`  ndx )  e.  NN
1817a1i 9 . . . 4  |-  ( ph  ->  ( .s `  ndx )  e.  NN )
19 mulrslid 13345 . . . . . 6  |-  ( .r  = Slot  ( .r `  ndx )  /\  ( .r `  ndx )  e.  NN )
2019slotex 13239 . . . . 5  |-  ( W  e.  X  ->  ( .r `  W )  e. 
_V )
211, 20syl 14 . . . 4  |-  ( ph  ->  ( .r `  W
)  e.  _V )
22 setsex 13244 . . . 4  |-  ( ( ( W sSet  <. (Scalar ` 
ndx ) ,  ( Ws  S ) >. )  e.  _V  /\  ( .s
`  ndx )  e.  NN  /\  ( .r `  W
)  e.  _V )  ->  ( ( W sSet  <. (Scalar `  ndx ) ,  ( Ws  S ) >. ) sSet  <.
( .s `  ndx ) ,  ( .r `  W ) >. )  e.  _V )
2315, 18, 21, 22syl3anc 1274 . . 3  |-  ( ph  ->  ( ( W sSet  <. (Scalar `  ndx ) ,  ( Ws  S ) >. ) sSet  <.
( .s `  ndx ) ,  ( .r `  W ) >. )  e.  _V )
24 slotsdifipndx 13388 . . . . 5  |-  ( ( .s `  ndx )  =/=  ( .i `  ndx )  /\  (Scalar `  ndx )  =/=  ( .i `  ndx ) )
2524simpli 111 . . . 4  |-  ( .s
`  ndx )  =/=  ( .i `  ndx )
26 ipslid 13384 . . . . 5  |-  ( .i  = Slot  ( .i `  ndx )  /\  ( .i `  ndx )  e.  NN )
2726simpri 113 . . . 4  |-  ( .i
`  ndx )  e.  NN
2816, 25, 27setsslnid 13264 . . 3  |-  ( ( ( ( W sSet  <. (Scalar `  ndx ) ,  ( Ws  S ) >. ) sSet  <.
( .s `  ndx ) ,  ( .r `  W ) >. )  e.  _V  /\  ( .r
`  W )  e. 
_V )  ->  ( .s `  ( ( W sSet  <. (Scalar `  ndx ) ,  ( Ws  S ) >. ) sSet  <.
( .s `  ndx ) ,  ( .r `  W ) >. )
)  =  ( .s
`  ( ( ( W sSet  <. (Scalar `  ndx ) ,  ( Ws  S
) >. ) sSet  <. ( .s `  ndx ) ,  ( .r `  W
) >. ) sSet  <. ( .i `  ndx ) ,  ( .r `  W
) >. ) ) )
2923, 21, 28syl2anc 411 . 2  |-  ( ph  ->  ( .s `  (
( W sSet  <. (Scalar `  ndx ) ,  ( Ws  S ) >. ) sSet  <. ( .s `  ndx ) ,  ( .r `  W
) >. ) )  =  ( .s `  (
( ( W sSet  <. (Scalar `  ndx ) ,  ( Ws  S ) >. ) sSet  <.
( .s `  ndx ) ,  ( .r `  W ) >. ) sSet  <.
( .i `  ndx ) ,  ( .r `  W ) >. )
) )
3016setsslid 13263 . . 3  |-  ( ( ( W sSet  <. (Scalar ` 
ndx ) ,  ( Ws  S ) >. )  e.  _V  /\  ( .r
`  W )  e. 
_V )  ->  ( .r `  W )  =  ( .s `  (
( W sSet  <. (Scalar `  ndx ) ,  ( Ws  S ) >. ) sSet  <. ( .s `  ndx ) ,  ( .r `  W
) >. ) ) )
3115, 21, 30syl2anc 411 . 2  |-  ( ph  ->  ( .r `  W
)  =  ( .s
`  ( ( W sSet  <. (Scalar `  ndx ) ,  ( Ws  S ) >. ) sSet  <.
( .s `  ndx ) ,  ( .r `  W ) >. )
) )
32 srapart.a . . . 4  |-  ( ph  ->  A  =  ( (subringAlg  `  W ) `  S
) )
33 sraval 14585 . . . . 5  |-  ( ( 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 ) >. )
)
346, 10, 33syl2anc 411 . . . 4  |-  ( ph  ->  ( (subringAlg  `  W ) `
 S )  =  ( ( ( W sSet  <. (Scalar `  ndx ) ,  ( Ws  S ) >. ) sSet  <.
( .s `  ndx ) ,  ( .r `  W ) >. ) sSet  <.
( .i `  ndx ) ,  ( .r `  W ) >. )
)
3532, 34eqtrd 2265 . . 3  |-  ( ph  ->  A  =  ( ( ( W sSet  <. (Scalar ` 
ndx ) ,  ( Ws  S ) >. ) sSet  <.
( .s `  ndx ) ,  ( .r `  W ) >. ) sSet  <.
( .i `  ndx ) ,  ( .r `  W ) >. )
)
3635fveq2d 5674 . 2  |-  ( ph  ->  ( .s `  A
)  =  ( .s
`  ( ( ( W sSet  <. (Scalar `  ndx ) ,  ( Ws  S
) >. ) sSet  <. ( .s `  ndx ) ,  ( .r `  W
) >. ) sSet  <. ( .i `  ndx ) ,  ( .r `  W
) >. ) ) )
3729, 31, 363eqtr4d 2275 1  |-  ( ph  ->  ( .r `  W
)  =  ( .s
`  A ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1398    e. wcel 2203    =/= wne 2412   _Vcvv 2813    C_ wss 3211   <.cop 3692    Fn wfn 5347   ` cfv 5352  (class class class)co 6050   NNcn 9237   ndxcnx 13209   sSet csts 13210  Slot cslot 13211   Basecbs 13212   ↾s cress 13213   .rcmulr 13291  Scalarcsca 13293   .scvsca 13294   .icip 13295  subringAlg csra 14581
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-coll 4225  ax-sep 4228  ax-pow 4287  ax-pr 4322  ax-un 4554  ax-setind 4659  ax-cnex 8218  ax-resscn 8219  ax-1cn 8220  ax-1re 8221  ax-icn 8222  ax-addcl 8223  ax-addrcl 8224  ax-mulcl 8225  ax-addcom 8227  ax-addass 8229  ax-i2m1 8232  ax-0lt1 8233  ax-0id 8235  ax-rnegex 8236  ax-pre-ltirr 8239  ax-pre-lttrn 8241  ax-pre-ltadd 8243
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-nel 2508  df-ral 2525  df-rex 2526  df-reu 2527  df-rab 2529  df-v 2815  df-sbc 3043  df-csb 3139  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-nul 3509  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-int 3950  df-iun 3993  df-br 4110  df-opab 4172  df-mpt 4173  df-id 4414  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-ima 4762  df-iota 5312  df-fun 5354  df-fn 5355  df-f 5356  df-f1 5357  df-fo 5358  df-f1o 5359  df-fv 5360  df-ov 6053  df-oprab 6054  df-mpo 6055  df-pnf 8310  df-mnf 8311  df-ltxr 8313  df-inn 9238  df-2 9296  df-3 9297  df-4 9298  df-5 9299  df-6 9300  df-7 9301  df-8 9302  df-ndx 13215  df-slot 13216  df-base 13218  df-sets 13219  df-iress 13220  df-mulr 13304  df-sca 13306  df-vsca 13307  df-ip 13308  df-sra 14583
This theorem is referenced by:  sralmod  14598  rlmvscag  14609
  Copyright terms: Public domain W3C validator