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

Theorem scaffng 14326
Description: The scalar multiplication operation is 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
)
Assertion
Ref Expression
scaffng  |-  ( W  e.  V  ->  .xb  Fn  ( K  X.  B
) )

Proof of Theorem scaffng
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 vex 2805 . . . . . 6  |-  x  e. 
_V
2 vscaslid 13248 . . . . . . 7  |-  ( .s  = Slot  ( .s `  ndx )  /\  ( .s `  ndx )  e.  NN )
32slotex 13111 . . . . . 6  |-  ( W  e.  V  ->  ( .s `  W )  e. 
_V )
4 vex 2805 . . . . . . 7  |-  y  e. 
_V
54a1i 9 . . . . . 6  |-  ( W  e.  V  ->  y  e.  _V )
6 ovexg 6052 . . . . . 6  |-  ( ( x  e.  _V  /\  ( .s `  W )  e.  _V  /\  y  e.  _V )  ->  (
x ( .s `  W ) y )  e.  _V )
71, 3, 5, 6mp3an2i 1378 . . . . 5  |-  ( W  e.  V  ->  (
x ( .s `  W ) y )  e.  _V )
87ralrimivw 2606 . . . 4  |-  ( W  e.  V  ->  A. y  e.  B  ( x
( .s `  W
) y )  e. 
_V )
98ralrimivw 2606 . . 3  |-  ( W  e.  V  ->  A. x  e.  K  A. y  e.  B  ( x
( .s `  W
) y )  e. 
_V )
10 eqid 2231 . . . 4  |-  ( x  e.  K ,  y  e.  B  |->  ( x ( .s `  W
) y ) )  =  ( x  e.  K ,  y  e.  B  |->  ( x ( .s `  W ) y ) )
1110fnmpo 6367 . . 3  |-  ( A. x  e.  K  A. y  e.  B  (
x ( .s `  W ) y )  e.  _V  ->  (
x  e.  K , 
y  e.  B  |->  ( x ( .s `  W ) y ) )  Fn  ( K  X.  B ) )
129, 11syl 14 . 2  |-  ( W  e.  V  ->  (
x  e.  K , 
y  e.  B  |->  ( x ( .s `  W ) y ) )  Fn  ( K  X.  B ) )
13 scaffval.b . . . 4  |-  B  =  ( Base `  W
)
14 scaffval.f . . . 4  |-  F  =  (Scalar `  W )
15 scaffval.k . . . 4  |-  K  =  ( Base `  F
)
16 scaffval.a . . . 4  |-  .xb  =  ( .sf `  W
)
17 eqid 2231 . . . 4  |-  ( .s
`  W )  =  ( .s `  W
)
1813, 14, 15, 16, 17scaffvalg 14323 . . 3  |-  ( W  e.  V  ->  .xb  =  ( x  e.  K ,  y  e.  B  |->  ( x ( .s
`  W ) y ) ) )
1918fneq1d 5420 . 2  |-  ( W  e.  V  ->  (  .xb  Fn  ( K  X.  B )  <->  ( x  e.  K ,  y  e.  B  |->  ( x ( .s `  W ) y ) )  Fn  ( K  X.  B
) ) )
2012, 19mpbird 167 1  |-  ( W  e.  V  ->  .xb  Fn  ( K  X.  B
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1397    e. wcel 2202   A.wral 2510   _Vcvv 2802    X. cxp 4723    Fn wfn 5321   ` cfv 5326  (class class class)co 6018    e. cmpo 6020   Basecbs 13084  Scalarcsca 13165   .scvsca 13166   .sfcscaf 14305
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-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-cnex 8123  ax-resscn 8124  ax-1re 8126  ax-addrcl 8129
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-ov 6021  df-oprab 6022  df-mpo 6023  df-1st 6303  df-2nd 6304  df-inn 9144  df-2 9202  df-3 9203  df-4 9204  df-5 9205  df-6 9206  df-ndx 13087  df-slot 13088  df-base 13090  df-sca 13178  df-vsca 13179  df-scaf 14307
This theorem is referenced by:  lmodfopnelem1  14341
  Copyright terms: Public domain W3C validator