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

Theorem lbsind 20257
Description: A basis is linearly independent; that is, every element has a span which trivially intersects the span of the remainder of the basis. (Contributed by Mario Carneiro, 12-Jan-2015.)
Hypotheses
Ref Expression
lbsss.v 𝑉 = (Base‘𝑊)
lbsss.j 𝐽 = (LBasis‘𝑊)
lbssp.n 𝑁 = (LSpan‘𝑊)
lbsind.f 𝐹 = (Scalar‘𝑊)
lbsind.s · = ( ·𝑠𝑊)
lbsind.k 𝐾 = (Base‘𝐹)
lbsind.z 0 = (0g𝐹)
Assertion
Ref Expression
lbsind (((𝐵𝐽𝐸𝐵) ∧ (𝐴𝐾𝐴0 )) → ¬ (𝐴 · 𝐸) ∈ (𝑁‘(𝐵 ∖ {𝐸})))

Proof of Theorem lbsind
Dummy variables 𝑦 𝑥 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eldifsn 4717 . 2 (𝐴 ∈ (𝐾 ∖ { 0 }) ↔ (𝐴𝐾𝐴0 ))
2 elfvdm 6788 . . . . . . . 8 (𝐵 ∈ (LBasis‘𝑊) → 𝑊 ∈ dom LBasis)
3 lbsss.j . . . . . . . 8 𝐽 = (LBasis‘𝑊)
42, 3eleq2s 2857 . . . . . . 7 (𝐵𝐽𝑊 ∈ dom LBasis)
5 lbsss.v . . . . . . . 8 𝑉 = (Base‘𝑊)
6 lbsind.f . . . . . . . 8 𝐹 = (Scalar‘𝑊)
7 lbsind.s . . . . . . . 8 · = ( ·𝑠𝑊)
8 lbsind.k . . . . . . . 8 𝐾 = (Base‘𝐹)
9 lbssp.n . . . . . . . 8 𝑁 = (LSpan‘𝑊)
10 lbsind.z . . . . . . . 8 0 = (0g𝐹)
115, 6, 7, 8, 3, 9, 10islbs 20253 . . . . . . 7 (𝑊 ∈ dom LBasis → (𝐵𝐽 ↔ (𝐵𝑉 ∧ (𝑁𝐵) = 𝑉 ∧ ∀𝑥𝐵𝑦 ∈ (𝐾 ∖ { 0 }) ¬ (𝑦 · 𝑥) ∈ (𝑁‘(𝐵 ∖ {𝑥})))))
124, 11syl 17 . . . . . 6 (𝐵𝐽 → (𝐵𝐽 ↔ (𝐵𝑉 ∧ (𝑁𝐵) = 𝑉 ∧ ∀𝑥𝐵𝑦 ∈ (𝐾 ∖ { 0 }) ¬ (𝑦 · 𝑥) ∈ (𝑁‘(𝐵 ∖ {𝑥})))))
1312ibi 266 . . . . 5 (𝐵𝐽 → (𝐵𝑉 ∧ (𝑁𝐵) = 𝑉 ∧ ∀𝑥𝐵𝑦 ∈ (𝐾 ∖ { 0 }) ¬ (𝑦 · 𝑥) ∈ (𝑁‘(𝐵 ∖ {𝑥}))))
1413simp3d 1142 . . . 4 (𝐵𝐽 → ∀𝑥𝐵𝑦 ∈ (𝐾 ∖ { 0 }) ¬ (𝑦 · 𝑥) ∈ (𝑁‘(𝐵 ∖ {𝑥})))
15 oveq2 7263 . . . . . . 7 (𝑥 = 𝐸 → (𝑦 · 𝑥) = (𝑦 · 𝐸))
16 sneq 4568 . . . . . . . . 9 (𝑥 = 𝐸 → {𝑥} = {𝐸})
1716difeq2d 4053 . . . . . . . 8 (𝑥 = 𝐸 → (𝐵 ∖ {𝑥}) = (𝐵 ∖ {𝐸}))
1817fveq2d 6760 . . . . . . 7 (𝑥 = 𝐸 → (𝑁‘(𝐵 ∖ {𝑥})) = (𝑁‘(𝐵 ∖ {𝐸})))
1915, 18eleq12d 2833 . . . . . 6 (𝑥 = 𝐸 → ((𝑦 · 𝑥) ∈ (𝑁‘(𝐵 ∖ {𝑥})) ↔ (𝑦 · 𝐸) ∈ (𝑁‘(𝐵 ∖ {𝐸}))))
2019notbid 317 . . . . 5 (𝑥 = 𝐸 → (¬ (𝑦 · 𝑥) ∈ (𝑁‘(𝐵 ∖ {𝑥})) ↔ ¬ (𝑦 · 𝐸) ∈ (𝑁‘(𝐵 ∖ {𝐸}))))
21 oveq1 7262 . . . . . . 7 (𝑦 = 𝐴 → (𝑦 · 𝐸) = (𝐴 · 𝐸))
2221eleq1d 2823 . . . . . 6 (𝑦 = 𝐴 → ((𝑦 · 𝐸) ∈ (𝑁‘(𝐵 ∖ {𝐸})) ↔ (𝐴 · 𝐸) ∈ (𝑁‘(𝐵 ∖ {𝐸}))))
2322notbid 317 . . . . 5 (𝑦 = 𝐴 → (¬ (𝑦 · 𝐸) ∈ (𝑁‘(𝐵 ∖ {𝐸})) ↔ ¬ (𝐴 · 𝐸) ∈ (𝑁‘(𝐵 ∖ {𝐸}))))
2420, 23rspc2v 3562 . . . 4 ((𝐸𝐵𝐴 ∈ (𝐾 ∖ { 0 })) → (∀𝑥𝐵𝑦 ∈ (𝐾 ∖ { 0 }) ¬ (𝑦 · 𝑥) ∈ (𝑁‘(𝐵 ∖ {𝑥})) → ¬ (𝐴 · 𝐸) ∈ (𝑁‘(𝐵 ∖ {𝐸}))))
2514, 24syl5com 31 . . 3 (𝐵𝐽 → ((𝐸𝐵𝐴 ∈ (𝐾 ∖ { 0 })) → ¬ (𝐴 · 𝐸) ∈ (𝑁‘(𝐵 ∖ {𝐸}))))
2625impl 455 . 2 (((𝐵𝐽𝐸𝐵) ∧ 𝐴 ∈ (𝐾 ∖ { 0 })) → ¬ (𝐴 · 𝐸) ∈ (𝑁‘(𝐵 ∖ {𝐸})))
271, 26sylan2br 594 1 (((𝐵𝐽𝐸𝐵) ∧ (𝐴𝐾𝐴0 )) → ¬ (𝐴 · 𝐸) ∈ (𝑁‘(𝐵 ∖ {𝐸})))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 205  wa 395  w3a 1085   = wceq 1539  wcel 2108  wne 2942  wral 3063  cdif 3880  wss 3883  {csn 4558  dom cdm 5580  cfv 6418  (class class class)co 7255  Basecbs 16840  Scalarcsca 16891   ·𝑠 cvsca 16892  0gc0g 17067  LSpanclspn 20148  LBasisclbs 20251
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-sbc 3712  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-br 5071  df-opab 5133  df-mpt 5154  df-id 5480  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-iota 6376  df-fun 6420  df-fv 6426  df-ov 7258  df-lbs 20252
This theorem is referenced by:  lbsind2  20258
  Copyright terms: Public domain W3C validator