Theorem rellindf 21939

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

Syntax hints:  ¬ wn 3   ∧ wa 400   ∈ wcel 2143  ∀wral 3079  [wsbc 3745   ∖ cdif 3903  {csn 4590  dom cdm 5663   “ cima 5666  Rel wrel 5668  ⟶wf 6534  ‘cfv 6538  (class class class)co 7412  Basecbs 17270  Scalarcsca 17314   ·_𝑠 cvsca 17315  0_gc0g 17493  LSpanclspn 21073   LIndF clindf 21935

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735

This theorem depends on definitions:  df-bi 210  df-an 401  df-tru 1573  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-v 3457  df-ss 3923  df-opab 5175  df-xp 5669  df-rel 5670  df-lindf 21937

This theorem is referenced by:  lindff  21946  lindfind  21947  f1lindf  21953  lindfmm  21958  lsslindf  21961