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

Theorem lindslinindimp2lem4 47715
Description: Lemma 4 for lindslinindsimp2 47717. (Contributed by AV, 25-Apr-2019.) (Revised by AV, 30-Jul-2019.) (Proof shortened by II, 16-Feb-2023.)
Hypotheses
Ref Expression
lindslinind.r 𝑅 = (Scalar‘𝑀)
lindslinind.b 𝐵 = (Base‘𝑅)
lindslinind.0 0 = (0g𝑅)
lindslinind.z 𝑍 = (0g𝑀)
lindslinind.y 𝑌 = ((invg𝑅)‘(𝑓𝑥))
lindslinind.g 𝐺 = (𝑓 ↾ (𝑆 ∖ {𝑥}))
Assertion
Ref Expression
lindslinindimp2lem4 (((𝑆𝑉𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆) ∧ (𝑓 ∈ (𝐵m 𝑆) ∧ 𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍)) → (𝑀 Σg (𝑦 ∈ (𝑆 ∖ {𝑥}) ↦ ((𝑓𝑦)( ·𝑠𝑀)𝑦))) = (𝑌( ·𝑠𝑀)𝑥))
Distinct variable groups:   𝐵,𝑓,𝑦   𝑓,𝑀,𝑦   𝑅,𝑓,𝑥   𝑆,𝑓,𝑥,𝑦   𝑦,𝑉   𝑓,𝑍,𝑦   0 ,𝑓,𝑥,𝑦   𝑦,𝐺
Allowed substitution hints:   𝐵(𝑥)   𝑅(𝑦)   𝐺(𝑥,𝑓)   𝑀(𝑥)   𝑉(𝑥,𝑓)   𝑌(𝑥,𝑦,𝑓)   𝑍(𝑥)

