Theorem rellininds 49555

Description: The class defining the relation between a module and its linearly independent subsets is a relation. (Contributed by AV, 13-Apr-2019.)

Assertion

Ref	Expression
rellininds	⊢ Rel linIndS

Proof of Theorem rellininds

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

Step	Hyp	Ref	Expression
1		df-lininds 49554	. 2 ⊢ linIndS = {⟨𝑠, 𝑚⟩ ∣ (𝑠 ∈ 𝒫 (Base‘𝑚) ∧ ∀𝑓 ∈ ((Base‘(Scalar‘𝑚)) ↑m 𝑠)((𝑓 finSupp (0g‘(Scalar‘𝑚)) ∧ (𝑓( linC ‘𝑚)𝑠) = (0g‘𝑚)) → ∀𝑥 ∈ 𝑠 (𝑓‘𝑥) = (0g‘(Scalar‘𝑚))))}
2	1	relopabiv 5797	1 ⊢ Rel linIndS

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144  ∀wral 3076  𝒫 cpw 4556   class class class wbr 5102  Rel wrel 5655  ‘cfv 6538  (class class class)co 7420   ↑_m cmap 8847   finSupp cfsupp 9353  Basecbs 17387  Scalarcsca 17431  0_gc0g 17610   linC clinc 49516   linIndS clininds 49552

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1572  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-v 3452  df-ss 3896  df-opab 5167  df-xp 5656  df-rel 5657  df-lininds 49554

This theorem is used by:  linindsv  49557