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

Theorem lssset 20931
Description: The set of all (not necessarily closed) linear subspaces of a left module or left vector space. (Contributed by NM, 8-Dec-2013.) (Revised by Mario Carneiro, 15-Jul-2014.)
Hypotheses
Ref Expression
lssset.f 𝐹 = (Scalar‘𝑊)
lssset.b 𝐵 = (Base‘𝐹)
lssset.v 𝑉 = (Base‘𝑊)
lssset.p + = (+g𝑊)
lssset.t · = ( ·𝑠𝑊)
lssset.s 𝑆 = (LSubSp‘𝑊)
Assertion
Ref Expression
lssset (𝑊𝑋𝑆 = {𝑠 ∈ (𝒫 𝑉 ∖ {∅}) ∣ ∀𝑥𝐵𝑎𝑠𝑏𝑠 ((𝑥 · 𝑎) + 𝑏) ∈ 𝑠})
Distinct variable groups:   + ,𝑠   𝑥,𝑠,𝐵   𝑉,𝑠   𝑎,𝑏,𝑠,𝑥,𝑊   · ,𝑠
Allowed substitution hints:   𝐵(𝑎,𝑏)   + (𝑥,𝑎,𝑏)   𝑆(𝑥,𝑠,𝑎,𝑏)   · (𝑥,𝑎,𝑏)   𝐹(𝑥,𝑠,𝑎,𝑏)   𝑉(𝑥,𝑎,𝑏)   𝑋(𝑥,𝑠,𝑎,𝑏)

