Theorem lindff 22017

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 22010	. . . . . 6 ⊢ Rel LIndF
3	2	brrelex1i 5719	. . . . 5 ⊢ (𝐹 LIndF 𝑊 → 𝐹 ∈ V)
4		lindff.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝑊)
5		eqid 2765	. . . . . 6 ⊢ ( ·𝑠 ‘𝑊) = ( ·𝑠 ‘𝑊)
6		eqid 2765	. . . . . 6 ⊢ (LSpan‘𝑊) = (LSpan‘𝑊)
7		eqid 2765	. . . . . 6 ⊢ (Scalar‘𝑊) = (Scalar‘𝑊)
8		eqid 2765	. . . . . 6 ⊢ (Base‘(Scalar‘𝑊)) = (Base‘(Scalar‘𝑊))
9		eqid 2765	. . . . . 6 ⊢ (0g‘(Scalar‘𝑊)) = (0g‘(Scalar‘𝑊))
10	4, 5, 6, 7, 8, 9	islindf 22014	. . . . 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 2146  ∀wral 3081  Vcvv 3457   ∖ cdif 3903  {csn 4591   class class class wbr 5111  dom cdm 5663   “ cima 5666  ⟶wf 6536  ‘cfv 6540  (class class class)co 7419  Basecbs 17293  Scalarcsca 17337   ·_𝑠 cvsca 17338  0_gc0g 17516  LSpanclspn 21144   LIndF clindf 22006

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 2148  ax-9 2156  ax-ext 2737  ax-sep 5259  ax-nul 5271  ax-pr 5406

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 2744  df-cleq 2757  df-clel 2840  df-ne 2961  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-sbc 3747  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-opab 5176  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-fv 6548  df-ov 7422  df-lindf 22008

This theorem is used by:  lindfind2  22020  lindff1  22022  lindfrn  22023  f1lindf  22024  indlcim  22042