Theorem lindslinindsimp2 47454

Description: Implication 2 for lindslininds 47455. (Contributed by AV, 26-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
lindslinindsimp2	⊢ ((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) → ((𝑆 ⊆ (Base‘𝑀) ∧ ∀𝑠 ∈ 𝑆 ∀𝑦 ∈ (𝐵 ∖ { 0 }) ¬ (𝑦( ·𝑠 ‘𝑀)𝑠) ∈ ((LSpan‘𝑀)‘(𝑆 ∖ {𝑠}))) → (𝑆 ∈ 𝒫 (Base‘𝑀) ∧ ∀𝑓 ∈ (𝐵 ↑m 𝑆)((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍) → ∀𝑥 ∈ 𝑆 (𝑓‘𝑥) = 0 ))))

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

Proof of Theorem lindslinindsimp2

Dummy variable 𝑔 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		simprl 770	. . . 4 ⊢ (((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ ∀𝑠 ∈ 𝑆 ∀𝑦 ∈ (𝐵 ∖ { 0 }) ¬ (𝑦( ·𝑠 ‘𝑀)𝑠) ∈ ((LSpan‘𝑀)‘(𝑆 ∖ {𝑠})))) → 𝑆 ⊆ (Base‘𝑀))
2		elpwg 4601	. . . . 5 ⊢ (𝑆 ∈ 𝑉 → (𝑆 ∈ 𝒫 (Base‘𝑀) ↔ 𝑆 ⊆ (Base‘𝑀)))
3	2	ad2antrr 725	. . . 4 ⊢ (((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ ∀𝑠 ∈ 𝑆 ∀𝑦 ∈ (𝐵 ∖ { 0 }) ¬ (𝑦( ·𝑠 ‘𝑀)𝑠) ∈ ((LSpan‘𝑀)‘(𝑆 ∖ {𝑠})))) → (𝑆 ∈ 𝒫 (Base‘𝑀) ↔ 𝑆 ⊆ (Base‘𝑀)))
4	1, 3	mpbird 257	. . 3 ⊢ (((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ ∀𝑠 ∈ 𝑆 ∀𝑦 ∈ (𝐵 ∖ { 0 }) ¬ (𝑦( ·𝑠 ‘𝑀)𝑠) ∈ ((LSpan‘𝑀)‘(𝑆 ∖ {𝑠})))) → 𝑆 ∈ 𝒫 (Base‘𝑀))
5		simplr 768	. . . . . . . . 9 ⊢ (((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ 𝑆 ⊆ (Base‘𝑀)) → 𝑀 ∈ LMod)
6		ssdifss 4131	. . . . . . . . . . 11 ⊢ (𝑆 ⊆ (Base‘𝑀) → (𝑆 ∖ {𝑠}) ⊆ (Base‘𝑀))
7	6	adantl 481	. . . . . . . . . 10 ⊢ (((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ 𝑆 ⊆ (Base‘𝑀)) → (𝑆 ∖ {𝑠}) ⊆ (Base‘𝑀))
8		difexg 5323	. . . . . . . . . . . 12 ⊢ (𝑆 ∈ 𝑉 → (𝑆 ∖ {𝑠}) ∈ V)
9	8	ad2antrr 725	. . . . . . . . . . 11 ⊢ (((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ 𝑆 ⊆ (Base‘𝑀)) → (𝑆 ∖ {𝑠}) ∈ V)
10		elpwg 4601	. . . . . . . . . . 11 ⊢ ((𝑆 ∖ {𝑠}) ∈ V → ((𝑆 ∖ {𝑠}) ∈ 𝒫 (Base‘𝑀) ↔ (𝑆 ∖ {𝑠}) ⊆ (Base‘𝑀)))
11	9, 10	syl 17	. . . . . . . . . 10 ⊢ (((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ 𝑆 ⊆ (Base‘𝑀)) → ((𝑆 ∖ {𝑠}) ∈ 𝒫 (Base‘𝑀) ↔ (𝑆 ∖ {𝑠}) ⊆ (Base‘𝑀)))
12	7, 11	mpbird 257	. . . . . . . . 9 ⊢ (((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ 𝑆 ⊆ (Base‘𝑀)) → (𝑆 ∖ {𝑠}) ∈ 𝒫 (Base‘𝑀))
13		eqid 2727	. . . . . . . . . . . 12 ⊢ (Base‘𝑀) = (Base‘𝑀)
14	13	lspeqlco 47430	. . . . . . . . . . 11 ⊢ ((𝑀 ∈ LMod ∧ (𝑆 ∖ {𝑠}) ∈ 𝒫 (Base‘𝑀)) → (𝑀 LinCo (𝑆 ∖ {𝑠})) = ((LSpan‘𝑀)‘(𝑆 ∖ {𝑠})))
15	14	eleq2d 2814	. . . . . . . . . 10 ⊢ ((𝑀 ∈ LMod ∧ (𝑆 ∖ {𝑠}) ∈ 𝒫 (Base‘𝑀)) → ((𝑦( ·𝑠 ‘𝑀)𝑠) ∈ (𝑀 LinCo (𝑆 ∖ {𝑠})) ↔ (𝑦( ·𝑠 ‘𝑀)𝑠) ∈ ((LSpan‘𝑀)‘(𝑆 ∖ {𝑠}))))
16	15	bicomd 222	. . . . . . . . 9 ⊢ ((𝑀 ∈ LMod ∧ (𝑆 ∖ {𝑠}) ∈ 𝒫 (Base‘𝑀)) → ((𝑦( ·𝑠 ‘𝑀)𝑠) ∈ ((LSpan‘𝑀)‘(𝑆 ∖ {𝑠})) ↔ (𝑦( ·𝑠 ‘𝑀)𝑠) ∈ (𝑀 LinCo (𝑆 ∖ {𝑠}))))
17	5, 12, 16	syl2anc 583	. . . . . . . 8 ⊢ (((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ 𝑆 ⊆ (Base‘𝑀)) → ((𝑦( ·𝑠 ‘𝑀)𝑠) ∈ ((LSpan‘𝑀)‘(𝑆 ∖ {𝑠})) ↔ (𝑦( ·𝑠 ‘𝑀)𝑠) ∈ (𝑀 LinCo (𝑆 ∖ {𝑠}))))
18	17	notbid 318	. . . . . . 7 ⊢ (((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ 𝑆 ⊆ (Base‘𝑀)) → (¬ (𝑦( ·𝑠 ‘𝑀)𝑠) ∈ ((LSpan‘𝑀)‘(𝑆 ∖ {𝑠})) ↔ ¬ (𝑦( ·𝑠 ‘𝑀)𝑠) ∈ (𝑀 LinCo (𝑆 ∖ {𝑠}))))
19		lindslinind.r	. . . . . . . . . . . 12 ⊢ 𝑅 = (Scalar‘𝑀)
20		lindslinind.b	. . . . . . . . . . . 12 ⊢ 𝐵 = (Base‘𝑅)
21	13, 19, 20	lcoval 47403	. . . . . . . . . . 11 ⊢ ((𝑀 ∈ LMod ∧ (𝑆 ∖ {𝑠}) ∈ 𝒫 (Base‘𝑀)) → ((𝑦( ·𝑠 ‘𝑀)𝑠) ∈ (𝑀 LinCo (𝑆 ∖ {𝑠})) ↔ ((𝑦( ·𝑠 ‘𝑀)𝑠) ∈ (Base‘𝑀) ∧ ∃𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑠}))(𝑔 finSupp (0g‘𝑅) ∧ (𝑦( ·𝑠 ‘𝑀)𝑠) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑠}))))))
22		lindslinind.0	. . . . . . . . . . . . . . . 16 ⊢ 0 = (0g‘𝑅)
23	22	eqcomi 2736	. . . . . . . . . . . . . . 15 ⊢ (0g‘𝑅) = 0
24	23	breq2i 5150	. . . . . . . . . . . . . 14 ⊢ (𝑔 finSupp (0g‘𝑅) ↔ 𝑔 finSupp 0 )
25	24	anbi1i 623	. . . . . . . . . . . . 13 ⊢ ((𝑔 finSupp (0g‘𝑅) ∧ (𝑦( ·𝑠 ‘𝑀)𝑠) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑠}))) ↔ (𝑔 finSupp 0 ∧ (𝑦( ·𝑠 ‘𝑀)𝑠) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑠}))))
26	25	rexbii 3089	. . . . . . . . . . . 12 ⊢ (∃𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑠}))(𝑔 finSupp (0g‘𝑅) ∧ (𝑦( ·𝑠 ‘𝑀)𝑠) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑠}))) ↔ ∃𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑠}))(𝑔 finSupp 0 ∧ (𝑦( ·𝑠 ‘𝑀)𝑠) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑠}))))
27	26	anbi2i 622	. . . . . . . . . . 11 ⊢ (((𝑦( ·𝑠 ‘𝑀)𝑠) ∈ (Base‘𝑀) ∧ ∃𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑠}))(𝑔 finSupp (0g‘𝑅) ∧ (𝑦( ·𝑠 ‘𝑀)𝑠) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑠})))) ↔ ((𝑦( ·𝑠 ‘𝑀)𝑠) ∈ (Base‘𝑀) ∧ ∃𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑠}))(𝑔 finSupp 0 ∧ (𝑦( ·𝑠 ‘𝑀)𝑠) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑠})))))
28	21, 27	bitrdi 287	. . . . . . . . . 10 ⊢ ((𝑀 ∈ LMod ∧ (𝑆 ∖ {𝑠}) ∈ 𝒫 (Base‘𝑀)) → ((𝑦( ·𝑠 ‘𝑀)𝑠) ∈ (𝑀 LinCo (𝑆 ∖ {𝑠})) ↔ ((𝑦( ·𝑠 ‘𝑀)𝑠) ∈ (Base‘𝑀) ∧ ∃𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑠}))(𝑔 finSupp 0 ∧ (𝑦( ·𝑠 ‘𝑀)𝑠) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑠}))))))
29	5, 12, 28	syl2anc 583	. . . . . . . . 9 ⊢ (((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ 𝑆 ⊆ (Base‘𝑀)) → ((𝑦( ·𝑠 ‘𝑀)𝑠) ∈ (𝑀 LinCo (𝑆 ∖ {𝑠})) ↔ ((𝑦( ·𝑠 ‘𝑀)𝑠) ∈ (Base‘𝑀) ∧ ∃𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑠}))(𝑔 finSupp 0 ∧ (𝑦( ·𝑠 ‘𝑀)𝑠) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑠}))))))
30	29	notbid 318	. . . . . . . 8 ⊢ (((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ 𝑆 ⊆ (Base‘𝑀)) → (¬ (𝑦( ·𝑠 ‘𝑀)𝑠) ∈ (𝑀 LinCo (𝑆 ∖ {𝑠})) ↔ ¬ ((𝑦( ·𝑠 ‘𝑀)𝑠) ∈ (Base‘𝑀) ∧ ∃𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑠}))(𝑔 finSupp 0 ∧ (𝑦( ·𝑠 ‘𝑀)𝑠) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑠}))))))
31		ianor 980	. . . . . . . . 9 ⊢ (¬ ((𝑦( ·𝑠 ‘𝑀)𝑠) ∈ (Base‘𝑀) ∧ ∃𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑠}))(𝑔 finSupp 0 ∧ (𝑦( ·𝑠 ‘𝑀)𝑠) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑠})))) ↔ (¬ (𝑦( ·𝑠 ‘𝑀)𝑠) ∈ (Base‘𝑀) ∨ ¬ ∃𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑠}))(𝑔 finSupp 0 ∧ (𝑦( ·𝑠 ‘𝑀)𝑠) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑠})))))
32		ralnex 3067	. . . . . . . . . . 11 ⊢ (∀𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑠})) ¬ (𝑔 finSupp 0 ∧ (𝑦( ·𝑠 ‘𝑀)𝑠) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑠}))) ↔ ¬ ∃𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑠}))(𝑔 finSupp 0 ∧ (𝑦( ·𝑠 ‘𝑀)𝑠) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑠}))))
33		ianor 980	. . . . . . . . . . . 12 ⊢ (¬ (𝑔 finSupp 0 ∧ (𝑦( ·𝑠 ‘𝑀)𝑠) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑠}))) ↔ (¬ 𝑔 finSupp 0 ∨ ¬ (𝑦( ·𝑠 ‘𝑀)𝑠) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑠}))))
34	33	ralbii 3088	. . . . . . . . . . 11 ⊢ (∀𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑠})) ¬ (𝑔 finSupp 0 ∧ (𝑦( ·𝑠 ‘𝑀)𝑠) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑠}))) ↔ ∀𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑠}))(¬ 𝑔 finSupp 0 ∨ ¬ (𝑦( ·𝑠 ‘𝑀)𝑠) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑠}))))
35	32, 34	bitr3i 277	. . . . . . . . . 10 ⊢ (¬ ∃𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑠}))(𝑔 finSupp 0 ∧ (𝑦( ·𝑠 ‘𝑀)𝑠) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑠}))) ↔ ∀𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑠}))(¬ 𝑔 finSupp 0 ∨ ¬ (𝑦( ·𝑠 ‘𝑀)𝑠) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑠}))))
36	35	orbi2i 911	. . . . . . . . 9 ⊢ ((¬ (𝑦( ·𝑠 ‘𝑀)𝑠) ∈ (Base‘𝑀) ∨ ¬ ∃𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑠}))(𝑔 finSupp 0 ∧ (𝑦( ·𝑠 ‘𝑀)𝑠) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑠})))) ↔ (¬ (𝑦( ·𝑠 ‘𝑀)𝑠) ∈ (Base‘𝑀) ∨ ∀𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑠}))(¬ 𝑔 finSupp 0 ∨ ¬ (𝑦( ·𝑠 ‘𝑀)𝑠) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑠})))))
37	31, 36	bitri 275	. . . . . . . 8 ⊢ (¬ ((𝑦( ·𝑠 ‘𝑀)𝑠) ∈ (Base‘𝑀) ∧ ∃𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑠}))(𝑔 finSupp 0 ∧ (𝑦( ·𝑠 ‘𝑀)𝑠) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑠})))) ↔ (¬ (𝑦( ·𝑠 ‘𝑀)𝑠) ∈ (Base‘𝑀) ∨ ∀𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑠}))(¬ 𝑔 finSupp 0 ∨ ¬ (𝑦( ·𝑠 ‘𝑀)𝑠) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑠})))))
38	30, 37	bitrdi 287	. . . . . . 7 ⊢ (((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ 𝑆 ⊆ (Base‘𝑀)) → (¬ (𝑦( ·𝑠 ‘𝑀)𝑠) ∈ (𝑀 LinCo (𝑆 ∖ {𝑠})) ↔ (¬ (𝑦( ·𝑠 ‘𝑀)𝑠) ∈ (Base‘𝑀) ∨ ∀𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑠}))(¬ 𝑔 finSupp 0 ∨ ¬ (𝑦( ·𝑠 ‘𝑀)𝑠) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑠}))))))
39	18, 38	bitrd 279	. . . . . 6 ⊢ (((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ 𝑆 ⊆ (Base‘𝑀)) → (¬ (𝑦( ·𝑠 ‘𝑀)𝑠) ∈ ((LSpan‘𝑀)‘(𝑆 ∖ {𝑠})) ↔ (¬ (𝑦( ·𝑠 ‘𝑀)𝑠) ∈ (Base‘𝑀) ∨ ∀𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑠}))(¬ 𝑔 finSupp 0 ∨ ¬ (𝑦( ·𝑠 ‘𝑀)𝑠) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑠}))))))
40	39	2ralbidv 3213	. . . . 5 ⊢ (((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ 𝑆 ⊆ (Base‘𝑀)) → (∀𝑠 ∈ 𝑆 ∀𝑦 ∈ (𝐵 ∖ { 0 }) ¬ (𝑦( ·𝑠 ‘𝑀)𝑠) ∈ ((LSpan‘𝑀)‘(𝑆 ∖ {𝑠})) ↔ ∀𝑠 ∈ 𝑆 ∀𝑦 ∈ (𝐵 ∖ { 0 })(¬ (𝑦( ·𝑠 ‘𝑀)𝑠) ∈ (Base‘𝑀) ∨ ∀𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑠}))(¬ 𝑔 finSupp 0 ∨ ¬ (𝑦( ·𝑠 ‘𝑀)𝑠) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑠}))))))
41		simpllr 775	. . . . . . . . . . 11 ⊢ ((((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ 𝑆 ⊆ (Base‘𝑀)) ∧ (𝑠 ∈ 𝑆 ∧ 𝑦 ∈ (𝐵 ∖ { 0 }))) → 𝑀 ∈ LMod)
42		eldifi 4122	. . . . . . . . . . . . 13 ⊢ (𝑦 ∈ (𝐵 ∖ { 0 }) → 𝑦 ∈ 𝐵)
43	42	adantl 481	. . . . . . . . . . . 12 ⊢ ((𝑠 ∈ 𝑆 ∧ 𝑦 ∈ (𝐵 ∖ { 0 })) → 𝑦 ∈ 𝐵)
44	43	adantl 481	. . . . . . . . . . 11 ⊢ ((((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ 𝑆 ⊆ (Base‘𝑀)) ∧ (𝑠 ∈ 𝑆 ∧ 𝑦 ∈ (𝐵 ∖ { 0 }))) → 𝑦 ∈ 𝐵)
45		ssel2 3973	. . . . . . . . . . . 12 ⊢ ((𝑆 ⊆ (Base‘𝑀) ∧ 𝑠 ∈ 𝑆) → 𝑠 ∈ (Base‘𝑀))
46	45	ad2ant2lr 747	. . . . . . . . . . 11 ⊢ ((((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ 𝑆 ⊆ (Base‘𝑀)) ∧ (𝑠 ∈ 𝑆 ∧ 𝑦 ∈ (𝐵 ∖ { 0 }))) → 𝑠 ∈ (Base‘𝑀))
47		eqid 2727	. . . . . . . . . . . 12 ⊢ ( ·𝑠 ‘𝑀) = ( ·𝑠 ‘𝑀)
48	13, 19, 47, 20	lmodvscl 20750	. . . . . . . . . . 11 ⊢ ((𝑀 ∈ LMod ∧ 𝑦 ∈ 𝐵 ∧ 𝑠 ∈ (Base‘𝑀)) → (𝑦( ·𝑠 ‘𝑀)𝑠) ∈ (Base‘𝑀))
49	41, 44, 46, 48	syl3anc 1369	. . . . . . . . . 10 ⊢ ((((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ 𝑆 ⊆ (Base‘𝑀)) ∧ (𝑠 ∈ 𝑆 ∧ 𝑦 ∈ (𝐵 ∖ { 0 }))) → (𝑦( ·𝑠 ‘𝑀)𝑠) ∈ (Base‘𝑀))
50	49	notnotd 144	. . . . . . . . 9 ⊢ ((((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ 𝑆 ⊆ (Base‘𝑀)) ∧ (𝑠 ∈ 𝑆 ∧ 𝑦 ∈ (𝐵 ∖ { 0 }))) → ¬ ¬ (𝑦( ·𝑠 ‘𝑀)𝑠) ∈ (Base‘𝑀))
51		nbfal 1549	. . . . . . . . 9 ⊢ (¬ ¬ (𝑦( ·𝑠 ‘𝑀)𝑠) ∈ (Base‘𝑀) ↔ (¬ (𝑦( ·𝑠 ‘𝑀)𝑠) ∈ (Base‘𝑀) ↔ ⊥))
52	50, 51	sylib 217	. . . . . . . 8 ⊢ ((((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ 𝑆 ⊆ (Base‘𝑀)) ∧ (𝑠 ∈ 𝑆 ∧ 𝑦 ∈ (𝐵 ∖ { 0 }))) → (¬ (𝑦( ·𝑠 ‘𝑀)𝑠) ∈ (Base‘𝑀) ↔ ⊥))
53	52	orbi1d 915	. . . . . . 7 ⊢ ((((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ 𝑆 ⊆ (Base‘𝑀)) ∧ (𝑠 ∈ 𝑆 ∧ 𝑦 ∈ (𝐵 ∖ { 0 }))) → ((¬ (𝑦( ·𝑠 ‘𝑀)𝑠) ∈ (Base‘𝑀) ∨ ∀𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑠}))(¬ 𝑔 finSupp 0 ∨ ¬ (𝑦( ·𝑠 ‘𝑀)𝑠) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑠})))) ↔ (⊥ ∨ ∀𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑠}))(¬ 𝑔 finSupp 0 ∨ ¬ (𝑦( ·𝑠 ‘𝑀)𝑠) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑠}))))))
54	53	2ralbidva 3211	. . . . . 6 ⊢ (((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ 𝑆 ⊆ (Base‘𝑀)) → (∀𝑠 ∈ 𝑆 ∀𝑦 ∈ (𝐵 ∖ { 0 })(¬ (𝑦( ·𝑠 ‘𝑀)𝑠) ∈ (Base‘𝑀) ∨ ∀𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑠}))(¬ 𝑔 finSupp 0 ∨ ¬ (𝑦( ·𝑠 ‘𝑀)𝑠) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑠})))) ↔ ∀𝑠 ∈ 𝑆 ∀𝑦 ∈ (𝐵 ∖ { 0 })(⊥ ∨ ∀𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑠}))(¬ 𝑔 finSupp 0 ∨ ¬ (𝑦( ·𝑠 ‘𝑀)𝑠) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑠}))))))
55		r19.32v 3186	. . . . . . . . 9 ⊢ (∀𝑦 ∈ (𝐵 ∖ { 0 })(⊥ ∨ ∀𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑠}))(¬ 𝑔 finSupp 0 ∨ ¬ (𝑦( ·𝑠 ‘𝑀)𝑠) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑠})))) ↔ (⊥ ∨ ∀𝑦 ∈ (𝐵 ∖ { 0 })∀𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑠}))(¬ 𝑔 finSupp 0 ∨ ¬ (𝑦( ·𝑠 ‘𝑀)𝑠) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑠})))))
56	55	ralbii 3088	. . . . . . . 8 ⊢ (∀𝑠 ∈ 𝑆 ∀𝑦 ∈ (𝐵 ∖ { 0 })(⊥ ∨ ∀𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑠}))(¬ 𝑔 finSupp 0 ∨ ¬ (𝑦( ·𝑠 ‘𝑀)𝑠) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑠})))) ↔ ∀𝑠 ∈ 𝑆 (⊥ ∨ ∀𝑦 ∈ (𝐵 ∖ { 0 })∀𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑠}))(¬ 𝑔 finSupp 0 ∨ ¬ (𝑦( ·𝑠 ‘𝑀)𝑠) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑠})))))
57		r19.32v 3186	. . . . . . . 8 ⊢ (∀𝑠 ∈ 𝑆 (⊥ ∨ ∀𝑦 ∈ (𝐵 ∖ { 0 })∀𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑠}))(¬ 𝑔 finSupp 0 ∨ ¬ (𝑦( ·𝑠 ‘𝑀)𝑠) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑠})))) ↔ (⊥ ∨ ∀𝑠 ∈ 𝑆 ∀𝑦 ∈ (𝐵 ∖ { 0 })∀𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑠}))(¬ 𝑔 finSupp 0 ∨ ¬ (𝑦( ·𝑠 ‘𝑀)𝑠) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑠})))))
58	56, 57	bitri 275	. . . . . . 7 ⊢ (∀𝑠 ∈ 𝑆 ∀𝑦 ∈ (𝐵 ∖ { 0 })(⊥ ∨ ∀𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑠}))(¬ 𝑔 finSupp 0 ∨ ¬ (𝑦( ·𝑠 ‘𝑀)𝑠) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑠})))) ↔ (⊥ ∨ ∀𝑠 ∈ 𝑆 ∀𝑦 ∈ (𝐵 ∖ { 0 })∀𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑠}))(¬ 𝑔 finSupp 0 ∨ ¬ (𝑦( ·𝑠 ‘𝑀)𝑠) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑠})))))
59		falim 1551	. . . . . . . . 9 ⊢ (⊥ → (((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ 𝑆 ⊆ (Base‘𝑀)) → ∀𝑓 ∈ (𝐵 ↑m 𝑆)((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍) → ∀𝑥 ∈ 𝑆 (𝑓‘𝑥) = 0 )))
60		sneq 4634	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝑠 = 𝑥 → {𝑠} = {𝑥})
61	60	difeq2d 4118	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑠 = 𝑥 → (𝑆 ∖ {𝑠}) = (𝑆 ∖ {𝑥}))
62	61	oveq2d 7430	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑠 = 𝑥 → (𝐵 ↑m (𝑆 ∖ {𝑠})) = (𝐵 ↑m (𝑆 ∖ {𝑥})))
63		oveq2 7422	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝑠 = 𝑥 → (𝑦( ·𝑠 ‘𝑀)𝑠) = (𝑦( ·𝑠 ‘𝑀)𝑥))
64	61	oveq2d 7430	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝑠 = 𝑥 → (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑠})) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑥})))
65	63, 64	eqeq12d 2743	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝑠 = 𝑥 → ((𝑦( ·𝑠 ‘𝑀)𝑠) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑠})) ↔ (𝑦( ·𝑠 ‘𝑀)𝑥) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑥}))))
66	65	notbid 318	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑠 = 𝑥 → (¬ (𝑦( ·𝑠 ‘𝑀)𝑠) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑠})) ↔ ¬ (𝑦( ·𝑠 ‘𝑀)𝑥) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑥}))))
67	66	orbi2d 914	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑠 = 𝑥 → ((¬ 𝑔 finSupp 0 ∨ ¬ (𝑦( ·𝑠 ‘𝑀)𝑠) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑠}))) ↔ (¬ 𝑔 finSupp 0 ∨ ¬ (𝑦( ·𝑠 ‘𝑀)𝑥) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑥})))))
68	62, 67	raleqbidv 3337	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑠 = 𝑥 → (∀𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑠}))(¬ 𝑔 finSupp 0 ∨ ¬ (𝑦( ·𝑠 ‘𝑀)𝑠) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑠}))) ↔ ∀𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑥}))(¬ 𝑔 finSupp 0 ∨ ¬ (𝑦( ·𝑠 ‘𝑀)𝑥) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑥})))))
69	68	ralbidv 3172	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑠 = 𝑥 → (∀𝑦 ∈ (𝐵 ∖ { 0 })∀𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑠}))(¬ 𝑔 finSupp 0 ∨ ¬ (𝑦( ·𝑠 ‘𝑀)𝑠) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑠}))) ↔ ∀𝑦 ∈ (𝐵 ∖ { 0 })∀𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑥}))(¬ 𝑔 finSupp 0 ∨ ¬ (𝑦( ·𝑠 ‘𝑀)𝑥) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑥})))))
70	69	rspcva 3605	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑥 ∈ 𝑆 ∧ ∀𝑠 ∈ 𝑆 ∀𝑦 ∈ (𝐵 ∖ { 0 })∀𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑠}))(¬ 𝑔 finSupp 0 ∨ ¬ (𝑦( ·𝑠 ‘𝑀)𝑠) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑠})))) → ∀𝑦 ∈ (𝐵 ∖ { 0 })∀𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑥}))(¬ 𝑔 finSupp 0 ∨ ¬ (𝑦( ·𝑠 ‘𝑀)𝑥) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑥}))))
71		lindslinind.z	. . . . . . . . . . . . . . . . . . . . 21 ⊢ 𝑍 = (0g‘𝑀)
72	19, 20, 22, 71	lindslinindsimp2lem5 47453	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ 𝑥 ∈ 𝑆)) → ((𝑓 ∈ (𝐵 ↑m 𝑆) ∧ (𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍)) → (∀𝑦 ∈ (𝐵 ∖ { 0 })∀𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑥}))(¬ 𝑔 finSupp 0 ∨ ¬ (𝑦( ·𝑠 ‘𝑀)𝑥) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑥}))) → (𝑓‘𝑥) = 0 )))
73	72	expr 456	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ 𝑆 ⊆ (Base‘𝑀)) → (𝑥 ∈ 𝑆 → ((𝑓 ∈ (𝐵 ↑m 𝑆) ∧ (𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍)) → (∀𝑦 ∈ (𝐵 ∖ { 0 })∀𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑥}))(¬ 𝑔 finSupp 0 ∨ ¬ (𝑦( ·𝑠 ‘𝑀)𝑥) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑥}))) → (𝑓‘𝑥) = 0 ))))
74	73	com14 96	. . . . . . . . . . . . . . . . . 18 ⊢ (∀𝑦 ∈ (𝐵 ∖ { 0 })∀𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑥}))(¬ 𝑔 finSupp 0 ∨ ¬ (𝑦( ·𝑠 ‘𝑀)𝑥) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑥}))) → (𝑥 ∈ 𝑆 → ((𝑓 ∈ (𝐵 ↑m 𝑆) ∧ (𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍)) → (((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ 𝑆 ⊆ (Base‘𝑀)) → (𝑓‘𝑥) = 0 ))))
75	70, 74	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑥 ∈ 𝑆 ∧ ∀𝑠 ∈ 𝑆 ∀𝑦 ∈ (𝐵 ∖ { 0 })∀𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑠}))(¬ 𝑔 finSupp 0 ∨ ¬ (𝑦( ·𝑠 ‘𝑀)𝑠) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑠})))) → (𝑥 ∈ 𝑆 → ((𝑓 ∈ (𝐵 ↑m 𝑆) ∧ (𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍)) → (((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ 𝑆 ⊆ (Base‘𝑀)) → (𝑓‘𝑥) = 0 ))))
76	75	ex 412	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 ∈ 𝑆 → (∀𝑠 ∈ 𝑆 ∀𝑦 ∈ (𝐵 ∖ { 0 })∀𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑠}))(¬ 𝑔 finSupp 0 ∨ ¬ (𝑦( ·𝑠 ‘𝑀)𝑠) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑠}))) → (𝑥 ∈ 𝑆 → ((𝑓 ∈ (𝐵 ↑m 𝑆) ∧ (𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍)) → (((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ 𝑆 ⊆ (Base‘𝑀)) → (𝑓‘𝑥) = 0 )))))
77	76	pm2.43a 54	. . . . . . . . . . . . . . 15 ⊢ (𝑥 ∈ 𝑆 → (∀𝑠 ∈ 𝑆 ∀𝑦 ∈ (𝐵 ∖ { 0 })∀𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑠}))(¬ 𝑔 finSupp 0 ∨ ¬ (𝑦( ·𝑠 ‘𝑀)𝑠) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑠}))) → ((𝑓 ∈ (𝐵 ↑m 𝑆) ∧ (𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍)) → (((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ 𝑆 ⊆ (Base‘𝑀)) → (𝑓‘𝑥) = 0 ))))
78	77	com14 96	. . . . . . . . . . . . . 14 ⊢ (((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ 𝑆 ⊆ (Base‘𝑀)) → (∀𝑠 ∈ 𝑆 ∀𝑦 ∈ (𝐵 ∖ { 0 })∀𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑠}))(¬ 𝑔 finSupp 0 ∨ ¬ (𝑦( ·𝑠 ‘𝑀)𝑠) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑠}))) → ((𝑓 ∈ (𝐵 ↑m 𝑆) ∧ (𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍)) → (𝑥 ∈ 𝑆 → (𝑓‘𝑥) = 0 ))))
79	78	imp 406	. . . . . . . . . . . . 13 ⊢ ((((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ 𝑆 ⊆ (Base‘𝑀)) ∧ ∀𝑠 ∈ 𝑆 ∀𝑦 ∈ (𝐵 ∖ { 0 })∀𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑠}))(¬ 𝑔 finSupp 0 ∨ ¬ (𝑦( ·𝑠 ‘𝑀)𝑠) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑠})))) → ((𝑓 ∈ (𝐵 ↑m 𝑆) ∧ (𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍)) → (𝑥 ∈ 𝑆 → (𝑓‘𝑥) = 0 )))
80	79	expdimp 452	. . . . . . . . . . . 12 ⊢ (((((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ 𝑆 ⊆ (Base‘𝑀)) ∧ ∀𝑠 ∈ 𝑆 ∀𝑦 ∈ (𝐵 ∖ { 0 })∀𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑠}))(¬ 𝑔 finSupp 0 ∨ ¬ (𝑦( ·𝑠 ‘𝑀)𝑠) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑠})))) ∧ 𝑓 ∈ (𝐵 ↑m 𝑆)) → ((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍) → (𝑥 ∈ 𝑆 → (𝑓‘𝑥) = 0 )))
81	80	ralrimdv 3147	. . . . . . . . . . 11 ⊢ (((((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ 𝑆 ⊆ (Base‘𝑀)) ∧ ∀𝑠 ∈ 𝑆 ∀𝑦 ∈ (𝐵 ∖ { 0 })∀𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑠}))(¬ 𝑔 finSupp 0 ∨ ¬ (𝑦( ·𝑠 ‘𝑀)𝑠) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑠})))) ∧ 𝑓 ∈ (𝐵 ↑m 𝑆)) → ((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍) → ∀𝑥 ∈ 𝑆 (𝑓‘𝑥) = 0 ))
82	81	ralrimiva 3141	. . . . . . . . . 10 ⊢ ((((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ 𝑆 ⊆ (Base‘𝑀)) ∧ ∀𝑠 ∈ 𝑆 ∀𝑦 ∈ (𝐵 ∖ { 0 })∀𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑠}))(¬ 𝑔 finSupp 0 ∨ ¬ (𝑦( ·𝑠 ‘𝑀)𝑠) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑠})))) → ∀𝑓 ∈ (𝐵 ↑m 𝑆)((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍) → ∀𝑥 ∈ 𝑆 (𝑓‘𝑥) = 0 ))
83	82	expcom 413	. . . . . . . . 9 ⊢ (∀𝑠 ∈ 𝑆 ∀𝑦 ∈ (𝐵 ∖ { 0 })∀𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑠}))(¬ 𝑔 finSupp 0 ∨ ¬ (𝑦( ·𝑠 ‘𝑀)𝑠) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑠}))) → (((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ 𝑆 ⊆ (Base‘𝑀)) → ∀𝑓 ∈ (𝐵 ↑m 𝑆)((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍) → ∀𝑥 ∈ 𝑆 (𝑓‘𝑥) = 0 )))
84	59, 83	jaoi 856	. . . . . . . 8 ⊢ ((⊥ ∨ ∀𝑠 ∈ 𝑆 ∀𝑦 ∈ (𝐵 ∖ { 0 })∀𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑠}))(¬ 𝑔 finSupp 0 ∨ ¬ (𝑦( ·𝑠 ‘𝑀)𝑠) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑠})))) → (((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ 𝑆 ⊆ (Base‘𝑀)) → ∀𝑓 ∈ (𝐵 ↑m 𝑆)((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍) → ∀𝑥 ∈ 𝑆 (𝑓‘𝑥) = 0 )))
85	84	com12 32	. . . . . . 7 ⊢ (((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ 𝑆 ⊆ (Base‘𝑀)) → ((⊥ ∨ ∀𝑠 ∈ 𝑆 ∀𝑦 ∈ (𝐵 ∖ { 0 })∀𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑠}))(¬ 𝑔 finSupp 0 ∨ ¬ (𝑦( ·𝑠 ‘𝑀)𝑠) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑠})))) → ∀𝑓 ∈ (𝐵 ↑m 𝑆)((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍) → ∀𝑥 ∈ 𝑆 (𝑓‘𝑥) = 0 )))
86	58, 85	biimtrid 241	. . . . . 6 ⊢ (((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ 𝑆 ⊆ (Base‘𝑀)) → (∀𝑠 ∈ 𝑆 ∀𝑦 ∈ (𝐵 ∖ { 0 })(⊥ ∨ ∀𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑠}))(¬ 𝑔 finSupp 0 ∨ ¬ (𝑦( ·𝑠 ‘𝑀)𝑠) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑠})))) → ∀𝑓 ∈ (𝐵 ↑m 𝑆)((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍) → ∀𝑥 ∈ 𝑆 (𝑓‘𝑥) = 0 )))
87	54, 86	sylbid 239	. . . . 5 ⊢ (((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ 𝑆 ⊆ (Base‘𝑀)) → (∀𝑠 ∈ 𝑆 ∀𝑦 ∈ (𝐵 ∖ { 0 })(¬ (𝑦( ·𝑠 ‘𝑀)𝑠) ∈ (Base‘𝑀) ∨ ∀𝑔 ∈ (𝐵 ↑m (𝑆 ∖ {𝑠}))(¬ 𝑔 finSupp 0 ∨ ¬ (𝑦( ·𝑠 ‘𝑀)𝑠) = (𝑔( linC ‘𝑀)(𝑆 ∖ {𝑠})))) → ∀𝑓 ∈ (𝐵 ↑m 𝑆)((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍) → ∀𝑥 ∈ 𝑆 (𝑓‘𝑥) = 0 )))
88	40, 87	sylbid 239	. . . 4 ⊢ (((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ 𝑆 ⊆ (Base‘𝑀)) → (∀𝑠 ∈ 𝑆 ∀𝑦 ∈ (𝐵 ∖ { 0 }) ¬ (𝑦( ·𝑠 ‘𝑀)𝑠) ∈ ((LSpan‘𝑀)‘(𝑆 ∖ {𝑠})) → ∀𝑓 ∈ (𝐵 ↑m 𝑆)((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍) → ∀𝑥 ∈ 𝑆 (𝑓‘𝑥) = 0 )))
89	88	impr 454	. . 3 ⊢ (((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ ∀𝑠 ∈ 𝑆 ∀𝑦 ∈ (𝐵 ∖ { 0 }) ¬ (𝑦( ·𝑠 ‘𝑀)𝑠) ∈ ((LSpan‘𝑀)‘(𝑆 ∖ {𝑠})))) → ∀𝑓 ∈ (𝐵 ↑m 𝑆)((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍) → ∀𝑥 ∈ 𝑆 (𝑓‘𝑥) = 0 ))
90	4, 89	jca 511	. 2 ⊢ (((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) ∧ (𝑆 ⊆ (Base‘𝑀) ∧ ∀𝑠 ∈ 𝑆 ∀𝑦 ∈ (𝐵 ∖ { 0 }) ¬ (𝑦( ·𝑠 ‘𝑀)𝑠) ∈ ((LSpan‘𝑀)‘(𝑆 ∖ {𝑠})))) → (𝑆 ∈ 𝒫 (Base‘𝑀) ∧ ∀𝑓 ∈ (𝐵 ↑m 𝑆)((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍) → ∀𝑥 ∈ 𝑆 (𝑓‘𝑥) = 0 )))
91	90	ex 412	1 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝑀 ∈ LMod) → ((𝑆 ⊆ (Base‘𝑀) ∧ ∀𝑠 ∈ 𝑆 ∀𝑦 ∈ (𝐵 ∖ { 0 }) ¬ (𝑦( ·𝑠 ‘𝑀)𝑠) ∈ ((LSpan‘𝑀)‘(𝑆 ∖ {𝑠}))) → (𝑆 ∈ 𝒫 (Base‘𝑀) ∧ ∀𝑓 ∈ (𝐵 ↑m 𝑆)((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍) → ∀𝑥 ∈ 𝑆 (𝑓‘𝑥) = 0 ))))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 395   ∨ wo 846   = wceq 1534  ⊥wfal 1546   ∈ wcel 2099  ∀wral 3056  ∃wrex 3065  Vcvv 3469   ∖ cdif 3941   ⊆ wss 3944  𝒫 cpw 4598  {csn 4624   class class class wbr 5142  ‘cfv 6542  (class class class)co 7414   ↑_m cmap 8836   finSupp cfsupp 9377  Basecbs 17171  Scalarcsca 17227   ·_𝑠 cvsca 17228  0_gc0g 17412  LModclmod 20732  LSpanclspn 20844   linC clinc 47395   LinCo clinco 47396

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-10 2130  ax-11 2147  ax-12 2164  ax-ext 2698  ax-rep 5279  ax-sep 5293  ax-nul 5300  ax-pow 5359  ax-pr 5423  ax-un 7734  ax-cnex 11186  ax-resscn 11187  ax-1cn 11188  ax-icn 11189  ax-addcl 11190  ax-addrcl 11191  ax-mulcl 11192  ax-mulrcl 11193  ax-mulcom 11194  ax-addass 11195  ax-mulass 11196  ax-distr 11197  ax-i2m1 11198  ax-1ne0 11199  ax-1rid 11200  ax-rnegex 11201  ax-rrecex 11202  ax-cnre 11203  ax-pre-lttri 11204  ax-pre-lttrn 11205  ax-pre-ltadd 11206  ax-pre-mulgt0 11207

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 847  df-3or 1086  df-3an 1087  df-tru 1537  df-fal 1547  df-ex 1775  df-nf 1779  df-sb 2061  df-mo 2529  df-eu 2558  df-clab 2705  df-cleq 2719  df-clel 2805  df-nfc 2880  df-ne 2936  df-nel 3042  df-ral 3057  df-rex 3066  df-rmo 3371  df-reu 3372  df-rab 3428  df-v 3471  df-sbc 3775  df-csb 3890  df-dif 3947  df-un 3949  df-in 3951  df-ss 3961  df-pss 3963  df-nul 4319  df-if 4525  df-pw 4600  df-sn 4625  df-pr 4627  df-op 4631  df-uni 4904  df-int 4945  df-iun 4993  df-iin 4994  df-br 5143  df-opab 5205  df-mpt 5226  df-tr 5260  df-id 5570  df-eprel 5576  df-po 5584  df-so 5585  df-fr 5627  df-se 5628  df-we 5629  df-xp 5678  df-rel 5679  df-cnv 5680  df-co 5681  df-dm 5682  df-rn 5683  df-res 5684  df-ima 5685  df-pred 6299  df-ord 6366  df-on 6367  df-lim 6368  df-suc 6369  df-iota 6494  df-fun 6544  df-fn 6545  df-f 6546  df-f1 6547  df-fo 6548  df-f1o 6549  df-fv 6550  df-isom 6551  df-riota 7370  df-ov 7417  df-oprab 7418  df-mpo 7419  df-of 7679  df-om 7865  df-1st 7987  df-2nd 7988  df-supp 8160  df-frecs 8280  df-wrecs 8311  df-recs 8385  df-rdg 8424  df-1o 8480  df-er 8718  df-map 8838  df-en 8956  df-dom 8957  df-sdom 8958  df-fin 8959  df-fsupp 9378  df-oi 9525  df-card 9954  df-pnf 11272  df-mnf 11273  df-xr 11274  df-ltxr 11275  df-le 11276  df-sub 11468  df-neg 11469  df-nn 12235  df-2 12297  df-n0 12495  df-z 12581  df-uz 12845  df-fz 13509  df-fzo 13652  df-seq 13991  df-hash 14314  df-sets 17124  df-slot 17142  df-ndx 17154  df-base 17172  df-ress 17201  df-plusg 17237  df-0g 17414  df-gsum 17415  df-mre 17557  df-mrc 17558  df-acs 17560  df-mgm 18591  df-sgrp 18670  df-mnd 18686  df-mhm 18731  df-submnd 18732  df-grp 18884  df-minusg 18885  df-sbg 18886  df-mulg 19015  df-subg 19069  df-ghm 19159  df-cntz 19259  df-cmn 19728  df-abl 19729  df-mgp 20066  df-rng 20084  df-ur 20113  df-ring 20166  df-lmod 20734  df-lss 20805  df-lsp 20845  df-linc 47397  df-lco 47398

This theorem is referenced by:  lindslininds  47455