lincresunit3lem2 - Mathbox for Alexander van der Vekens

	Mathbox for Alexander van der Vekens		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > lincresunit3lem2		Structured version Visualization version GIF version

Theorem lincresunit3lem2 47250

Description: Lemma 2 for lincresunit3 47251. (Contributed by AV, 18-May-2019.) (Proof shortened by AV, 30-Jul-2019.)

**Hypotheses**
Ref	Expression
lincresunit.b	⊢ 𝐵 = (Base‘𝑀)
lincresunit.r	⊢ 𝑅 = (Scalar‘𝑀)
lincresunit.e	⊢ 𝐸 = (Base‘𝑅)
lincresunit.u	⊢ 𝑈 = (Unit‘𝑅)
lincresunit.0	⊢ 0 = (0_g‘𝑅)
lincresunit.z	⊢ 𝑍 = (0_g‘𝑀)
lincresunit.n	⊢ 𝑁 = (inv_g‘𝑅)
lincresunit.i	⊢ 𝐼 = (inv_r‘𝑅)
lincresunit.t	⊢ · = (._r‘𝑅)
lincresunit.g	⊢ 𝐺 = (𝑠 ∈ (𝑆 ∖ {𝑋}) ↦ ((𝐼‘(𝑁‘(𝐹‘𝑋))) · (𝐹‘𝑠)))

**Assertion**
Ref	Expression
lincresunit3lem2	⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 )) → ((𝑁‘(𝐹‘𝑋))( ·_𝑠 ‘𝑀)(𝑀 Σ_g (𝑧 ∈ (𝑆 ∖ {𝑋}) ↦ ((𝐺‘𝑧)( ·_𝑠 ‘𝑀)𝑧)))) = ((𝐹 ↾ (𝑆 ∖ {𝑋}))( linC ‘𝑀)(𝑆 ∖ {𝑋})))

Distinct variable groups: 𝐵,𝑠 𝐸,𝑠 𝐹,𝑠 𝑀,𝑠 𝑆,𝑠 𝑋,𝑠 𝑈,𝑠 𝐼,𝑠 𝑁,𝑠 · ,𝑠 𝑧,𝑠,𝐵 𝑧,𝐸 𝑧,𝐹 𝑧,𝐺 𝑧,𝑀 𝑧,𝑁 𝑧,𝑅 𝑧,𝑆 𝑧,𝑈 𝑧,𝑋 𝑧,𝑍 0 ,𝑠,𝑧 Allowed substitution hints: 𝑅(𝑠) · (𝑧) 𝐺(𝑠) 𝐼(𝑧) 𝑍(𝑠)

