Theorem rellindf 22027

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

This proof depends on syntax axioms:  ¬ wn 3   ∧ wa 401   ∈ wcel 2145  ∀wral 3078  [wsbc 3742   ∖ cdif 3899  {csn 4587  dom cdm 5659   “ cima 5662  Rel wrel 5664  ⟶wf 6533  ‘cfv 6537  (class class class)co 7417  Basecbs 17307  Scalarcsca 17351   ·_𝑠 cvsca 17352  0_gc0g 17530  LSpanclspn 21161   LIndF clindf 22023

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 2147  ax-9 2155  ax-ext 2734

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2741  df-cleq 2754  df-clel 2837  df-v 3455  df-ss 3919  df-opab 5172  df-xp 5665  df-rel 5666  df-lindf 22025

This theorem is used by:  lindff  22034  lindfind  22035  f1lindf  22041  lindfmm  22046  lsslindf  22049