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

Theorem scafvalg 14455
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 14454 . . 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 6059 . . 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 13376 . . . . . 6  |-  ( .s  = Slot  ( .s `  ndx )  /\  ( .s `  ndx )  e.  NN )
1312slotex 13239 . . . . 5  |-  ( W  e.  V  ->  ( .s `  W )  e. 
_V )
145, 13eqeltrid 2319 . . . 4  |-  ( W  e.  V  ->  .x.  e.  _V )
15143ad2ant1 1045 . . 3  |-  ( ( W  e.  V  /\  X  e.  K  /\  Y  e.  B )  ->  .x.  e.  _V )
16 ovexg 6084 . . 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 6181 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 2203   _Vcvv 2813   ` cfv 5352  (class class class)co 6050    e. cmpo 6052   Basecbs 13212  Scalarcsca 13293   .scvsca 13294   .sfcscaf 14436
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 2205  ax-14 2206  ax-ext 2214  ax-coll 4225  ax-sep 4228  ax-pow 4287  ax-pr 4322  ax-un 4554  ax-setind 4659  ax-cnex 8218  ax-resscn 8219  ax-1re 8221  ax-addrcl 8224
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-ral 2525  df-rex 2526  df-reu 2527  df-rab 2529  df-v 2815  df-sbc 3043  df-csb 3139  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-int 3950  df-iun 3993  df-br 4110  df-opab 4172  df-mpt 4173  df-id 4414  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-ima 4762  df-iota 5312  df-fun 5354  df-fn 5355  df-f 5356  df-f1 5357  df-fo 5358  df-f1o 5359  df-fv 5360  df-ov 6053  df-oprab 6054  df-mpo 6055  df-1st 6334  df-2nd 6335  df-inn 9238  df-2 9296  df-3 9297  df-4 9298  df-5 9299  df-6 9300  df-ndx 13215  df-slot 13216  df-base 13218  df-sca 13306  df-vsca 13307  df-scaf 14438
This theorem is referenced by:  lmodfopne  14474
  Copyright terms: Public domain W3C validator