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

Theorem scaffval 21148
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 6883 . . . . . . . 8 (𝑤 = 𝑊 → (Scalar‘𝑤) = (Scalar‘𝑊))
3 scaffval.f . . . . . . . 8 𝐹 = (Scalar‘𝑊)
42, 3eqtr4di 2814 . . . . . . 7 (𝑤 = 𝑊 → (Scalar‘𝑤) = 𝐹)
54fveq2d 6887 . . . . . 6 (𝑤 = 𝑊 → (Base‘(Scalar‘𝑤)) = (Base‘𝐹))
6 scaffval.k . . . . . 6 𝐾 = (Base‘𝐹)
75, 6eqtr4di 2814 . . . . 5 (𝑤 = 𝑊 → (Base‘(Scalar‘𝑤)) = 𝐾)
8 fveq2 6883 . . . . . 6 (𝑤 = 𝑊 → (Base‘𝑤) = (Base‘𝑊))
9 scaffval.b . . . . . 6 𝐵 = (Base‘𝑊)
108, 9eqtr4di 2814 . . . . 5 (𝑤 = 𝑊 → (Base‘𝑤) = 𝐵)
11 fveq2 6883 . . . . . . 7 (𝑤 = 𝑊 → ( ·𝑠 ‘𝑤) = ( ·𝑠 ‘𝑊))
12 scaffval.s . . . . . . 7 · = ( ·𝑠 ‘𝑊)
1311, 12eqtr4di 2814 . . . . . 6 (𝑤 = 𝑊 → ( ·𝑠 ‘𝑤) = · )
1413oveqd 7435 . . . . 5 (𝑤 = 𝑊 → (𝑥( ·𝑠 ‘𝑤)𝑦) = (𝑥 · 𝑦))
157, 10, 14mpoeq123dv 7493 . . . 4 (𝑤 = 𝑊 → (𝑥 ∈ (Base‘(Scalar‘𝑤)), 𝑦 ∈ (Base‘𝑤) ↦ (𝑥( ·𝑠 ‘𝑤)𝑦)) = (𝑥 ∈ 𝐾, 𝑦 ∈ 𝐵 ↦ (𝑥 · 𝑦)))
16 df-scaf 21131 . . . 4 ·sf = (𝑤 ∈ V ↦ (𝑥 ∈ (Base‘(Scalar‘𝑤)), 𝑦 ∈ (Base‘𝑤) ↦ (𝑥( ·𝑠 ‘𝑤)𝑦)))
176fvexi 6897 . . . . 5 𝐾 ∈ V
189fvexi 6897 . . . . 5 𝐵 ∈ V
1912fvexi 6897 . . . . . . 7 · ∈ V
2019rnex 7920 . . . . . 6 ran · ∈ V
21 p0ex 5346 . . . . . 6 {∅} ∈ V
2220, 21unex 7759 . . . . 5 (ran · ∪ {∅}) ∈ V
23 df-ov 7421 . . . . . . 7 (𝑥 · 𝑦) = ( · ‘⟨𝑥, 𝑦⟩)
24 fvrn0 6911 . . . . . . 7 ( · ‘⟨𝑥, 𝑦⟩) ∈ (ran · ∪ {∅})
2523, 24eqeltri 2857 . . . . . 6 (𝑥 · 𝑦) ∈ (ran · ∪ {∅})
2625rgen2w 3082 . . . . 5 ∀𝑥 ∈ 𝐾 ∀𝑦 ∈ 𝐵 (𝑥 · 𝑦) ∈ (ran · ∪ {∅})
2717, 18, 22, 26mpoexw 8089 . . . 4 (𝑥 ∈ 𝐾, 𝑦 ∈ 𝐵 ↦ (𝑥 · 𝑦)) ∈ V
2815, 16, 27fvmpt 6991 . . 3 (𝑊 ∈ V → ( ·sf ‘𝑊) = (𝑥 ∈ 𝐾, 𝑦 ∈ 𝐵 ↦ (𝑥 · 𝑦)))
29 fvprc 6875 . . . 4 (¬ 𝑊 ∈ V → ( ·sf ‘𝑊) = ∅)
30 fvprc 6875 . . . . . . 7 (¬ 𝑊 ∈ V → (Base‘𝑊) = ∅)
319, 30eqtrid 2808 . . . . . 6 (¬ 𝑊 ∈ V → 𝐵 = ∅)
3231olcd 888 . . . . 5 (¬ 𝑊 ∈ V → (𝐾 = ∅ ∨ 𝐵 = ∅))
33 0mpo0 7501 . . . . 5 ((𝐾 = ∅ ∨ 𝐵 = ∅) → (𝑥 ∈ 𝐾, 𝑦 ∈ 𝐵 ↦ (𝑥 · 𝑦)) = ∅)
3432, 33syl 18 . . . 4 (¬ 𝑊 ∈ V → (𝑥 ∈ 𝐾, 𝑦 ∈ 𝐵 ↦ (𝑥 · 𝑦)) = ∅)
3529, 34eqtr4d 2799 . . 3 (¬ 𝑊 ∈ V → ( ·sf ‘𝑊) = (𝑥 ∈ 𝐾, 𝑦 ∈ 𝐵 ↦ (𝑥 · 𝑦)))
3628, 35pm2.61i 184 . 2 ( ·sf ‘𝑊) = (𝑥 ∈ 𝐾, 𝑦 ∈ 𝐵 ↦ (𝑥 · 𝑦))
371, 36eqtri 2784 1 ∙ = (𝑥 ∈ 𝐾, 𝑦 ∈ 𝐵 ↦ (𝑥 · 𝑦))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   ∨ wo 861   = wceq 1570   ∈ wcel 2145  Vcvv 3451   ∪ cun 3897  ∅c0 4279  {csn 4584  ⟨cop 4590  ran crn 5652  ‘cfv 6537  (class class class)co 7418   ∈ cmpo 7420  Basecbs 17380  Scalarcsca 17424   ·𝑠 cvsca 17425   ·sf cscaf 21129
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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7749
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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-fv 6545  df-ov 7421  df-oprab 7422  df-mpo 7423  df-1st 7999  df-2nd 8000  df-scaf 21131
This theorem is used by:  scafval  21149  scafeq  21150  scaffn  21151  lmodscaf  21152  rlmscaf  21475
  Copyright terms: Public domain W3C validator