Proof of Theorem lssset
Dummy variable 𝑤 is distinct from all other variables.
StepHypRef Expression
1 lssset.s . 2 𝑆 = (LSubSp‘𝑊)
2 elex 3501 . . 3 (𝑊𝑋𝑊 ∈ V)
3 fveq2 6906 . . . . . . . 8 (𝑤 = 𝑊 → (Base‘𝑤) = (Base‘𝑊))
4 lssset.v . . . . . . . 8 𝑉 = (Base‘𝑊)
53, 4eqtr4di 2795 . . . . . . 7 (𝑤 = 𝑊 → (Base‘𝑤) = 𝑉)
65pweqd 4617 . . . . . 6 (𝑤 = 𝑊 → 𝒫 (Base‘𝑤) = 𝒫 𝑉)
76difeq1d 4125 . . . . 5 (𝑤 = 𝑊 → (𝒫 (Base‘𝑤) ∖ {∅}) = (𝒫 𝑉 ∖ {∅}))
8 fveq2 6906 . . . . . . . . 9 (𝑤 = 𝑊 → (Scalar‘𝑤) = (Scalar‘𝑊))
9 lssset.f . . . . . . . . 9 𝐹 = (Scalar‘𝑊)
108, 9eqtr4di 2795 . . . . . . . 8 (𝑤 = 𝑊 → (Scalar‘𝑤) = 𝐹)
1110fveq2d 6910 . . . . . . 7 (𝑤 = 𝑊 → (Base‘(Scalar‘𝑤)) = (Base‘𝐹))
12 lssset.b . . . . . . 7 𝐵 = (Base‘𝐹)
1311, 12eqtr4di 2795 . . . . . 6 (𝑤 = 𝑊 → (Base‘(Scalar‘𝑤)) = 𝐵)
14 fveq2 6906 . . . . . . . . . . . 12 (𝑤 = 𝑊 → ( ·𝑠𝑤) = ( ·𝑠𝑊))
15 lssset.t . . . . . . . . . . . 12 · = ( ·𝑠𝑊)
1614, 15eqtr4di 2795 . . . . . . . . . . 11 (𝑤 = 𝑊 → ( ·𝑠𝑤) = · )
1716oveqd 7448 . . . . . . . . . 10 (𝑤 = 𝑊 → (𝑥( ·𝑠𝑤)𝑎) = (𝑥 · 𝑎))
1817oveq1d 7446 . . . . . . . . 9 (𝑤 = 𝑊 → ((𝑥( ·𝑠𝑤)𝑎)(+g𝑤)𝑏) = ((𝑥 · 𝑎)(+g𝑤)𝑏))
19 fveq2 6906 . . . . . . . . . . 11 (𝑤 = 𝑊 → (+g𝑤) = (+g𝑊))
20 lssset.p . . . . . . . . . . 11 + = (+g𝑊)
2119, 20eqtr4di 2795 . . . . . . . . . 10 (𝑤 = 𝑊 → (+g𝑤) = + )
2221oveqd 7448 . . . . . . . . 9 (𝑤 = 𝑊 → ((𝑥 · 𝑎)(+g𝑤)𝑏) = ((𝑥 · 𝑎) + 𝑏))
2318, 22eqtrd 2777 . . . . . . . 8 (𝑤 = 𝑊 → ((𝑥( ·𝑠𝑤)𝑎)(+g𝑤)𝑏) = ((𝑥 · 𝑎) + 𝑏))
2423eleq1d 2826 . . . . . . 7 (𝑤 = 𝑊 → (((𝑥( ·𝑠𝑤)𝑎)(+g𝑤)𝑏) ∈ 𝑠 ↔ ((𝑥 · 𝑎) + 𝑏) ∈ 𝑠))
25242ralbidv 3221 . . . . . 6 (𝑤 = 𝑊 → (∀𝑎𝑠𝑏𝑠 ((𝑥( ·𝑠𝑤)𝑎)(+g𝑤)𝑏) ∈ 𝑠 ↔ ∀𝑎𝑠𝑏𝑠 ((𝑥 · 𝑎) + 𝑏) ∈ 𝑠))
2613, 25raleqbidv 3346 . . . . 5 (𝑤 = 𝑊 → (∀𝑥 ∈ (Base‘(Scalar‘𝑤))∀𝑎𝑠𝑏𝑠 ((𝑥( ·𝑠𝑤)𝑎)(+g𝑤)𝑏) ∈ 𝑠 ↔ ∀𝑥𝐵𝑎𝑠𝑏𝑠 ((𝑥 · 𝑎) + 𝑏) ∈ 𝑠))
277, 26rabeqbidv 3455 . . . 4 (𝑤 = 𝑊 → {𝑠 ∈ (𝒫 (Base‘𝑤) ∖ {∅}) ∣ ∀𝑥 ∈ (Base‘(Scalar‘𝑤))∀𝑎𝑠𝑏𝑠 ((𝑥( ·𝑠𝑤)𝑎)(+g𝑤)𝑏) ∈ 𝑠} = {𝑠 ∈ (𝒫 𝑉 ∖ {∅}) ∣ ∀𝑥𝐵𝑎𝑠𝑏𝑠 ((𝑥 · 𝑎) + 𝑏) ∈ 𝑠})
28 df-lss 20930 . . . 4 LSubSp = (𝑤 ∈ V ↦ {𝑠 ∈ (𝒫 (Base‘𝑤) ∖ {∅}) ∣ ∀𝑥 ∈ (Base‘(Scalar‘𝑤))∀𝑎𝑠𝑏𝑠 ((𝑥( ·𝑠𝑤)𝑎)(+g𝑤)𝑏) ∈ 𝑠})
294fvexi 6920 . . . . . . 7 𝑉 ∈ V
3029pwex 5380 . . . . . 6 𝒫 𝑉 ∈ V
3130difexi 5330 . . . . 5 (𝒫 𝑉 ∖ {∅}) ∈ V
3231rabex 5339 . . . 4 {𝑠 ∈ (𝒫 𝑉 ∖ {∅}) ∣ ∀𝑥𝐵𝑎𝑠𝑏𝑠 ((𝑥 · 𝑎) + 𝑏) ∈ 𝑠} ∈ V
3327, 28, 32fvmpt 7016 . . 3 (𝑊 ∈ V → (LSubSp‘𝑊) = {𝑠 ∈ (𝒫 𝑉 ∖ {∅}) ∣ ∀𝑥𝐵𝑎𝑠𝑏𝑠 ((𝑥 · 𝑎) + 𝑏) ∈ 𝑠})
342, 33syl 17 . 2 (𝑊𝑋 → (LSubSp‘𝑊) = {𝑠 ∈ (𝒫 𝑉 ∖ {∅}) ∣ ∀𝑥𝐵𝑎𝑠𝑏𝑠 ((𝑥 · 𝑎) + 𝑏) ∈ 𝑠})
351, 34eqtrid 2789 1 (𝑊𝑋𝑆 = {𝑠 ∈ (𝒫 𝑉 ∖ {∅}) ∣ ∀𝑥𝐵𝑎𝑠𝑏𝑠 ((𝑥 · 𝑎) + 𝑏) ∈ 𝑠})
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1540  wcel 2108  wral 3061  {crab 3436  Vcvv 3480  cdif 3948  c0 4333  𝒫 cpw 4600  {csn 4626  cfv 6561  (class class class)co 7431  Basecbs 17247  +gcplusg 17297  Scalarcsca 17300   ·𝑠 cvsca 17301  LSubSpclss 20929
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2708  ax-sep 5296  ax-nul 5306  ax-pow 5365  ax-pr 5432
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2892  df-ne 2941  df-ral 3062  df-rex 3071  df-rab 3437  df-v 3482  df-dif 3954  df-un 3956  df-in 3958  df-ss 3968  df-nul 4334  df-if 4526  df-pw 4602  df-sn 4627  df-pr 4629  df-op 4633  df-uni 4908  df-br 5144  df-opab 5206  df-mpt 5226  df-id 5578  df-xp 5691  df-rel 5692  df-cnv 5693  df-co 5694  df-dm 5695  df-iota 6514  df-fun 6563  df-fv 6569  df-ov 7434  df-lss 20930
This theorem is referenced by:  islss  20932
  Copyright terms: Public domain W3C validator