Theorem rellindf 21918

Description: The independent-family predicate is a proper relation and can be used with brrelex1i 5708. (Contributed by Stefan O'Rear, 24-Feb-2015.)

Assertion

Ref	Expression
rellindf	⊢ Rel LIndF

Proof of Theorem rellindf

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

Step	Hyp	Ref	Expression
1		df-lindf 21916	. 2 ⊢ LIndF = {⟨𝑓, 𝑤⟩ ∣ (𝑓:dom 𝑓⟶(Base‘𝑤) ∧ [(Scalar‘𝑤) / 𝑠]∀𝑥 ∈ dom 𝑓∀𝑘 ∈ ((Base‘𝑠) ∖ {(0g‘𝑠)}) ¬ (𝑘( ·𝑠 ‘𝑤)(𝑓‘𝑥)) ∈ ((LSpan‘𝑤)‘(𝑓 “ (dom 𝑓 ∖ {𝑥}))))}
2	1	relopabiv 5798	1 ⊢ Rel LIndF

Syntax hints:  ¬ wn 3   ∧ wa 400   ∈ wcel 2145  ∀wral 3079  [wsbc 3747   ∖ cdif 3904  {csn 4585  dom cdm 5652   “ cima 5655  Rel wrel 5657  ⟶wf 6521  ‘cfv 6525  (class class class)co 7400  Basecbs 17259  Scalarcsca 17303   ·_𝑠 cvsca 17304  0_gc0g 17482  LSpanclspn 21061   LIndF clindf 21914

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-ext 2737

This theorem depends on definitions:  df-bi 210  df-an 401  df-tru 1566  df-ex 1803  df-sb 2094  df-clab 2744  df-cleq 2757  df-clel 2840  df-v 3459  df-ss 3924  df-opab 5168  df-xp 5658  df-rel 5659  df-lindf 21916

This theorem is referenced by:  lindff  21925  lindfind  21926  f1lindf  21932  lindfmm  21937  lsslindf  21940