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

Theorem scaffng 14115
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 2776 . . . . . 6  |-  x  e. 
_V
2 vscaslid 13039 . . . . . . 7  |-  ( .s  = Slot  ( .s `  ndx )  /\  ( .s `  ndx )  e.  NN )
32slotex 12903 . . . . . 6  |-  ( W  e.  V  ->  ( .s `  W )  e. 
_V )
4 vex 2776 . . . . . . 7  |-  y  e. 
_V
54a1i 9 . . . . . 6  |-  ( W  e.  V  ->  y  e.  _V )
6 ovexg 5985 . . . . . 6  |-  ( ( x  e.  _V  /\  ( .s `  W )  e.  _V  /\  y  e.  _V )  ->  (
x ( .s `  W ) y )  e.  _V )
71, 3, 5, 6mp3an2i 1355 . . . . 5  |-  ( W  e.  V  ->  (
x ( .s `  W ) y )  e.  _V )
87ralrimivw 2581 . . . 4  |-  ( W  e.  V  ->  A. y  e.  B  ( x
( .s `  W
) y )  e. 
_V )
98ralrimivw 2581 . . 3  |-  ( W  e.  V  ->  A. x  e.  K  A. y  e.  B  ( x
( .s `  W
) y )  e. 
_V )
10 eqid 2206 . . . 4  |-  ( x  e.  K ,  y  e.  B  |->  ( x ( .s `  W
) y ) )  =  ( x  e.  K ,  y  e.  B  |->  ( x ( .s `  W ) y ) )
1110fnmpo 6295 . . 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 2206 . . . 4  |-  ( .s
`  W )  =  ( .s `  W
)
1813, 14, 15, 16, 17scaffvalg 14112 . . 3  |-  ( W  e.  V  ->  .xb  =  ( x  e.  K ,  y  e.  B  |->  ( x ( .s
`  W ) y ) ) )
1918fneq1d 5369 . 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 1373    e. wcel 2177   A.wral 2485   _Vcvv 2773    X. cxp 4677    Fn wfn 5271   ` cfv 5276  (class class class)co 5951    e. cmpo 5953   Basecbs 12876  Scalarcsca 12956   .scvsca 12957   .sfcscaf 14094
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 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2179  ax-14 2180  ax-ext 2188  ax-coll 4163  ax-sep 4166  ax-pow 4222  ax-pr 4257  ax-un 4484  ax-cnex 8023  ax-resscn 8024  ax-1re 8026  ax-addrcl 8029
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2193  df-cleq 2199  df-clel 2202  df-nfc 2338  df-ral 2490  df-rex 2491  df-reu 2492  df-rab 2494  df-v 2775  df-sbc 3000  df-csb 3095  df-un 3171  df-in 3173  df-ss 3180  df-pw 3619  df-sn 3640  df-pr 3641  df-op 3643  df-uni 3853  df-int 3888  df-iun 3931  df-br 4048  df-opab 4110  df-mpt 4111  df-id 4344  df-xp 4685  df-rel 4686  df-cnv 4687  df-co 4688  df-dm 4689  df-rn 4690  df-res 4691  df-ima 4692  df-iota 5237  df-fun 5278  df-fn 5279  df-f 5280  df-f1 5281  df-fo 5282  df-f1o 5283  df-fv 5284  df-ov 5954  df-oprab 5955  df-mpo 5956  df-1st 6233  df-2nd 6234  df-inn 9044  df-2 9102  df-3 9103  df-4 9104  df-5 9105  df-6 9106  df-ndx 12879  df-slot 12880  df-base 12882  df-sca 12969  df-vsca 12970  df-scaf 14096
This theorem is referenced by:  lmodfopnelem1  14130
  Copyright terms: Public domain W3C validator