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

Theorem scafvalg 14386
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 14385 . . 3  |-  ( W  e.  V  ->  .xb  =  ( x  e.  K ,  y  e.  B  |->  ( x  .x.  y
) ) )
763ad2ant1 1045 . 2  |-  ( ( W  e.  V  /\  X  e.  K  /\  Y  e.  B )  -> 
.xb  =  ( x  e.  K ,  y  e.  B  |->  ( x 
.x.  y ) ) )
8 oveq12 6037 . . 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 1025 . 2  |-  ( ( W  e.  V  /\  X  e.  K  /\  Y  e.  B )  ->  X  e.  K )
11 simp3 1026 . 2  |-  ( ( W  e.  V  /\  X  e.  K  /\  Y  e.  B )  ->  Y  e.  B )
12 vscaslid 13309 . . . . . 6  |-  ( .s  = Slot  ( .s `  ndx )  /\  ( .s `  ndx )  e.  NN )
1312slotex 13172 . . . . 5  |-  ( W  e.  V  ->  ( .s `  W )  e. 
_V )
145, 13eqeltrid 2318 . . . 4  |-  ( W  e.  V  ->  .x.  e.  _V )
15143ad2ant1 1045 . . 3  |-  ( ( W  e.  V  /\  X  e.  K  /\  Y  e.  B )  ->  .x.  e.  _V )
16 ovexg 6062 . . 3  |-  ( ( X  e.  K  /\  .x. 
e.  _V  /\  Y  e.  B )  ->  ( X  .x.  Y )  e. 
_V )
1710, 15, 11, 16syl3anc 1274 . 2  |-  ( ( W  e.  V  /\  X  e.  K  /\  Y  e.  B )  ->  ( X  .x.  Y
)  e.  _V )
187, 9, 10, 11, 17ovmpod 6159 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 1005    = wceq 1398    e. wcel 2202   _Vcvv 2803   ` cfv 5333  (class class class)co 6028    e. cmpo 6030   Basecbs 13145  Scalarcsca 13226   .scvsca 13227   .sfcscaf 14367
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 8166  ax-resscn 8167  ax-1re 8169  ax-addrcl 8172
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-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-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-1st 6312  df-2nd 6313  df-inn 9186  df-2 9244  df-3 9245  df-4 9246  df-5 9247  df-6 9248  df-ndx 13148  df-slot 13149  df-base 13151  df-sca 13239  df-vsca 13240  df-scaf 14369
This theorem is referenced by:  lmodfopne  14405
  Copyright terms: Public domain W3C validator