Theorem scaffng 13808

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 2763	. . . . . 6 |- x e. _V
2		vscaslid 12783	. . . . . . 7 |- ( .s = Slot ( .s ` ndx ) /\ ( .s ` ndx ) e. NN )
3	2	slotex 12648	. . . . . 6 |- ( W e. V -> ( .s ` W ) e. _V )
4		vex 2763	. . . . . . 7 |- y e. _V
5	4	a1i 9	. . . . . 6 |- ( W e. V -> y e. _V )
6		ovexg 5953	. . . . . 6 |- ( ( x e. _V /\ ( .s ` W ) e. _V /\ y e. _V ) -> ( x ( .s ` W ) y ) e. _V )
7	1, 3, 5, 6	mp3an2i 1353	. . . . 5 |- ( W e. V -> ( x ( .s ` W ) y ) e. _V )
8	7	ralrimivw 2568	. . . 4 |- ( W e. V -> A. y e. B ( x ( .s ` W ) y ) e. _V )
9	8	ralrimivw 2568	. . 3 |- ( W e. V -> A. x e. K A. y e. B ( x ( .s ` W ) y ) e. _V )
10		eqid 2193	. . . 4 |- ( x e. K , y e. B |-> ( x ( .s ` W ) y ) ) = ( x e. K , y e. B |-> ( x ( .s ` W ) y ) )
11	10	fnmpo 6257	. . 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 2193	. . . 4 |- ( .s ` W ) = ( .s ` W )
18	13, 14, 15, 16, 17	scaffvalg 13805	. . 3 |- ( W e. V -> .xb = ( x e. K , y e. B |-> ( x ( .s ` W ) y ) ) )
19	18	fneq1d 5345	. 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 ) )

Syntax hints:   -> wi 4   = wceq 1364   e. wcel 2164   A.wral 2472   _Vcvv 2760   X. cxp 4658   Fn wfn 5250   ` cfv 5255  (class class class)co 5919   e. cmpo 5921   Basecbs 12621  Scalarcsca 12701   .scvsca 12702   .sfcscaf 13787

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 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-coll 4145  ax-sep 4148  ax-pow 4204  ax-pr 4239  ax-un 4465  ax-cnex 7965  ax-resscn 7966  ax-1re 7968  ax-addrcl 7971

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ral 2477  df-rex 2478  df-reu 2479  df-rab 2481  df-v 2762  df-sbc 2987  df-csb 3082  df-un 3158  df-in 3160  df-ss 3167  df-pw 3604  df-sn 3625  df-pr 3626  df-op 3628  df-uni 3837  df-int 3872  df-iun 3915  df-br 4031  df-opab 4092  df-mpt 4093  df-id 4325  df-xp 4666  df-rel 4667  df-cnv 4668  df-co 4669  df-dm 4670  df-rn 4671  df-res 4672  df-ima 4673  df-iota 5216  df-fun 5257  df-fn 5258  df-f 5259  df-f1 5260  df-fo 5261  df-f1o 5262  df-fv 5263  df-ov 5922  df-oprab 5923  df-mpo 5924  df-1st 6195  df-2nd 6196  df-inn 8985  df-2 9043  df-3 9044  df-4 9045  df-5 9046  df-6 9047  df-ndx 12624  df-slot 12625  df-base 12627  df-sca 12714  df-vsca 12715  df-scaf 13789

This theorem is referenced by:  lmodfopnelem1  13823