Theorem linindscl 48943

Description: A linearly independent set is a subset of (the base set of) a module. (Contributed by AV, 13-Apr-2019.)

Assertion

Ref	Expression
linindscl	⊢ (𝑆 linIndS 𝑀 → 𝑆 ∈ 𝒫 (Base‘𝑀))

Proof of Theorem linindscl

Dummy variables 𝑥 𝑓 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2737	. . 3 ⊢ (Base‘𝑀) = (Base‘𝑀)
2		eqid 2737	. . 3 ⊢ (0g‘𝑀) = (0g‘𝑀)
3		eqid 2737	. . 3 ⊢ (Scalar‘𝑀) = (Scalar‘𝑀)
4		eqid 2737	. . 3 ⊢ (Base‘(Scalar‘𝑀)) = (Base‘(Scalar‘𝑀))
5		eqid 2737	. . 3 ⊢ (0g‘(Scalar‘𝑀)) = (0g‘(Scalar‘𝑀))
6	1, 2, 3, 4, 5	linindsi 48939	. 2 ⊢ (𝑆 linIndS 𝑀 → (𝑆 ∈ 𝒫 (Base‘𝑀) ∧ ∀𝑓 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑆)((𝑓 finSupp (0g‘(Scalar‘𝑀)) ∧ (𝑓( linC ‘𝑀)𝑆) = (0g‘𝑀)) → ∀𝑥 ∈ 𝑆 (𝑓‘𝑥) = (0g‘(Scalar‘𝑀)))))
7	6	simpld 494	1 ⊢ (𝑆 linIndS 𝑀 → 𝑆 ∈ 𝒫 (Base‘𝑀))

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1542   ∈ wcel 2114  ∀wral 3052  𝒫 cpw 4542   class class class wbr 5086  ‘cfv 6494  (class class class)co 7362   ↑_m cmap 8768   finSupp cfsupp 9269  Basecbs 17174  Scalarcsca 17218  0_gc0g 17397   linC clinc 48896   linIndS clininds 48932

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2709  ax-sep 5232  ax-pr 5372

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-ral 3053  df-rex 3063  df-rab 3391  df-v 3432  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-br 5087  df-opab 5149  df-xp 5632  df-rel 5633  df-iota 6450  df-fv 6502  df-ov 7365  df-lininds 48934

This theorem is referenced by: (None)