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 47114

Description: Lemma 2 for lincresunit3 47115. (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 1192	. . 3 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 )) → 𝑀 ∈ LMod)
2		lincresunit.e	. . . . . . . . . 10 ⊢ 𝐸 = (Base‘𝑅)
3		lincresunit.r	. . . . . . . . . . 11 ⊢ 𝑅 = (Scalar‘𝑀)
4	3	fveq2i 6891	. . . . . . . . . 10 ⊢ (Base‘𝑅) = (Base‘(Scalar‘𝑀))
5	2, 4	eqtri 2760	. . . . . . . . 9 ⊢ 𝐸 = (Base‘(Scalar‘𝑀))
6	5	oveq1i 7415	. . . . . . . 8 ⊢ (𝐸 ↑_m 𝑆) = ((Base‘(Scalar‘𝑀)) ↑_m 𝑆)
7	6	eleq2i 2825	. . . . . . 7 ⊢ (𝐹 ∈ (𝐸 ↑_m 𝑆) ↔ 𝐹 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑆))
8	7	biimpi 215	. . . . . 6 ⊢ (𝐹 ∈ (𝐸 ↑_m 𝑆) → 𝐹 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑆))
9	8	3ad2ant1 1133	. . . . 5 ⊢ ((𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 ) → 𝐹 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑆))
10	9	adantl 482	. . . 4 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 )) → 𝐹 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑆))
11		difssd 4131	. . . 4 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 )) → (𝑆 ∖ {𝑋}) ⊆ 𝑆)
12		elmapssres 8857	. . . 4 ⊢ ((𝐹 ∈ ((Base‘(Scalar‘𝑀)) ↑_m 𝑆) ∧ (𝑆 ∖ {𝑋}) ⊆ 𝑆) → (𝐹 ↾ (𝑆 ∖ {𝑋})) ∈ ((Base‘(Scalar‘𝑀)) ↑_m (𝑆 ∖ {𝑋})))
13	10, 11, 12	syl2anc 584	. . 3 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 )) → (𝐹 ↾ (𝑆 ∖ {𝑋})) ∈ ((Base‘(Scalar‘𝑀)) ↑_m (𝑆 ∖ {𝑋})))
14		elpwi 4608	. . . . . . . 8 ⊢ (𝑆 ∈ 𝒫 (Base‘𝑀) → 𝑆 ⊆ (Base‘𝑀))
15	14	ssdifssd 4141	. . . . . . 7 ⊢ (𝑆 ∈ 𝒫 (Base‘𝑀) → (𝑆 ∖ {𝑋}) ⊆ (Base‘𝑀))
16		difexg 5326	. . . . . . . 8 ⊢ (𝑆 ∈ 𝒫 (Base‘𝑀) → (𝑆 ∖ {𝑋}) ∈ V)
17		elpwg 4604	. . . . . . . 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 4617	. . . . . 6 ⊢ 𝒫 𝐵 = 𝒫 (Base‘𝑀)
22	19, 21	eleq2s 2851	. . . . 5 ⊢ (𝑆 ∈ 𝒫 𝐵 → (𝑆 ∖ {𝑋}) ∈ 𝒫 (Base‘𝑀))
23	22	3ad2ant1 1133	. . . 4 ⊢ ((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) → (𝑆 ∖ {𝑋}) ∈ 𝒫 (Base‘𝑀))
24	23	adantr 481	. . 3 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 )) → (𝑆 ∖ {𝑋}) ∈ 𝒫 (Base‘𝑀))
25		lincval 47043	. . 3 ⊢ ((𝑀 ∈ LMod ∧ (𝐹 ↾ (𝑆 ∖ {𝑋})) ∈ ((Base‘(Scalar‘𝑀)) ↑_m (𝑆 ∖ {𝑋})) ∧ (𝑆 ∖ {𝑋}) ∈ 𝒫 (Base‘𝑀)) → ((𝐹 ↾ (𝑆 ∖ {𝑋}))( linC ‘𝑀)(𝑆 ∖ {𝑋})) = (𝑀 Σ_g (𝑧 ∈ (𝑆 ∖ {𝑋}) ↦ (((𝐹 ↾ (𝑆 ∖ {𝑋}))‘𝑧)( ·_𝑠 ‘𝑀)𝑧))))
26	1, 13, 24, 25	syl3anc 1371	. 2 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 )) → ((𝐹 ↾ (𝑆 ∖ {𝑋}))( linC ‘𝑀)(𝑆 ∖ {𝑋})) = (𝑀 Σ_g (𝑧 ∈ (𝑆 ∖ {𝑋}) ↦ (((𝐹 ↾ (𝑆 ∖ {𝑋}))‘𝑧)( ·_𝑠 ‘𝑀)𝑧))))
27		simpll 765	. . . . . 6 ⊢ ((((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 )) ∧ 𝑧 ∈ (𝑆 ∖ {𝑋})) → (𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆))
28		simplr1 1215	. . . . . 6 ⊢ ((((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 )) ∧ 𝑧 ∈ (𝑆 ∖ {𝑋})) → 𝐹 ∈ (𝐸 ↑_m 𝑆))
29		simplr2 1216	. . . . . 6 ⊢ ((((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 )) ∧ 𝑧 ∈ (𝑆 ∖ {𝑋})) → (𝐹‘𝑋) ∈ 𝑈)
30		simpr 485	. . . . . 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 47113	. . . . . 6 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝑧 ∈ (𝑆 ∖ {𝑋}))) → ((𝑁‘(𝐹‘𝑋))( ·_𝑠 ‘𝑀)((𝐺‘𝑧)( ·_𝑠 ‘𝑀)𝑧)) = ((𝐹‘𝑧)( ·_𝑠 ‘𝑀)𝑧))
39	27, 28, 29, 30, 38	syl13anc 1372	. . . . 5 ⊢ ((((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 )) ∧ 𝑧 ∈ (𝑆 ∖ {𝑋})) → ((𝑁‘(𝐹‘𝑋))( ·_𝑠 ‘𝑀)((𝐺‘𝑧)( ·_𝑠 ‘𝑀)𝑧)) = ((𝐹‘𝑧)( ·_𝑠 ‘𝑀)𝑧))
40		fvres 6907	. . . . . . . 8 ⊢ (𝑧 ∈ (𝑆 ∖ {𝑋}) → ((𝐹 ↾ (𝑆 ∖ {𝑋}))‘𝑧) = (𝐹‘𝑧))
41	40	adantl 482	. . . . . . 7 ⊢ ((((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 )) ∧ 𝑧 ∈ (𝑆 ∖ {𝑋})) → ((𝐹 ↾ (𝑆 ∖ {𝑋}))‘𝑧) = (𝐹‘𝑧))
42	41	eqcomd 2738	. . . . . 6 ⊢ ((((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 )) ∧ 𝑧 ∈ (𝑆 ∖ {𝑋})) → (𝐹‘𝑧) = ((𝐹 ↾ (𝑆 ∖ {𝑋}))‘𝑧))
43	42	oveq1d 7420	. . . . 5 ⊢ ((((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 )) ∧ 𝑧 ∈ (𝑆 ∖ {𝑋})) → ((𝐹‘𝑧)( ·_𝑠 ‘𝑀)𝑧) = (((𝐹 ↾ (𝑆 ∖ {𝑋}))‘𝑧)( ·_𝑠 ‘𝑀)𝑧))
44	39, 43	eqtrd 2772	. . . 4 ⊢ ((((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 )) ∧ 𝑧 ∈ (𝑆 ∖ {𝑋})) → ((𝑁‘(𝐹‘𝑋))( ·_𝑠 ‘𝑀)((𝐺‘𝑧)( ·_𝑠 ‘𝑀)𝑧)) = (((𝐹 ↾ (𝑆 ∖ {𝑋}))‘𝑧)( ·_𝑠 ‘𝑀)𝑧))
45	44	mpteq2dva 5247	. . 3 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 )) → (𝑧 ∈ (𝑆 ∖ {𝑋}) ↦ ((𝑁‘(𝐹‘𝑋))( ·_𝑠 ‘𝑀)((𝐺‘𝑧)( ·_𝑠 ‘𝑀)𝑧))) = (𝑧 ∈ (𝑆 ∖ {𝑋}) ↦ (((𝐹 ↾ (𝑆 ∖ {𝑋}))‘𝑧)( ·_𝑠 ‘𝑀)𝑧)))
46	45	oveq2d 7421	. 2 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 )) → (𝑀 Σ_g (𝑧 ∈ (𝑆 ∖ {𝑋}) ↦ ((𝑁‘(𝐹‘𝑋))( ·_𝑠 ‘𝑀)((𝐺‘𝑧)( ·_𝑠 ‘𝑀)𝑧)))) = (𝑀 Σ_g (𝑧 ∈ (𝑆 ∖ {𝑋}) ↦ (((𝐹 ↾ (𝑆 ∖ {𝑋}))‘𝑧)( ·_𝑠 ‘𝑀)𝑧))))
47		eqid 2732	. . 3 ⊢ (+_g‘𝑀) = (+_g‘𝑀)
48		eqid 2732	. . 3 ⊢ ( ·_𝑠 ‘𝑀) = ( ·_𝑠 ‘𝑀)
49		difexg 5326	. . . . 5 ⊢ (𝑆 ∈ 𝒫 𝐵 → (𝑆 ∖ {𝑋}) ∈ V)
50	49	3ad2ant1 1133	. . . 4 ⊢ ((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) → (𝑆 ∖ {𝑋}) ∈ V)
51	50	adantr 481	. . 3 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 )) → (𝑆 ∖ {𝑋}) ∈ V)
52	3	lmodfgrp 20472	. . . . . . 7 ⊢ (𝑀 ∈ LMod → 𝑅 ∈ Grp)
53	52	3ad2ant2 1134	. . . . . 6 ⊢ ((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) → 𝑅 ∈ Grp)
54	53	adantr 481	. . . . 5 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ 𝐹 ∈ (𝐸 ↑_m 𝑆)) → 𝑅 ∈ Grp)
55		elmapi 8839	. . . . . . 7 ⊢ (𝐹 ∈ (𝐸 ↑_m 𝑆) → 𝐹:𝑆⟶𝐸)
56		ffvelcdm 7080	. . . . . . . . 9 ⊢ ((𝐹:𝑆⟶𝐸 ∧ 𝑋 ∈ 𝑆) → (𝐹‘𝑋) ∈ 𝐸)
57	56	expcom 414	. . . . . . . 8 ⊢ (𝑋 ∈ 𝑆 → (𝐹:𝑆⟶𝐸 → (𝐹‘𝑋) ∈ 𝐸))
58	57	3ad2ant3 1135	. . . . . . 7 ⊢ ((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) → (𝐹:𝑆⟶𝐸 → (𝐹‘𝑋) ∈ 𝐸))
59	55, 58	syl5com 31	. . . . . 6 ⊢ (𝐹 ∈ (𝐸 ↑_m 𝑆) → ((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) → (𝐹‘𝑋) ∈ 𝐸))
60	59	impcom 408	. . . . 5 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ 𝐹 ∈ (𝐸 ↑_m 𝑆)) → (𝐹‘𝑋) ∈ 𝐸)
61	2, 34	grpinvcl 18868	. . . . 5 ⊢ ((𝑅 ∈ Grp ∧ (𝐹‘𝑋) ∈ 𝐸) → (𝑁‘(𝐹‘𝑋)) ∈ 𝐸)
62	54, 60, 61	syl2anc 584	. . . 4 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ 𝐹 ∈ (𝐸 ↑_m 𝑆)) → (𝑁‘(𝐹‘𝑋)) ∈ 𝐸)
63	62	3ad2antr1 1188	. . 3 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 )) → (𝑁‘(𝐹‘𝑋)) ∈ 𝐸)
64	1	adantr 481	. . . 4 ⊢ ((((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 )) ∧ 𝑧 ∈ (𝑆 ∖ {𝑋})) → 𝑀 ∈ LMod)
65	20, 3, 2, 31, 32, 33, 34, 35, 36, 37	lincresunit1 47111	. . . . . . 7 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈)) → 𝐺 ∈ (𝐸 ↑_m (𝑆 ∖ {𝑋})))
66	65	3adantr3 1171	. . . . . 6 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 )) → 𝐺 ∈ (𝐸 ↑_m (𝑆 ∖ {𝑋})))
67		elmapi 8839	. . . . . 6 ⊢ (𝐺 ∈ (𝐸 ↑_m (𝑆 ∖ {𝑋})) → 𝐺:(𝑆 ∖ {𝑋})⟶𝐸)
68		ffvelcdm 7080	. . . . . . 7 ⊢ ((𝐺:(𝑆 ∖ {𝑋})⟶𝐸 ∧ 𝑧 ∈ (𝑆 ∖ {𝑋})) → (𝐺‘𝑧) ∈ 𝐸)
69	68	ex 413	. . . . . 6 ⊢ (𝐺:(𝑆 ∖ {𝑋})⟶𝐸 → (𝑧 ∈ (𝑆 ∖ {𝑋}) → (𝐺‘𝑧) ∈ 𝐸))
70	66, 67, 69	3syl 18	. . . . 5 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 )) → (𝑧 ∈ (𝑆 ∖ {𝑋}) → (𝐺‘𝑧) ∈ 𝐸))
71	70	imp 407	. . . 4 ⊢ ((((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 )) ∧ 𝑧 ∈ (𝑆 ∖ {𝑋})) → (𝐺‘𝑧) ∈ 𝐸)
72		elpwi 4608	. . . . . . . 8 ⊢ (𝑆 ∈ 𝒫 𝐵 → 𝑆 ⊆ 𝐵)
73		eldifi 4125	. . . . . . . . 9 ⊢ (𝑧 ∈ (𝑆 ∖ {𝑋}) → 𝑧 ∈ 𝑆)
74		ssel2 3976	. . . . . . . . . 10 ⊢ ((𝑆 ⊆ 𝐵 ∧ 𝑧 ∈ 𝑆) → 𝑧 ∈ 𝐵)
75	74	expcom 414	. . . . . . . . 9 ⊢ (𝑧 ∈ 𝑆 → (𝑆 ⊆ 𝐵 → 𝑧 ∈ 𝐵))
76	73, 75	syl 17	. . . . . . . 8 ⊢ (𝑧 ∈ (𝑆 ∖ {𝑋}) → (𝑆 ⊆ 𝐵 → 𝑧 ∈ 𝐵))
77	72, 76	syl5com 31	. . . . . . 7 ⊢ (𝑆 ∈ 𝒫 𝐵 → (𝑧 ∈ (𝑆 ∖ {𝑋}) → 𝑧 ∈ 𝐵))
78	77	3ad2ant1 1133	. . . . . 6 ⊢ ((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) → (𝑧 ∈ (𝑆 ∖ {𝑋}) → 𝑧 ∈ 𝐵))
79	78	adantr 481	. . . . 5 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 )) → (𝑧 ∈ (𝑆 ∖ {𝑋}) → 𝑧 ∈ 𝐵))
80	79	imp 407	. . . 4 ⊢ ((((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 )) ∧ 𝑧 ∈ (𝑆 ∖ {𝑋})) → 𝑧 ∈ 𝐵)
81	20, 3, 48, 2	lmodvscl 20481	. . . 4 ⊢ ((𝑀 ∈ LMod ∧ (𝐺‘𝑧) ∈ 𝐸 ∧ 𝑧 ∈ 𝐵) → ((𝐺‘𝑧)( ·_𝑠 ‘𝑀)𝑧) ∈ 𝐵)
82	64, 71, 80, 81	syl3anc 1371	. . 3 ⊢ ((((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 )) ∧ 𝑧 ∈ (𝑆 ∖ {𝑋})) → ((𝐺‘𝑧)( ·_𝑠 ‘𝑀)𝑧) ∈ 𝐵)
83		simp2 1137	. . . . . 6 ⊢ ((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) → 𝑀 ∈ LMod)
84	83, 23	jca 512	. . . . 5 ⊢ ((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) → (𝑀 ∈ LMod ∧ (𝑆 ∖ {𝑋}) ∈ 𝒫 (Base‘𝑀)))
85	84	adantr 481	. . . 4 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 )) → (𝑀 ∈ LMod ∧ (𝑆 ∖ {𝑋}) ∈ 𝒫 (Base‘𝑀)))
86	20, 3, 2, 31, 32, 33, 34, 35, 36, 37	lincresunit2 47112	. . . . 5 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 )) → 𝐺 finSupp 0 )
87	86, 32	breqtrdi 5188	. . . 4 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 )) → 𝐺 finSupp (0_g‘𝑅))
88	3, 2	scmfsupp 47007	. . . . 5 ⊢ (((𝑀 ∈ LMod ∧ (𝑆 ∖ {𝑋}) ∈ 𝒫 (Base‘𝑀)) ∧ 𝐺 ∈ (𝐸 ↑_m (𝑆 ∖ {𝑋})) ∧ 𝐺 finSupp (0_g‘𝑅)) → (𝑧 ∈ (𝑆 ∖ {𝑋}) ↦ ((𝐺‘𝑧)( ·_𝑠 ‘𝑀)𝑧)) finSupp (0_g‘𝑀))
89	88, 33	breqtrrdi 5189	. . . 4 ⊢ (((𝑀 ∈ LMod ∧ (𝑆 ∖ {𝑋}) ∈ 𝒫 (Base‘𝑀)) ∧ 𝐺 ∈ (𝐸 ↑_m (𝑆 ∖ {𝑋})) ∧ 𝐺 finSupp (0_g‘𝑅)) → (𝑧 ∈ (𝑆 ∖ {𝑋}) ↦ ((𝐺‘𝑧)( ·_𝑠 ‘𝑀)𝑧)) finSupp 𝑍)
90	85, 66, 87, 89	syl3anc 1371	. . 3 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 )) → (𝑧 ∈ (𝑆 ∖ {𝑋}) ↦ ((𝐺‘𝑧)( ·_𝑠 ‘𝑀)𝑧)) finSupp 𝑍)
91	20, 3, 2, 33, 47, 48, 1, 51, 63, 82, 90	gsumvsmul 20528	. 2 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 )) → (𝑀 Σ_g (𝑧 ∈ (𝑆 ∖ {𝑋}) ↦ ((𝑁‘(𝐹‘𝑋))( ·_𝑠 ‘𝑀)((𝐺‘𝑧)( ·_𝑠 ‘𝑀)𝑧)))) = ((𝑁‘(𝐹‘𝑋))( ·_𝑠 ‘𝑀)(𝑀 Σ_g (𝑧 ∈ (𝑆 ∖ {𝑋}) ↦ ((𝐺‘𝑧)( ·_𝑠 ‘𝑀)𝑧)))))
92	26, 46, 91	3eqtr2rd 2779	1 ⊢ (((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ LMod ∧ 𝑋 ∈ 𝑆) ∧ (𝐹 ∈ (𝐸 ↑_m 𝑆) ∧ (𝐹‘𝑋) ∈ 𝑈 ∧ 𝐹 finSupp 0 )) → ((𝑁‘(𝐹‘𝑋))( ·_𝑠 ‘𝑀)(𝑀 Σ_g (𝑧 ∈ (𝑆 ∖ {𝑋}) ↦ ((𝐺‘𝑧)( ·_𝑠 ‘𝑀)𝑧)))) = ((𝐹 ↾ (𝑆 ∖ {𝑋}))( linC ‘𝑀)(𝑆 ∖ {𝑋})))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 ∧ w3a 1087 = wceq 1541 ∈ wcel 2106 Vcvv 3474 ∖ cdif 3944 ⊆ wss 3947 𝒫 cpw 4601 {csn 4627 class class class wbr 5147 ↦ cmpt 5230 ↾ cres 5677 ⟶wf 6536 ‘cfv 6540 (class class class)co 7405 ↑_m cmap 8816 finSupp cfsupp 9357 Basecbs 17140 +_gcplusg 17193 ._rcmulr 17194 Scalarcsca 17196 ·_𝑠 cvsca 17197 0_gc0g 17381 Σ_g cgsu 17382 Grpcgrp 18815 inv_gcminusg 18816 Unitcui 20161 inv_rcinvr 20193 LModclmod 20463 linC clinc 47038

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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-rep 5284 ax-sep 5298 ax-nul 5305 ax-pow 5362 ax-pr 5426 ax-un 7721 ax-cnex 11162 ax-resscn 11163 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-mulcom 11170 ax-addass 11171 ax-mulass 11172 ax-distr 11173 ax-i2m1 11174 ax-1ne0 11175 ax-1rid 11176 ax-rnegex 11177 ax-rrecex 11178 ax-cnre 11179 ax-pre-lttri 11180 ax-pre-lttrn 11181 ax-pre-ltadd 11182 ax-pre-mulgt0 11183

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3376 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4322 df-if 4528 df-pw 4603 df-sn 4628 df-pr 4630 df-op 4634 df-uni 4908 df-int 4950 df-iun 4998 df-br 5148 df-opab 5210 df-mpt 5231 df-tr 5265 df-id 5573 df-eprel 5579 df-po 5587 df-so 5588 df-fr 5630 df-se 5631 df-we 5632 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-rn 5686 df-res 5687 df-ima 5688 df-pred 6297 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6492 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-isom 6549 df-riota 7361 df-ov 7408 df-oprab 7409 df-mpo 7410 df-om 7852 df-1st 7971 df-2nd 7972 df-supp 8143 df-tpos 8207 df-frecs 8262 df-wrecs 8293 df-recs 8367 df-rdg 8406 df-1o 8462 df-er 8699 df-map 8818 df-en 8936 df-dom 8937 df-sdom 8938 df-fin 8939 df-fsupp 9358 df-oi 9501 df-card 9930 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-sub 11442 df-neg 11443 df-nn 12209 df-2 12271 df-3 12272 df-n0 12469 df-z 12555 df-uz 12819 df-fz 13481 df-fzo 13624 df-seq 13963 df-hash 14287 df-sets 17093 df-slot 17111 df-ndx 17123 df-base 17141 df-ress 17170 df-plusg 17206 df-mulr 17207 df-0g 17383 df-gsum 17384 df-mgm 18557 df-sgrp 18606 df-mnd 18622 df-mhm 18667 df-grp 18818 df-minusg 18819 df-ghm 19084 df-cntz 19175 df-cmn 19644 df-abl 19645 df-mgp 19982 df-ur 19999 df-ring 20051 df-oppr 20142 df-dvdsr 20163 df-unit 20164 df-invr 20194 df-lmod 20465 df-linc 47040

This theorem is referenced by: lincresunit3 47115

W3C validator