Users' Mathboxes Mathbox for Norm Megill < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  lflvsdi2a Structured version   Visualization version   GIF version

Theorem lflvsdi2a 40137
Description: Reverse distributive law for (right vector space) scalar product of functionals. (Contributed by NM, 21-Oct-2014.)
Hypotheses
Ref Expression
lfldi.v 𝑉 = (Base‘𝑊)
lfldi.r 𝑅 = (Scalar‘𝑊)
lfldi.k 𝐾 = (Base‘𝑅)
lfldi.p + = (+g‘𝑅)
lfldi.t · = (.r‘𝑅)
lfldi.f 𝐹 = (LFnl‘𝑊)
lfldi.w (𝜑 → 𝑊 ∈ LMod)
lfldi.x (𝜑 → 𝑋 ∈ 𝐾)
lfldi2.y (𝜑 → 𝑌 ∈ 𝐾)
lfldi2.g (𝜑 → 𝐺 ∈ 𝐹)
Assertion
Ref Expression
lflvsdi2a (𝜑 → (𝐺 ∘f · (𝑉 × {(𝑋 + 𝑌)})) = ((𝐺 ∘f · (𝑉 × {𝑋})) ∘f + (𝐺 ∘f · (𝑉 × {𝑌}))))

Proof of Theorem lflvsdi2a
StepHypRef Expression
1 lfldi.v . . . . . 6 𝑉 = (Base‘𝑊)
21fvexi 6899 . . . . 5 𝑉 ∈ V
32a1i 11 . . . 4 (𝜑 → 𝑉 ∈ V)
4 lfldi.x . . . 4 (𝜑 → 𝑋 ∈ 𝐾)
5 lfldi2.y . . . 4 (𝜑 → 𝑌 ∈ 𝐾)
63, 4, 5ofc12 7723 . . 3 (𝜑 → ((𝑉 × {𝑋}) ∘f + (𝑉 × {𝑌})) = (𝑉 × {(𝑋 + 𝑌)}))
76oveq2d 7436 . 2 (𝜑 → (𝐺 ∘f · ((𝑉 × {𝑋}) ∘f + (𝑉 × {𝑌}))) = (𝐺 ∘f · (𝑉 × {(𝑋 + 𝑌)})))
8 lfldi.r . . 3 𝑅 = (Scalar‘𝑊)
9 lfldi.k . . 3 𝐾 = (Base‘𝑅)
10 lfldi.p . . 3 + = (+g‘𝑅)
11 lfldi.t . . 3 · = (.r‘𝑅)
12 lfldi.f . . 3 𝐹 = (LFnl‘𝑊)
13 lfldi.w . . 3 (𝜑 → 𝑊 ∈ LMod)
14 lfldi2.g . . 3 (𝜑 → 𝐺 ∈ 𝐹)
151, 8, 9, 10, 11, 12, 13, 4, 5, 14lflvsdi2 40136 . 2 (𝜑 → (𝐺 ∘f · ((𝑉 × {𝑋}) ∘f + (𝑉 × {𝑌}))) = ((𝐺 ∘f · (𝑉 × {𝑋})) ∘f + (𝐺 ∘f · (𝑉 × {𝑌}))))
167, 15eqtr3d 2798 1 (𝜑 → (𝐺 ∘f · (𝑉 × {(𝑋 + 𝑌)})) = ((𝐺 ∘f · (𝑉 × {𝑋})) ∘f + (𝐺 ∘f · (𝑉 × {𝑌}))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145  Vcvv 3451  {csn 4584   × cxp 5649  ‘cfv 6538  (class class class)co 7420   ∘f cof 7691  Basecbs 17387  +gcplusg 17428  .rcmulr 17429  Scalarcsca 17431  LModclmod 21135  LFnlclfn 40114
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-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7751
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-reu 3367  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 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-of 7693  df-map 8849  df-ring 20461  df-lmod 21137  df-lfl 40115
This theorem is used by:  ldualvsdi2  40201
  Copyright terms: Public domain W3C validator