MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  scaffval Structured version   Visualization version   GIF version

Theorem scaffval 21206
Description: The scalar multiplication operation as a function. (Contributed by Mario Carneiro, 5-Oct-2015.) (Proof shortened by AV, 2-Mar-2024.)
Hypotheses
Ref Expression
scaffval.b 𝐵 = (Base‘𝑊)
scaffval.f 𝐹 = (Scalar‘𝑊)
scaffval.k 𝐾 = (Base‘𝐹)
scaffval.a ∙ = ( ·sf ‘𝑊)
scaffval.s · = ( ·𝑠 ‘𝑊)
Assertion
Ref Expression
scaffval ∙ = (𝑥 ∈ 𝐾, 𝑦 ∈ 𝐵 ↦ (𝑥 · 𝑦))
Distinct variable groups:   𝑥,𝑦,𝐵   𝑥,𝐾,𝑦   𝑥, · ,𝑦   𝑥,𝑊,𝑦
Allowed substitution hints:   ∙ (𝑥, 𝑦)   𝐹(𝑥, 𝑦)

Proof of Theorem scaffval
Dummy variable 𝑤 is distinct from all other variables.
StepHypRef Expression
1 scaffval.a . 2 ∙ = ( ·sf ‘𝑊)
2 fveq2 6916 . . . . . . . 8 (𝑤 = 𝑊 → (Scalar‘𝑤) = (Scalar‘𝑊))
3 scaffval.f . . . . . . . 8 𝐹 = (Scalar‘𝑊)
42, 3eqtr4di 2816 . . . . . . 7 (𝑤 = 𝑊 → (Scalar‘𝑤) = 𝐹)
54fveq2d 6920 . . . . . 6 (𝑤 = 𝑊 → (Base‘(Scalar‘𝑤)) = (Base‘𝐹))
6 scaffval.k . . . . . 6 𝐾 = (Base‘𝐹)
75, 6eqtr4di 2816 . . . . 5 (𝑤 = 𝑊 → (Base‘(Scalar‘𝑤)) = 𝐾)
8 fveq2 6916 . . . . . 6 (𝑤 = 𝑊 → (Base‘𝑤) = (Base‘𝑊))
9 scaffval.b . . . . . 6 𝐵 = (Base‘𝑊)
108, 9eqtr4di 2816 . . . . 5 (𝑤 = 𝑊 → (Base‘𝑤) = 𝐵)
11 fveq2 6916 . . . . . . 7 (𝑤 = 𝑊 → ( ·𝑠 ‘𝑤) = ( ·𝑠 ‘𝑊))
12 scaffval.s . . . . . . 7 · = ( ·𝑠 ‘𝑊)
1311, 12eqtr4di 2816 . . . . . 6 (𝑤 = 𝑊 → ( ·𝑠 ‘𝑤) = · )
1413oveqd 7468 . . . . 5 (𝑤 = 𝑊 → (𝑥( ·𝑠 ‘𝑤)𝑦) = (𝑥 · 𝑦))
157, 10, 14mpoeq123dv 7526 . . . 4 (𝑤 = 𝑊 → (𝑥 ∈ (Base‘(Scalar‘𝑤)), 𝑦 ∈ (Base‘𝑤) ↦ (𝑥( ·𝑠 ‘𝑤)𝑦)) = (𝑥 ∈ 𝐾, 𝑦 ∈ 𝐵 ↦ (𝑥 · 𝑦)))
16 df-scaf 21189 . . . 4 ·sf = (𝑤 ∈ V ↦ (𝑥 ∈ (Base‘(Scalar‘𝑤)), 𝑦 ∈ (Base‘𝑤) ↦ (𝑥( ·𝑠 ‘𝑤)𝑦)))
176fvexi 6930 . . . . 5 𝐾 ∈ V
189fvexi 6930 . . . . 5 𝐵 ∈ V
1912fvexi 6930 . . . . . . 7 · ∈ V
2019rnex 7956 . . . . . 6 ran · ∈ V
21 p0ex 5353 . . . . . 6 {∅} ∈ V
2220, 21unex 7793 . . . . 5 (ran · ∪ {∅}) ∈ V
23 df-ov 7454 . . . . . . 7 (𝑥 · 𝑦) = ( · ‘⟨𝑥, 𝑦⟩)
24 fvrn0 6944 . . . . . . 7 ( · ‘⟨𝑥, 𝑦⟩) ∈ (ran · ∪ {∅})
2523, 24eqeltri 2860 . . . . . 6 (𝑥 · 𝑦) ∈ (ran · ∪ {∅})
2625rgen2w 3085 . . . . 5 ∀𝑥 ∈ 𝐾 ∀𝑦 ∈ 𝐵 (𝑥 · 𝑦) ∈ (ran · ∪ {∅})
2717, 18, 22, 26mpoexw 8126 . . . 4 (𝑥 ∈ 𝐾, 𝑦 ∈ 𝐵 ↦ (𝑥 · 𝑦)) ∈ V
2815, 16, 27fvmpt 7024 . . 3 (𝑊 ∈ V → ( ·sf ‘𝑊) = (𝑥 ∈ 𝐾, 𝑦 ∈ 𝐵 ↦ (𝑥 · 𝑦)))
29 fvprc 6908 . . . 4 (¬ 𝑊 ∈ V → ( ·sf ‘𝑊) = ∅)
30 fvprc 6908 . . . . . . 7 (¬ 𝑊 ∈ V → (Base‘𝑊) = ∅)
319, 30eqtrid 2810 . . . . . 6 (¬ 𝑊 ∈ V → 𝐵 = ∅)
3231olcd 888 . . . . 5 (¬ 𝑊 ∈ V → (𝐾 = ∅ ∨ 𝐵 = ∅))
33 0mpo0 7534 . . . . 5 ((𝐾 = ∅ ∨ 𝐵 = ∅) → (𝑥 ∈ 𝐾, 𝑦 ∈ 𝐵 ↦ (𝑥 · 𝑦)) = ∅)
3432, 33syl 18 . . . 4 (¬ 𝑊 ∈ V → (𝑥 ∈ 𝐾, 𝑦 ∈ 𝐵 ↦ (𝑥 · 𝑦)) = ∅)
3529, 34eqtr4d 2801 . . 3 (¬ 𝑊 ∈ V → ( ·sf ‘𝑊) = (𝑥 ∈ 𝐾, 𝑦 ∈ 𝐵 ↦ (𝑥 · 𝑦)))
3628, 35pm2.61i 184 . 2 ( ·sf ‘𝑊) = (𝑥 ∈ 𝐾, 𝑦 ∈ 𝐵 ↦ (𝑥 · 𝑦))
371, 36eqtri 2786 1 ∙ = (𝑥 ∈ 𝐾, 𝑦 ∈ 𝐵 ↦ (𝑥 · 𝑦))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   ∨ wo 861   = wceq 1570   ∈ wcel 2147  Vcvv 3454   ∪ cun 4152  ∅c0 4281  {csn 4588  ⟨cop 4840  ran crn 5659  ‘cfv 6566  (class class class)co 7451   ∈ cmpo 7453  Basecbs 17431  Scalarcsca 17475   ·𝑠 cvsca 17476   ·sf cscaf 21187
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-1st 8035  df-2nd 8036  df-scaf 21189
This theorem is used by:  scafval  21207  scafeq  21208  scaffn  21209  lmodscaf  21210  rlmscaf  21533
  Copyright terms: Public domain W3C validator