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

Theorem sravscag 14539
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 13316 . . . . . . 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 13221 . . . . . . . 8  |-  Base  Fn  _V
61elexd 2817 . . . . . . . 8  |-  ( ph  ->  W  e.  _V )
7 funfvex 5665 . . . . . . . . 9  |-  ( ( Fun  Base  /\  W  e. 
dom  Base )  ->  ( Base `  W )  e. 
_V )
87funfni 5439 . . . . . . . 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 4234 . . . . . 6  |-  ( ph  ->  S  e.  _V )
12 ressex 13228 . . . . . 6  |-  ( ( W  e.  X  /\  S  e.  _V )  ->  ( Ws  S )  e.  _V )
131, 11, 12syl2anc 411 . . . . 5  |-  ( ph  ->  ( Ws  S )  e.  _V )
14 setsex 13194 . . . . 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 13326 . . . . . 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 13295 . . . . . 6  |-  ( .r  = Slot  ( .r `  ndx )  /\  ( .r `  ndx )  e.  NN )
2019slotex 13189 . . . . 5  |-  ( W  e.  X  ->  ( .r `  W )  e. 
_V )
211, 20syl 14 . . . 4  |-  ( ph  ->  ( .r `  W
)  e.  _V )
22 setsex 13194 . . . 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 13338 . . . . 5  |-  ( ( .s `  ndx )  =/=  ( .i `  ndx )  /\  (Scalar `  ndx )  =/=  ( .i `  ndx ) )
2524simpli 111 . . . 4  |-  ( .s
`  ndx )  =/=  ( .i `  ndx )
26 ipslid 13334 . . . . 5  |-  ( .i  = Slot  ( .i `  ndx )  /\  ( .i `  ndx )  e.  NN )
2726simpri 113 . . . 4  |-  ( .i
`  ndx )  e.  NN
2816, 25, 27setsslnid 13214 . . 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 13213 . . 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 14533 . . . . 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 2264 . . 3  |-  ( ph  ->  A  =  ( ( ( W sSet  <. (Scalar ` 
ndx ) ,  ( Ws  S ) >. ) sSet  <.
( .s `  ndx ) ,  ( .r `  W ) >. ) sSet  <.
( .i `  ndx ) ,  ( .r `  W ) >. )
)
3635fveq2d 5652 . 2  |-  ( ph  ->  ( .s `  A
)  =  ( .s
`  ( ( ( W sSet  <. (Scalar `  ndx ) ,  ( Ws  S
) >. ) sSet  <. ( .s `  ndx ) ,  ( .r `  W
) >. ) sSet  <. ( .i `  ndx ) ,  ( .r `  W
) >. ) ) )
3729, 31, 363eqtr4d 2274 1  |-  ( ph  ->  ( .r `  W
)  =  ( .s
`  A ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1398    e. wcel 2202    =/= wne 2403   _Vcvv 2803    C_ wss 3201   <.cop 3676    Fn wfn 5328   ` cfv 5333  (class class class)co 6028   NNcn 9202   ndxcnx 13159   sSet csts 13160  Slot cslot 13161   Basecbs 13162   ↾s cress 13163   .rcmulr 13241  Scalarcsca 13243   .scvsca 13244   .icip 13245  subringAlg csra 14529
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 2204  ax-14 2205  ax-ext 2213  ax-coll 4209  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-cnex 8183  ax-resscn 8184  ax-1cn 8185  ax-1re 8186  ax-icn 8187  ax-addcl 8188  ax-addrcl 8189  ax-mulcl 8190  ax-addcom 8192  ax-addass 8194  ax-i2m1 8197  ax-0lt1 8198  ax-0id 8200  ax-rnegex 8201  ax-pre-ltirr 8204  ax-pre-lttrn 8206  ax-pre-ltadd 8208
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-nel 2499  df-ral 2516  df-rex 2517  df-reu 2518  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-ov 6031  df-oprab 6032  df-mpo 6033  df-pnf 8275  df-mnf 8276  df-ltxr 8278  df-inn 9203  df-2 9261  df-3 9262  df-4 9263  df-5 9264  df-6 9265  df-7 9266  df-8 9267  df-ndx 13165  df-slot 13166  df-base 13168  df-sets 13169  df-iress 13170  df-mulr 13254  df-sca 13256  df-vsca 13257  df-ip 13258  df-sra 14531
This theorem is referenced by:  sralmod  14546  rlmvscag  14557
  Copyright terms: Public domain W3C validator