Theorem lindslinindsimp2lem5 48451

Description: Lemma 5 for lindslinindsimp2 48452. (Contributed by AV, 25-Apr-2019.) (Revised by AV, 30-Jul-2019.)

Hypotheses

Ref	Expression
lindslinind.r	⊢ 𝑅 = (Scalar‘𝑀)
lindslinind.b	⊢ 𝐵 = (Base‘𝑅)
lindslinind.0	⊢ 0 = (0g‘𝑅)
lindslinind.z	⊢ 𝑍 = (0g‘𝑀)

Assertion

Ref	Expression
lindslinindsimp2lem5	⊢ (((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆)) → ((𝑓 ∈ (𝐵 ↑m 𝑆) ∧ (𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍)) → (∀𝑦 ∈ (𝐵 ∖ { 0 })∀𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑥}))(¬ 𝑔 finSupp 0 ∨ ¬ (𝑦( ·𝑠 ‘𝑀)𝑥) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑥}))) → (𝑓‘𝑥) = 0 )))

Distinct variable groups:   𝐵,𝑓,𝑔,𝑦   𝑓,𝑀,𝑔,𝑦   𝑅,𝑓,𝑥   𝑆,𝑓,𝑔,𝑥,𝑦   𝑔,𝑉,𝑦   𝑓,𝑍,𝑔,𝑦   0 ,𝑓,𝑔,𝑥,𝑦   𝑅,𝑔,𝑦

Allowed substitution hints:   𝐵(𝑥)   𝑀(𝑥)   𝑉(𝑥,𝑓)   𝑍(𝑥)

