Theorem lindff 22176

Description: Functional property of a linearly independent family. (Contributed by Stefan O'Rear, 24-Feb-2015.)

Hypothesis

Ref	Expression
lindff.b	⊢ 𝐵 = (Base‘𝑊)

Assertion

Ref	Expression
lindff	⊢ ((𝐹 LIndF 𝑊 ∧ 𝑊 ∈ 𝑌) → 𝐹:dom 𝐹⟶𝐵)

Proof of Theorem lindff

Dummy variables 𝑘 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpl 488	. . 3 ⊢ ((𝐹 LIndF 𝑊 ∧ 𝑊 ∈ 𝑌) → 𝐹 LIndF 𝑊)
2		rellindf 22169	. . . . . 6 ⊢ Rel LIndF
3	2	brrelex1i 5714	. . . . 5 ⊢ (𝐹 LIndF 𝑊 → 𝐹 ∈ V)
4		lindff.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝑊)
5		eqid 2763	. . . . . 6 ⊢ ( ·𝑠 ‘𝑊) = ( ·𝑠 ‘𝑊)
6		eqid 2763	. . . . . 6 ⊢ (LSpan‘𝑊) = (LSpan‘𝑊)
7		eqid 2763	. . . . . 6 ⊢ (Scalar‘𝑊) = (Scalar‘𝑊)
8		eqid 2763	. . . . . 6 ⊢ (Base‘(Scalar‘𝑊)) = (Base‘(Scalar‘𝑊))
9		eqid 2763	. . . . . 6 ⊢ (0g‘(Scalar‘𝑊)) = (0g‘(Scalar‘𝑊))
10	4, 5, 6, 7, 8, 9	islindf 22173	. . . . 5 ⊢ ((𝑊 ∈ 𝑌 ∧ 𝐹 ∈ V) → (𝐹 LIndF 𝑊 ↔ (𝐹:dom 𝐹⟶𝐵 ∧ ∀𝑥 ∈ dom 𝐹∀𝑘 ∈ ((Base‘(Scalar‘𝑊)) ∖ {(0g‘(Scalar‘𝑊))}) ¬ (𝑘( ·𝑠 ‘𝑊)(𝐹‘𝑥)) ∈ ((LSpan‘𝑊)‘(𝐹 “ (dom 𝐹 ∖ {𝑥}))))))
11	3, 10	sylan2 605	. . . 4 ⊢ ((𝑊 ∈ 𝑌 ∧ 𝐹 LIndF 𝑊) → (𝐹 LIndF 𝑊 ↔ (𝐹:dom 𝐹⟶𝐵 ∧ ∀𝑥 ∈ dom 𝐹∀𝑘 ∈ ((Base‘(Scalar‘𝑊)) ∖ {(0g‘(Scalar‘𝑊))}) ¬ (𝑘( ·𝑠 ‘𝑊)(𝐹‘𝑥)) ∈ ((LSpan‘𝑊)‘(𝐹 “ (dom 𝐹 ∖ {𝑥}))))))
12	11	ancoms 464	. . 3 ⊢ ((𝐹 LIndF 𝑊 ∧ 𝑊 ∈ 𝑌) → (𝐹 LIndF 𝑊 ↔ (𝐹:dom 𝐹⟶𝐵 ∧ ∀𝑥 ∈ dom 𝐹∀𝑘 ∈ ((Base‘(Scalar‘𝑊)) ∖ {(0g‘(Scalar‘𝑊))}) ¬ (𝑘( ·𝑠 ‘𝑊)(𝐹‘𝑥)) ∈ ((LSpan‘𝑊)‘(𝐹 “ (dom 𝐹 ∖ {𝑥}))))))
13	1, 12	mpbid 235	. 2 ⊢ ((𝐹 LIndF 𝑊 ∧ 𝑊 ∈ 𝑌) → (𝐹:dom 𝐹⟶𝐵 ∧ ∀𝑥 ∈ dom 𝐹∀𝑘 ∈ ((Base‘(Scalar‘𝑊)) ∖ {(0g‘(Scalar‘𝑊))}) ¬ (𝑘( ·𝑠 ‘𝑊)(𝐹‘𝑥)) ∈ ((LSpan‘𝑊)‘(𝐹 “ (dom 𝐹 ∖ {𝑥})))))
14	13	simpld 500	1 ⊢ ((𝐹 LIndF 𝑊 ∧ 𝑊 ∈ 𝑌) → 𝐹:dom 𝐹⟶𝐵)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080  Vcvv 3454   ∖ cdif 4048  {csn 4588   class class class wbr 5108  dom cdm 5658   “ cima 5661  ⟶wf 6562  ‘cfv 6566  (class class class)co 7451  Basecbs 17431  Scalarcsca 17475   ·_𝑠 cvsca 17476  0_gc0g 17660  LSpanclspn 21297   LIndF clindf 22165

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pr 5398

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-fv 6574  df-ov 7454  df-lindf 22167

This theorem is used by:  lindfind2  22179  lindff1  22181  lindfrn  22182  f1lindf  22183  indlcim  22201