Theorem scaffng 14648

Description: The scalar multiplication operation is a function. (Contributed by Mario Carneiro, 5-Oct-2015.)

Hypotheses

Ref	Expression
scaffval.b	⊢ 𝐵 = (Base‘𝑊)
scaffval.f	⊢ 𝐹 = (Scalar‘𝑊)
scaffval.k	⊢ 𝐾 = (Base‘𝐹)
scaffval.a	⊢ ∙ = ( ·sf ‘𝑊)

Assertion

Ref	Expression
scaffng	⊢ (𝑊 ∈ 𝑉 → ∙ Fn (𝐾 × 𝐵))

Proof of Theorem scaffng

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		vex 2824	. . . . . 6 ⊢ 𝑥 ∈ V
2		vscaslid 13519	. . . . . . 7 ⊢ ( ·𝑠 = Slot ( ·𝑠 ‘ndx) ∧ ( ·𝑠 ‘ndx) ∈ ℕ)
3	2	slotex 13381	. . . . . 6 ⊢ (𝑊 ∈ 𝑉 → ( ·𝑠 ‘𝑊) ∈ V)
4		vex 2824	. . . . . . 7 ⊢ 𝑦 ∈ V
5	4	a1i 9	. . . . . 6 ⊢ (𝑊 ∈ 𝑉 → 𝑦 ∈ V)
6		ovexg 6119	. . . . . 6 ⊢ ((𝑥 ∈ V ∧ ( ·𝑠 ‘𝑊) ∈ V ∧ 𝑦 ∈ V) → (𝑥( ·𝑠 ‘𝑊)𝑦) ∈ V)
7	1, 3, 5, 6	mp3an2i 1383	. . . . 5 ⊢ (𝑊 ∈ 𝑉 → (𝑥( ·𝑠 ‘𝑊)𝑦) ∈ V)
8	7	ralrimivw 2624	. . . 4 ⊢ (𝑊 ∈ 𝑉 → ∀𝑦 ∈ 𝐵 (𝑥( ·𝑠 ‘𝑊)𝑦) ∈ V)
9	8	ralrimivw 2624	. . 3 ⊢ (𝑊 ∈ 𝑉 → ∀𝑥 ∈ 𝐾 ∀𝑦 ∈ 𝐵 (𝑥( ·𝑠 ‘𝑊)𝑦) ∈ V)
10		eqid 2238	. . . 4 ⊢ (𝑥 ∈ 𝐾, 𝑦 ∈ 𝐵 ↦ (𝑥( ·𝑠 ‘𝑊)𝑦)) = (𝑥 ∈ 𝐾, 𝑦 ∈ 𝐵 ↦ (𝑥( ·𝑠 ‘𝑊)𝑦))
11	10	fnmpo 6438	. . 3 ⊢ (∀𝑥 ∈ 𝐾 ∀𝑦 ∈ 𝐵 (𝑥( ·𝑠 ‘𝑊)𝑦) ∈ V → (𝑥 ∈ 𝐾, 𝑦 ∈ 𝐵 ↦ (𝑥( ·𝑠 ‘𝑊)𝑦)) Fn (𝐾 × 𝐵))
12	9, 11	syl 14	. 2 ⊢ (𝑊 ∈ 𝑉 → (𝑥 ∈ 𝐾, 𝑦 ∈ 𝐵 ↦ (𝑥( ·𝑠 ‘𝑊)𝑦)) Fn (𝐾 × 𝐵))
13		scaffval.b	. . . 4 ⊢ 𝐵 = (Base‘𝑊)
14		scaffval.f	. . . 4 ⊢ 𝐹 = (Scalar‘𝑊)
15		scaffval.k	. . . 4 ⊢ 𝐾 = (Base‘𝐹)
16		scaffval.a	. . . 4 ⊢ ∙ = ( ·sf ‘𝑊)
17		eqid 2238	. . . 4 ⊢ ( ·𝑠 ‘𝑊) = ( ·𝑠 ‘𝑊)
18	13, 14, 15, 16, 17	scaffvalg 14645	. . 3 ⊢ (𝑊 ∈ 𝑉 → ∙ = (𝑥 ∈ 𝐾, 𝑦 ∈ 𝐵 ↦ (𝑥( ·𝑠 ‘𝑊)𝑦)))
19	18	fneq1d 5471	. 2 ⊢ (𝑊 ∈ 𝑉 → ( ∙ Fn (𝐾 × 𝐵) ↔ (𝑥 ∈ 𝐾, 𝑦 ∈ 𝐵 ↦ (𝑥( ·𝑠 ‘𝑊)𝑦)) Fn (𝐾 × 𝐵)))
20	12, 19	mpbird 167	1 ⊢ (𝑊 ∈ 𝑉 → ∙ Fn (𝐾 × 𝐵))

This proof depends on syntax axioms:   → wi 4   = wceq 1402   ∈ wcel 2209  ∀wral 2528  Vcvv 2821   × cxp 4772   Fn wfn 5372  ‘cfv 5377  (class class class)co 6085   ∈ cmpo 6087  Basecbs 13354  Scalarcsca 13436   ·_𝑠 cvsca 13437   ·_sf cscaf 14626

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 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-cnex 8270  ax-resscn 8271  ax-1re 8273  ax-addrcl 8276

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 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-inn 9306  df-2 9364  df-3 9365  df-4 9366  df-5 9367  df-6 9368  df-ndx 13357  df-slot 13358  df-base 13360  df-sca 13449  df-vsca 13450  df-scaf 14628

This theorem is used by:  lmodfopnelem1  14663