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

Theorem mptscmfsuppd 21236
Description: A function mapping to a scalar product in which one factor is finitely supported is finitely supported. Formerly part of proof for ply1coe 22649. (Contributed by Stefan O'Rear, 21-Mar-2015.) (Revised by AV, 8-Aug-2019.) (Proof shortened by AV, 18-Oct-2019.)
Hypotheses
Ref Expression
mptscmfsuppd.b 𝐵 = (Base‘𝑃)
mptscmfsuppd.s 𝑆 = (Scalar‘𝑃)
mptscmfsuppd.n · = ( ·𝑠 ‘𝑃)
mptscmfsuppd.p (𝜑 → 𝑃 ∈ LMod)
mptscmfsuppd.x (𝜑 → 𝑋 ∈ 𝑉)
mptscmfsuppd.z ((𝜑 ∧ 𝑘 ∈ 𝑋) → 𝑍 ∈ 𝐵)
mptscmfsuppd.a (𝜑 → 𝐴:𝑋⟶𝑌)
mptscmfsuppd.f (𝜑 → 𝐴 finSupp (0g‘𝑆))
Assertion
Ref Expression
mptscmfsuppd (𝜑 → (𝑘 ∈ 𝑋 ↦ ((𝐴‘𝑘) · 𝑍)) finSupp (0g‘𝑃))
Distinct variable groups:   𝐴,𝑘   𝐵,𝑘   𝑃,𝑘   𝑆,𝑘   𝑘,𝑋   · ,𝑘   𝜑,𝑘
Allowed substitution hints:   𝑉(𝑘)   𝑌(𝑘)   𝑍(𝑘)

Proof of Theorem mptscmfsuppd
StepHypRef Expression
1 mptscmfsuppd.x . 2 (𝜑 → 𝑋 ∈ 𝑉)
2 mptscmfsuppd.p . 2 (𝜑 → 𝑃 ∈ LMod)
3 mptscmfsuppd.s . . 3 𝑆 = (Scalar‘𝑃)
43a1i 11 . 2 (𝜑 → 𝑆 = (Scalar‘𝑃))
5 mptscmfsuppd.b . 2 𝐵 = (Base‘𝑃)
6 fvexd 6926 . 2 ((𝜑 ∧ 𝑘 ∈ 𝑋) → (𝐴‘𝑘) ∈ V)
7 mptscmfsuppd.z . 2 ((𝜑 ∧ 𝑘 ∈ 𝑋) → 𝑍 ∈ 𝐵)
8 eqid 2763 . 2 (0g‘𝑃) = (0g‘𝑃)
9 eqid 2763 . 2 (0g‘𝑆) = (0g‘𝑆)
10 mptscmfsuppd.n . 2 · = ( ·𝑠 ‘𝑃)
11 mptscmfsuppd.a . . . 4 (𝜑 → 𝐴:𝑋⟶𝑌)
1211feqmptd 6979 . . 3 (𝜑 → 𝐴 = (𝑘 ∈ 𝑋 ↦ (𝐴‘𝑘)))
13 mptscmfsuppd.f . . 3 (𝜑 → 𝐴 finSupp (0g‘𝑆))
1412, 13eqbrtrrd 5133 . 2 (𝜑 → (𝑘 ∈ 𝑋 ↦ (𝐴‘𝑘)) finSupp (0g‘𝑆))
151, 2, 4, 5, 6, 7, 8, 9, 10, 14mptscmfsupp0 21235 1 (𝜑 → (𝑘 ∈ 𝑋 ↦ ((𝐴‘𝑘) · 𝑍)) finSupp (0g‘𝑃))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  Vcvv 3454   class class class wbr 5106   ↦ cmpt 5190  ⟶wf 6557  ‘cfv 6561  (class class class)co 7446   finSupp cfsupp 9384  Basecbs 17419  Scalarcsca 17463   ·𝑠 cvsca 17464  0gc0g 17642  LModclmod 21168
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-rep 5236  ax-sep 5253  ax-nul 5264  ax-pr 5396  ax-un 7778
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  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-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  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 5172  df-mpt 5191  df-tr 5217  df-id 5551  df-eprel 5556  df-po 5564  df-so 5565  df-fr 5609  df-we 5611  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-ord 6386  df-on 6387  df-lim 6388  df-suc 6389  df-iota 6515  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-riota 7403  df-ov 7449  df-oprab 7450  df-mpo 7451  df-om 7905  df-supp 8208  df-1o 8507  df-en 9005  df-fin 9008  df-fsupp 9385  df-0g 17644  df-mgm 18848  df-sgrp 18940  df-mnd 18956  df-grp 19179  df-ring 20494  df-lmod 21170
This theorem is used by:  ply1coefsupp  22648
  Copyright terms: Public domain W3C validator