Proof of Theorem lindslinindsimp2lem5

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ax-1 6	. . 3 ⊢ ((𝑓‘𝑥) = 0 → (∀𝑦 ∈ (𝐵 ∖ { 0 })∀𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑥}))(¬ 𝑔 finSupp 0 ∨ ¬ (𝑦( ·𝑠 ‘𝑀)𝑥) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑥}))) → (𝑓‘𝑥) = 0 ))
2	1	2a1d 26	. 2 ⊢ ((𝑓‘𝑥) = 0 → (((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆)) → ((𝑓 ∈ (𝐵 ↑m 𝑆) ∧ (𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍)) → (∀𝑦 ∈ (𝐵 ∖ { 0 })∀𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑥}))(¬ 𝑔 finSupp 0 ∨ ¬ (𝑦( ·𝑠 ‘𝑀)𝑥) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑥}))) → (𝑓‘𝑥) = 0 ))))
3		elmapi 8822	. . . . . . . . . 10 ⊢ (𝑓 ∈ (𝐵 ↑m 𝑆) → 𝑓:𝑆⟶𝐵)
4		ffvelcdm 7053	. . . . . . . . . . . . . 14 ⊢ ((𝑓:𝑆⟶𝐵 ∧ 𝑥 ∈ 𝑆) → (𝑓‘𝑥) ∈ 𝐵)
5	4	expcom 413	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ 𝑆 → (𝑓:𝑆⟶𝐵 → (𝑓‘𝑥) ∈ 𝐵))
6	5	adantl 481	. . . . . . . . . . . 12 ⊢ ((𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆) → (𝑓:𝑆⟶𝐵 → (𝑓‘𝑥) ∈ 𝐵))
7	6	adantl 481	. . . . . . . . . . 11 ⊢ (((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆)) → (𝑓:𝑆⟶𝐵 → (𝑓‘𝑥) ∈ 𝐵))
8	7	com12 32	. . . . . . . . . 10 ⊢ (𝑓:𝑆⟶𝐵 → (((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆)) → (𝑓‘𝑥) ∈ 𝐵))
9	3, 8	syl 17	. . . . . . . . 9 ⊢ (𝑓 ∈ (𝐵 ↑m 𝑆) → (((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆)) → (𝑓‘𝑥) ∈ 𝐵))
10	9	adantr 480	. . . . . . . 8 ⊢ ((𝑓 ∈ (𝐵 ↑m 𝑆) ∧ (𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍)) → (((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆)) → (𝑓‘𝑥) ∈ 𝐵))
11	10	impcom 407	. . . . . . 7 ⊢ ((((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆)) ∧ (𝑓 ∈ (𝐵 ↑m 𝑆) ∧ (𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍))) → (𝑓‘𝑥) ∈ 𝐵)
12	11	biantrurd 532	. . . . . 6 ⊢ ((((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆)) ∧ (𝑓 ∈ (𝐵 ↑m 𝑆) ∧ (𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍))) → ((𝑓‘𝑥) ≠ 0 ↔ ((𝑓‘𝑥) ∈ 𝐵 ∧ (𝑓‘𝑥) ≠ 0 )))
13		df-ne 2926	. . . . . . 7 ⊢ ((𝑓‘𝑥) ≠ 0 ↔ ¬ (𝑓‘𝑥) = 0 )
14	13	bicomi 224	. . . . . 6 ⊢ (¬ (𝑓‘𝑥) = 0 ↔ (𝑓‘𝑥) ≠ 0 )
15		eldifsn 4750	. . . . . 6 ⊢ ((𝑓‘𝑥) ∈ (𝐵 ∖ { 0 }) ↔ ((𝑓‘𝑥) ∈ 𝐵 ∧ (𝑓‘𝑥) ≠ 0 ))
16	12, 14, 15	3bitr4g 314	. . . . 5 ⊢ ((((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆)) ∧ (𝑓 ∈ (𝐵 ↑m 𝑆) ∧ (𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍))) → (¬ (𝑓‘𝑥) = 0 ↔ (𝑓‘𝑥) ∈ (𝐵 ∖ { 0 })))
17		lindslinind.r	. . . . . . . . . . 11 ⊢ 𝑅 = (Scalar‘𝑀)
18	17	lmodfgrp 20775	. . . . . . . . . 10 ⊢ (𝑀 ∈ LMod → 𝑅 ∈ Grp)
19	18	adantl 481	. . . . . . . . 9 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) → 𝑅 ∈ Grp)
20	19	adantr 480	. . . . . . . 8 ⊢ (((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆)) → 𝑅 ∈ Grp)
21	20	adantr 480	. . . . . . 7 ⊢ ((((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆)) ∧ (𝑓 ∈ (𝐵 ↑m 𝑆) ∧ (𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍))) → 𝑅 ∈ Grp)
22		lindslinind.b	. . . . . . . 8 ⊢ 𝐵 = (Base‘𝑅)
23		lindslinind.0	. . . . . . . 8 ⊢ 0 = (0g‘𝑅)
24		eqid 2729	. . . . . . . 8 ⊢ (invg‘𝑅) = (invg‘𝑅)
25	22, 23, 24	grpinvnzcl 18943	. . . . . . 7 ⊢ ((𝑅 ∈ Grp ∧ (𝑓‘𝑥) ∈ (𝐵 ∖ { 0 })) → ((invg‘𝑅)‘(𝑓‘𝑥)) ∈ (𝐵 ∖ { 0 }))
26	21, 25	sylan 580	. . . . . 6 ⊢ (((((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆)) ∧ (𝑓 ∈ (𝐵 ↑m 𝑆) ∧ (𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍))) ∧ (𝑓‘𝑥) ∈ (𝐵 ∖ { 0 })) → ((invg‘𝑅)‘(𝑓‘𝑥)) ∈ (𝐵 ∖ { 0 }))
27	26	ex 412	. . . . 5 ⊢ ((((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆)) ∧ (𝑓 ∈ (𝐵 ↑m 𝑆) ∧ (𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍))) → ((𝑓‘𝑥) ∈ (𝐵 ∖ { 0 }) → ((invg‘𝑅)‘(𝑓‘𝑥)) ∈ (𝐵 ∖ { 0 })))
28	16, 27	sylbid 240	. . . 4 ⊢ ((((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆)) ∧ (𝑓 ∈ (𝐵 ↑m 𝑆) ∧ (𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍))) → (¬ (𝑓‘𝑥) = 0 → ((invg‘𝑅)‘(𝑓‘𝑥)) ∈ (𝐵 ∖ { 0 })))
29		oveq1 7394	. . . . . . . . . . 11 ⊢ (𝑦 = ((invg‘𝑅)‘(𝑓‘𝑥)) → (𝑦( ·𝑠 ‘𝑀)𝑥) = (((invg‘𝑅)‘(𝑓‘𝑥))( ·𝑠 ‘𝑀)𝑥))
30	29	eqeq1d 2731	. . . . . . . . . 10 ⊢ (𝑦 = ((invg‘𝑅)‘(𝑓‘𝑥)) → ((𝑦( ·𝑠 ‘𝑀)𝑥) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑥})) ↔ (((invg‘𝑅)‘(𝑓‘𝑥))( ·𝑠 ‘𝑀)𝑥) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑥}))))
31	30	notbid 318	. . . . . . . . 9 ⊢ (𝑦 = ((invg‘𝑅)‘(𝑓‘𝑥)) → (¬ (𝑦( ·𝑠 ‘𝑀)𝑥) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑥})) ↔ ¬ (((invg‘𝑅)‘(𝑓‘𝑥))( ·𝑠 ‘𝑀)𝑥) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑥}))))
32	31	orbi2d 915	. . . . . . . 8 ⊢ (𝑦 = ((invg‘𝑅)‘(𝑓‘𝑥)) → ((¬ 𝑔 finSupp 0 ∨ ¬ (𝑦( ·𝑠 ‘𝑀)𝑥) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑥}))) ↔ (¬ 𝑔 finSupp 0 ∨ ¬ (((invg‘𝑅)‘(𝑓‘𝑥))( ·𝑠 ‘𝑀)𝑥) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑥})))))
33	32	ralbidv 3156	. . . . . . 7 ⊢ (𝑦 = ((invg‘𝑅)‘(𝑓‘𝑥)) → (∀𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑥}))(¬ 𝑔 finSupp 0 ∨ ¬ (𝑦( ·𝑠 ‘𝑀)𝑥) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑥}))) ↔ ∀𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑥}))(¬ 𝑔 finSupp 0 ∨ ¬ (((invg‘𝑅)‘(𝑓‘𝑥))( ·𝑠 ‘𝑀)𝑥) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑥})))))
34	33	rspcva 3586	. . . . . 6 ⊢ ((((invg‘𝑅)‘(𝑓‘𝑥)) ∈ (𝐵 ∖ { 0 }) ∧ ∀𝑦 ∈ (𝐵 ∖ { 0 })∀𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑥}))(¬ 𝑔 finSupp 0 ∨ ¬ (𝑦( ·𝑠 ‘𝑀)𝑥) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑥})))) → ∀𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑥}))(¬ 𝑔 finSupp 0 ∨ ¬ (((invg‘𝑅)‘(𝑓‘𝑥))( ·𝑠 ‘𝑀)𝑥) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑥}))))
35		simpl 482	. . . . . . . . 9 ⊢ (((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆)) → (𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod))
36	35	adantr 480	. . . . . . . 8 ⊢ ((((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆)) ∧ (𝑓 ∈ (𝐵 ↑m 𝑆) ∧ (𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍))) → (𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod))
37		simplrl 776	. . . . . . . 8 ⊢ ((((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆)) ∧ (𝑓 ∈ (𝐵 ↑m 𝑆) ∧ (𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍))) → 𝑆 ⊆ (Base‘𝑀))
38		simplrr 777	. . . . . . . 8 ⊢ ((((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆)) ∧ (𝑓 ∈ (𝐵 ↑m 𝑆) ∧ (𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍))) → 𝑥 ∈ 𝑆)
39		simpl 482	. . . . . . . . 9 ⊢ ((𝑓 ∈ (𝐵 ↑m 𝑆) ∧ (𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍)) → 𝑓 ∈ (𝐵 ↑m 𝑆))
40	39	adantl 481	. . . . . . . 8 ⊢ ((((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆)) ∧ (𝑓 ∈ (𝐵 ↑m 𝑆) ∧ (𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍))) → 𝑓 ∈ (𝐵 ↑m 𝑆))
41		lindslinind.z	. . . . . . . . 9 ⊢ 𝑍 = (0g‘𝑀)
42		eqid 2729	. . . . . . . . 9 ⊢ ((invg‘𝑅)‘(𝑓‘𝑥)) = ((invg‘𝑅)‘(𝑓‘𝑥))
43		eqid 2729	. . . . . . . . 9 ⊢ (𝑓 ↾ (𝑆 ∖ {𝑥})) = (𝑓 ↾ (𝑆 ∖ {𝑥}))
44	17, 22, 23, 41, 42, 43	lindslinindimp2lem2 48448	. . . . . . . 8 ⊢ (((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆 ∧ 𝑓 ∈ (𝐵 ↑m 𝑆))) → (𝑓 ↾ (𝑆 ∖ {𝑥})) ∈ (𝐵 ↑m (𝑆 ∖ {𝑥})))
45	36, 37, 38, 40, 44	syl13anc 1374	. . . . . . 7 ⊢ ((((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆)) ∧ (𝑓 ∈ (𝐵 ↑m 𝑆) ∧ (𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍))) → (𝑓 ↾ (𝑆 ∖ {𝑥})) ∈ (𝐵 ↑m (𝑆 ∖ {𝑥})))
46		id 22	. . . . . . . . . . . . . 14 ⊢ (𝑔 = (𝑓 ↾ (𝑆 ∖ {𝑥})) → 𝑔 = (𝑓 ↾ (𝑆 ∖ {𝑥})))
47	23	a1i 11	. . . . . . . . . . . . . 14 ⊢ (𝑔 = (𝑓 ↾ (𝑆 ∖ {𝑥})) → 0 = (0g‘𝑅))
48	46, 47	breq12d 5120	. . . . . . . . . . . . 13 ⊢ (𝑔 = (𝑓 ↾ (𝑆 ∖ {𝑥})) → (𝑔 finSupp 0 ↔ (𝑓 ↾ (𝑆 ∖ {𝑥})) finSupp (0g‘𝑅)))
49	48	notbid 318	. . . . . . . . . . . 12 ⊢ (𝑔 = (𝑓 ↾ (𝑆 ∖ {𝑥})) → (¬ 𝑔 finSupp 0 ↔ ¬ (𝑓 ↾ (𝑆 ∖ {𝑥})) finSupp (0g‘𝑅)))
50		oveq1 7394	. . . . . . . . . . . . . 14 ⊢ (𝑔 = (𝑓 ↾ (𝑆 ∖ {𝑥})) → (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑥})) = ((𝑓 ↾ (𝑆 ∖ {𝑥}))( linC ‘𝑀)(𝑆 ∖ {𝑥})))
51	50	eqeq2d 2740	. . . . . . . . . . . . 13 ⊢ (𝑔 = (𝑓 ↾ (𝑆 ∖ {𝑥})) → ((((invg‘𝑅)‘(𝑓‘𝑥))( ·𝑠 ‘𝑀)𝑥) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑥})) ↔ (((invg‘𝑅)‘(𝑓‘𝑥))( ·𝑠 ‘𝑀)𝑥) = ((𝑓 ↾ (𝑆 ∖ {𝑥}))( linC ‘𝑀)(𝑆 ∖ {𝑥}))))
52	51	notbid 318	. . . . . . . . . . . 12 ⊢ (𝑔 = (𝑓 ↾ (𝑆 ∖ {𝑥})) → (¬ (((invg‘𝑅)‘(𝑓‘𝑥))( ·𝑠 ‘𝑀)𝑥) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑥})) ↔ ¬ (((invg‘𝑅)‘(𝑓‘𝑥))( ·𝑠 ‘𝑀)𝑥) = ((𝑓 ↾ (𝑆 ∖ {𝑥}))( linC ‘𝑀)(𝑆 ∖ {𝑥}))))
53	49, 52	orbi12d 918	. . . . . . . . . . 11 ⊢ (𝑔 = (𝑓 ↾ (𝑆 ∖ {𝑥})) → ((¬ 𝑔 finSupp 0 ∨ ¬ (((invg‘𝑅)‘(𝑓‘𝑥))( ·𝑠 ‘𝑀)𝑥) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑥}))) ↔ (¬ (𝑓 ↾ (𝑆 ∖ {𝑥})) finSupp (0g‘𝑅) ∨ ¬ (((invg‘𝑅)‘(𝑓‘𝑥))( ·𝑠 ‘𝑀)𝑥) = ((𝑓 ↾ (𝑆 ∖ {𝑥}))( linC ‘𝑀)(𝑆 ∖ {𝑥})))))
54	53	rspcva 3586	. . . . . . . . . 10 ⊢ (((𝑓 ↾ (𝑆 ∖ {𝑥})) ∈ (𝐵 ↑m (𝑆 ∖ {𝑥})) ∧ ∀𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑥}))(¬ 𝑔 finSupp 0 ∨ ¬ (((invg‘𝑅)‘(𝑓‘𝑥))( ·𝑠 ‘𝑀)𝑥) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑥})))) → (¬ (𝑓 ↾ (𝑆 ∖ {𝑥})) finSupp (0g‘𝑅) ∨ ¬ (((invg‘𝑅)‘(𝑓‘𝑥))( ·𝑠 ‘𝑀)𝑥) = ((𝑓 ↾ (𝑆 ∖ {𝑥}))( linC ‘𝑀)(𝑆 ∖ {𝑥}))))
55	23	breq2i 5115	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑓 finSupp 0 ↔ 𝑓 finSupp (0g‘𝑅))
56	55	biimpi 216	. . . . . . . . . . . . . . . . 17 ⊢ (𝑓 finSupp 0 → 𝑓 finSupp (0g‘𝑅))
57	56	adantr 480	. . . . . . . . . . . . . . . 16 ⊢ ((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍) → 𝑓 finSupp (0g‘𝑅))
58	57	adantl 481	. . . . . . . . . . . . . . 15 ⊢ ((𝑓 ∈ (𝐵 ↑m 𝑆) ∧ (𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍)) → 𝑓 finSupp (0g‘𝑅))
59	58	adantl 481	. . . . . . . . . . . . . 14 ⊢ ((((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆)) ∧ (𝑓 ∈ (𝐵 ↑m 𝑆) ∧ (𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍))) → 𝑓 finSupp (0g‘𝑅))
60		fvexd 6873	. . . . . . . . . . . . . 14 ⊢ ((((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆)) ∧ (𝑓 ∈ (𝐵 ↑m 𝑆) ∧ (𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍))) → (0g‘𝑅) ∈ V)
61	59, 60	fsuppres 9344	. . . . . . . . . . . . 13 ⊢ ((((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆)) ∧ (𝑓 ∈ (𝐵 ↑m 𝑆) ∧ (𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍))) → (𝑓 ↾ (𝑆 ∖ {𝑥})) finSupp (0g‘𝑅))
62	61	pm2.24d 151	. . . . . . . . . . . 12 ⊢ ((((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆)) ∧ (𝑓 ∈ (𝐵 ↑m 𝑆) ∧ (𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍))) → (¬ (𝑓 ↾ (𝑆 ∖ {𝑥})) finSupp (0g‘𝑅) → (𝑓‘𝑥) = 0 ))
63	62	com12 32	. . . . . . . . . . 11 ⊢ (¬ (𝑓 ↾ (𝑆 ∖ {𝑥})) finSupp (0g‘𝑅) → ((((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆)) ∧ (𝑓 ∈ (𝐵 ↑m 𝑆) ∧ (𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍))) → (𝑓‘𝑥) = 0 ))
64		simplr 768	. . . . . . . . . . . . . . . 16 ⊢ (((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆)) → 𝑀 ∈ LMod)
65	64	adantr 480	. . . . . . . . . . . . . . 15 ⊢ ((((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆)) ∧ (𝑓 ∈ (𝐵 ↑m 𝑆) ∧ (𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍))) → 𝑀 ∈ LMod)
66	17	fveq2i 6861	. . . . . . . . . . . . . . . . . 18 ⊢ (Base‘𝑅) = (Base‘(Scalar‘𝑀))
67	22, 66	eqtr2i 2753	. . . . . . . . . . . . . . . . 17 ⊢ (Base‘(Scalar‘𝑀)) = 𝐵
68	67	oveq1i 7397	. . . . . . . . . . . . . . . 16 ⊢ ((Base‘(Scalar‘𝑀)) ↑m (𝑆 ∖ {𝑥})) = (𝐵 ↑m (𝑆 ∖ {𝑥}))
69	45, 68	eleqtrrdi 2839	. . . . . . . . . . . . . . 15 ⊢ ((((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆)) ∧ (𝑓 ∈ (𝐵 ↑m 𝑆) ∧ (𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍))) → (𝑓 ↾ (𝑆 ∖ {𝑥})) ∈ ((Base‘(Scalar‘𝑀)) ↑m (𝑆 ∖ {𝑥})))
70		ssdifss 4103	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑆 ⊆ (Base‘𝑀) → (𝑆 ∖ {𝑥}) ⊆ (Base‘𝑀))
71	70	adantr 480	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆) → (𝑆 ∖ {𝑥}) ⊆ (Base‘𝑀))
72	71	adantl 481	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆)) → (𝑆 ∖ {𝑥}) ⊆ (Base‘𝑀))
73		difexg 5284	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑆 ∈ 𝑉 → (𝑆 ∖ {𝑥}) ∈ V)
74	73	adantr 480	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) → (𝑆 ∖ {𝑥}) ∈ V)
75	74	adantr 480	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆)) → (𝑆 ∖ {𝑥}) ∈ V)
76		elpwg 4566	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑆 ∖ {𝑥}) ∈ V → ((𝑆 ∖ {𝑥}) ∈ 𝒫 (Base‘𝑀) ↔ (𝑆 ∖ {𝑥}) ⊆ (Base‘𝑀)))
77	75, 76	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆)) → ((𝑆 ∖ {𝑥}) ∈ 𝒫 (Base‘𝑀) ↔ (𝑆 ∖ {𝑥}) ⊆ (Base‘𝑀)))
78	72, 77	mpbird 257	. . . . . . . . . . . . . . . 16 ⊢ (((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆)) → (𝑆 ∖ {𝑥}) ∈ 𝒫 (Base‘𝑀))
79	78	adantr 480	. . . . . . . . . . . . . . 15 ⊢ ((((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆)) ∧ (𝑓 ∈ (𝐵 ↑m 𝑆) ∧ (𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍))) → (𝑆 ∖ {𝑥}) ∈ 𝒫 (Base‘𝑀))
80		lincval 48398	. . . . . . . . . . . . . . 15 ⊢ ((𝑀 ∈ LMod ∧ (𝑓 ↾ (𝑆 ∖ {𝑥})) ∈ ((Base‘(Scalar‘𝑀)) ↑m (𝑆 ∖ {𝑥})) ∧ (𝑆 ∖ {𝑥}) ∈ 𝒫 (Base‘𝑀)) → ((𝑓 ↾ (𝑆 ∖ {𝑥}))( linC ‘𝑀)(𝑆 ∖ {𝑥})) = (𝑀 Σg (𝑧 ∈ (𝑆 ∖ {𝑥}) ↦ (((𝑓 ↾ (𝑆 ∖ {𝑥}))‘𝑧)( ·𝑠 ‘𝑀)𝑧))))
81	65, 69, 79, 80	syl3anc 1373	. . . . . . . . . . . . . 14 ⊢ ((((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆)) ∧ (𝑓 ∈ (𝐵 ↑m 𝑆) ∧ (𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍))) → ((𝑓 ↾ (𝑆 ∖ {𝑥}))( linC ‘𝑀)(𝑆 ∖ {𝑥})) = (𝑀 Σg (𝑧 ∈ (𝑆 ∖ {𝑥}) ↦ (((𝑓 ↾ (𝑆 ∖ {𝑥}))‘𝑧)( ·𝑠 ‘𝑀)𝑧))))
82		fvres 6877	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑧 ∈ (𝑆 ∖ {𝑥}) → ((𝑓 ↾ (𝑆 ∖ {𝑥}))‘𝑧) = (𝑓‘𝑧))
83	82	adantl 481	. . . . . . . . . . . . . . . . 17 ⊢ (((((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆)) ∧ (𝑓 ∈ (𝐵 ↑m 𝑆) ∧ (𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍))) ∧ 𝑧 ∈ (𝑆 ∖ {𝑥})) → ((𝑓 ↾ (𝑆 ∖ {𝑥}))‘𝑧) = (𝑓‘𝑧))
84	83	oveq1d 7402	. . . . . . . . . . . . . . . 16 ⊢ (((((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆)) ∧ (𝑓 ∈ (𝐵 ↑m 𝑆) ∧ (𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍))) ∧ 𝑧 ∈ (𝑆 ∖ {𝑥})) → (((𝑓 ↾ (𝑆 ∖ {𝑥}))‘𝑧)( ·𝑠 ‘𝑀)𝑧) = ((𝑓‘𝑧)( ·𝑠 ‘𝑀)𝑧))
85	84	mpteq2dva 5200	. . . . . . . . . . . . . . 15 ⊢ ((((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆)) ∧ (𝑓 ∈ (𝐵 ↑m 𝑆) ∧ (𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍))) → (𝑧 ∈ (𝑆 ∖ {𝑥}) ↦ (((𝑓 ↾ (𝑆 ∖ {𝑥}))‘𝑧)( ·𝑠 ‘𝑀)𝑧)) = (𝑧 ∈ (𝑆 ∖ {𝑥}) ↦ ((𝑓‘𝑧)( ·𝑠 ‘𝑀)𝑧)))
86	85	oveq2d 7403	. . . . . . . . . . . . . 14 ⊢ ((((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆)) ∧ (𝑓 ∈ (𝐵 ↑m 𝑆) ∧ (𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍))) → (𝑀 Σg (𝑧 ∈ (𝑆 ∖ {𝑥}) ↦ (((𝑓 ↾ (𝑆 ∖ {𝑥}))‘𝑧)( ·𝑠 ‘𝑀)𝑧))) = (𝑀 Σg (𝑧 ∈ (𝑆 ∖ {𝑥}) ↦ ((𝑓‘𝑧)( ·𝑠 ‘𝑀)𝑧))))
87		simplr 768	. . . . . . . . . . . . . . 15 ⊢ ((((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆)) ∧ (𝑓 ∈ (𝐵 ↑m 𝑆) ∧ (𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍))) → (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆))
88		3anass 1094	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑓 ∈ (𝐵 ↑m 𝑆) ∧ 𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍) ↔ (𝑓 ∈ (𝐵 ↑m 𝑆) ∧ (𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍)))
89	88	bicomi 224	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑓 ∈ (𝐵 ↑m 𝑆) ∧ (𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍)) ↔ (𝑓 ∈ (𝐵 ↑m 𝑆) ∧ 𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍))
90	89	biimpi 216	. . . . . . . . . . . . . . . 16 ⊢ ((𝑓 ∈ (𝐵 ↑m 𝑆) ∧ (𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍)) → (𝑓 ∈ (𝐵 ↑m 𝑆) ∧ 𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍))
91	90	adantl 481	. . . . . . . . . . . . . . 15 ⊢ ((((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆)) ∧ (𝑓 ∈ (𝐵 ↑m 𝑆) ∧ (𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍))) → (𝑓 ∈ (𝐵 ↑m 𝑆) ∧ 𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍))
92	17, 22, 23, 41, 42, 43	lindslinindimp2lem4 48450	. . . . . . . . . . . . . . 15 ⊢ (((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆) ∧ (𝑓 ∈ (𝐵 ↑m 𝑆) ∧ 𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍)) → (𝑀 Σg (𝑧 ∈ (𝑆 ∖ {𝑥}) ↦ ((𝑓‘𝑧)( ·𝑠 ‘𝑀)𝑧))) = (((invg‘𝑅)‘(𝑓‘𝑥))( ·𝑠 ‘𝑀)𝑥))
93	36, 87, 91, 92	syl3anc 1373	. . . . . . . . . . . . . 14 ⊢ ((((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆)) ∧ (𝑓 ∈ (𝐵 ↑m 𝑆) ∧ (𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍))) → (𝑀 Σg (𝑧 ∈ (𝑆 ∖ {𝑥}) ↦ ((𝑓‘𝑧)( ·𝑠 ‘𝑀)𝑧))) = (((invg‘𝑅)‘(𝑓‘𝑥))( ·𝑠 ‘𝑀)𝑥))
94	81, 86, 93	3eqtrrd 2769	. . . . . . . . . . . . 13 ⊢ ((((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆)) ∧ (𝑓 ∈ (𝐵 ↑m 𝑆) ∧ (𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍))) → (((invg‘𝑅)‘(𝑓‘𝑥))( ·𝑠 ‘𝑀)𝑥) = ((𝑓 ↾ (𝑆 ∖ {𝑥}))( linC ‘𝑀)(𝑆 ∖ {𝑥})))
95	94	pm2.24d 151	. . . . . . . . . . . 12 ⊢ ((((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆)) ∧ (𝑓 ∈ (𝐵 ↑m 𝑆) ∧ (𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍))) → (¬ (((invg‘𝑅)‘(𝑓‘𝑥))( ·𝑠 ‘𝑀)𝑥) = ((𝑓 ↾ (𝑆 ∖ {𝑥}))( linC ‘𝑀)(𝑆 ∖ {𝑥})) → (𝑓‘𝑥) = 0 ))
96	95	com12 32	. . . . . . . . . . 11 ⊢ (¬ (((invg‘𝑅)‘(𝑓‘𝑥))( ·𝑠 ‘𝑀)𝑥) = ((𝑓 ↾ (𝑆 ∖ {𝑥}))( linC ‘𝑀)(𝑆 ∖ {𝑥})) → ((((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆)) ∧ (𝑓 ∈ (𝐵 ↑m 𝑆) ∧ (𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍))) → (𝑓‘𝑥) = 0 ))
97	63, 96	jaoi 857	. . . . . . . . . 10 ⊢ ((¬ (𝑓 ↾ (𝑆 ∖ {𝑥})) finSupp (0g‘𝑅) ∨ ¬ (((invg‘𝑅)‘(𝑓‘𝑥))( ·𝑠 ‘𝑀)𝑥) = ((𝑓 ↾ (𝑆 ∖ {𝑥}))( linC ‘𝑀)(𝑆 ∖ {𝑥}))) → ((((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆)) ∧ (𝑓 ∈ (𝐵 ↑m 𝑆) ∧ (𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍))) → (𝑓‘𝑥) = 0 ))
98	54, 97	syl 17	. . . . . . . . 9 ⊢ (((𝑓 ↾ (𝑆 ∖ {𝑥})) ∈ (𝐵 ↑m (𝑆 ∖ {𝑥})) ∧ ∀𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑥}))(¬ 𝑔 finSupp 0 ∨ ¬ (((invg‘𝑅)‘(𝑓‘𝑥))( ·𝑠 ‘𝑀)𝑥) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑥})))) → ((((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆)) ∧ (𝑓 ∈ (𝐵 ↑m 𝑆) ∧ (𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍))) → (𝑓‘𝑥) = 0 ))
99	98	ex 412	. . . . . . . 8 ⊢ ((𝑓 ↾ (𝑆 ∖ {𝑥})) ∈ (𝐵 ↑m (𝑆 ∖ {𝑥})) → (∀𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑥}))(¬ 𝑔 finSupp 0 ∨ ¬ (((invg‘𝑅)‘(𝑓‘𝑥))( ·𝑠 ‘𝑀)𝑥) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑥}))) → ((((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆)) ∧ (𝑓 ∈ (𝐵 ↑m 𝑆) ∧ (𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍))) → (𝑓‘𝑥) = 0 )))
100	99	com23 86	. . . . . . 7 ⊢ ((𝑓 ↾ (𝑆 ∖ {𝑥})) ∈ (𝐵 ↑m (𝑆 ∖ {𝑥})) → ((((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆)) ∧ (𝑓 ∈ (𝐵 ↑m 𝑆) ∧ (𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍))) → (∀𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑥}))(¬ 𝑔 finSupp 0 ∨ ¬ (((invg‘𝑅)‘(𝑓‘𝑥))( ·𝑠 ‘𝑀)𝑥) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑥}))) → (𝑓‘𝑥) = 0 )))
101	45, 100	mpcom 38	. . . . . 6 ⊢ ((((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆)) ∧ (𝑓 ∈ (𝐵 ↑m 𝑆) ∧ (𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍))) → (∀𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑥}))(¬ 𝑔 finSupp 0 ∨ ¬ (((invg‘𝑅)‘(𝑓‘𝑥))( ·𝑠 ‘𝑀)𝑥) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑥}))) → (𝑓‘𝑥) = 0 ))
102	34, 101	syl5 34	. . . . 5 ⊢ ((((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆)) ∧ (𝑓 ∈ (𝐵 ↑m 𝑆) ∧ (𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍))) → ((((invg‘𝑅)‘(𝑓‘𝑥)) ∈ (𝐵 ∖ { 0 }) ∧ ∀𝑦 ∈ (𝐵 ∖ { 0 })∀𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑥}))(¬ 𝑔 finSupp 0 ∨ ¬ (𝑦( ·𝑠 ‘𝑀)𝑥) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑥})))) → (𝑓‘𝑥) = 0 ))
103	102	expd 415	. . . 4 ⊢ ((((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆)) ∧ (𝑓 ∈ (𝐵 ↑m 𝑆) ∧ (𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍))) → (((invg‘𝑅)‘(𝑓‘𝑥)) ∈ (𝐵 ∖ { 0 }) → (∀𝑦 ∈ (𝐵 ∖ { 0 })∀𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑥}))(¬ 𝑔 finSupp 0 ∨ ¬ (𝑦( ·𝑠 ‘𝑀)𝑥) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑥}))) → (𝑓‘𝑥) = 0 )))
104	28, 103	syldc 48	. . 3 ⊢ (¬ (𝑓‘𝑥) = 0 → ((((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆)) ∧ (𝑓 ∈ (𝐵 ↑m 𝑆) ∧ (𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍))) → (∀𝑦 ∈ (𝐵 ∖ { 0 })∀𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑥}))(¬ 𝑔 finSupp 0 ∨ ¬ (𝑦( ·𝑠 ‘𝑀)𝑥) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑥}))) → (𝑓‘𝑥) = 0 )))
105	104	expd 415	. 2 ⊢ (¬ (𝑓‘𝑥) = 0 → (((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆)) → ((𝑓 ∈ (𝐵 ↑m 𝑆) ∧ (𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍)) → (∀𝑦 ∈ (𝐵 ∖ { 0 })∀𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑥}))(¬ 𝑔 finSupp 0 ∨ ¬ (𝑦( ·𝑠 ‘𝑀)𝑥) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑥}))) → (𝑓‘𝑥) = 0 ))))
106	2, 105	pm2.61i 182	1 ⊢ (((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆)) → ((𝑓 ∈ (𝐵 ↑m 𝑆) ∧ (𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍)) → (∀𝑦 ∈ (𝐵 ∖ { 0 })∀𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑥}))(¬ 𝑔 finSupp 0 ∨ ¬ (𝑦( ·𝑠 ‘𝑀)𝑥) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑥}))) → (𝑓‘𝑥) = 0 )))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   ∨ wo 847   ∧ w3a 1086   = wceq 1540   ∈ wcel 2109   ≠ wne 2925  ∀wral 3044  Vcvv 3447   ∖ cdif 3911   ⊆ wss 3914  𝒫 cpw 4563  {csn 4589   class class class wbr 5107   ↦ cmpt 5188   ↾ cres 5640  ⟶wf 6507  ‘cfv 6511  (class class class)co 7387   ↑_m cmap 8799   finSupp cfsupp 9312  Basecbs 17179  Scalarcsca 17223   ·_𝑠 cvsca 17224  0_gc0g 17402   Σ_g cgsu 17403  Grpcgrp 18865  inv_gcminusg 18866  LModclmod 20766   linC clinc 48393

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 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5234  ax-sep 5251  ax-nul 5261  ax-pow 5320  ax-pr 5387  ax-un 7711  ax-cnex 11124  ax-resscn 11125  ax-1cn 11126  ax-icn 11127  ax-addcl 11128  ax-addrcl 11129  ax-mulcl 11130  ax-mulrcl 11131  ax-mulcom 11132  ax-addass 11133  ax-mulass 11134  ax-distr 11135  ax-i2m1 11136  ax-1ne0 11137  ax-1rid 11138  ax-rnegex 11139  ax-rrecex 11140  ax-cnre 11141  ax-pre-lttri 11142  ax-pre-lttrn 11143  ax-pre-ltadd 11144  ax-pre-mulgt0 11145

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-nel 3030  df-ral 3045  df-rex 3054  df-rmo 3354  df-reu 3355  df-rab 3406  df-v 3449  df-sbc 3754  df-csb 3863  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-pss 3934  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-int 4911  df-iun 4957  df-iin 4958  df-br 5108  df-opab 5170  df-mpt 5189  df-tr 5215  df-id 5533  df-eprel 5538  df-po 5546  df-so 5547  df-fr 5591  df-se 5592  df-we 5593  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-pred 6274  df-ord 6335  df-on 6336  df-lim 6337  df-suc 6338  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-f1 6516  df-fo 6517  df-f1o 6518  df-fv 6519  df-isom 6520  df-riota 7344  df-ov 7390  df-oprab 7391  df-mpo 7392  df-of 7653  df-om 7843  df-1st 7968  df-2nd 7969  df-supp 8140  df-frecs 8260  df-wrecs 8291  df-recs 8340  df-rdg 8378  df-1o 8434  df-2o 8435  df-er 8671  df-map 8801  df-en 8919  df-dom 8920  df-sdom 8921  df-fin 8922  df-fsupp 9313  df-oi 9463  df-card 9892  df-pnf 11210  df-mnf 11211  df-xr 11212  df-ltxr 11213  df-le 11214  df-sub 11407  df-neg 11408  df-nn 12187  df-2 12249  df-n0 12443  df-z 12530  df-uz 12794  df-fz 13469  df-fzo 13616  df-seq 13967  df-hash 14296  df-sets 17134  df-slot 17152  df-ndx 17164  df-base 17180  df-ress 17201  df-plusg 17233  df-0g 17404  df-gsum 17405  df-mre 17547  df-mrc 17548  df-acs 17550  df-mgm 18567  df-sgrp 18646  df-mnd 18662  df-submnd 18711  df-grp 18868  df-minusg 18869  df-mulg 19000  df-cntz 19249  df-cmn 19712  df-abl 19713  df-mgp 20050  df-rng 20062  df-ur 20091  df-ring 20144  df-lmod 20768  df-linc 48395

This theorem is referenced by:  lindslinindsimp2  48452