Theorem rellindf 21995

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

This proof depends on syntax axioms:  ¬ wn 3   ∧ wa 401   ∈ wcel 2146  ∀wral 3082  [wsbc 3747   ∖ cdif 3905  {csn 4594  dom cdm 5666   “ cima 5669  Rel wrel 5671  ⟶wf 6539  ‘cfv 6543  (class class class)co 7423  Basecbs 17294  Scalarcsca 17338   ·_𝑠 cvsca 17339  0_gc0g 17517  LSpanclspn 21129   LIndF clindf 21991

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 2148  ax-9 2156  ax-ext 2738

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2745  df-cleq 2758  df-clel 2841  df-v 3460  df-ss 3925  df-opab 5179  df-xp 5672  df-rel 5673  df-lindf 21993

This theorem is used by:  lindff  22002  lindfind  22003  f1lindf  22009  lindfmm  22014  lsslindf  22017