**Proof of Theorem lincresunit3lem2**
Step	Hyp	Ref	Expression
1		simpl2 1190	. . 3 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 )) → 𝑀 ∈ LMod)
2		lincresunit.e	. . . . . . . . . 10 ⊢ 𝐸 = (Base‘𝑅)
3		lincresunit.r	. . . . . . . . . . 11 ⊢ 𝑅 = (Scalar‘𝑀)
4	3	fveq2i 6895	. . . . . . . . . 10 ⊢ (Base‘𝑅) = (Base‘(Scalar‘𝑀))
5	2, 4	eqtri 2758	. . . . . . . . 9 ⊢ 𝐸 = (Base‘(Scalar‘𝑀))
6	5	oveq1i 7423	. . . . . . . 8 ⊢ (𝐸 ↑_m 𝑆) = ((Base‘(Scalar‘𝑀)) ↑_m 𝑆)
7	6	eleq2i 2823	. . . . . . 7 ⊢ (𝐹 ∈ (𝐸 ↑_m 𝑆) ↔ 𝐹 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑆))
8	7	biimpi 215	. . . . . 6 ⊢ (𝐹 ∈ (𝐸 ↑_m 𝑆) → 𝐹 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑆))
9	8	3ad2ant1 1131	. . . . 5 ⊢ ((𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 ) → 𝐹 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑆))
10	9	adantl 480	. . . 4 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 )) → 𝐹 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑆))
11		difssd 4133	. . . 4 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 )) → (𝑆 ∖ {𝑋}) ⊆ 𝑆)
12		elmapssres 8865	. . . 4 ⊢ ((𝐹 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑆) ∧ (𝑆 ∖ {𝑋}) ⊆ 𝑆) → (𝐹 ↾ (𝑆 ∖ {𝑋})) ∈ ((Base‘(Scalar‘𝑀)) ↑_m (𝑆 ∖ {𝑋})))
13	10, 11, 12	syl2anc 582	. . 3 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 )) → (𝐹 ↾ (𝑆 ∖ {𝑋})) ∈ ((Base‘(Scalar‘𝑀)) ↑_m (𝑆 ∖ {𝑋})))
14		elpwi 4610	. . . . . . . 8 ⊢ (𝑆 ∈ 𝒫 (Base‘𝑀) → 𝑆 ⊆ (Base‘𝑀))
15	14	ssdifssd 4143	. . . . . . 7 ⊢ (𝑆 ∈ 𝒫 (Base‘𝑀) → (𝑆 ∖ {𝑋}) ⊆ (Base‘𝑀))
16		difexg 5328	. . . . . . . 8 ⊢ (𝑆 ∈ 𝒫 (Base‘𝑀) → (𝑆 ∖ {𝑋}) ∈ V)
17		elpwg 4606	. . . . . . . 8 ⊢ ((𝑆 ∖ {𝑋}) ∈ V → ((𝑆 ∖ {𝑋}) ∈ 𝒫 (Base‘𝑀) ↔ (𝑆 ∖ {𝑋}) ⊆ (Base‘𝑀)))
18	16, 17	syl 17	. . . . . . 7 ⊢ (𝑆 ∈ 𝒫 (Base‘𝑀) → ((𝑆 ∖ {𝑋}) ∈ 𝒫 (Base‘𝑀) ↔ (𝑆 ∖ {𝑋}) ⊆ (Base‘𝑀)))
19	15, 18	mpbird 256	. . . . . 6 ⊢ (𝑆 ∈ 𝒫 (Base‘𝑀) → (𝑆 ∖ {𝑋}) ∈ 𝒫 (Base‘𝑀))
20		lincresunit.b	. . . . . . 7 ⊢ 𝐵 = (Base‘𝑀)
21	20	pweqi 4619	. . . . . 6 ⊢ 𝒫 𝐵 = 𝒫 (Base‘𝑀)
22	19, 21	eleq2s 2849	. . . . 5 ⊢ (𝑆 ∈ 𝒫 𝐵 → (𝑆 ∖ {𝑋}) ∈ 𝒫 (Base‘𝑀))
23	22	3ad2ant1 1131	. . . 4 ⊢ ((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) → (𝑆 ∖ {𝑋}) ∈ 𝒫 (Base‘𝑀))
24	23	adantr 479	. . 3 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 )) → (𝑆 ∖ {𝑋}) ∈ 𝒫 (Base‘𝑀))
25		lincval 47179	. . 3 ⊢ ((𝑀 ∈ LMod ∧ (𝐹 ↾ (𝑆 ∖ {𝑋})) ∈ ((Base‘(Scalar‘𝑀)) ↑_m (𝑆 ∖ {𝑋})) ∧ (𝑆 ∖ {𝑋}) ∈ 𝒫 (Base‘𝑀)) → ((𝐹 ↾ (𝑆 ∖ {𝑋}))( linC ‘𝑀)(𝑆 ∖ {𝑋})) = (𝑀 Σ_g (𝑧 ∈ (𝑆 ∖ {𝑋}) ↦ (((𝐹 ↾ (𝑆 ∖ {𝑋}))‘𝑧)( ·_𝑠 ‘𝑀)𝑧))))
26	1, 13, 24, 25	syl3anc 1369	. 2 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 )) → ((𝐹 ↾ (𝑆 ∖ {𝑋}))( linC ‘𝑀)(𝑆 ∖ {𝑋})) = (𝑀 Σ_g (𝑧 ∈ (𝑆 ∖ {𝑋}) ↦ (((𝐹 ↾ (𝑆 ∖ {𝑋}))‘𝑧)( ·_𝑠 ‘𝑀)𝑧))))
27		simpll 763	. . . . . 6 ⊢ ((((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 )) ∧ 𝑧 ∈ (𝑆 ∖ {𝑋})) → (𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆))
28		simplr1 1213	. . . . . 6 ⊢ ((((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 )) ∧ 𝑧 ∈ (𝑆 ∖ {𝑋})) → 𝐹 ∈ (𝐸 ↑_m 𝑆))
29		simplr2 1214	. . . . . 6 ⊢ ((((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 )) ∧ 𝑧 ∈ (𝑆 ∖ {𝑋})) → (𝐹‘𝑋) ∈ 𝑈)
30		simpr 483	. . . . . 6 ⊢ ((((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 )) ∧ 𝑧 ∈ (𝑆 ∖ {𝑋})) → 𝑧 ∈ (𝑆 ∖ {𝑋}))
31		lincresunit.u	. . . . . . 7 ⊢ 𝑈 = (Unit‘𝑅)
32		lincresunit.0	. . . . . . 7 ⊢ 0 = (0_g‘𝑅)
33		lincresunit.z	. . . . . . 7 ⊢ 𝑍 = (0_g‘𝑀)
34		lincresunit.n	. . . . . . 7 ⊢ 𝑁 = (inv_g‘𝑅)
35		lincresunit.i	. . . . . . 7 ⊢ 𝐼 = (inv_r‘𝑅)
36		lincresunit.t	. . . . . . 7 ⊢ · = (._r‘𝑅)
37		lincresunit.g	. . . . . . 7 ⊢ 𝐺 = (𝑠 ∈ (𝑆 ∖ {𝑋}) ↦ ((𝐼‘(𝑁‘(𝐹‘𝑋))) · (𝐹‘𝑠)))
38	20, 3, 2, 31, 32, 33, 34, 35, 36, 37	lincresunit3lem1 47249	. . . . . 6 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝑧 ∈ (𝑆 ∖ {𝑋}))) → ((𝑁‘(𝐹‘𝑋))( ·_𝑠 ‘𝑀)((𝐺‘𝑧)( ·_𝑠 ‘𝑀)𝑧)) = ((𝐹‘𝑧)( ·_𝑠 ‘𝑀)𝑧))
39	27, 28, 29, 30, 38	syl13anc 1370	. . . . 5 ⊢ ((((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 )) ∧ 𝑧 ∈ (𝑆 ∖ {𝑋})) → ((𝑁‘(𝐹‘𝑋))( ·_𝑠 ‘𝑀)((𝐺‘𝑧)( ·_𝑠 ‘𝑀)𝑧)) = ((𝐹‘𝑧)( ·_𝑠 ‘𝑀)𝑧))
40		fvres 6911	. . . . . . . 8 ⊢ (𝑧 ∈ (𝑆 ∖ {𝑋}) → ((𝐹 ↾ (𝑆 ∖ {𝑋}))‘𝑧) = (𝐹‘𝑧))
41	40	adantl 480	. . . . . . 7 ⊢ ((((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 )) ∧ 𝑧 ∈ (𝑆 ∖ {𝑋})) → ((𝐹 ↾ (𝑆 ∖ {𝑋}))‘𝑧) = (𝐹‘𝑧))
42	41	eqcomd 2736	. . . . . 6 ⊢ ((((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 )) ∧ 𝑧 ∈ (𝑆 ∖ {𝑋})) → (𝐹‘𝑧) = ((𝐹 ↾ (𝑆 ∖ {𝑋}))‘𝑧))
43	42	oveq1d 7428	. . . . 5 ⊢ ((((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 )) ∧ 𝑧 ∈ (𝑆 ∖ {𝑋})) → ((𝐹‘𝑧)( ·_𝑠 ‘𝑀)𝑧) = (((𝐹 ↾ (𝑆 ∖ {𝑋}))‘𝑧)( ·_𝑠 ‘𝑀)𝑧))
44	39, 43	eqtrd 2770	. . . 4 ⊢ ((((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 )) ∧ 𝑧 ∈ (𝑆 ∖ {𝑋})) → ((𝑁‘(𝐹‘𝑋))( ·_𝑠 ‘𝑀)((𝐺‘𝑧)( ·_𝑠 ‘𝑀)𝑧)) = (((𝐹 ↾ (𝑆 ∖ {𝑋}))‘𝑧)( ·_𝑠 ‘𝑀)𝑧))
45	44	mpteq2dva 5249	. . 3 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 )) → (𝑧 ∈ (𝑆 ∖ {𝑋}) ↦ ((𝑁‘(𝐹‘𝑋))( ·_𝑠 ‘𝑀)((𝐺‘𝑧)( ·_𝑠 ‘𝑀)𝑧))) = (𝑧 ∈ (𝑆 ∖ {𝑋}) ↦ (((𝐹 ↾ (𝑆 ∖ {𝑋}))‘𝑧)( ·_𝑠 ‘𝑀)𝑧)))
46	45	oveq2d 7429	. 2 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 )) → (𝑀 Σ_g (𝑧 ∈ (𝑆 ∖ {𝑋}) ↦ ((𝑁‘(𝐹‘𝑋))( ·_𝑠 ‘𝑀)((𝐺‘𝑧)( ·_𝑠 ‘𝑀)𝑧)))) = (𝑀 Σ_g (𝑧 ∈ (𝑆 ∖ {𝑋}) ↦ (((𝐹 ↾ (𝑆 ∖ {𝑋}))‘𝑧)( ·_𝑠 ‘𝑀)𝑧))))
47		eqid 2730	. . 3 ⊢ (+_g‘𝑀) = (+_g‘𝑀)
48		eqid 2730	. . 3 ⊢ ( ·_𝑠 ‘𝑀) = ( ·_𝑠 ‘𝑀)
49		difexg 5328	. . . . 5 ⊢ (𝑆 ∈ 𝒫 𝐵 → (𝑆 ∖ {𝑋}) ∈ V)
50	49	3ad2ant1 1131	. . . 4 ⊢ ((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) → (𝑆 ∖ {𝑋}) ∈ V)
51	50	adantr 479	. . 3 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 )) → (𝑆 ∖ {𝑋}) ∈ V)
52	3	lmodfgrp 20625	. . . . . . 7 ⊢ (𝑀 ∈ LMod → 𝑅 ∈ Grp)
53	52	3ad2ant2 1132	. . . . . 6 ⊢ ((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) → 𝑅 ∈ Grp)
54	53	adantr 479	. . . . 5 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ 𝐹 ∈ (𝐸 ↑_m 𝑆)) → 𝑅 ∈ Grp)
55		elmapi 8847	. . . . . . 7 ⊢ (𝐹 ∈ (𝐸 ↑_m 𝑆) → 𝐹:𝑆⟶𝐸)
56		ffvelcdm 7084	. . . . . . . . 9 ⊢ ((𝐹:𝑆⟶𝐸 ∧ 𝑋 ∈ 𝑆) → (𝐹‘𝑋) ∈ 𝐸)
57	56	expcom 412	. . . . . . . 8 ⊢ (𝑋 ∈ 𝑆 → (𝐹:𝑆⟶𝐸 → (𝐹‘𝑋) ∈ 𝐸))
58	57	3ad2ant3 1133	. . . . . . 7 ⊢ ((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) → (𝐹:𝑆⟶𝐸 → (𝐹‘𝑋) ∈ 𝐸))
59	55, 58	syl5com 31	. . . . . 6 ⊢ (𝐹 ∈ (𝐸 ↑_m 𝑆) → ((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) → (𝐹‘𝑋) ∈ 𝐸))
60	59	impcom 406	. . . . 5 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ 𝐹 ∈ (𝐸 ↑_m 𝑆)) → (𝐹‘𝑋) ∈ 𝐸)
61	2, 34	grpinvcl 18910	. . . . 5 ⊢ ((𝑅 ∈ Grp ∧ (𝐹‘𝑋) ∈ 𝐸) → (𝑁‘(𝐹‘𝑋)) ∈ 𝐸)
62	54, 60, 61	syl2anc 582	. . . 4 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ 𝐹 ∈ (𝐸 ↑_m 𝑆)) → (𝑁‘(𝐹‘𝑋)) ∈ 𝐸)
63	62	3ad2antr1 1186	. . 3 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 )) → (𝑁‘(𝐹‘𝑋)) ∈ 𝐸)
64	1	adantr 479	. . . 4 ⊢ ((((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 )) ∧ 𝑧 ∈ (𝑆 ∖ {𝑋})) → 𝑀 ∈ LMod)
65	20, 3, 2, 31, 32, 33, 34, 35, 36, 37	lincresunit1 47247	. . . . . . 7 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈)) → 𝐺 ∈ (𝐸 ↑_m (𝑆 ∖ {𝑋})))
66	65	3adantr3 1169	. . . . . 6 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 )) → 𝐺 ∈ (𝐸 ↑_m (𝑆 ∖ {𝑋})))
67		elmapi 8847	. . . . . 6 ⊢ (𝐺 ∈ (𝐸 ↑_m (𝑆 ∖ {𝑋})) → 𝐺:(𝑆 ∖ {𝑋})⟶𝐸)
68		ffvelcdm 7084	. . . . . . 7 ⊢ ((𝐺:(𝑆 ∖ {𝑋})⟶𝐸 ∧ 𝑧 ∈ (𝑆 ∖ {𝑋})) → (𝐺‘𝑧) ∈ 𝐸)
69	68	ex 411	. . . . . 6 ⊢ (𝐺:(𝑆 ∖ {𝑋})⟶𝐸 → (𝑧 ∈ (𝑆 ∖ {𝑋}) → (𝐺‘𝑧) ∈ 𝐸))
70	66, 67, 69	3syl 18	. . . . 5 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 )) → (𝑧 ∈ (𝑆 ∖ {𝑋}) → (𝐺‘𝑧) ∈ 𝐸))
71	70	imp 405	. . . 4 ⊢ ((((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 )) ∧ 𝑧 ∈ (𝑆 ∖ {𝑋})) → (𝐺‘𝑧) ∈ 𝐸)
72		elpwi 4610	. . . . . . . 8 ⊢ (𝑆 ∈ 𝒫 𝐵 → 𝑆 ⊆ 𝐵)
73		eldifi 4127	. . . . . . . . 9 ⊢ (𝑧 ∈ (𝑆 ∖ {𝑋}) → 𝑧 ∈ 𝑆)
74		ssel2 3978	. . . . . . . . . 10 ⊢ ((𝑆 ⊆ 𝐵 ∧ 𝑧 ∈ 𝑆) → 𝑧 ∈ 𝐵)
75	74	expcom 412	. . . . . . . . 9 ⊢ (𝑧 ∈ 𝑆 → (𝑆 ⊆ 𝐵 → 𝑧 ∈ 𝐵))
76	73, 75	syl 17	. . . . . . . 8 ⊢ (𝑧 ∈ (𝑆 ∖ {𝑋}) → (𝑆 ⊆ 𝐵 → 𝑧 ∈ 𝐵))
77	72, 76	syl5com 31	. . . . . . 7 ⊢ (𝑆 ∈ 𝒫 𝐵 → (𝑧 ∈ (𝑆 ∖ {𝑋}) → 𝑧 ∈ 𝐵))
78	77	3ad2ant1 1131	. . . . . 6 ⊢ ((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) → (𝑧 ∈ (𝑆 ∖ {𝑋}) → 𝑧 ∈ 𝐵))
79	78	adantr 479	. . . . 5 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 )) → (𝑧 ∈ (𝑆 ∖ {𝑋}) → 𝑧 ∈ 𝐵))
80	79	imp 405	. . . 4 ⊢ ((((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 )) ∧ 𝑧 ∈ (𝑆 ∖ {𝑋})) → 𝑧 ∈ 𝐵)
81	20, 3, 48, 2	lmodvscl 20634	. . . 4 ⊢ ((𝑀 ∈ LMod ∧ (𝐺‘𝑧) ∈ 𝐸 ∧ 𝑧 ∈ 𝐵) → ((𝐺‘𝑧)( ·_𝑠 ‘𝑀)𝑧) ∈ 𝐵)
82	64, 71, 80, 81	syl3anc 1369	. . 3 ⊢ ((((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 )) ∧ 𝑧 ∈ (𝑆 ∖ {𝑋})) → ((𝐺‘𝑧)( ·_𝑠 ‘𝑀)𝑧) ∈ 𝐵)
83		simp2 1135	. . . . . 6 ⊢ ((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) → 𝑀 ∈ LMod)
84	83, 23	jca 510	. . . . 5 ⊢ ((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) → (𝑀 ∈ LMod ∧ (𝑆 ∖ {𝑋}) ∈ 𝒫 (Base‘𝑀)))
85	84	adantr 479	. . . 4 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 )) → (𝑀 ∈ LMod ∧ (𝑆 ∖ {𝑋}) ∈ 𝒫 (Base‘𝑀)))
86	20, 3, 2, 31, 32, 33, 34, 35, 36, 37	lincresunit2 47248	. . . . 5 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 )) → 𝐺 finSupp 0 )
87	86, 32	breqtrdi 5190	. . . 4 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 )) → 𝐺 finSupp (0_g‘𝑅))
88	3, 2	scmfsupp 47144	. . . . 5 ⊢ (((𝑀 ∈ LMod ∧ (𝑆 ∖ {𝑋}) ∈ 𝒫 (Base‘𝑀)) ∧ 𝐺 ∈ (𝐸 ↑_m (𝑆 ∖ {𝑋})) ∧ 𝐺 finSupp (0_g‘𝑅)) → (𝑧 ∈ (𝑆 ∖ {𝑋}) ↦ ((𝐺‘𝑧)( ·_𝑠 ‘𝑀)𝑧)) finSupp (0_g‘𝑀))
89	88, 33	breqtrrdi 5191	. . . 4 ⊢ (((𝑀 ∈ LMod ∧ (𝑆 ∖ {𝑋}) ∈ 𝒫 (Base‘𝑀)) ∧ 𝐺 ∈ (𝐸 ↑_m (𝑆 ∖ {𝑋})) ∧ 𝐺 finSupp (0_g‘𝑅)) → (𝑧 ∈ (𝑆 ∖ {𝑋}) ↦ ((𝐺‘𝑧)( ·_𝑠 ‘𝑀)𝑧)) finSupp 𝑍)
90	85, 66, 87, 89	syl3anc 1369	. . 3 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 )) → (𝑧 ∈ (𝑆 ∖ {𝑋}) ↦ ((𝐺‘𝑧)( ·_𝑠 ‘𝑀)𝑧)) finSupp 𝑍)
91	20, 3, 2, 33, 47, 48, 1, 51, 63, 82, 90	gsumvsmul 20682	. 2 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 )) → (𝑀 Σ_g (𝑧 ∈ (𝑆 ∖ {𝑋}) ↦ ((𝑁‘(𝐹‘𝑋))( ·_𝑠 ‘𝑀)((𝐺‘𝑧)( ·_𝑠 ‘𝑀)𝑧)))) = ((𝑁‘(𝐹‘𝑋))( ·_𝑠 ‘𝑀)(𝑀 Σ_g (𝑧 ∈ (𝑆 ∖ {𝑋}) ↦ ((𝐺‘𝑧)( ·_𝑠 ‘𝑀)𝑧)))))
92	26, 46, 91	3eqtr2rd 2777	1 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 )) → ((𝑁‘(𝐹‘𝑋))( ·_𝑠 ‘𝑀)(𝑀 Σ_g (𝑧 ∈ (𝑆 ∖ {𝑋}) ↦ ((𝐺‘𝑧)( ·_𝑠 ‘𝑀)𝑧)))) = ((𝐹 ↾ (𝑆 ∖ {𝑋}))( linC ‘𝑀)(𝑆 ∖ {𝑋})))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 394 ∧ w3a 1085 = wceq 1539 ∈ wcel 2104 Vcvv 3472 ∖ cdif 3946 ⊆ wss 3949 𝒫 cpw 4603 {csn 4629 class class class wbr 5149 ↦ cmpt 5232 ↾ cres 5679 ⟶wf 6540 ‘cfv 6544 (class class class)co 7413 ↑_m cmap 8824 finSupp cfsupp 9365 Basecbs 17150 +_gcplusg 17203 ._rcmulr 17204 Scalarcsca 17206 ·_𝑠 cvsca 17207 0_gc0g 17391 Σ_g cgsu 17392 Grpcgrp 18857 inv_gcminusg 18858 Unitcui 20248 inv_rcinvr 20280 LModclmod 20616 linC clinc 47174

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1911 ax-6 1969 ax-7 2009 ax-8 2106 ax-9 2114 ax-10 2135 ax-11 2152 ax-12 2169 ax-ext 2701 ax-rep 5286 ax-sep 5300 ax-nul 5307 ax-pow 5364 ax-pr 5428 ax-un 7729 ax-cnex 11170 ax-resscn 11171 ax-1cn 11172 ax-icn 11173 ax-addcl 11174 ax-addrcl 11175 ax-mulcl 11176 ax-mulrcl 11177 ax-mulcom 11178 ax-addass 11179 ax-mulass 11180 ax-distr 11181 ax-i2m1 11182 ax-1ne0 11183 ax-1rid 11184 ax-rnegex 11185 ax-rrecex 11186 ax-cnre 11187 ax-pre-lttri 11188 ax-pre-lttrn 11189 ax-pre-ltadd 11190 ax-pre-mulgt0 11191

This theorem depends on definitions: df-bi 206 df-an 395 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2532 df-eu 2561 df-clab 2708 df-cleq 2722 df-clel 2808 df-nfc 2883 df-ne 2939 df-nel 3045 df-ral 3060 df-rex 3069 df-rmo 3374 df-reu 3375 df-rab 3431 df-v 3474 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-pss 3968 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4910 df-int 4952 df-iun 5000 df-br 5150 df-opab 5212 df-mpt 5233 df-tr 5267 df-id 5575 df-eprel 5581 df-po 5589 df-so 5590 df-fr 5632 df-se 5633 df-we 5634 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 df-pred 6301 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6496 df-fun 6546 df-fn 6547 df-f 6548 df-f1 6549 df-fo 6550 df-f1o 6551 df-fv 6552 df-isom 6553 df-riota 7369 df-ov 7416 df-oprab 7417 df-mpo 7418 df-om 7860 df-1st 7979 df-2nd 7980 df-supp 8151 df-tpos 8215 df-frecs 8270 df-wrecs 8301 df-recs 8375 df-rdg 8414 df-1o 8470 df-er 8707 df-map 8826 df-en 8944 df-dom 8945 df-sdom 8946 df-fin 8947 df-fsupp 9366 df-oi 9509 df-card 9938 df-pnf 11256 df-mnf 11257 df-xr 11258 df-ltxr 11259 df-le 11260 df-sub 11452 df-neg 11453 df-nn 12219 df-2 12281 df-3 12282 df-n0 12479 df-z 12565 df-uz 12829 df-fz 13491 df-fzo 13634 df-seq 13973 df-hash 14297 df-sets 17103 df-slot 17121 df-ndx 17133 df-base 17151 df-ress 17180 df-plusg 17216 df-mulr 17217 df-0g 17393 df-gsum 17394 df-mgm 18567 df-sgrp 18646 df-mnd 18662 df-mhm 18707 df-grp 18860 df-minusg 18861 df-ghm 19130 df-cntz 19224 df-cmn 19693 df-abl 19694 df-mgp 20031 df-rng 20049 df-ur 20078 df-ring 20131 df-oppr 20227 df-dvdsr 20250 df-unit 20251 df-invr 20281 df-lmod 20618 df-linc 47176

This theorem is referenced by: lincresunit3 47251

W3C validator