Theorem rellindf 21840

Description: The independent-family predicate is a proper relation and can be used with brrelex1i 5701. (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 21838	. 2 ⊢ LIndF = {⟨𝑓, 𝑤⟩ ∣ (𝑓:dom 𝑓⟶(Base‘𝑤) ∧ [(Scalar‘𝑤) / 𝑠]∀𝑥 ∈ dom 𝑓∀𝑘 ∈ ((Base‘𝑠) ∖ {(0g‘𝑠)}) ¬ (𝑘( ·𝑠 ‘𝑤)(𝑓‘𝑥)) ∈ ((LSpan‘𝑤)‘(𝑓 “ (dom 𝑓 ∖ {𝑥}))))}
2	1	relopabiv 5791	1 ⊢ Rel LIndF

Syntax hints:  ¬ wn 3   ∧ wa 399   ∈ wcel 2141  ∀wral 3075  [wsbc 3744   ∖ cdif 3901  {csn 4581  dom cdm 5645   “ cima 5648  Rel wrel 5650  ⟶wf 6513  ‘cfv 6517  (class class class)co 7392  Basecbs 17228  Scalarcsca 17272   ·_𝑠 cvsca 17273  0_gc0g 17451  LSpanclspn 21018   LIndF clindf 21836

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-ext 2733

This theorem depends on definitions:  df-bi 209  df-an 400  df-tru 1562  df-ex 1799  df-sb 2090  df-clab 2740  df-cleq 2753  df-clel 2836  df-v 3455  df-ss 3921  df-opab 5162  df-xp 5651  df-rel 5652  df-lindf 21838

This theorem is referenced by:  lindff  21847  lindfind  21848  f1lindf  21854  lindfmm  21859  lsslindf  21862