Theorem rellindf 22094

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

This proof depends on syntax axioms:  ¬ wn 3   ∧ wa 401   ∈ wcel 2145  ∀wral 3077  [wsbc 3739   ∖ cdif 3896  {csn 4584  dom cdm 5651   “ cima 5654  Rel wrel 5656  ⟶wf 6527  ‘cfv 6531  (class class class)co 7412  Basecbs 17367  Scalarcsca 17411   ·_𝑠 cvsca 17412  0_gc0g 17590  LSpanclspn 21226   LIndF clindf 22090

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 2733

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-v 3453  df-ss 3916  df-opab 5168  df-xp 5657  df-rel 5658  df-lindf 22092

This theorem is used by:  lindff  22101  lindfind  22102  f1lindf  22108  lindfmm  22113  lsslindf  22116