Theorem rellininds 49360

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

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3078  𝒫 cpw 4560   class class class wbr 5107  Rel wrel 5664  ‘cfv 6537  (class class class)co 7416   ↑_m cmap 8829   finSupp cfsupp 9334  Basecbs 17305  Scalarcsca 17349  0_gc0g 17528   linC clinc 49321   linIndS clininds 49357

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 2147  ax-9 2155  ax-ext 2734

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2741  df-cleq 2754  df-clel 2837  df-v 3455  df-ss 3919  df-opab 5172  df-xp 5665  df-rel 5666  df-lininds 49359

This theorem is used by:  linindsv  49362