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

Theorem scaffvalg 14643
Description: The scalar multiplication operation as a function. (Contributed by Mario Carneiro, 5-Oct-2015.) (Proof shortened by AV, 2-Mar-2024.)
Hypotheses
Ref Expression
scaffval.b  |-  B  =  ( Base `  W
)
scaffval.f  |-  F  =  (Scalar `  W )
scaffval.k  |-  K  =  ( Base `  F
)
scaffval.a  |-  .xb  =  ( .sf `  W
)
scaffval.s  |-  .x.  =  ( .s `  W )
Assertion
Ref Expression
scaffvalg  |-  ( W  e.  V  ->  .xb  =  ( x  e.  K ,  y  e.  B  |->  ( x  .x.  y
) ) )
Distinct variable groups:    x, y, B   
x, K, y    x,  .x. , y    x, W, y   
x, V, y
Allowed substitution hints:    .xb ( x,  y)    F( x,  y)

Proof of Theorem scaffvalg
Dummy variable  w is distinct from all other variables.
StepHypRef Expression
1 scaffval.a . 2  |-  .xb  =  ( .sf `  W
)
2 elex 2833 . . 3  |-  ( W  e.  V  ->  W  e.  _V )
3 df-scaf 14626 . . . 4  |-  .sf 
=  ( w  e. 
_V  |->  ( x  e.  ( Base `  (Scalar `  w ) ) ,  y  e.  ( Base `  w )  |->  ( x ( .s `  w
) y ) ) )
4 fveq2 5695 . . . . . . . 8  |-  ( w  =  W  ->  (Scalar `  w )  =  (Scalar `  W ) )
5 scaffval.f . . . . . . . 8  |-  F  =  (Scalar `  W )
64, 5eqtr4di 2289 . . . . . . 7  |-  ( w  =  W  ->  (Scalar `  w )  =  F )
76fveq2d 5699 . . . . . 6  |-  ( w  =  W  ->  ( Base `  (Scalar `  w
) )  =  (
Base `  F )
)
8 scaffval.k . . . . . 6  |-  K  =  ( Base `  F
)
97, 8eqtr4di 2289 . . . . 5  |-  ( w  =  W  ->  ( Base `  (Scalar `  w
) )  =  K )
10 fveq2 5695 . . . . . 6  |-  ( w  =  W  ->  ( Base `  w )  =  ( Base `  W
) )
11 scaffval.b . . . . . 6  |-  B  =  ( Base `  W
)
1210, 11eqtr4di 2289 . . . . 5  |-  ( w  =  W  ->  ( Base `  w )  =  B )
13 fveq2 5695 . . . . . . 7  |-  ( w  =  W  ->  ( .s `  w )  =  ( .s `  W
) )
14 scaffval.s . . . . . . 7  |-  .x.  =  ( .s `  W )
1513, 14eqtr4di 2289 . . . . . 6  |-  ( w  =  W  ->  ( .s `  w )  = 
.x.  )
1615oveqd 6102 . . . . 5  |-  ( w  =  W  ->  (
x ( .s `  w ) y )  =  ( x  .x.  y ) )
179, 12, 16mpoeq123dv 6150 . . . 4  |-  ( w  =  W  ->  (
x  e.  ( Base `  (Scalar `  w )
) ,  y  e.  ( Base `  w
)  |->  ( x ( .s `  w ) y ) )  =  ( x  e.  K ,  y  e.  B  |->  ( x  .x.  y
) ) )
18 elex 2833 . . . 4  |-  ( W  e.  _V  ->  W  e.  _V )
19 basfn 13411 . . . . . . 7  |-  Base  Fn  _V
20 scaslid 13507 . . . . . . . . 9  |-  (Scalar  = Slot  (Scalar `  ndx )  /\  (Scalar `  ndx )  e.  NN )
2120slotex 13379 . . . . . . . 8  |-  ( W  e.  _V  ->  (Scalar `  W )  e.  _V )
225, 21eqeltrid 2325 . . . . . . 7  |-  ( W  e.  _V  ->  F  e.  _V )
23 funfvex 5712 . . . . . . . 8  |-  ( ( Fun  Base  /\  F  e. 
dom  Base )  ->  ( Base `  F )  e. 
_V )
2423funfni 5483 . . . . . . 7  |-  ( (
Base  Fn  _V  /\  F  e.  _V )  ->  ( Base `  F )  e. 
_V )
2519, 22, 24sylancr 418 . . . . . 6  |-  ( W  e.  _V  ->  ( Base `  F )  e. 
_V )
268, 25eqeltrid 2325 . . . . 5  |-  ( W  e.  _V  ->  K  e.  _V )
27 funfvex 5712 . . . . . . . 8  |-  ( ( Fun  Base  /\  W  e. 
dom  Base )  ->  ( Base `  W )  e. 
_V )
2827funfni 5483 . . . . . . 7  |-  ( (
Base  Fn  _V  /\  W  e.  _V )  ->  ( Base `  W )  e. 
_V )
2919, 28mpan 428 . . . . . 6  |-  ( W  e.  _V  ->  ( Base `  W )  e. 
_V )
3011, 29eqeltrid 2325 . . . . 5  |-  ( W  e.  _V  ->  B  e.  _V )
31 mpoexga 6448 . . . . 5  |-  ( ( K  e.  _V  /\  B  e.  _V )  ->  ( x  e.  K ,  y  e.  B  |->  ( x  .x.  y
) )  e.  _V )
3226, 30, 31syl2anc 415 . . . 4  |-  ( W  e.  _V  ->  (
x  e.  K , 
y  e.  B  |->  ( x  .x.  y ) )  e.  _V )
333, 17, 18, 32fvmptd3 5799 . . 3  |-  ( W  e.  _V  ->  ( .sf `  W )  =  ( x  e.  K ,  y  e.  B  |->  ( x  .x.  y ) ) )
342, 33syl 14 . 2  |-  ( W  e.  V  ->  ( .sf `  W )  =  ( x  e.  K ,  y  e.  B  |->  ( x  .x.  y ) ) )
351, 34eqtrid 2283 1  |-  ( W  e.  V  ->  .xb  =  ( x  e.  K ,  y  e.  B  |->  ( x  .x.  y
) ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    = wceq 1402    e. wcel 2209   _Vcvv 2821    Fn wfn 5372   ` cfv 5377  (class class class)co 6085    e. cmpo 6087   Basecbs 13352  Scalarcsca 13434   .scvsca 13435   .sfcscaf 14624
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  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 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-cnex 8270  ax-resscn 8271  ax-1re 8273  ax-addrcl 8276
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  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-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-inn 9305  df-2 9363  df-3 9364  df-4 9365  df-5 9366  df-ndx 13355  df-slot 13356  df-base 13358  df-sca 13447  df-scaf 14626
This theorem is used by:  scafvalg  14644  scafeqg  14645  scaffng  14646  lmodscaf  14647
  Copyright terms: Public domain W3C validator