Theorem lcoop 48887

Description: A linear combination as operation. (Contributed by AV, 5-Apr-2019.) (Revised by AV, 28-Jul-2019.)

Hypotheses

Ref	Expression
lcoop.b	⊢ 𝐵 = (Base‘𝑀)
lcoop.s	⊢ 𝑆 = (Scalar‘𝑀)
lcoop.r	⊢ 𝑅 = (Base‘𝑆)

Assertion

Ref	Expression
lcoop	⊢ ((𝑀 ∈ 𝑋 ∧ 𝑉 ∈ 𝒫 𝐵) → (𝑀 LinCo 𝑉) = {𝑐 ∈ 𝐵 ∣ ∃𝑠 ∈ (𝑅 ↑m 𝑉)(𝑠 finSupp (0g‘𝑆) ∧ 𝑐 = (𝑠( linC ‘𝑀)𝑉))})

Distinct variable groups:   𝐵,𝑐   𝑀,𝑐,𝑠   𝑅,𝑐,𝑠   𝑉,𝑐,𝑠

Allowed substitution hints:   𝐵(𝑠)   𝑆(𝑠,𝑐)   𝑋(𝑠,𝑐)

Proof of Theorem lcoop

Dummy variables 𝑚 𝑣 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		elex 3450	. . 3 ⊢ (𝑀 ∈ 𝑋 → 𝑀 ∈ V)
2	1	adantr 480	. 2 ⊢ ((𝑀 ∈ 𝑋 ∧ 𝑉 ∈ 𝒫 𝐵) → 𝑀 ∈ V)
3		lcoop.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝑀)
4	3	pweqi 4557	. . . . 5 ⊢ 𝒫 𝐵 = 𝒫 (Base‘𝑀)
5	4	eleq2i 2828	. . . 4 ⊢ (𝑉 ∈ 𝒫 𝐵 ↔ 𝑉 ∈ 𝒫 (Base‘𝑀))
6	5	biimpi 216	. . 3 ⊢ (𝑉 ∈ 𝒫 𝐵 → 𝑉 ∈ 𝒫 (Base‘𝑀))
7	6	adantl 481	. 2 ⊢ ((𝑀 ∈ 𝑋 ∧ 𝑉 ∈ 𝒫 𝐵) → 𝑉 ∈ 𝒫 (Base‘𝑀))
8	3	fvexi 6854	. . 3 ⊢ 𝐵 ∈ V
9		rabexg 5278	. . 3 ⊢ (𝐵 ∈ V → {𝑐 ∈ 𝐵 ∣ ∃𝑠 ∈ (𝑅 ↑m 𝑉)(𝑠 finSupp (0g‘𝑆) ∧ 𝑐 = (𝑠( linC ‘𝑀)𝑉))} ∈ V)
10	8, 9	mp1i 13	. 2 ⊢ ((𝑀 ∈ 𝑋 ∧ 𝑉 ∈ 𝒫 𝐵) → {𝑐 ∈ 𝐵 ∣ ∃𝑠 ∈ (𝑅 ↑m 𝑉)(𝑠 finSupp (0g‘𝑆) ∧ 𝑐 = (𝑠( linC ‘𝑀)𝑉))} ∈ V)
11		fveq2 6840	. . . . . 6 ⊢ (𝑚 = 𝑀 → (Base‘𝑚) = (Base‘𝑀))
12	11, 3	eqtr4di 2789	. . . . 5 ⊢ (𝑚 = 𝑀 → (Base‘𝑚) = 𝐵)
13	12	adantr 480	. . . 4 ⊢ ((𝑚 = 𝑀 ∧ 𝑣 = 𝑉) → (Base‘𝑚) = 𝐵)
14		2fveq3 6845	. . . . . . . 8 ⊢ (𝑚 = 𝑀 → (Base‘(Scalar‘𝑚)) = (Base‘(Scalar‘𝑀)))
15	14	adantr 480	. . . . . . 7 ⊢ ((𝑚 = 𝑀 ∧ 𝑣 = 𝑉) → (Base‘(Scalar‘𝑚)) = (Base‘(Scalar‘𝑀)))
16		lcoop.r	. . . . . . . 8 ⊢ 𝑅 = (Base‘𝑆)
17		lcoop.s	. . . . . . . . 9 ⊢ 𝑆 = (Scalar‘𝑀)
18	17	fveq2i 6843	. . . . . . . 8 ⊢ (Base‘𝑆) = (Base‘(Scalar‘𝑀))
19	16, 18	eqtri 2759	. . . . . . 7 ⊢ 𝑅 = (Base‘(Scalar‘𝑀))
20	15, 19	eqtr4di 2789	. . . . . 6 ⊢ ((𝑚 = 𝑀 ∧ 𝑣 = 𝑉) → (Base‘(Scalar‘𝑚)) = 𝑅)
21		simpr 484	. . . . . 6 ⊢ ((𝑚 = 𝑀 ∧ 𝑣 = 𝑉) → 𝑣 = 𝑉)
22	20, 21	oveq12d 7385	. . . . 5 ⊢ ((𝑚 = 𝑀 ∧ 𝑣 = 𝑉) → ((Base‘(Scalar‘𝑚)) ↑m 𝑣) = (𝑅 ↑m 𝑉))
23		2fveq3 6845	. . . . . . . . 9 ⊢ (𝑚 = 𝑀 → (0g‘(Scalar‘𝑚)) = (0g‘(Scalar‘𝑀)))
24	17	a1i 11	. . . . . . . . . . 11 ⊢ (𝑚 = 𝑀 → 𝑆 = (Scalar‘𝑀))
25	24	eqcomd 2742	. . . . . . . . . 10 ⊢ (𝑚 = 𝑀 → (Scalar‘𝑀) = 𝑆)
26	25	fveq2d 6844	. . . . . . . . 9 ⊢ (𝑚 = 𝑀 → (0g‘(Scalar‘𝑀)) = (0g‘𝑆))
27	23, 26	eqtrd 2771	. . . . . . . 8 ⊢ (𝑚 = 𝑀 → (0g‘(Scalar‘𝑚)) = (0g‘𝑆))
28	27	adantr 480	. . . . . . 7 ⊢ ((𝑚 = 𝑀 ∧ 𝑣 = 𝑉) → (0g‘(Scalar‘𝑚)) = (0g‘𝑆))
29	28	breq2d 5097	. . . . . 6 ⊢ ((𝑚 = 𝑀 ∧ 𝑣 = 𝑉) → (𝑠 finSupp (0g‘(Scalar‘𝑚)) ↔ 𝑠 finSupp (0g‘𝑆)))
30		fveq2 6840	. . . . . . . . 9 ⊢ (𝑚 = 𝑀 → ( linC ‘𝑚) = ( linC ‘𝑀))
31	30	adantr 480	. . . . . . . 8 ⊢ ((𝑚 = 𝑀 ∧ 𝑣 = 𝑉) → ( linC ‘𝑚) = ( linC ‘𝑀))
32		eqidd 2737	. . . . . . . 8 ⊢ ((𝑚 = 𝑀 ∧ 𝑣 = 𝑉) → 𝑠 = 𝑠)
33	31, 32, 21	oveq123d 7388	. . . . . . 7 ⊢ ((𝑚 = 𝑀 ∧ 𝑣 = 𝑉) → (𝑠( linC ‘𝑚)𝑣) = (𝑠( linC ‘𝑀)𝑉))
34	33	eqeq2d 2747	. . . . . 6 ⊢ ((𝑚 = 𝑀 ∧ 𝑣 = 𝑉) → (𝑐 = (𝑠( linC ‘𝑚)𝑣) ↔ 𝑐 = (𝑠( linC ‘𝑀)𝑉)))
35	29, 34	anbi12d 633	. . . . 5 ⊢ ((𝑚 = 𝑀 ∧ 𝑣 = 𝑉) → ((𝑠 finSupp (0g‘(Scalar‘𝑚)) ∧ 𝑐 = (𝑠( linC ‘𝑚)𝑣)) ↔ (𝑠 finSupp (0g‘𝑆) ∧ 𝑐 = (𝑠( linC ‘𝑀)𝑉))))
36	22, 35	rexeqbidv 3312	. . . 4 ⊢ ((𝑚 = 𝑀 ∧ 𝑣 = 𝑉) → (∃𝑠 ∈ ((Base‘(Scalar‘𝑚)) ↑m 𝑣)(𝑠 finSupp (0g‘(Scalar‘𝑚)) ∧ 𝑐 = (𝑠( linC ‘𝑚)𝑣)) ↔ ∃𝑠 ∈ (𝑅 ↑m 𝑉)(𝑠 finSupp (0g‘𝑆) ∧ 𝑐 = (𝑠( linC ‘𝑀)𝑉))))
37	13, 36	rabeqbidv 3407	. . 3 ⊢ ((𝑚 = 𝑀 ∧ 𝑣 = 𝑉) → {𝑐 ∈ (Base‘𝑚) ∣ ∃𝑠 ∈ ((Base‘(Scalar‘𝑚)) ↑m 𝑣)(𝑠 finSupp (0g‘(Scalar‘𝑚)) ∧ 𝑐 = (𝑠( linC ‘𝑚)𝑣))} = {𝑐 ∈ 𝐵 ∣ ∃𝑠 ∈ (𝑅 ↑m 𝑉)(𝑠 finSupp (0g‘𝑆) ∧ 𝑐 = (𝑠( linC ‘𝑀)𝑉))})
38	11	pweqd 4558	. . 3 ⊢ (𝑚 = 𝑀 → 𝒫 (Base‘𝑚) = 𝒫 (Base‘𝑀))
39		df-lco 48883	. . 3 ⊢ LinCo = (𝑚 ∈ V, 𝑣 ∈ 𝒫 (Base‘𝑚) ↦ {𝑐 ∈ (Base‘𝑚) ∣ ∃𝑠 ∈ ((Base‘(Scalar‘𝑚)) ↑m 𝑣)(𝑠 finSupp (0g‘(Scalar‘𝑚)) ∧ 𝑐 = (𝑠( linC ‘𝑚)𝑣))})
40	37, 38, 39	ovmpox 7520	. 2 ⊢ ((𝑀 ∈ V ∧ 𝑉 ∈ 𝒫 (Base‘𝑀) ∧ {𝑐 ∈ 𝐵 ∣ ∃𝑠 ∈ (𝑅 ↑m 𝑉)(𝑠 finSupp (0g‘𝑆) ∧ 𝑐 = (𝑠( linC ‘𝑀)𝑉))} ∈ V) → (𝑀 LinCo 𝑉) = {𝑐 ∈ 𝐵 ∣ ∃𝑠 ∈ (𝑅 ↑m 𝑉)(𝑠 finSupp (0g‘𝑆) ∧ 𝑐 = (𝑠( linC ‘𝑀)𝑉))})
41	2, 7, 10, 40	syl3anc 1374	1 ⊢ ((𝑀 ∈ 𝑋 ∧ 𝑉 ∈ 𝒫 𝐵) → (𝑀 LinCo 𝑉) = {𝑐 ∈ 𝐵 ∣ ∃𝑠 ∈ (𝑅 ↑m 𝑉)(𝑠 finSupp (0g‘𝑆) ∧ 𝑐 = (𝑠( linC ‘𝑀)𝑉))})

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1542   ∈ wcel 2114  ∃wrex 3061  {crab 3389  Vcvv 3429  𝒫 cpw 4541   class class class wbr 5085  ‘cfv 6498  (class class class)co 7367   ↑_m cmap 8773   finSupp cfsupp 9274  Basecbs 17179  Scalarcsca 17223  0_gc0g 17402   linC clinc 48880   LinCo clinco 48881

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-sep 5231  ax-nul 5241  ax-pr 5375

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-rab 3390  df-v 3431  df-sbc 3729  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-br 5086  df-opab 5148  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-iota 6454  df-fun 6500  df-fv 6506  df-ov 7370  df-oprab 7371  df-mpo 7372  df-lco 48883

This theorem is referenced by:  lcoval  48888  lco0  48903