Proof of Theorem lindslinindimp2lem4
StepHypRef Expression
1 simpr 483 . . . . . . . . . . . . 13 ((𝑆𝑉𝑀 ∈ LMod) → 𝑀 ∈ LMod)
21adantr 479 . . . . . . . . . . . 12 (((𝑆𝑉𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆)) → 𝑀 ∈ LMod)
3 simprl 769 . . . . . . . . . . . . 13 (((𝑆𝑉𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆)) → 𝑆 ⊆ (Base‘𝑀))
4 elpwg 4607 . . . . . . . . . . . . . 14 (𝑆𝑉 → (𝑆 ∈ 𝒫 (Base‘𝑀) ↔ 𝑆 ⊆ (Base‘𝑀)))
54ad2antrr 724 . . . . . . . . . . . . 13 (((𝑆𝑉𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆)) → (𝑆 ∈ 𝒫 (Base‘𝑀) ↔ 𝑆 ⊆ (Base‘𝑀)))
63, 5mpbird 256 . . . . . . . . . . . 12 (((𝑆𝑉𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆)) → 𝑆 ∈ 𝒫 (Base‘𝑀))
7 simpr 483 . . . . . . . . . . . . 13 ((𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆) → 𝑥𝑆)
87adantl 480 . . . . . . . . . . . 12 (((𝑆𝑉𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆)) → 𝑥𝑆)
92, 6, 83jca 1125 . . . . . . . . . . 11 (((𝑆𝑉𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆)) → (𝑀 ∈ LMod ∧ 𝑆 ∈ 𝒫 (Base‘𝑀) ∧ 𝑥𝑆))
109adantl 480 . . . . . . . . . 10 (((𝑓 ∈ (𝐵m 𝑆) ∧ 𝑓 finSupp 0 ) ∧ ((𝑆𝑉𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆))) → (𝑀 ∈ LMod ∧ 𝑆 ∈ 𝒫 (Base‘𝑀) ∧ 𝑥𝑆))
11 simpl 481 . . . . . . . . . 10 (((𝑓 ∈ (𝐵m 𝑆) ∧ 𝑓 finSupp 0 ) ∧ ((𝑆𝑉𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆))) → (𝑓 ∈ (𝐵m 𝑆) ∧ 𝑓 finSupp 0 ))
12 lindslinind.g . . . . . . . . . . 11 𝐺 = (𝑓 ↾ (𝑆 ∖ {𝑥}))
1312a1i 11 . . . . . . . . . 10 (((𝑓 ∈ (𝐵m 𝑆) ∧ 𝑓 finSupp 0 ) ∧ ((𝑆𝑉𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆))) → 𝐺 = (𝑓 ↾ (𝑆 ∖ {𝑥})))
14 eqid 2725 . . . . . . . . . . 11 (Base‘𝑀) = (Base‘𝑀)
15 lindslinind.r . . . . . . . . . . 11 𝑅 = (Scalar‘𝑀)
16 lindslinind.b . . . . . . . . . . 11 𝐵 = (Base‘𝑅)
17 eqid 2725 . . . . . . . . . . 11 ( ·𝑠𝑀) = ( ·𝑠𝑀)
18 eqid 2725 . . . . . . . . . . 11 (+g𝑀) = (+g𝑀)
19 lindslinind.0 . . . . . . . . . . 11 0 = (0g𝑅)
2014, 15, 16, 17, 18, 19lincdifsn 47678 . . . . . . . . . 10 (((𝑀 ∈ LMod ∧ 𝑆 ∈ 𝒫 (Base‘𝑀) ∧ 𝑥𝑆) ∧ (𝑓 ∈ (𝐵m 𝑆) ∧ 𝑓 finSupp 0 ) ∧ 𝐺 = (𝑓 ↾ (𝑆 ∖ {𝑥}))) → (𝑓( linC ‘𝑀)𝑆) = ((𝐺( linC ‘𝑀)(𝑆 ∖ {𝑥}))(+g𝑀)((𝑓𝑥)( ·𝑠𝑀)𝑥)))
2110, 11, 13, 20syl3anc 1368 . . . . . . . . 9 (((𝑓 ∈ (𝐵m 𝑆) ∧ 𝑓 finSupp 0 ) ∧ ((𝑆𝑉𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆))) → (𝑓( linC ‘𝑀)𝑆) = ((𝐺( linC ‘𝑀)(𝑆 ∖ {𝑥}))(+g𝑀)((𝑓𝑥)( ·𝑠𝑀)𝑥)))
2221eqeq1d 2727 . . . . . . . 8 (((𝑓 ∈ (𝐵m 𝑆) ∧ 𝑓 finSupp 0 ) ∧ ((𝑆𝑉𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆))) → ((𝑓( linC ‘𝑀)𝑆) = 𝑍 ↔ ((𝐺( linC ‘𝑀)(𝑆 ∖ {𝑥}))(+g𝑀)((𝑓𝑥)( ·𝑠𝑀)𝑥)) = 𝑍))
23 lmodgrp 20762 . . . . . . . . . . 11 (𝑀 ∈ LMod → 𝑀 ∈ Grp)
2423adantl 480 . . . . . . . . . 10 ((𝑆𝑉𝑀 ∈ LMod) → 𝑀 ∈ Grp)
2524ad2antrl 726 . . . . . . . . 9 (((𝑓 ∈ (𝐵m 𝑆) ∧ 𝑓 finSupp 0 ) ∧ ((𝑆𝑉𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆))) → 𝑀 ∈ Grp)
261ad2antrl 726 . . . . . . . . . 10 (((𝑓 ∈ (𝐵m 𝑆) ∧ 𝑓 finSupp 0 ) ∧ ((𝑆𝑉𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆))) → 𝑀 ∈ LMod)
27 elmapi 8868 . . . . . . . . . . . . 13 (𝑓 ∈ (𝐵m 𝑆) → 𝑓:𝑆𝐵)
28 ffvelcdm 7090 . . . . . . . . . . . . . . 15 ((𝑓:𝑆𝐵𝑥𝑆) → (𝑓𝑥) ∈ 𝐵)
2928expcom 412 . . . . . . . . . . . . . 14 (𝑥𝑆 → (𝑓:𝑆𝐵 → (𝑓𝑥) ∈ 𝐵))
3029ad2antll 727 . . . . . . . . . . . . 13 (((𝑆𝑉𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆)) → (𝑓:𝑆𝐵 → (𝑓𝑥) ∈ 𝐵))
3127, 30syl5com 31 . . . . . . . . . . . 12 (𝑓 ∈ (𝐵m 𝑆) → (((𝑆𝑉𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆)) → (𝑓𝑥) ∈ 𝐵))
3231adantr 479 . . . . . . . . . . 11 ((𝑓 ∈ (𝐵m 𝑆) ∧ 𝑓 finSupp 0 ) → (((𝑆𝑉𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆)) → (𝑓𝑥) ∈ 𝐵))
3332imp 405 . . . . . . . . . 10 (((𝑓 ∈ (𝐵m 𝑆) ∧ 𝑓 finSupp 0 ) ∧ ((𝑆𝑉𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆))) → (𝑓𝑥) ∈ 𝐵)
34 ssel2 3971 . . . . . . . . . . 11 ((𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆) → 𝑥 ∈ (Base‘𝑀))
3534ad2antll 727 . . . . . . . . . 10 (((𝑓 ∈ (𝐵m 𝑆) ∧ 𝑓 finSupp 0 ) ∧ ((𝑆𝑉𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆))) → 𝑥 ∈ (Base‘𝑀))
3614, 15, 17, 16lmodvscl 20773 . . . . . . . . . 10 ((𝑀 ∈ LMod ∧ (𝑓𝑥) ∈ 𝐵𝑥 ∈ (Base‘𝑀)) → ((𝑓𝑥)( ·𝑠𝑀)𝑥) ∈ (Base‘𝑀))
3726, 33, 35, 36syl3anc 1368 . . . . . . . . 9 (((𝑓 ∈ (𝐵m 𝑆) ∧ 𝑓 finSupp 0 ) ∧ ((𝑆𝑉𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆))) → ((𝑓𝑥)( ·𝑠𝑀)𝑥) ∈ (Base‘𝑀))
38 difexg 5330 . . . . . . . . . . . . 13 (𝑆𝑉 → (𝑆 ∖ {𝑥}) ∈ V)
3938ad2antrr 724 . . . . . . . . . . . 12 (((𝑆𝑉𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆)) → (𝑆 ∖ {𝑥}) ∈ V)
40 ssdifss 4132 . . . . . . . . . . . . 13 (𝑆 ⊆ (Base‘𝑀) → (𝑆 ∖ {𝑥}) ⊆ (Base‘𝑀))
4140ad2antrl 726 . . . . . . . . . . . 12 (((𝑆𝑉𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆)) → (𝑆 ∖ {𝑥}) ⊆ (Base‘𝑀))
4239, 41jca 510 . . . . . . . . . . 11 (((𝑆𝑉𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆)) → ((𝑆 ∖ {𝑥}) ∈ V ∧ (𝑆 ∖ {𝑥}) ⊆ (Base‘𝑀)))
4342adantl 480 . . . . . . . . . 10 (((𝑓 ∈ (𝐵m 𝑆) ∧ 𝑓 finSupp 0 ) ∧ ((𝑆𝑉𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆))) → ((𝑆 ∖ {𝑥}) ∈ V ∧ (𝑆 ∖ {𝑥}) ⊆ (Base‘𝑀)))
44 simprl 769 . . . . . . . . . . . 12 (((𝑓 ∈ (𝐵m 𝑆) ∧ 𝑓 finSupp 0 ) ∧ ((𝑆𝑉𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆))) → (𝑆𝑉𝑀 ∈ LMod))
45 simpl 481 . . . . . . . . . . . . 13 ((𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆) → 𝑆 ⊆ (Base‘𝑀))
4645ad2antll 727 . . . . . . . . . . . 12 (((𝑓 ∈ (𝐵m 𝑆) ∧ 𝑓 finSupp 0 ) ∧ ((𝑆𝑉𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆))) → 𝑆 ⊆ (Base‘𝑀))
477ad2antll 727 . . . . . . . . . . . 12 (((𝑓 ∈ (𝐵m 𝑆) ∧ 𝑓 finSupp 0 ) ∧ ((𝑆𝑉𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆))) → 𝑥𝑆)
48 simpl 481 . . . . . . . . . . . . 13 ((𝑓 ∈ (𝐵m 𝑆) ∧ 𝑓 finSupp 0 ) → 𝑓 ∈ (𝐵m 𝑆))
4948adantr 479 . . . . . . . . . . . 12 (((𝑓 ∈ (𝐵m 𝑆) ∧ 𝑓 finSupp 0 ) ∧ ((𝑆𝑉𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆))) → 𝑓 ∈ (𝐵m 𝑆))
50 lindslinind.z . . . . . . . . . . . . 13 𝑍 = (0g𝑀)
51 lindslinind.y . . . . . . . . . . . . 13 𝑌 = ((invg𝑅)‘(𝑓𝑥))
5215, 16, 19, 50, 51, 12lindslinindimp2lem2 47713 . . . . . . . . . . . 12 (((𝑆𝑉𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆𝑓 ∈ (𝐵m 𝑆))) → 𝐺 ∈ (𝐵m (𝑆 ∖ {𝑥})))
5344, 46, 47, 49, 52syl13anc 1369 . . . . . . . . . . 11 (((𝑓 ∈ (𝐵m 𝑆) ∧ 𝑓 finSupp 0 ) ∧ ((𝑆𝑉𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆))) → 𝐺 ∈ (𝐵m (𝑆 ∖ {𝑥})))
54 simpr 483 . . . . . . . . . . . . 13 (((𝑆𝑉𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆)) → (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆))
5554adantl 480 . . . . . . . . . . . 12 (((𝑓 ∈ (𝐵m 𝑆) ∧ 𝑓 finSupp 0 ) ∧ ((𝑆𝑉𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆))) → (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆))
5615, 16, 19, 50, 51, 12lindslinindimp2lem3 47714 . . . . . . . . . . . 12 (((𝑆𝑉𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆) ∧ (𝑓 ∈ (𝐵m 𝑆) ∧ 𝑓 finSupp 0 )) → 𝐺 finSupp 0 )
5744, 55, 11, 56syl3anc 1368 . . . . . . . . . . 11 (((𝑓 ∈ (𝐵m 𝑆) ∧ 𝑓 finSupp 0 ) ∧ ((𝑆𝑉𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆))) → 𝐺 finSupp 0 )
5853, 57jca 510 . . . . . . . . . 10 (((𝑓 ∈ (𝐵m 𝑆) ∧ 𝑓 finSupp 0 ) ∧ ((𝑆𝑉𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆))) → (𝐺 ∈ (𝐵m (𝑆 ∖ {𝑥})) ∧ 𝐺 finSupp 0 ))
5914, 15, 16, 19lincfsuppcl 47667 . . . . . . . . . 10 ((𝑀 ∈ LMod ∧ ((𝑆 ∖ {𝑥}) ∈ V ∧ (𝑆 ∖ {𝑥}) ⊆ (Base‘𝑀)) ∧ (𝐺 ∈ (𝐵m (𝑆 ∖ {𝑥})) ∧ 𝐺 finSupp 0 )) → (𝐺( linC ‘𝑀)(𝑆 ∖ {𝑥})) ∈ (Base‘𝑀))
6026, 43, 58, 59syl3anc 1368 . . . . . . . . 9 (((𝑓 ∈ (𝐵m 𝑆) ∧ 𝑓 finSupp 0 ) ∧ ((𝑆𝑉𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆))) → (𝐺( linC ‘𝑀)(𝑆 ∖ {𝑥})) ∈ (Base‘𝑀))
61 eqid 2725 . . . . . . . . . 10 (invg𝑀) = (invg𝑀)
6214, 18, 50, 61grpinvid2 18957 . . . . . . . . 9 ((𝑀 ∈ Grp ∧ ((𝑓𝑥)( ·𝑠𝑀)𝑥) ∈ (Base‘𝑀) ∧ (𝐺( linC ‘𝑀)(𝑆 ∖ {𝑥})) ∈ (Base‘𝑀)) → (((invg𝑀)‘((𝑓𝑥)( ·𝑠𝑀)𝑥)) = (𝐺( linC ‘𝑀)(𝑆 ∖ {𝑥})) ↔ ((𝐺( linC ‘𝑀)(𝑆 ∖ {𝑥}))(+g𝑀)((𝑓𝑥)( ·𝑠𝑀)𝑥)) = 𝑍))
6325, 37, 60, 62syl3anc 1368 . . . . . . . 8 (((𝑓 ∈ (𝐵m 𝑆) ∧ 𝑓 finSupp 0 ) ∧ ((𝑆𝑉𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆))) → (((invg𝑀)‘((𝑓𝑥)( ·𝑠𝑀)𝑥)) = (𝐺( linC ‘𝑀)(𝑆 ∖ {𝑥})) ↔ ((𝐺( linC ‘𝑀)(𝑆 ∖ {𝑥}))(+g𝑀)((𝑓𝑥)( ·𝑠𝑀)𝑥)) = 𝑍))
6422, 63bitr4d 281 . . . . . . 7 (((𝑓 ∈ (𝐵m 𝑆) ∧ 𝑓 finSupp 0 ) ∧ ((𝑆𝑉𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆))) → ((𝑓( linC ‘𝑀)𝑆) = 𝑍 ↔ ((invg𝑀)‘((𝑓𝑥)( ·𝑠𝑀)𝑥)) = (𝐺( linC ‘𝑀)(𝑆 ∖ {𝑥}))))
65 eqcom 2732 . . . . . . . 8 (((invg𝑀)‘((𝑓𝑥)( ·𝑠𝑀)𝑥)) = (𝐺( linC ‘𝑀)(𝑆 ∖ {𝑥})) ↔ (𝐺( linC ‘𝑀)(𝑆 ∖ {𝑥})) = ((invg𝑀)‘((𝑓𝑥)( ·𝑠𝑀)𝑥)))
6615fveq2i 6899 . . . . . . . . . . . . . 14 (Base‘𝑅) = (Base‘(Scalar‘𝑀))
6716, 66eqtri 2753 . . . . . . . . . . . . 13 𝐵 = (Base‘(Scalar‘𝑀))
6867oveq1i 7429 . . . . . . . . . . . 12 (𝐵m (𝑆 ∖ {𝑥})) = ((Base‘(Scalar‘𝑀)) ↑m (𝑆 ∖ {𝑥}))
6953, 68eleqtrdi 2835 . . . . . . . . . . 11 (((𝑓 ∈ (𝐵m 𝑆) ∧ 𝑓 finSupp 0 ) ∧ ((𝑆𝑉𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆))) → 𝐺 ∈ ((Base‘(Scalar‘𝑀)) ↑m (𝑆 ∖ {𝑥})))
7039, 41elpwd 4610 . . . . . . . . . . . 12 (((𝑆𝑉𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆)) → (𝑆 ∖ {𝑥}) ∈ 𝒫 (Base‘𝑀))
7170adantl 480 . . . . . . . . . . 11 (((𝑓 ∈ (𝐵m 𝑆) ∧ 𝑓 finSupp 0 ) ∧ ((𝑆𝑉𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆))) → (𝑆 ∖ {𝑥}) ∈ 𝒫 (Base‘𝑀))
72 lincval 47663 . . . . . . . . . . 11 ((𝑀 ∈ LMod ∧ 𝐺 ∈ ((Base‘(Scalar‘𝑀)) ↑m (𝑆 ∖ {𝑥})) ∧ (𝑆 ∖ {𝑥}) ∈ 𝒫 (Base‘𝑀)) → (𝐺( linC ‘𝑀)(𝑆 ∖ {𝑥})) = (𝑀 Σg (𝑦 ∈ (𝑆 ∖ {𝑥}) ↦ ((𝐺𝑦)( ·𝑠𝑀)𝑦))))
7326, 69, 71, 72syl3anc 1368 . . . . . . . . . 10 (((𝑓 ∈ (𝐵m 𝑆) ∧ 𝑓 finSupp 0 ) ∧ ((𝑆𝑉𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆))) → (𝐺( linC ‘𝑀)(𝑆 ∖ {𝑥})) = (𝑀 Σg (𝑦 ∈ (𝑆 ∖ {𝑥}) ↦ ((𝐺𝑦)( ·𝑠𝑀)𝑦))))
7473eqeq1d 2727 . . . . . . . . 9 (((𝑓 ∈ (𝐵m 𝑆) ∧ 𝑓 finSupp 0 ) ∧ ((𝑆𝑉𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆))) → ((𝐺( linC ‘𝑀)(𝑆 ∖ {𝑥})) = ((invg𝑀)‘((𝑓𝑥)( ·𝑠𝑀)𝑥)) ↔ (𝑀 Σg (𝑦 ∈ (𝑆 ∖ {𝑥}) ↦ ((𝐺𝑦)( ·𝑠𝑀)𝑦))) = ((invg𝑀)‘((𝑓𝑥)( ·𝑠𝑀)𝑥))))
7512fveq1i 6897 . . . . . . . . . . . . . . . 16 (𝐺𝑦) = ((𝑓 ↾ (𝑆 ∖ {𝑥}))‘𝑦)
7675a1i 11 . . . . . . . . . . . . . . 15 ((((𝑓 ∈ (𝐵m 𝑆) ∧ 𝑓 finSupp 0 ) ∧ ((𝑆𝑉𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆))) ∧ 𝑦 ∈ (𝑆 ∖ {𝑥})) → (𝐺𝑦) = ((𝑓 ↾ (𝑆 ∖ {𝑥}))‘𝑦))
77 fvres 6915 . . . . . . . . . . . . . . . 16 (𝑦 ∈ (𝑆 ∖ {𝑥}) → ((𝑓 ↾ (𝑆 ∖ {𝑥}))‘𝑦) = (𝑓𝑦))
7877adantl 480 . . . . . . . . . . . . . . 15 ((((𝑓 ∈ (𝐵m 𝑆) ∧ 𝑓 finSupp 0 ) ∧ ((𝑆𝑉𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆))) ∧ 𝑦 ∈ (𝑆 ∖ {𝑥})) → ((𝑓 ↾ (𝑆 ∖ {𝑥}))‘𝑦) = (𝑓𝑦))
7976, 78eqtrd 2765 . . . . . . . . . . . . . 14 ((((𝑓 ∈ (𝐵m 𝑆) ∧ 𝑓 finSupp 0 ) ∧ ((𝑆𝑉𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆))) ∧ 𝑦 ∈ (𝑆 ∖ {𝑥})) → (𝐺𝑦) = (𝑓𝑦))
8079oveq1d 7434 . . . . . . . . . . . . 13 ((((𝑓 ∈ (𝐵m 𝑆) ∧ 𝑓 finSupp 0 ) ∧ ((𝑆𝑉𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆))) ∧ 𝑦 ∈ (𝑆 ∖ {𝑥})) → ((𝐺𝑦)( ·𝑠𝑀)𝑦) = ((𝑓𝑦)( ·𝑠𝑀)𝑦))
8180mpteq2dva 5249 . . . . . . . . . . . 12 (((𝑓 ∈ (𝐵m 𝑆) ∧ 𝑓 finSupp 0 ) ∧ ((𝑆𝑉𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆))) → (𝑦 ∈ (𝑆 ∖ {𝑥}) ↦ ((𝐺𝑦)( ·𝑠𝑀)𝑦)) = (𝑦 ∈ (𝑆 ∖ {𝑥}) ↦ ((𝑓𝑦)( ·𝑠𝑀)𝑦)))
8281oveq2d 7435 . . . . . . . . . . 11 (((𝑓 ∈ (𝐵m 𝑆) ∧ 𝑓 finSupp 0 ) ∧ ((𝑆𝑉𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆))) → (𝑀 Σg (𝑦 ∈ (𝑆 ∖ {𝑥}) ↦ ((𝐺𝑦)( ·𝑠𝑀)𝑦))) = (𝑀 Σg (𝑦 ∈ (𝑆 ∖ {𝑥}) ↦ ((𝑓𝑦)( ·𝑠𝑀)𝑦))))
83 eqid 2725 . . . . . . . . . . . . 13 (invg𝑅) = (invg𝑅)
8414, 15, 17, 61, 16, 83, 26, 35, 33lmodvsneg 20801 . . . . . . . . . . . 12 (((𝑓 ∈ (𝐵m 𝑆) ∧ 𝑓 finSupp 0 ) ∧ ((𝑆𝑉𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆))) → ((invg𝑀)‘((𝑓𝑥)( ·𝑠𝑀)𝑥)) = (((invg𝑅)‘(𝑓𝑥))( ·𝑠𝑀)𝑥))
8551eqcomi 2734 . . . . . . . . . . . . . 14 ((invg𝑅)‘(𝑓𝑥)) = 𝑌
8685a1i 11 . . . . . . . . . . . . 13 (((𝑓 ∈ (𝐵m 𝑆) ∧ 𝑓 finSupp 0 ) ∧ ((𝑆𝑉𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆))) → ((invg𝑅)‘(𝑓𝑥)) = 𝑌)
8786oveq1d 7434 . . . . . . . . . . . 12 (((𝑓 ∈ (𝐵m 𝑆) ∧ 𝑓 finSupp 0 ) ∧ ((𝑆𝑉𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆))) → (((invg𝑅)‘(𝑓𝑥))( ·𝑠𝑀)𝑥) = (𝑌( ·𝑠𝑀)𝑥))
8884, 87eqtrd 2765 . . . . . . . . . . 11 (((𝑓 ∈ (𝐵m 𝑆) ∧ 𝑓 finSupp 0 ) ∧ ((𝑆𝑉𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆))) → ((invg𝑀)‘((𝑓𝑥)( ·𝑠𝑀)𝑥)) = (𝑌( ·𝑠𝑀)𝑥))
8982, 88eqeq12d 2741 . . . . . . . . . 10 (((𝑓 ∈ (𝐵m 𝑆) ∧ 𝑓 finSupp 0 ) ∧ ((𝑆𝑉𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆))) → ((𝑀 Σg (𝑦 ∈ (𝑆 ∖ {𝑥}) ↦ ((𝐺𝑦)( ·𝑠𝑀)𝑦))) = ((invg𝑀)‘((𝑓𝑥)( ·𝑠𝑀)𝑥)) ↔ (𝑀 Σg (𝑦 ∈ (𝑆 ∖ {𝑥}) ↦ ((𝑓𝑦)( ·𝑠𝑀)𝑦))) = (𝑌( ·𝑠𝑀)𝑥)))
9089biimpd 228 . . . . . . . . 9 (((𝑓 ∈ (𝐵m 𝑆) ∧ 𝑓 finSupp 0 ) ∧ ((𝑆𝑉𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆))) → ((𝑀 Σg (𝑦 ∈ (𝑆 ∖ {𝑥}) ↦ ((𝐺𝑦)( ·𝑠𝑀)𝑦))) = ((invg𝑀)‘((𝑓𝑥)( ·𝑠𝑀)𝑥)) → (𝑀 Σg (𝑦 ∈ (𝑆 ∖ {𝑥}) ↦ ((𝑓𝑦)( ·𝑠𝑀)𝑦))) = (𝑌( ·𝑠𝑀)𝑥)))
9174, 90sylbid 239 . . . . . . . 8 (((𝑓 ∈ (𝐵m 𝑆) ∧ 𝑓 finSupp 0 ) ∧ ((𝑆𝑉𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆))) → ((𝐺( linC ‘𝑀)(𝑆 ∖ {𝑥})) = ((invg𝑀)‘((𝑓𝑥)( ·𝑠𝑀)𝑥)) → (𝑀 Σg (𝑦 ∈ (𝑆 ∖ {𝑥}) ↦ ((𝑓𝑦)( ·𝑠𝑀)𝑦))) = (𝑌( ·𝑠𝑀)𝑥)))
9265, 91biimtrid 241 . . . . . . 7 (((𝑓 ∈ (𝐵m 𝑆) ∧ 𝑓 finSupp 0 ) ∧ ((𝑆𝑉𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆))) → (((invg𝑀)‘((𝑓𝑥)( ·𝑠𝑀)𝑥)) = (𝐺( linC ‘𝑀)(𝑆 ∖ {𝑥})) → (𝑀 Σg (𝑦 ∈ (𝑆 ∖ {𝑥}) ↦ ((𝑓𝑦)( ·𝑠𝑀)𝑦))) = (𝑌( ·𝑠𝑀)𝑥)))
9364, 92sylbid 239 . . . . . 6 (((𝑓 ∈ (𝐵m 𝑆) ∧ 𝑓 finSupp 0 ) ∧ ((𝑆𝑉𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆))) → ((𝑓( linC ‘𝑀)𝑆) = 𝑍 → (𝑀 Σg (𝑦 ∈ (𝑆 ∖ {𝑥}) ↦ ((𝑓𝑦)( ·𝑠𝑀)𝑦))) = (𝑌( ·𝑠𝑀)𝑥)))
9493ex 411 . . . . 5 ((𝑓 ∈ (𝐵m 𝑆) ∧ 𝑓 finSupp 0 ) → (((𝑆𝑉𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆)) → ((𝑓( linC ‘𝑀)𝑆) = 𝑍 → (𝑀 Σg (𝑦 ∈ (𝑆 ∖ {𝑥}) ↦ ((𝑓𝑦)( ·𝑠𝑀)𝑦))) = (𝑌( ·𝑠𝑀)𝑥))))
9594com23 86 . . . 4 ((𝑓 ∈ (𝐵m 𝑆) ∧ 𝑓 finSupp 0 ) → ((𝑓( linC ‘𝑀)𝑆) = 𝑍 → (((𝑆𝑉𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆)) → (𝑀 Σg (𝑦 ∈ (𝑆 ∖ {𝑥}) ↦ ((𝑓𝑦)( ·𝑠𝑀)𝑦))) = (𝑌( ·𝑠𝑀)𝑥))))
96953impia 1114 . . 3 ((𝑓 ∈ (𝐵m 𝑆) ∧ 𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍) → (((𝑆𝑉𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆)) → (𝑀 Σg (𝑦 ∈ (𝑆 ∖ {𝑥}) ↦ ((𝑓𝑦)( ·𝑠𝑀)𝑦))) = (𝑌( ·𝑠𝑀)𝑥)))
9796com12 32 . 2 (((𝑆𝑉𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆)) → ((𝑓 ∈ (𝐵m 𝑆) ∧ 𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍) → (𝑀 Σg (𝑦 ∈ (𝑆 ∖ {𝑥}) ↦ ((𝑓𝑦)( ·𝑠𝑀)𝑦))) = (𝑌( ·𝑠𝑀)𝑥)))
98973impia 1114 1 (((𝑆𝑉𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥𝑆) ∧ (𝑓 ∈ (𝐵m 𝑆) ∧ 𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍)) → (𝑀 Σg (𝑦 ∈ (𝑆 ∖ {𝑥}) ↦ ((𝑓𝑦)( ·𝑠𝑀)𝑦))) = (𝑌( ·𝑠𝑀)𝑥))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 394  w3a 1084   = wceq 1533  wcel 2098  Vcvv 3461  cdif 3941  wss 3944  𝒫 cpw 4604  {csn 4630   class class class wbr 5149  cmpt 5232  cres 5680  wf 6545  cfv 6549  (class class class)co 7419  m cmap 8845   finSupp cfsupp 9387  Basecbs 17183  +gcplusg 17236  Scalarcsca 17239   ·𝑠 cvsca 17240  0gc0g 17424   Σg cgsu 17425  Grpcgrp 18898  invgcminusg 18899  LModclmod 20755   linC clinc 47658
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2166  ax-ext 2696  ax-rep 5286  ax-sep 5300  ax-nul 5307  ax-pow 5365  ax-pr 5429  ax-un 7741  ax-cnex 11196  ax-resscn 11197  ax-1cn 11198  ax-icn 11199  ax-addcl 11200  ax-addrcl 11201  ax-mulcl 11202  ax-mulrcl 11203  ax-mulcom 11204  ax-addass 11205  ax-mulass 11206  ax-distr 11207  ax-i2m1 11208  ax-1ne0 11209  ax-1rid 11210  ax-rnegex 11211  ax-rrecex 11212  ax-cnre 11213  ax-pre-lttri 11214  ax-pre-lttrn 11215  ax-pre-ltadd 11216  ax-pre-mulgt0 11217
This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3or 1085  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2528  df-eu 2557  df-clab 2703  df-cleq 2717  df-clel 2802  df-nfc 2877  df-ne 2930  df-nel 3036  df-ral 3051  df-rex 3060  df-rmo 3363  df-reu 3364  df-rab 3419  df-v 3463  df-sbc 3774  df-csb 3890  df-dif 3947  df-un 3949  df-in 3951  df-ss 3961  df-pss 3964  df-nul 4323  df-if 4531  df-pw 4606  df-sn 4631  df-pr 4633  df-op 4637  df-uni 4910  df-int 4951  df-iun 4999  df-iin 5000  df-br 5150  df-opab 5212  df-mpt 5233  df-tr 5267  df-id 5576  df-eprel 5582  df-po 5590  df-so 5591  df-fr 5633  df-se 5634  df-we 5635  df-xp 5684  df-rel 5685  df-cnv 5686  df-co 5687  df-dm 5688  df-rn 5689  df-res 5690  df-ima 5691  df-pred 6307  df-ord 6374  df-on 6375  df-lim 6376  df-suc 6377  df-iota 6501  df-fun 6551  df-fn 6552  df-f 6553  df-f1 6554  df-fo 6555  df-f1o 6556  df-fv 6557  df-isom 6558  df-riota 7375  df-ov 7422  df-oprab 7423  df-mpo 7424  df-of 7685  df-om 7872  df-1st 7994  df-2nd 7995  df-supp 8166  df-frecs 8287  df-wrecs 8318  df-recs 8392  df-rdg 8431  df-1o 8487  df-er 8725  df-map 8847  df-en 8965  df-dom 8966  df-sdom 8967  df-fin 8968  df-fsupp 9388  df-oi 9535  df-card 9964  df-pnf 11282  df-mnf 11283  df-xr 11284  df-ltxr 11285  df-le 11286  df-sub 11478  df-neg 11479  df-nn 12246  df-2 12308  df-n0 12506  df-z 12592  df-uz 12856  df-fz 13520  df-fzo 13663  df-seq 14003  df-hash 14326  df-sets 17136  df-slot 17154  df-ndx 17166  df-base 17184  df-ress 17213  df-plusg 17249  df-0g 17426  df-gsum 17427  df-mre 17569  df-mrc 17570  df-acs 17572  df-mgm 18603  df-sgrp 18682  df-mnd 18698  df-submnd 18744  df-grp 18901  df-minusg 18902  df-mulg 19032  df-cntz 19280  df-cmn 19749  df-abl 19750  df-mgp 20087  df-rng 20105  df-ur 20134  df-ring 20187  df-lmod 20757  df-linc 47660
This theorem is referenced by:  lindslinindsimp2lem5  47716
  Copyright terms: Public domain W3C validator