Theorem lindff 22121

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 22114	. . . . . 6 ⊢ Rel LIndF
3	2	brrelex1i 5707	. . . . 5 ⊢ (𝐹 LIndF 𝑊 → 𝐹 ∈ V)
4		lindff.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝑊)
5		eqid 2761	. . . . . 6 ⊢ ( ·𝑠 ‘𝑊) = ( ·𝑠 ‘𝑊)
6		eqid 2761	. . . . . 6 ⊢ (LSpan‘𝑊) = (LSpan‘𝑊)
7		eqid 2761	. . . . . 6 ⊢ (Scalar‘𝑊) = (Scalar‘𝑊)
8		eqid 2761	. . . . . 6 ⊢ (Base‘(Scalar‘𝑊)) = (Base‘(Scalar‘𝑊))
9		eqid 2761	. . . . . 6 ⊢ (0g‘(Scalar‘𝑊)) = (0g‘(Scalar‘𝑊))
10	4, 5, 6, 7, 8, 9	islindf 22118	. . . . 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 2145  ∀wral 3077  Vcvv 3451   ∖ cdif 3896  {csn 4584   class class class wbr 5103  dom cdm 5651   “ cima 5654  ⟶wf 6534  ‘cfv 6538  (class class class)co 7420  Basecbs 17387  Scalarcsca 17431   ·_𝑠 cvsca 17432  0_gc0g 17610  LSpanclspn 21246   LIndF clindf 22110

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  ax-sep 5249  ax-nul 5260  ax-pr 5391

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 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-sbc 3740  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  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 6494  df-fun 6540  df-fn 6541  df-f 6542  df-fv 6546  df-ov 7423  df-lindf 22112

This theorem is used by:  lindfind2  22124  lindff1  22126  lindfrn  22127  f1lindf  22128  indlcim  22146