Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  lindff Structured version   Visualization version   GIF version

Theorem lindff 20958
 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.
StepHypRef Expression
1 simpl 485 . . 3 ((𝐹 LIndF 𝑊𝑊𝑌) → 𝐹 LIndF 𝑊)
2 rellindf 20951 . . . . . 6 Rel LIndF
32brrelex1i 5607 . . . . 5 (𝐹 LIndF 𝑊𝐹 ∈ V)
4 lindff.b . . . . . 6 𝐵 = (Base‘𝑊)
5 eqid 2821 . . . . . 6 ( ·𝑠𝑊) = ( ·𝑠𝑊)
6 eqid 2821 . . . . . 6 (LSpan‘𝑊) = (LSpan‘𝑊)
7 eqid 2821 . . . . . 6 (Scalar‘𝑊) = (Scalar‘𝑊)
8 eqid 2821 . . . . . 6 (Base‘(Scalar‘𝑊)) = (Base‘(Scalar‘𝑊))
9 eqid 2821 . . . . . 6 (0g‘(Scalar‘𝑊)) = (0g‘(Scalar‘𝑊))
104, 5, 6, 7, 8, 9islindf 20955 . . . . 5 ((𝑊𝑌𝐹 ∈ V) → (𝐹 LIndF 𝑊 ↔ (𝐹:dom 𝐹𝐵 ∧ ∀𝑥 ∈ dom 𝐹𝑘 ∈ ((Base‘(Scalar‘𝑊)) ∖ {(0g‘(Scalar‘𝑊))}) ¬ (𝑘( ·𝑠𝑊)(𝐹𝑥)) ∈ ((LSpan‘𝑊)‘(𝐹 “ (dom 𝐹 ∖ {𝑥}))))))
113, 10sylan2 594 . . . 4 ((𝑊𝑌𝐹 LIndF 𝑊) → (𝐹 LIndF 𝑊 ↔ (𝐹:dom 𝐹𝐵 ∧ ∀𝑥 ∈ dom 𝐹𝑘 ∈ ((Base‘(Scalar‘𝑊)) ∖ {(0g‘(Scalar‘𝑊))}) ¬ (𝑘( ·𝑠𝑊)(𝐹𝑥)) ∈ ((LSpan‘𝑊)‘(𝐹 “ (dom 𝐹 ∖ {𝑥}))))))
1211ancoms 461 . . 3 ((𝐹 LIndF 𝑊𝑊𝑌) → (𝐹 LIndF 𝑊 ↔ (𝐹:dom 𝐹𝐵 ∧ ∀𝑥 ∈ dom 𝐹𝑘 ∈ ((Base‘(Scalar‘𝑊)) ∖ {(0g‘(Scalar‘𝑊))}) ¬ (𝑘( ·𝑠𝑊)(𝐹𝑥)) ∈ ((LSpan‘𝑊)‘(𝐹 “ (dom 𝐹 ∖ {𝑥}))))))
131, 12mpbid 234 . 2 ((𝐹 LIndF 𝑊𝑊𝑌) → (𝐹:dom 𝐹𝐵 ∧ ∀𝑥 ∈ dom 𝐹𝑘 ∈ ((Base‘(Scalar‘𝑊)) ∖ {(0g‘(Scalar‘𝑊))}) ¬ (𝑘( ·𝑠𝑊)(𝐹𝑥)) ∈ ((LSpan‘𝑊)‘(𝐹 “ (dom 𝐹 ∖ {𝑥})))))
1413simpld 497 1 ((𝐹 LIndF 𝑊𝑊𝑌) → 𝐹:dom 𝐹𝐵)
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 208   ∧ wa 398   = wceq 1533   ∈ wcel 2110  ∀wral 3138  Vcvv 3494   ∖ cdif 3932  {csn 4566   class class class wbr 5065  dom cdm 5554   “ cima 5557  ⟶wf 6350  ‘cfv 6354  (class class class)co 7155  Basecbs 16482  Scalarcsca 16567   ·𝑠 cvsca 16568  0gc0g 16712  LSpanclspn 19742   LIndF clindf 20947 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-sep 5202  ax-nul 5209  ax-pr 5329 This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-sbc 3772  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-nul 4291  df-if 4467  df-sn 4567  df-pr 4569  df-op 4573  df-uni 4838  df-br 5066  df-opab 5128  df-xp 5560  df-rel 5561  df-cnv 5562  df-co 5563  df-dm 5564  df-rn 5565  df-res 5566  df-ima 5567  df-iota 6313  df-fun 6356  df-fn 6357  df-f 6358  df-fv 6362  df-ov 7158  df-lindf 20949 This theorem is referenced by:  lindfind2  20961  lindff1  20963  lindfrn  20964  f1lindf  20965  indlcim  20983
 Copyright terms: Public domain W3C validator