Theorem mndpfsupp 18961

Description: A mapping of a scalar multiplication with a function of scalars is finitely supported if the function of scalars is finitely supported. (Contributed by AV, 9-Jun-2019.)

Hypothesis

Ref	Expression
mndpsuppfi.r	⊢ 𝑅 = (Base‘𝑀)

Assertion

Ref	Expression
mndpfsupp	⊢ (((𝑀 ∈ Mnd ∧ 𝑉 ∈ 𝑋) ∧ (𝐴 ∈ (𝑅 ↑m 𝑉) ∧ 𝐵 ∈ (𝑅 ↑m 𝑉)) ∧ (𝐴 finSupp (0g‘𝑀) ∧ 𝐵 finSupp (0g‘𝑀))) → (𝐴 ∘f (+g‘𝑀)𝐵) finSupp (0g‘𝑀))

Proof of Theorem mndpfsupp

Step	Hyp	Ref	Expression
1		elmapfn 8887	. . . . 5 ⊢ (𝐴 ∈ (𝑅 ↑m 𝑉) → 𝐴 Fn 𝑉)
2	1	adantr 486	. . . 4 ⊢ ((𝐴 ∈ (𝑅 ↑m 𝑉) ∧ 𝐵 ∈ (𝑅 ↑m 𝑉)) → 𝐴 Fn 𝑉)
3	2	3ad2ant2 1152	. . 3 ⊢ (((𝑀 ∈ Mnd ∧ 𝑉 ∈ 𝑋) ∧ (𝐴 ∈ (𝑅 ↑m 𝑉) ∧ 𝐵 ∈ (𝑅 ↑m 𝑉)) ∧ (𝐴 finSupp (0g‘𝑀) ∧ 𝐵 finSupp (0g‘𝑀))) → 𝐴 Fn 𝑉)
4		elmapfn 8887	. . . . 5 ⊢ (𝐵 ∈ (𝑅 ↑m 𝑉) → 𝐵 Fn 𝑉)
5	4	adantl 487	. . . 4 ⊢ ((𝐴 ∈ (𝑅 ↑m 𝑉) ∧ 𝐵 ∈ (𝑅 ↑m 𝑉)) → 𝐵 Fn 𝑉)
6	5	3ad2ant2 1152	. . 3 ⊢ (((𝑀 ∈ Mnd ∧ 𝑉 ∈ 𝑋) ∧ (𝐴 ∈ (𝑅 ↑m 𝑉) ∧ 𝐵 ∈ (𝑅 ↑m 𝑉)) ∧ (𝐴 finSupp (0g‘𝑀) ∧ 𝐵 finSupp (0g‘𝑀))) → 𝐵 Fn 𝑉)
7		simp1r 1217	. . 3 ⊢ (((𝑀 ∈ Mnd ∧ 𝑉 ∈ 𝑋) ∧ (𝐴 ∈ (𝑅 ↑m 𝑉) ∧ 𝐵 ∈ (𝑅 ↑m 𝑉)) ∧ (𝐴 finSupp (0g‘𝑀) ∧ 𝐵 finSupp (0g‘𝑀))) → 𝑉 ∈ 𝑋)
8	3, 6, 7, 7	offun 7707	. 2 ⊢ (((𝑀 ∈ Mnd ∧ 𝑉 ∈ 𝑋) ∧ (𝐴 ∈ (𝑅 ↑m 𝑉) ∧ 𝐵 ∈ (𝑅 ↑m 𝑉)) ∧ (𝐴 finSupp (0g‘𝑀) ∧ 𝐵 finSupp (0g‘𝑀))) → Fun (𝐴 ∘f (+g‘𝑀)𝐵))
9		id 23	. . . . 5 ⊢ (𝐴 finSupp (0g‘𝑀) → 𝐴 finSupp (0g‘𝑀))
10	9	fsuppimpd 9361	. . . 4 ⊢ (𝐴 finSupp (0g‘𝑀) → (𝐴 supp (0g‘𝑀)) ∈ Fin)
11		id 23	. . . . 5 ⊢ (𝐵 finSupp (0g‘𝑀) → 𝐵 finSupp (0g‘𝑀))
12	11	fsuppimpd 9361	. . . 4 ⊢ (𝐵 finSupp (0g‘𝑀) → (𝐵 supp (0g‘𝑀)) ∈ Fin)
13	10, 12	anim12i 625	. . 3 ⊢ ((𝐴 finSupp (0g‘𝑀) ∧ 𝐵 finSupp (0g‘𝑀)) → ((𝐴 supp (0g‘𝑀)) ∈ Fin ∧ (𝐵 supp (0g‘𝑀)) ∈ Fin))
14		mndpsuppfi.r	. . . 4 ⊢ 𝑅 = (Base‘𝑀)
15	14	mndpsuppfi 18960	. . 3 ⊢ (((𝑀 ∈ Mnd ∧ 𝑉 ∈ 𝑋) ∧ (𝐴 ∈ (𝑅 ↑m 𝑉) ∧ 𝐵 ∈ (𝑅 ↑m 𝑉)) ∧ ((𝐴 supp (0g‘𝑀)) ∈ Fin ∧ (𝐵 supp (0g‘𝑀)) ∈ Fin)) → ((𝐴 ∘f (+g‘𝑀)𝐵) supp (0g‘𝑀)) ∈ Fin)
16	13, 15	syl3an3 1183	. 2 ⊢ (((𝑀 ∈ Mnd ∧ 𝑉 ∈ 𝑋) ∧ (𝐴 ∈ (𝑅 ↑m 𝑉) ∧ 𝐵 ∈ (𝑅 ↑m 𝑉)) ∧ (𝐴 finSupp (0g‘𝑀) ∧ 𝐵 finSupp (0g‘𝑀))) → ((𝐴 ∘f (+g‘𝑀)𝐵) supp (0g‘𝑀)) ∈ Fin)
17		ovex 7453	. . 3 ⊢ (𝐴 ∘f (+g‘𝑀)𝐵) ∈ V
18		fvexd 6900	. . 3 ⊢ (((𝑀 ∈ Mnd ∧ 𝑉 ∈ 𝑋) ∧ (𝐴 ∈ (𝑅 ↑m 𝑉) ∧ 𝐵 ∈ (𝑅 ↑m 𝑉)) ∧ (𝐴 finSupp (0g‘𝑀) ∧ 𝐵 finSupp (0g‘𝑀))) → (0g‘𝑀) ∈ V)
19		isfsupp 9357	. . 3 ⊢ (((𝐴 ∘f (+g‘𝑀)𝐵) ∈ V ∧ (0g‘𝑀) ∈ V) → ((𝐴 ∘f (+g‘𝑀)𝐵) finSupp (0g‘𝑀) ↔ (Fun (𝐴 ∘f (+g‘𝑀)𝐵) ∧ ((𝐴 ∘f (+g‘𝑀)𝐵) supp (0g‘𝑀)) ∈ Fin)))
20	17, 18, 19	sylancr 599	. 2 ⊢ (((𝑀 ∈ Mnd ∧ 𝑉 ∈ 𝑋) ∧ (𝐴 ∈ (𝑅 ↑m 𝑉) ∧ 𝐵 ∈ (𝑅 ↑m 𝑉)) ∧ (𝐴 finSupp (0g‘𝑀) ∧ 𝐵 finSupp (0g‘𝑀))) → ((𝐴 ∘f (+g‘𝑀)𝐵) finSupp (0g‘𝑀) ↔ (Fun (𝐴 ∘f (+g‘𝑀)𝐵) ∧ ((𝐴 ∘f (+g‘𝑀)𝐵) supp (0g‘𝑀)) ∈ Fin)))
21	8, 16, 20	mpbir2and 726	1 ⊢ (((𝑀 ∈ Mnd ∧ 𝑉 ∈ 𝑋) ∧ (𝐴 ∈ (𝑅 ↑m 𝑉) ∧ 𝐵 ∈ (𝑅 ↑m 𝑉)) ∧ (𝐴 finSupp (0g‘𝑀) ∧ 𝐵 finSupp (0g‘𝑀))) → (𝐴 ∘f (+g‘𝑀)𝐵) finSupp (0g‘𝑀))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  Vcvv 3451   class class class wbr 5103  Fun wfun 6532   Fn wfn 6533  ‘cfv 6538  (class class class)co 7420   ∘_f cof 7691   supp csupp 8177   ↑_m cmap 8847  Fincfn 8973   finSupp cfsupp 9353  Basecbs 17387  +_gcplusg 17428  0_gc0g 17610  Mndcmnd 18923

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-3or 1104  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-rmo 3366  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-pss 3919  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-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  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-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  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-riota 7377  df-ov 7423  df-oprab 7424  df-mpo 7425  df-of 7693  df-om 7878  df-1st 8001  df-2nd 8002  df-supp 8178  df-1o 8476  df-map 8849  df-en 8974  df-fin 8977  df-fsupp 9354  df-0g 17612  df-mgm 18816  df-sgrp 18908  df-mnd 18924

This theorem is used by:  elrgspnlem1  33803  lincsumcl  49542