Theorem linindslinci 49034

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 49033	. . 3 ⊢ (𝑆 linIndS 𝑀 → (𝑆 ∈ 𝒫 𝐵 ∧ ∀𝑓 ∈ (𝐸 ↑m 𝑆)((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍) → ∀𝑥 ∈ 𝑆 (𝑓‘𝑥) = 0 )))
7		breq1 5102	. . . . . . . . 9 ⊢ (𝑓 = 𝐹 → (𝑓 finSupp 0 ↔ 𝐹 finSupp 0 ))
8		oveq1 7399	. . . . . . . . . 10 ⊢ (𝑓 = 𝐹 → (𝑓( linC ‘𝑀)𝑆) = (𝐹( linC ‘𝑀)𝑆))
9	8	eqeq1d 2763	. . . . . . . . 9 ⊢ (𝑓 = 𝐹 → ((𝑓( linC ‘𝑀)𝑆) = 𝑍 ↔ (𝐹( linC ‘𝑀)𝑆) = 𝑍))
10	7, 9	anbi12d 641	. . . . . . . 8 ⊢ (𝑓 = 𝐹 → ((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍) ↔ (𝐹 finSupp 0 ∧ (𝐹( linC ‘𝑀)𝑆) = 𝑍)))
11		fveq1 6862	. . . . . . . . . 10 ⊢ (𝑓 = 𝐹 → (𝑓‘𝑥) = (𝐹‘𝑥))
12	11	eqeq1d 2763	. . . . . . . . 9 ⊢ (𝑓 = 𝐹 → ((𝑓‘𝑥) = 0 ↔ (𝐹‘𝑥) = 0 ))
13	12	ralbidv 3184	. . . . . . . 8 ⊢ (𝑓 = 𝐹 → (∀𝑥 ∈ 𝑆 (𝑓‘𝑥) = 0 ↔ ∀𝑥 ∈ 𝑆 (𝐹‘𝑥) = 0 ))
14	10, 13	imbi12d 346	. . . . . . 7 ⊢ (𝑓 = 𝐹 → (((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍) → ∀𝑥 ∈ 𝑆 (𝑓‘𝑥) = 0 ) ↔ ((𝐹 finSupp 0 ∧ (𝐹( linC ‘𝑀)𝑆) = 𝑍) → ∀𝑥 ∈ 𝑆 (𝐹‘𝑥) = 0 )))
15	14	rspcv 3577	. . . . . 6 ⊢ (𝐹 ∈ (𝐸 ↑m 𝑆) → (∀𝑓 ∈ (𝐸 ↑m 𝑆)((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍) → ∀𝑥 ∈ 𝑆 (𝑓‘𝑥) = 0 ) → ((𝐹 finSupp 0 ∧ (𝐹( linC ‘𝑀)𝑆) = 𝑍) → ∀𝑥 ∈ 𝑆 (𝐹‘𝑥) = 0 )))
16	15	com23 86	. . . . 5 ⊢ (𝐹 ∈ (𝐸 ↑m 𝑆) → ((𝐹 finSupp 0 ∧ (𝐹( linC ‘𝑀)𝑆) = 𝑍) → (∀𝑓 ∈ (𝐸 ↑m 𝑆)((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍) → ∀𝑥 ∈ 𝑆 (𝑓‘𝑥) = 0 ) → ∀𝑥 ∈ 𝑆 (𝐹‘𝑥) = 0 )))
17	16	3impib 1128	. . . 4 ⊢ ((𝐹 ∈ (𝐸 ↑m 𝑆) ∧ 𝐹 finSupp 0 ∧ (𝐹( linC ‘𝑀)𝑆) = 𝑍) → (∀𝑓 ∈ (𝐸 ↑m 𝑆)((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍) → ∀𝑥 ∈ 𝑆 (𝑓‘𝑥) = 0 ) → ∀𝑥 ∈ 𝑆 (𝐹‘𝑥) = 0 ))
18	17	com12 32	. . 3 ⊢ (∀𝑓 ∈ (𝐸 ↑m 𝑆)((𝑓 finSupp 0 ∧ (𝑓( linC ‘𝑀)𝑆) = 𝑍) → ∀𝑥 ∈ 𝑆 (𝑓‘𝑥) = 0 ) → ((𝐹 ∈ (𝐸 ↑m 𝑆) ∧ 𝐹 finSupp 0 ∧ (𝐹( linC ‘𝑀)𝑆) = 𝑍) → ∀𝑥 ∈ 𝑆 (𝐹‘𝑥) = 0 ))
19	6, 18	simpl2im 511	. 2 ⊢ (𝑆 linIndS 𝑀 → ((𝐹 ∈ (𝐸 ↑m 𝑆) ∧ 𝐹 finSupp 0 ∧ (𝐹( linC ‘𝑀)𝑆) = 𝑍) → ∀𝑥 ∈ 𝑆 (𝐹‘𝑥) = 0 ))
20	19	imp 410	1 ⊢ ((𝑆 linIndS 𝑀 ∧ (𝐹 ∈ (𝐸 ↑m 𝑆) ∧ 𝐹 finSupp 0 ∧ (𝐹( linC ‘𝑀)𝑆) = 𝑍)) → ∀𝑥 ∈ 𝑆 (𝐹‘𝑥) = 0 )

Syntax hints:   → wi 4   ∧ wa 399   ∧ w3a 1097   = wceq 1559   ∈ wcel 2141  ∀wral 3075  𝒫 cpw 4554   class class class wbr 5099  ‘cfv 6517  (class class class)co 7392   ↑_m cmap 8803   finSupp cfsupp 9304  Basecbs 17228  Scalarcsca 17272  0_gc0g 17451   linC clinc 48990   linIndS clininds 49026

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-ext 2733  ax-sep 5245  ax-pr 5389

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-sb 2090  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3076  df-rex 3086  df-rab 3414  df-v 3455  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-br 5100  df-opab 5162  df-xp 5651  df-rel 5652  df-iota 6473  df-fv 6525  df-ov 7395  df-lininds 49028

This theorem is referenced by: (None)