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 40280
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 6910 . . . . 5 𝑉 ∈ V
32a1i 11 . . . 4 (𝜑 → 𝑉 ∈ V)
4 lfldi.x . . . 4 (𝜑 → 𝑋 ∈ 𝐾)
5 lfldi2.y . . . 4 (𝜑 → 𝑌 ∈ 𝐾)
63, 4, 5ofc12 7733 . . 3 (𝜑 → ((𝑉 × {𝑋}) ∘f + (𝑉 × {𝑌})) = (𝑉 × {(𝑋 + 𝑌)}))
76oveq2d 7446 . 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 40279 . 2 (𝜑 → (𝐺 ∘f · ((𝑉 × {𝑋}) ∘f + (𝑉 × {𝑌}))) = ((𝐺 ∘f · (𝑉 × {𝑋})) ∘f + (𝐺 ∘f · (𝑉 × {𝑌}))))
167, 15eqtr3d 2800 1 (𝜑 → (𝐺 ∘f · (𝑉 × {(𝑋 + 𝑌)})) = ((𝐺 ∘f · (𝑉 × {𝑋})) ∘f + (𝐺 ∘f · (𝑉 × {𝑌}))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1569   ∈ wcel 2146  Vcvv 3454  {csn 4588   × cxp 5653  ‘cfv 6547  (class class class)co 7430   ∘f cof 7701  Basecbs 17402  +gcplusg 17443  .rcmulr 17444  Scalarcsca 17446  LModclmod 21150  LFnlclfn 40257
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7761
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2101  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-reu 3370  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 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6501  df-fun 6549  df-fn 6550  df-f 6551  df-f1 6552  df-fo 6553  df-f1o 6554  df-fv 6555  df-ov 7433  df-oprab 7434  df-mpo 7435  df-of 7703  df-map 8863  df-ring 20476  df-lmod 21152  df-lfl 40258
This theorem is used by:  ldualvsdi2  40344
  Copyright terms: Public domain W3C validator