Theorem rellindf 21763

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

Syntax hints:  ¬ wn 3   ∧ wa 395   ∈ wcel 2113  ∀wral 3051  [wsbc 3740   ∖ cdif 3898  {csn 4580  dom cdm 5624   “ cima 5627  Rel wrel 5629  ⟶wf 6488  ‘cfv 6492  (class class class)co 7358  Basecbs 17136  Scalarcsca 17180   ·_𝑠 cvsca 17181  0_gc0g 17359  LSpanclspn 20922   LIndF clindf 21759

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-ext 2708

This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1544  df-ex 1781  df-sb 2068  df-clab 2715  df-cleq 2728  df-clel 2811  df-v 3442  df-ss 3918  df-opab 5161  df-xp 5630  df-rel 5631  df-lindf 21761

This theorem is referenced by:  lindff  21770  lindfind  21771  f1lindf  21777  lindfmm  21782  lsslindf  21785