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

Theorem scafvalg 14311
Description: The scalar multiplication operation as a function. (Contributed by Mario Carneiro, 5-Oct-2015.)
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
scafvalg  |-  ( ( W  e.  V  /\  X  e.  K  /\  Y  e.  B )  ->  ( X  .xb  Y
)  =  ( X 
.x.  Y ) )

Proof of Theorem scafvalg
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 scaffval.b . . . 4  |-  B  =  ( Base `  W
)
2 scaffval.f . . . 4  |-  F  =  (Scalar `  W )
3 scaffval.k . . . 4  |-  K  =  ( Base `  F
)
4 scaffval.a . . . 4  |-  .xb  =  ( .sf `  W
)
5 scaffval.s . . . 4  |-  .x.  =  ( .s `  W )
61, 2, 3, 4, 5scaffvalg 14310 . . 3  |-  ( W  e.  V  ->  .xb  =  ( x  e.  K ,  y  e.  B  |->  ( x  .x.  y
) ) )
763ad2ant1 1042 . 2  |-  ( ( W  e.  V  /\  X  e.  K  /\  Y  e.  B )  -> 
.xb  =  ( x  e.  K ,  y  e.  B  |->  ( x 
.x.  y ) ) )
8 oveq12 6022 . . 3  |-  ( ( x  =  X  /\  y  =  Y )  ->  ( x  .x.  y
)  =  ( X 
.x.  Y ) )
98adantl 277 . 2  |-  ( ( ( W  e.  V  /\  X  e.  K  /\  Y  e.  B
)  /\  ( x  =  X  /\  y  =  Y ) )  -> 
( x  .x.  y
)  =  ( X 
.x.  Y ) )
10 simp2 1022 . 2  |-  ( ( W  e.  V  /\  X  e.  K  /\  Y  e.  B )  ->  X  e.  K )
11 simp3 1023 . 2  |-  ( ( W  e.  V  /\  X  e.  K  /\  Y  e.  B )  ->  Y  e.  B )
12 vscaslid 13236 . . . . . 6  |-  ( .s  = Slot  ( .s `  ndx )  /\  ( .s `  ndx )  e.  NN )
1312slotex 13099 . . . . 5  |-  ( W  e.  V  ->  ( .s `  W )  e. 
_V )
145, 13eqeltrid 2316 . . . 4  |-  ( W  e.  V  ->  .x.  e.  _V )
15143ad2ant1 1042 . . 3  |-  ( ( W  e.  V  /\  X  e.  K  /\  Y  e.  B )  ->  .x.  e.  _V )
16 ovexg 6047 . . 3  |-  ( ( X  e.  K  /\  .x. 
e.  _V  /\  Y  e.  B )  ->  ( X  .x.  Y )  e. 
_V )
1710, 15, 11, 16syl3anc 1271 . 2  |-  ( ( W  e.  V  /\  X  e.  K  /\  Y  e.  B )  ->  ( X  .x.  Y
)  e.  _V )
187, 9, 10, 11, 17ovmpod 6144 1  |-  ( ( W  e.  V  /\  X  e.  K  /\  Y  e.  B )  ->  ( X  .xb  Y
)  =  ( X 
.x.  Y ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    /\ w3a 1002    = wceq 1395    e. wcel 2200   _Vcvv 2800   ` cfv 5324  (class class class)co 6013    e. cmpo 6015   Basecbs 13072  Scalarcsca 13153   .scvsca 13154   .sfcscaf 14292
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4202  ax-sep 4205  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-setind 4633  ax-cnex 8113  ax-resscn 8114  ax-1re 8116  ax-addrcl 8119
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2802  df-sbc 3030  df-csb 3126  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-int 3927  df-iun 3970  df-br 4087  df-opab 4149  df-mpt 4150  df-id 4388  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-rn 4734  df-res 4735  df-ima 4736  df-iota 5284  df-fun 5326  df-fn 5327  df-f 5328  df-f1 5329  df-fo 5330  df-f1o 5331  df-fv 5332  df-ov 6016  df-oprab 6017  df-mpo 6018  df-1st 6298  df-2nd 6299  df-inn 9134  df-2 9192  df-3 9193  df-4 9194  df-5 9195  df-6 9196  df-ndx 13075  df-slot 13076  df-base 13078  df-sca 13166  df-vsca 13167  df-scaf 14294
This theorem is referenced by:  lmodfopne  14330
  Copyright terms: Public domain W3C validator