Theorem linindslinci 49269

Description: The implications of being a linearly independent subset and a linear combination of this subset being 0. (Contributed by AV, 24-Apr-2019.) (Revised by AV, 30-Jul-2019.)

Hypotheses

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

Assertion

Ref	Expression
linindslinci	⊢ ((𝑆 linIndS 𝑀 ∧ (𝐹 ∈ (𝐸 ↑m 𝑆) ∧ 𝐹 finSupp 0 ∧ (𝐹( linC ‘𝑀)𝑆) = 𝑍)) → ∀𝑥 ∈ 𝑆 (𝐹‘𝑥) = 0 )

Distinct variable groups:   𝑥,𝑀   𝑥,𝑆   𝑥,𝐹

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

Proof of Theorem linindslinci

Dummy variable 𝑓 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		islininds.b	. . . 4 ⊢ 𝐵 = (Base‘𝑀)
2		islininds.z	. . . 4 ⊢ 𝑍 = (0g‘𝑀)
3		islininds.r	. . . 4 ⊢ 𝑅 = (Scalar‘𝑀)
4		islininds.e	. . . 4 ⊢ 𝐸 = (Base‘𝑅)
5		islininds.0	. . . 4 ⊢ 0 = (0g‘𝑅)
6	1, 2, 3, 4, 5	linindsi 49268	. . 3 ⊢ (𝑆 linIndS 𝑀 → (𝑆 ∈ 𝒫 𝐵 ∧ ∀𝑓 ∈ (𝐸 ↑m 𝑆)((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍) → ∀𝑥 ∈ 𝑆 (𝑓‘𝑥) = 0 )))
7		breq1 5117	. . . . . . . . 9 ⊢ (𝑓 = 𝐹 → (𝑓 finSupp 0 ↔ 𝐹 finSupp 0 ))
8		oveq1 7430	. . . . . . . . . 10 ⊢ (𝑓 = 𝐹 → (𝑓( linC ‘𝑀)𝑆) = (𝐹( linC ‘𝑀)𝑆))
9	8	eqeq1d 2768	. . . . . . . . 9 ⊢ (𝑓 = 𝐹 → ((𝑓( linC ‘𝑀)𝑆) = 𝑍 ↔ (𝐹( linC ‘𝑀)𝑆) = 𝑍))
10	7, 9	anbi12d 644	. . . . . . . 8 ⊢ (𝑓 = 𝐹 → ((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍) ↔ (𝐹 finSupp 0 ∧ (𝐹( linC ‘𝑀)𝑆) = 𝑍)))
11		fveq1 6887	. . . . . . . . . 10 ⊢ (𝑓 = 𝐹 → (𝑓‘𝑥) = (𝐹‘𝑥))
12	11	eqeq1d 2768	. . . . . . . . 9 ⊢ (𝑓 = 𝐹 → ((𝑓‘𝑥) = 0 ↔ (𝐹‘𝑥) = 0 ))
13	12	ralbidv 3191	. . . . . . . 8 ⊢ (𝑓 = 𝐹 → (∀𝑥 ∈ 𝑆 (𝑓‘𝑥) = 0 ↔ ∀𝑥 ∈ 𝑆 (𝐹‘𝑥) = 0 ))
14	10, 13	imbi12d 347	. . . . . . 7 ⊢ (𝑓 = 𝐹 → (((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍) → ∀𝑥 ∈ 𝑆 (𝑓‘𝑥) = 0 ) ↔ ((𝐹 finSupp 0 ∧ (𝐹( linC ‘𝑀)𝑆) = 𝑍) → ∀𝑥 ∈ 𝑆 (𝐹‘𝑥) = 0 )))
15	14	rspcv 3580	. . . . . 6 ⊢ (𝐹 ∈ (𝐸 ↑m 𝑆) → (∀𝑓 ∈ (𝐸 ↑m 𝑆)((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍) → ∀𝑥 ∈ 𝑆 (𝑓‘𝑥) = 0 ) → ((𝐹 finSupp 0 ∧ (𝐹( linC ‘𝑀)𝑆) = 𝑍) → ∀𝑥 ∈ 𝑆 (𝐹‘𝑥) = 0 )))
16	15	com23 87	. . . . 5 ⊢ (𝐹 ∈ (𝐸 ↑m 𝑆) → ((𝐹 finSupp 0 ∧ (𝐹( linC ‘𝑀)𝑆) = 𝑍) → (∀𝑓 ∈ (𝐸 ↑m 𝑆)((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍) → ∀𝑥 ∈ 𝑆 (𝑓‘𝑥) = 0 ) → ∀𝑥 ∈ 𝑆 (𝐹‘𝑥) = 0 )))
17	16	3impib 1134	. . . 4 ⊢ ((𝐹 ∈ (𝐸 ↑m 𝑆) ∧ 𝐹 finSupp 0 ∧ (𝐹( linC ‘𝑀)𝑆) = 𝑍) → (∀𝑓 ∈ (𝐸 ↑m 𝑆)((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍) → ∀𝑥 ∈ 𝑆 (𝑓‘𝑥) = 0 ) → ∀𝑥 ∈ 𝑆 (𝐹‘𝑥) = 0 ))
18	17	com12 33	. . 3 ⊢ (∀𝑓 ∈ (𝐸 ↑m 𝑆)((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍) → ∀𝑥 ∈ 𝑆 (𝑓‘𝑥) = 0 ) → ((𝐹 ∈ (𝐸 ↑m 𝑆) ∧ 𝐹 finSupp 0 ∧ (𝐹( linC ‘𝑀)𝑆) = 𝑍) → ∀𝑥 ∈ 𝑆 (𝐹‘𝑥) = 0 ))
19	6, 18	simpl2im 513	. 2 ⊢ (𝑆 linIndS 𝑀 → ((𝐹 ∈ (𝐸 ↑m 𝑆) ∧ 𝐹 finSupp 0 ∧ (𝐹( linC ‘𝑀)𝑆) = 𝑍) → ∀𝑥 ∈ 𝑆 (𝐹‘𝑥) = 0 ))
20	19	imp 412	1 ⊢ ((𝑆 linIndS 𝑀 ∧ (𝐹 ∈ (𝐸 ↑m 𝑆) ∧ 𝐹 finSupp 0 ∧ (𝐹( linC ‘𝑀)𝑆) = 𝑍)) → ∀𝑥 ∈ 𝑆 (𝐹‘𝑥) = 0 )

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2146  ∀wral 3082  𝒫 cpw 4567   class class class wbr 5114  ‘cfv 6543  (class class class)co 7423   ↑_m cmap 8833   finSupp cfsupp 9331  Basecbs 17294  Scalarcsca 17338  0_gc0g 17517   linC clinc 49225   linIndS clininds 49261

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-ext 2738  ax-sep 5262  ax-pr 5409

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2745  df-cleq 2758  df-clel 2841  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-br 5115  df-opab 5179  df-xp 5672  df-rel 5673  df-iota 6499  df-fv 6551  df-ov 7426  df-lininds 49263

This theorem is used by: (None)