Theorem rellininds 49251

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 49250	. 2 ⊢ linIndS = {⟨𝑠, 𝑚⟩ ∣ (𝑠 ∈ 𝒫 (Base‘𝑚) ∧ ∀𝑓 ∈ ((Base‘(Scalar‘𝑚)) ↑m 𝑠)((𝑓 finSupp (0g‘(Scalar‘𝑚)) ∧ (𝑓( linC ‘𝑚)𝑠) = (0g‘𝑚)) → ∀𝑥 ∈ 𝑠 (𝑓‘𝑥) = (0g‘(Scalar‘𝑚))))}
2	1	relopabiv 5806	1 ⊢ Rel linIndS

This proof depends on syntax axioms:   → wi 4   ∧ wa 400   = wceq 1569   ∈ wcel 2142  ∀wral 3078  𝒫 cpw 4561   class class class wbr 5108  Rel wrel 5665  ‘cfv 6536  (class class class)co 7412   ↑_m cmap 8822   finSupp cfsupp 9319  Basecbs 17275  Scalarcsca 17319  0_gc0g 17498   linC clinc 49212   linIndS clininds 49248

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-ext 2734

This proof depends on definitions:  df-bi 210  df-an 401  df-tru 1572  df-ex 1809  df-sb 2096  df-clab 2741  df-cleq 2754  df-clel 2837  df-v 3456  df-ss 3921  df-opab 5173  df-xp 5666  df-rel 5667  df-lininds 49250

This theorem is used by:  linindsv  49253