Theorem scaffn 21041

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
scaffn	⊢ ∙ Fn (𝐾 × 𝐵)

Proof of Theorem scaffn

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

Step	Hyp	Ref	Expression
1		scaffval.b	. . 3 ⊢ 𝐵 = (Base‘𝑊)
2		scaffval.f	. . 3 ⊢ 𝐹 = (Scalar‘𝑊)
3		scaffval.k	. . 3 ⊢ 𝐾 = (Base‘𝐹)
4		scaffval.a	. . 3 ⊢ ∙ = ( ·sf ‘𝑊)
5		eqid 2766	. . 3 ⊢ ( ·𝑠 ‘𝑊) = ( ·𝑠 ‘𝑊)
6	1, 2, 3, 4, 5	scaffval 21038	. 2 ⊢ ∙ = (𝑥 ∈ 𝐾, 𝑦 ∈ 𝐵 ↦ (𝑥( ·𝑠 ‘𝑊)𝑦))
7		ovex 7456	. 2 ⊢ (𝑥( ·𝑠 ‘𝑊)𝑦) ∈ V
8	6, 7	fnmpoi 8076	1 ⊢ ∙ Fn (𝐾 × 𝐵)

This proof depends on syntax axioms:   = wceq 1570   × cxp 5664   Fn wfn 6538  ‘cfv 6543  (class class class)co 7423  Basecbs 17294  Scalarcsca 17338   ·_𝑠 cvsca 17339   ·_sf cscaf 21019

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-sep 5262  ax-nul 5274  ax-pow 5341  ax-pr 5409  ax-un 7745

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-sbc 3748  df-csb 3857  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-iun 4963  df-br 5115  df-opab 5179  df-mpt 5198  df-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-iota 6499  df-fun 6545  df-fn 6546  df-f 6547  df-fv 6551  df-ov 7426  df-oprab 7427  df-mpo 7428  df-1st 7995  df-2nd 7996  df-scaf 21021

This theorem is used by: (None)