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

Theorem sravscag 14752
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 13484 . . . . . . 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 13389 . . . . . . . 8  |-  Base  Fn  _V
61elexd 2835 . . . . . . . 8  |-  ( ph  ->  W  e.  _V )
7 funfvex 5707 . . . . . . . . 9  |-  ( ( Fun  Base  /\  W  e. 
dom  Base )  ->  ( Base `  W )  e. 
_V )
87funfni 5478 . . . . . . . 8  |-  ( (
Base  Fn  _V  /\  W  e.  _V )  ->  ( Base `  W )  e. 
_V )
95, 6, 8sylancr 418 . . . . . . 7  |-  ( ph  ->  ( Base `  W
)  e.  _V )
10 srapart.s . . . . . . 7  |-  ( ph  ->  S  C_  ( Base `  W ) )
119, 10ssexd 4268 . . . . . 6  |-  ( ph  ->  S  e.  _V )
12 ressex 13396 . . . . . 6  |-  ( ( W  e.  X  /\  S  e.  _V )  ->  ( Ws  S )  e.  _V )
131, 11, 12syl2anc 415 . . . . 5  |-  ( ph  ->  ( Ws  S )  e.  _V )
14 setsex 13362 . . . . 5  |-  ( ( W  e.  X  /\  (Scalar `  ndx )  e.  NN  /\  ( Ws  S )  e.  _V )  ->  ( W sSet  <. (Scalar ` 
ndx ) ,  ( Ws  S ) >. )  e.  _V )
151, 4, 13, 14syl3anc 1278 . . . 4  |-  ( ph  ->  ( W sSet  <. (Scalar ` 
ndx ) ,  ( Ws  S ) >. )  e.  _V )
16 vscaslid 13494 . . . . . 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 13463 . . . . . 6  |-  ( .r  = Slot  ( .r `  ndx )  /\  ( .r `  ndx )  e.  NN )
2019slotex 13357 . . . . 5  |-  ( W  e.  X  ->  ( .r `  W )  e. 
_V )
211, 20syl 14 . . . 4  |-  ( ph  ->  ( .r `  W
)  e.  _V )
22 setsex 13362 . . . 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 1278 . . 3  |-  ( ph  ->  ( ( W sSet  <. (Scalar `  ndx ) ,  ( Ws  S ) >. ) sSet  <.
( .s `  ndx ) ,  ( .r `  W ) >. )  e.  _V )
24 slotsdifipndx 13506 . . . . 5  |-  ( ( .s `  ndx )  =/=  ( .i `  ndx )  /\  (Scalar `  ndx )  =/=  ( .i `  ndx ) )
2524simpli 111 . . . 4  |-  ( .s
`  ndx )  =/=  ( .i `  ndx )
26 ipslid 13502 . . . . 5  |-  ( .i  = Slot  ( .i `  ndx )  /\  ( .i `  ndx )  e.  NN )
2726simpri 113 . . . 4  |-  ( .i
`  ndx )  e.  NN
2816, 25, 27setsslnid 13382 . . 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 415 . 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 13381 . . 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 415 . 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 14746 . . . . 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 415 . . . 4  |-  ( ph  ->  ( (subringAlg  `  W ) `
 S )  =  ( ( ( W sSet  <. (Scalar `  ndx ) ,  ( Ws  S ) >. ) sSet  <.
( .s `  ndx ) ,  ( .r `  W ) >. ) sSet  <.
( .i `  ndx ) ,  ( .r `  W ) >. )
)
3532, 34eqtrd 2271 . . 3  |-  ( ph  ->  A  =  ( ( ( W sSet  <. (Scalar ` 
ndx ) ,  ( Ws  S ) >. ) sSet  <.
( .s `  ndx ) ,  ( .r `  W ) >. ) sSet  <.
( .i `  ndx ) ,  ( .r `  W ) >. )
)
3635fveq2d 5694 . 2  |-  ( ph  ->  ( .s `  A
)  =  ( .s
`  ( ( ( W sSet  <. (Scalar `  ndx ) ,  ( Ws  S
) >. ) sSet  <. ( .s `  ndx ) ,  ( .r `  W
) >. ) sSet  <. ( .i `  ndx ) ,  ( .r `  W
) >. ) ) )
3729, 31, 363eqtr4d 2281 1  |-  ( ph  ->  ( .r `  W
)  =  ( .s
`  A ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1402    e. wcel 2209    =/= wne 2420   _Vcvv 2821    C_ wss 3220   <.cop 3708    Fn wfn 5367   ` cfv 5372  (class class class)co 6075   NNcn 9283   ndxcnx 13327   sSet csts 13328  Slot cslot 13329   Basecbs 13330   ↾s cress 13331   .rcmulr 13409  Scalarcsca 13411   .scvsca 13412   .icip 13413  subringAlg csra 14742
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-coll 4241  ax-sep 4244  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-cnex 8260  ax-resscn 8261  ax-1cn 8262  ax-1re 8263  ax-icn 8264  ax-addcl 8265  ax-addrcl 8266  ax-mulcl 8267  ax-addcom 8269  ax-addass 8271  ax-i2m1 8274  ax-0lt1 8275  ax-0id 8277  ax-rnegex 8278  ax-pre-ltirr 8281  ax-pre-lttrn 8283  ax-pre-ltadd 8285
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-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-iun 4009  df-br 4126  df-opab 4188  df-mpt 4189  df-id 4433  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-f1 5377  df-fo 5378  df-f1o 5379  df-fv 5380  df-ov 6078  df-oprab 6079  df-mpo 6080  df-pnf 8352  df-mnf 8353  df-ltxr 8355  df-inn 9284  df-2 9342  df-3 9343  df-4 9344  df-5 9345  df-6 9346  df-7 9347  df-8 9348  df-ndx 13333  df-slot 13334  df-base 13336  df-sets 13337  df-iress 13338  df-mulr 13422  df-sca 13424  df-vsca 13425  df-ip 13426  df-sra 14744
This theorem is referenced by:  sralmod  14759  rlmvscag  14770
  Copyright terms: Public domain W3C validator