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

Theorem lbsind 19933
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 4680 . 2 (𝐴 ∈ (𝐾 ∖ { 0 }) ↔ (𝐴𝐾𝐴0 ))
2 elfvdm 6695 . . . . . . . 8 (𝐵 ∈ (LBasis‘𝑊) → 𝑊 ∈ dom LBasis)
3 lbsss.j . . . . . . . 8 𝐽 = (LBasis‘𝑊)
42, 3eleq2s 2870 . . . . . . 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 19929 . . . . . . 7 (𝑊 ∈ dom LBasis → (𝐵𝐽 ↔ (𝐵𝑉 ∧ (𝑁𝐵) = 𝑉 ∧ ∀𝑥𝐵𝑦 ∈ (𝐾 ∖ { 0 }) ¬ (𝑦 · 𝑥) ∈ (𝑁‘(𝐵 ∖ {𝑥})))))
124, 11syl 17 . . . . . 6 (𝐵𝐽 → (𝐵𝐽 ↔ (𝐵𝑉 ∧ (𝑁𝐵) = 𝑉 ∧ ∀𝑥𝐵𝑦 ∈ (𝐾 ∖ { 0 }) ¬ (𝑦 · 𝑥) ∈ (𝑁‘(𝐵 ∖ {𝑥})))))
1312ibi 270 . . . . 5 (𝐵𝐽 → (𝐵𝑉 ∧ (𝑁𝐵) = 𝑉 ∧ ∀𝑥𝐵𝑦 ∈ (𝐾 ∖ { 0 }) ¬ (𝑦 · 𝑥) ∈ (𝑁‘(𝐵 ∖ {𝑥}))))
1413simp3d 1141 . . . 4 (𝐵𝐽 → ∀𝑥𝐵𝑦 ∈ (𝐾 ∖ { 0 }) ¬ (𝑦 · 𝑥) ∈ (𝑁‘(𝐵 ∖ {𝑥})))
15 oveq2 7164 . . . . . . 7 (𝑥 = 𝐸 → (𝑦 · 𝑥) = (𝑦 · 𝐸))
16 sneq 4535 . . . . . . . . 9 (𝑥 = 𝐸 → {𝑥} = {𝐸})
1716difeq2d 4030 . . . . . . . 8 (𝑥 = 𝐸 → (𝐵 ∖ {𝑥}) = (𝐵 ∖ {𝐸}))
1817fveq2d 6667 . . . . . . 7 (𝑥 = 𝐸 → (𝑁‘(𝐵 ∖ {𝑥})) = (𝑁‘(𝐵 ∖ {𝐸})))
1915, 18eleq12d 2846 . . . . . 6 (𝑥 = 𝐸 → ((𝑦 · 𝑥) ∈ (𝑁‘(𝐵 ∖ {𝑥})) ↔ (𝑦 · 𝐸) ∈ (𝑁‘(𝐵 ∖ {𝐸}))))
2019notbid 321 . . . . 5 (𝑥 = 𝐸 → (¬ (𝑦 · 𝑥) ∈ (𝑁‘(𝐵 ∖ {𝑥})) ↔ ¬ (𝑦 · 𝐸) ∈ (𝑁‘(𝐵 ∖ {𝐸}))))
21 oveq1 7163 . . . . . . 7 (𝑦 = 𝐴 → (𝑦 · 𝐸) = (𝐴 · 𝐸))
2221eleq1d 2836 . . . . . 6 (𝑦 = 𝐴 → ((𝑦 · 𝐸) ∈ (𝑁‘(𝐵 ∖ {𝐸})) ↔ (𝐴 · 𝐸) ∈ (𝑁‘(𝐵 ∖ {𝐸}))))
2322notbid 321 . . . . 5 (𝑦 = 𝐴 → (¬ (𝑦 · 𝐸) ∈ (𝑁‘(𝐵 ∖ {𝐸})) ↔ ¬ (𝐴 · 𝐸) ∈ (𝑁‘(𝐵 ∖ {𝐸}))))
2420, 23rspc2v 3553 . . . 4 ((𝐸𝐵𝐴 ∈ (𝐾 ∖ { 0 })) → (∀𝑥𝐵𝑦 ∈ (𝐾 ∖ { 0 }) ¬ (𝑦 · 𝑥) ∈ (𝑁‘(𝐵 ∖ {𝑥})) → ¬ (𝐴 · 𝐸) ∈ (𝑁‘(𝐵 ∖ {𝐸}))))
2514, 24syl5com 31 . . 3 (𝐵𝐽 → ((𝐸𝐵𝐴 ∈ (𝐾 ∖ { 0 })) → ¬ (𝐴 · 𝐸) ∈ (𝑁‘(𝐵 ∖ {𝐸}))))
2625impl 459 . 2 (((𝐵𝐽𝐸𝐵) ∧ 𝐴 ∈ (𝐾 ∖ { 0 })) → ¬ (𝐴 · 𝐸) ∈ (𝑁‘(𝐵 ∖ {𝐸})))
271, 26sylan2br 597 1 (((𝐵𝐽𝐸𝐵) ∧ (𝐴𝐾𝐴0 )) → ¬ (𝐴 · 𝐸) ∈ (𝑁‘(𝐵 ∖ {𝐸})))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 209  wa 399  w3a 1084   = wceq 1538  wcel 2111  wne 2951  wral 3070  cdif 3857  wss 3860  {csn 4525  dom cdm 5528  cfv 6340  (class class class)co 7156  Basecbs 16554  Scalarcsca 16639   ·𝑠 cvsca 16640  0gc0g 16784  LSpanclspn 19824  LBasisclbs 19927
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2729  ax-sep 5173  ax-nul 5180  ax-pow 5238  ax-pr 5302
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-fal 1551  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2557  df-eu 2588  df-clab 2736  df-cleq 2750  df-clel 2830  df-nfc 2901  df-ne 2952  df-ral 3075  df-rex 3076  df-rab 3079  df-v 3411  df-sbc 3699  df-dif 3863  df-un 3865  df-in 3867  df-ss 3877  df-nul 4228  df-if 4424  df-pw 4499  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4802  df-br 5037  df-opab 5099  df-mpt 5117  df-id 5434  df-xp 5534  df-rel 5535  df-cnv 5536  df-co 5537  df-dm 5538  df-iota 6299  df-fun 6342  df-fv 6348  df-ov 7159  df-lbs 19928
This theorem is referenced by:  lbsind2  19934
  Copyright terms: Public domain W3C validator