Theorem islindeps 49023

Description: The property of being a linearly dependent subset. (Contributed by AV, 26-Apr-2019.) (Revised by AV, 30-Jul-2019.)

Hypotheses

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

Assertion

Ref	Expression
islindeps	⊢ ((𝑀 ∈ 𝑊 ∧ 𝑆 ∈ 𝒫 𝐵) → (𝑆 linDepS 𝑀 ↔ ∃𝑓 ∈ (𝐸 ↑m 𝑆)(𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍 ∧ ∃𝑥 ∈ 𝑆 (𝑓‘𝑥) ≠ 0 )))

Distinct variable groups:   𝑓,𝐸   𝑓,𝑀,𝑥   𝑆,𝑓,𝑥

Allowed substitution hints:   𝐵(𝑥,𝑓)   𝑅(𝑥,𝑓)   𝐸(𝑥)   𝑊(𝑥,𝑓)   0 (𝑥,𝑓)   𝑍(𝑥,𝑓)

Proof of Theorem islindeps

Step	Hyp	Ref	Expression
1		lindepsnlininds 49022	. . 3 ⊢ ((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ 𝑊) → (𝑆 linDepS 𝑀 ↔ ¬ 𝑆 linIndS 𝑀))
2	1	ancoms 461	. 2 ⊢ ((𝑀 ∈ 𝑊 ∧ 𝑆 ∈ 𝒫 𝐵) → (𝑆 linDepS 𝑀 ↔ ¬ 𝑆 linIndS 𝑀))
3		islindeps.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝑀)
4		islindeps.z	. . . . . 6 ⊢ 𝑍 = (0g‘𝑀)
5		islindeps.r	. . . . . 6 ⊢ 𝑅 = (Scalar‘𝑀)
6		islindeps.e	. . . . . 6 ⊢ 𝐸 = (Base‘𝑅)
7		islindeps.0	. . . . . 6 ⊢ 0 = (0g‘𝑅)
8	3, 4, 5, 6, 7	islininds 49016	. . . . 5 ⊢ ((𝑆 ∈ 𝒫 𝐵 ∧ 𝑀 ∈ 𝑊) → (𝑆 linIndS 𝑀 ↔ (𝑆 ∈ 𝒫 𝐵 ∧ ∀𝑓 ∈ (𝐸 ↑m 𝑆)((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍) → ∀𝑥 ∈ 𝑆 (𝑓‘𝑥) = 0 ))))
9	8	ancoms 461	. . . 4 ⊢ ((𝑀 ∈ 𝑊 ∧ 𝑆 ∈ 𝒫 𝐵) → (𝑆 linIndS 𝑀 ↔ (𝑆 ∈ 𝒫 𝐵 ∧ ∀𝑓 ∈ (𝐸 ↑m 𝑆)((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍) → ∀𝑥 ∈ 𝑆 (𝑓‘𝑥) = 0 ))))
10		ibar 535	. . . . . 6 ⊢ (𝑆 ∈ 𝒫 𝐵 → (∀𝑓 ∈ (𝐸 ↑m 𝑆)((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍) → ∀𝑥 ∈ 𝑆 (𝑓‘𝑥) = 0 ) ↔ (𝑆 ∈ 𝒫 𝐵 ∧ ∀𝑓 ∈ (𝐸 ↑m 𝑆)((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍) → ∀𝑥 ∈ 𝑆 (𝑓‘𝑥) = 0 ))))
11	10	bicomd 225	. . . . 5 ⊢ (𝑆 ∈ 𝒫 𝐵 → ((𝑆 ∈ 𝒫 𝐵 ∧ ∀𝑓 ∈ (𝐸 ↑m 𝑆)((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍) → ∀𝑥 ∈ 𝑆 (𝑓‘𝑥) = 0 )) ↔ ∀𝑓 ∈ (𝐸 ↑m 𝑆)((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍) → ∀𝑥 ∈ 𝑆 (𝑓‘𝑥) = 0 )))
12	11	adantl 484	. . . 4 ⊢ ((𝑀 ∈ 𝑊 ∧ 𝑆 ∈ 𝒫 𝐵) → ((𝑆 ∈ 𝒫 𝐵 ∧ ∀𝑓 ∈ (𝐸 ↑m 𝑆)((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍) → ∀𝑥 ∈ 𝑆 (𝑓‘𝑥) = 0 )) ↔ ∀𝑓 ∈ (𝐸 ↑m 𝑆)((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍) → ∀𝑥 ∈ 𝑆 (𝑓‘𝑥) = 0 )))
13	9, 12	bitrd 281	. . 3 ⊢ ((𝑀 ∈ 𝑊 ∧ 𝑆 ∈ 𝒫 𝐵) → (𝑆 linIndS 𝑀 ↔ ∀𝑓 ∈ (𝐸 ↑m 𝑆)((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍) → ∀𝑥 ∈ 𝑆 (𝑓‘𝑥) = 0 )))
14	13	notbid 320	. 2 ⊢ ((𝑀 ∈ 𝑊 ∧ 𝑆 ∈ 𝒫 𝐵) → (¬ 𝑆 linIndS 𝑀 ↔ ¬ ∀𝑓 ∈ (𝐸 ↑m 𝑆)((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍) → ∀𝑥 ∈ 𝑆 (𝑓‘𝑥) = 0 )))
15		rexnal 3108	. . . 4 ⊢ (∃𝑓 ∈ (𝐸 ↑m 𝑆) ¬ ((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍) → ∀𝑥 ∈ 𝑆 (𝑓‘𝑥) = 0 ) ↔ ¬ ∀𝑓 ∈ (𝐸 ↑m 𝑆)((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍) → ∀𝑥 ∈ 𝑆 (𝑓‘𝑥) = 0 ))
16		df-ne 2952	. . . . . . . . 9 ⊢ ((𝑓‘𝑥) ≠ 0 ↔ ¬ (𝑓‘𝑥) = 0 )
17	16	rexbii 3103	. . . . . . . 8 ⊢ (∃𝑥 ∈ 𝑆 (𝑓‘𝑥) ≠ 0 ↔ ∃𝑥 ∈ 𝑆 ¬ (𝑓‘𝑥) = 0 )
18		rexnal 3108	. . . . . . . 8 ⊢ (∃𝑥 ∈ 𝑆 ¬ (𝑓‘𝑥) = 0 ↔ ¬ ∀𝑥 ∈ 𝑆 (𝑓‘𝑥) = 0 )
19	17, 18	bitr2i 278	. . . . . . 7 ⊢ (¬ ∀𝑥 ∈ 𝑆 (𝑓‘𝑥) = 0 ↔ ∃𝑥 ∈ 𝑆 (𝑓‘𝑥) ≠ 0 )
20	19	anbi2i 631	. . . . . 6 ⊢ (((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍) ∧ ¬ ∀𝑥 ∈ 𝑆 (𝑓‘𝑥) = 0 ) ↔ ((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍) ∧ ∃𝑥 ∈ 𝑆 (𝑓‘𝑥) ≠ 0 ))
21		pm4.61 407	. . . . . 6 ⊢ (¬ ((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍) → ∀𝑥 ∈ 𝑆 (𝑓‘𝑥) = 0 ) ↔ ((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍) ∧ ¬ ∀𝑥 ∈ 𝑆 (𝑓‘𝑥) = 0 ))
22		df-3an 1097	. . . . . 6 ⊢ ((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍 ∧ ∃𝑥 ∈ 𝑆 (𝑓‘𝑥) ≠ 0 ) ↔ ((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍) ∧ ∃𝑥 ∈ 𝑆 (𝑓‘𝑥) ≠ 0 ))
23	20, 21, 22	3bitr4i 305	. . . . 5 ⊢ (¬ ((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍) → ∀𝑥 ∈ 𝑆 (𝑓‘𝑥) = 0 ) ↔ (𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍 ∧ ∃𝑥 ∈ 𝑆 (𝑓‘𝑥) ≠ 0 ))
24	23	rexbii 3103	. . . 4 ⊢ (∃𝑓 ∈ (𝐸 ↑m 𝑆) ¬ ((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍) → ∀𝑥 ∈ 𝑆 (𝑓‘𝑥) = 0 ) ↔ ∃𝑓 ∈ (𝐸 ↑m 𝑆)(𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍 ∧ ∃𝑥 ∈ 𝑆 (𝑓‘𝑥) ≠ 0 ))
25	15, 24	bitr3i 279	. . 3 ⊢ (¬ ∀𝑓 ∈ (𝐸 ↑m 𝑆)((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍) → ∀𝑥 ∈ 𝑆 (𝑓‘𝑥) = 0 ) ↔ ∃𝑓 ∈ (𝐸 ↑m 𝑆)(𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍 ∧ ∃𝑥 ∈ 𝑆 (𝑓‘𝑥) ≠ 0 ))
26	25	a1i 11	. 2 ⊢ ((𝑀 ∈ 𝑊 ∧ 𝑆 ∈ 𝒫 𝐵) → (¬ ∀𝑓 ∈ (𝐸 ↑m 𝑆)((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍) → ∀𝑥 ∈ 𝑆 (𝑓‘𝑥) = 0 ) ↔ ∃𝑓 ∈ (𝐸 ↑m 𝑆)(𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍 ∧ ∃𝑥 ∈ 𝑆 (𝑓‘𝑥) ≠ 0 )))
27	2, 14, 26	3bitrd 307	1 ⊢ ((𝑀 ∈ 𝑊 ∧ 𝑆 ∈ 𝒫 𝐵) → (𝑆 linDepS 𝑀 ↔ ∃𝑓 ∈ (𝐸 ↑m 𝑆)(𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍 ∧ ∃𝑥 ∈ 𝑆 (𝑓‘𝑥) ≠ 0 )))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 208   ∧ wa 398   ∧ w3a 1095   = wceq 1554   ∈ wcel 2136   ≠ wne 2951  ∀wral 3070  ∃wrex 3080  𝒫 cpw 4549   class class class wbr 5094  ‘cfv 6510  (class class class)co 7385   ↑_m cmap 8796   finSupp cfsupp 9297  Basecbs 17221  Scalarcsca 17265  0_gc0g 17444   linC clinc 48974   linIndS clininds 49010   linDepS clindeps 49011

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1809  ax-4 1823  ax-5 1924  ax-6 1981  ax-7 2022  ax-8 2138  ax-9 2146  ax-ext 2728  ax-sep 5240  ax-pr 5384

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 857  df-3an 1097  df-tru 1557  df-fal 1567  df-ex 1794  df-sb 2085  df-clab 2735  df-cleq 2748  df-clel 2831  df-ne 2952  df-ral 3071  df-rex 3081  df-rab 3409  df-v 3450  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4281  df-if 4475  df-pw 4551  df-sn 4577  df-pr 4579  df-op 4583  df-uni 4860  df-br 5095  df-opab 5157  df-iota 6466  df-fv 6518  df-ov 7388  df-lininds 49012  df-lindeps 49014

This theorem is referenced by:  el0ldep  49036  ldepspr  49043  islindeps2  49053  isldepslvec2  49055  zlmodzxzldep  49074