Theorem lindff 22130

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 22123	. . . . . 6 ⊢ Rel LIndF
3	2	brrelex1i 5707	. . . . 5 ⊢ (𝐹 LIndF 𝑊 → 𝐹 ∈ V)
4		lindff.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝑊)
5		eqid 2760	. . . . . 6 ⊢ ( ·𝑠 ‘𝑊) = ( ·𝑠 ‘𝑊)
6		eqid 2760	. . . . . 6 ⊢ (LSpan‘𝑊) = (LSpan‘𝑊)
7		eqid 2760	. . . . . 6 ⊢ (Scalar‘𝑊) = (Scalar‘𝑊)
8		eqid 2760	. . . . . 6 ⊢ (Base‘(Scalar‘𝑊)) = (Base‘(Scalar‘𝑊))
9		eqid 2760	. . . . . 6 ⊢ (0g‘(Scalar‘𝑊)) = (0g‘(Scalar‘𝑊))
10	4, 5, 6, 7, 8, 9	islindf 22127	. . . . 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 1569   ∈ wcel 2144  ∀wral 3076  Vcvv 3450   ∖ cdif 4044  {csn 4584   class class class wbr 5102  dom cdm 5651   “ cima 5654  ⟶wf 6539  ‘cfv 6543  (class class class)co 7424  Basecbs 17396  Scalarcsca 17440   ·_𝑠 cvsca 17441  0_gc0g 17619  LSpanclspn 21255   LIndF clindf 22119

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5391

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6497  df-fun 6545  df-fn 6546  df-f 6547  df-fv 6551  df-ov 7427  df-lindf 22121

This theorem is used by:  lindfind2  22133  lindff1  22135  lindfrn  22136  f1lindf  22137  indlcim  22155