Theorem scaffng 14756

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.

Step	Hyp	Ref	Expression
1		vex 2824	. . . . . 6 |- x e. _V
2		vscaslid 13577	. . . . . . 7 |- ( .s = Slot ( .s ` ndx ) /\ ( .s ` ndx ) e. NN )
3	2	slotex 13438	. . . . . 6 |- ( W e. V -> ( .s ` W ) e. _V )
4		vex 2824	. . . . . . 7 |- y e. _V
5	4	a1i 9	. . . . . 6 |- ( W e. V -> y e. _V )
6		ovexg 6122	. . . . . 6 |- ( ( x e. _V /\ ( .s ` W ) e. _V /\ y e. _V ) -> ( x ( .s ` W ) y ) e. _V )
7	1, 3, 5, 6	mp3an2i 1383	. . . . 5 |- ( W e. V -> ( x ( .s ` W ) y ) e. _V )
8	7	ralrimivw 2624	. . . 4 |- ( W e. V -> A. y e. B ( x ( .s ` W ) y ) e. _V )
9	8	ralrimivw 2624	. . 3 |- ( W e. V -> A. x e. K A. y e. B ( x ( .s ` W ) y ) e. _V )
10		eqid 2238	. . . 4 |- ( x e. K , y e. B |-> ( x ( .s ` W ) y ) ) = ( x e. K , y e. B |-> ( x ( .s ` W ) y ) )
11	10	fnmpo 6442	. . 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 ) )
12	9, 11	syl 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 2238	. . . 4 |- ( .s ` W ) = ( .s ` W )
18	13, 14, 15, 16, 17	scaffvalg 14753	. . 3 |- ( W e. V -> .xb = ( x e. K , y e. B |-> ( x ( .s ` W ) y ) ) )
19	18	fneq1d 5474	. 2 |- ( W e. V -> ( .xb Fn ( K X. B ) <-> ( x e. K , y e. B |-> ( x ( .s ` W ) y ) ) Fn ( K X. B ) ) )
20	12, 19	mpbird 167	1 |- ( W e. V -> .xb Fn ( K X. B ) )

This proof depends on syntax axioms:   -> wi 4   = wceq 1402   e. wcel 2209   A.wral 2528   _Vcvv 2821   X. cxp 4774   Fn wfn 5375   ` cfv 5380  (class class class)co 6088   e. cmpo 6090   Basecbs 13411  Scalarcsca 13494   .scvsca 13495   .sfcscaf 14734

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4248  ax-sep 4251  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-cnex 8277  ax-resscn 8278  ax-1re 8280  ax-addrcl 8283

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-id 4440  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-ov 6091  df-oprab 6092  df-mpo 6093  df-1st 6378  df-2nd 6379  df-inn 9315  df-2 9373  df-3 9374  df-4 9375  df-5 9376  df-6 9377  df-ndx 13414  df-slot 13415  df-base 13417  df-sca 13507  df-vsca 13508  df-scaf 14736

This theorem is used by:  lmodfopnelem1  14771