Mathbox for Norm Megill < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  lpolsetN Structured version   Visualization version   GIF version

Theorem lpolsetN 35789
 Description: The set of polarities of a left module or left vector space. (Contributed by NM, 24-Nov-2014.) (New usage is discouraged.)
Hypotheses
Ref Expression
lpolset.v 𝑉 = (Base‘𝑊)
lpolset.s 𝑆 = (LSubSp‘𝑊)
lpolset.z 0 = (0g𝑊)
lpolset.a 𝐴 = (LSAtoms‘𝑊)
lpolset.h 𝐻 = (LSHyp‘𝑊)
lpolset.p 𝑃 = (LPol‘𝑊)
Assertion
Ref Expression
lpolsetN (𝑊𝑋𝑃 = {𝑜 ∈ (𝑆𝑚 𝒫 𝑉) ∣ ((𝑜𝑉) = { 0 } ∧ ∀𝑥𝑦((𝑥𝑉𝑦𝑉𝑥𝑦) → (𝑜𝑦) ⊆ (𝑜𝑥)) ∧ ∀𝑥𝐴 ((𝑜𝑥) ∈ 𝐻 ∧ (𝑜‘(𝑜𝑥)) = 𝑥))})
Distinct variable groups:   𝑥,𝐴   𝑆,𝑜   𝑜,𝑉   𝑥,𝑜,𝑦,𝑊
Allowed substitution hints:   𝐴(𝑦,𝑜)   𝑃(𝑥,𝑦,𝑜)   𝑆(𝑥,𝑦)   𝐻(𝑥,𝑦,𝑜)   𝑉(𝑥,𝑦)   𝑋(𝑥,𝑦,𝑜)   0 (𝑥,𝑦,𝑜)

Proof of Theorem lpolsetN
Dummy variable 𝑤 is distinct from all other variables.
StepHypRef Expression
1 elex 3185 . 2 (𝑊𝑋𝑊 ∈ V)
2 lpolset.p . . 3 𝑃 = (LPol‘𝑊)
3 fveq2 6103 . . . . . . 7 (𝑤 = 𝑊 → (LSubSp‘𝑤) = (LSubSp‘𝑊))
4 lpolset.s . . . . . . 7 𝑆 = (LSubSp‘𝑊)
53, 4syl6eqr 2662 . . . . . 6 (𝑤 = 𝑊 → (LSubSp‘𝑤) = 𝑆)
6 fveq2 6103 . . . . . . . 8 (𝑤 = 𝑊 → (Base‘𝑤) = (Base‘𝑊))
7 lpolset.v . . . . . . . 8 𝑉 = (Base‘𝑊)
86, 7syl6eqr 2662 . . . . . . 7 (𝑤 = 𝑊 → (Base‘𝑤) = 𝑉)
98pweqd 4113 . . . . . 6 (𝑤 = 𝑊 → 𝒫 (Base‘𝑤) = 𝒫 𝑉)
105, 9oveq12d 6567 . . . . 5 (𝑤 = 𝑊 → ((LSubSp‘𝑤) ↑𝑚 𝒫 (Base‘𝑤)) = (𝑆𝑚 𝒫 𝑉))
118fveq2d 6107 . . . . . . 7 (𝑤 = 𝑊 → (𝑜‘(Base‘𝑤)) = (𝑜𝑉))
12 fveq2 6103 . . . . . . . . 9 (𝑤 = 𝑊 → (0g𝑤) = (0g𝑊))
13 lpolset.z . . . . . . . . 9 0 = (0g𝑊)
1412, 13syl6eqr 2662 . . . . . . . 8 (𝑤 = 𝑊 → (0g𝑤) = 0 )
1514sneqd 4137 . . . . . . 7 (𝑤 = 𝑊 → {(0g𝑤)} = { 0 })
1611, 15eqeq12d 2625 . . . . . 6 (𝑤 = 𝑊 → ((𝑜‘(Base‘𝑤)) = {(0g𝑤)} ↔ (𝑜𝑉) = { 0 }))
178sseq2d 3596 . . . . . . . . 9 (𝑤 = 𝑊 → (𝑥 ⊆ (Base‘𝑤) ↔ 𝑥𝑉))
188sseq2d 3596 . . . . . . . . 9 (𝑤 = 𝑊 → (𝑦 ⊆ (Base‘𝑤) ↔ 𝑦𝑉))
1917, 183anbi12d 1392 . . . . . . . 8 (𝑤 = 𝑊 → ((𝑥 ⊆ (Base‘𝑤) ∧ 𝑦 ⊆ (Base‘𝑤) ∧ 𝑥𝑦) ↔ (𝑥𝑉𝑦𝑉𝑥𝑦)))
2019imbi1d 330 . . . . . . 7 (𝑤 = 𝑊 → (((𝑥 ⊆ (Base‘𝑤) ∧ 𝑦 ⊆ (Base‘𝑤) ∧ 𝑥𝑦) → (𝑜𝑦) ⊆ (𝑜𝑥)) ↔ ((𝑥𝑉𝑦𝑉𝑥𝑦) → (𝑜𝑦) ⊆ (𝑜𝑥))))
21202albidv 1838 . . . . . 6 (𝑤 = 𝑊 → (∀𝑥𝑦((𝑥 ⊆ (Base‘𝑤) ∧ 𝑦 ⊆ (Base‘𝑤) ∧ 𝑥𝑦) → (𝑜𝑦) ⊆ (𝑜𝑥)) ↔ ∀𝑥𝑦((𝑥𝑉𝑦𝑉𝑥𝑦) → (𝑜𝑦) ⊆ (𝑜𝑥))))
22 fveq2 6103 . . . . . . . 8 (𝑤 = 𝑊 → (LSAtoms‘𝑤) = (LSAtoms‘𝑊))
23 lpolset.a . . . . . . . 8 𝐴 = (LSAtoms‘𝑊)
2422, 23syl6eqr 2662 . . . . . . 7 (𝑤 = 𝑊 → (LSAtoms‘𝑤) = 𝐴)
25 fveq2 6103 . . . . . . . . . 10 (𝑤 = 𝑊 → (LSHyp‘𝑤) = (LSHyp‘𝑊))
26 lpolset.h . . . . . . . . . 10 𝐻 = (LSHyp‘𝑊)
2725, 26syl6eqr 2662 . . . . . . . . 9 (𝑤 = 𝑊 → (LSHyp‘𝑤) = 𝐻)
2827eleq2d 2673 . . . . . . . 8 (𝑤 = 𝑊 → ((𝑜𝑥) ∈ (LSHyp‘𝑤) ↔ (𝑜𝑥) ∈ 𝐻))
2928anbi1d 737 . . . . . . 7 (𝑤 = 𝑊 → (((𝑜𝑥) ∈ (LSHyp‘𝑤) ∧ (𝑜‘(𝑜𝑥)) = 𝑥) ↔ ((𝑜𝑥) ∈ 𝐻 ∧ (𝑜‘(𝑜𝑥)) = 𝑥)))
3024, 29raleqbidv 3129 . . . . . 6 (𝑤 = 𝑊 → (∀𝑥 ∈ (LSAtoms‘𝑤)((𝑜𝑥) ∈ (LSHyp‘𝑤) ∧ (𝑜‘(𝑜𝑥)) = 𝑥) ↔ ∀𝑥𝐴 ((𝑜𝑥) ∈ 𝐻 ∧ (𝑜‘(𝑜𝑥)) = 𝑥)))
3116, 21, 303anbi123d 1391 . . . . 5 (𝑤 = 𝑊 → (((𝑜‘(Base‘𝑤)) = {(0g𝑤)} ∧ ∀𝑥𝑦((𝑥 ⊆ (Base‘𝑤) ∧ 𝑦 ⊆ (Base‘𝑤) ∧ 𝑥𝑦) → (𝑜𝑦) ⊆ (𝑜𝑥)) ∧ ∀𝑥 ∈ (LSAtoms‘𝑤)((𝑜𝑥) ∈ (LSHyp‘𝑤) ∧ (𝑜‘(𝑜𝑥)) = 𝑥)) ↔ ((𝑜𝑉) = { 0 } ∧ ∀𝑥𝑦((𝑥𝑉𝑦𝑉𝑥𝑦) → (𝑜𝑦) ⊆ (𝑜𝑥)) ∧ ∀𝑥𝐴 ((𝑜𝑥) ∈ 𝐻 ∧ (𝑜‘(𝑜𝑥)) = 𝑥))))
3210, 31rabeqbidv 3168 . . . 4 (𝑤 = 𝑊 → {𝑜 ∈ ((LSubSp‘𝑤) ↑𝑚 𝒫 (Base‘𝑤)) ∣ ((𝑜‘(Base‘𝑤)) = {(0g𝑤)} ∧ ∀𝑥𝑦((𝑥 ⊆ (Base‘𝑤) ∧ 𝑦 ⊆ (Base‘𝑤) ∧ 𝑥𝑦) → (𝑜𝑦) ⊆ (𝑜𝑥)) ∧ ∀𝑥 ∈ (LSAtoms‘𝑤)((𝑜𝑥) ∈ (LSHyp‘𝑤) ∧ (𝑜‘(𝑜𝑥)) = 𝑥))} = {𝑜 ∈ (𝑆𝑚 𝒫 𝑉) ∣ ((𝑜𝑉) = { 0 } ∧ ∀𝑥𝑦((𝑥𝑉𝑦𝑉𝑥𝑦) → (𝑜𝑦) ⊆ (𝑜𝑥)) ∧ ∀𝑥𝐴 ((𝑜𝑥) ∈ 𝐻 ∧ (𝑜‘(𝑜𝑥)) = 𝑥))})
33 df-lpolN 35788 . . . 4 LPol = (𝑤 ∈ V ↦ {𝑜 ∈ ((LSubSp‘𝑤) ↑𝑚 𝒫 (Base‘𝑤)) ∣ ((𝑜‘(Base‘𝑤)) = {(0g𝑤)} ∧ ∀𝑥𝑦((𝑥 ⊆ (Base‘𝑤) ∧ 𝑦 ⊆ (Base‘𝑤) ∧ 𝑥𝑦) → (𝑜𝑦) ⊆ (𝑜𝑥)) ∧ ∀𝑥 ∈ (LSAtoms‘𝑤)((𝑜𝑥) ∈ (LSHyp‘𝑤) ∧ (𝑜‘(𝑜𝑥)) = 𝑥))})
34 ovex 6577 . . . . 5 (𝑆𝑚 𝒫 𝑉) ∈ V
3534rabex 4740 . . . 4 {𝑜 ∈ (𝑆𝑚 𝒫 𝑉) ∣ ((𝑜𝑉) = { 0 } ∧ ∀𝑥𝑦((𝑥𝑉𝑦𝑉𝑥𝑦) → (𝑜𝑦) ⊆ (𝑜𝑥)) ∧ ∀𝑥𝐴 ((𝑜𝑥) ∈ 𝐻 ∧ (𝑜‘(𝑜𝑥)) = 𝑥))} ∈ V
3632, 33, 35fvmpt 6191 . . 3 (𝑊 ∈ V → (LPol‘𝑊) = {𝑜 ∈ (𝑆𝑚 𝒫 𝑉) ∣ ((𝑜𝑉) = { 0 } ∧ ∀𝑥𝑦((𝑥𝑉𝑦𝑉𝑥𝑦) → (𝑜𝑦) ⊆ (𝑜𝑥)) ∧ ∀𝑥𝐴 ((𝑜𝑥) ∈ 𝐻 ∧ (𝑜‘(𝑜𝑥)) = 𝑥))})
372, 36syl5eq 2656 . 2 (𝑊 ∈ V → 𝑃 = {𝑜 ∈ (𝑆𝑚 𝒫 𝑉) ∣ ((𝑜𝑉) = { 0 } ∧ ∀𝑥𝑦((𝑥𝑉𝑦𝑉𝑥𝑦) → (𝑜𝑦) ⊆ (𝑜𝑥)) ∧ ∀𝑥𝐴 ((𝑜𝑥) ∈ 𝐻 ∧ (𝑜‘(𝑜𝑥)) = 𝑥))})
381, 37syl 17 1 (𝑊𝑋𝑃 = {𝑜 ∈ (𝑆𝑚 𝒫 𝑉) ∣ ((𝑜𝑉) = { 0 } ∧ ∀𝑥𝑦((𝑥𝑉𝑦𝑉𝑥𝑦) → (𝑜𝑦) ⊆ (𝑜𝑥)) ∧ ∀𝑥𝐴 ((𝑜𝑥) ∈ 𝐻 ∧ (𝑜‘(𝑜𝑥)) = 𝑥))})
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 383   ∧ w3a 1031  ∀wal 1473   = wceq 1475   ∈ wcel 1977  ∀wral 2896  {crab 2900  Vcvv 3173   ⊆ wss 3540  𝒫 cpw 4108  {csn 4125  ‘cfv 5804  (class class class)co 6549   ↑𝑚 cmap 7744  Basecbs 15695  0gc0g 15923  LSubSpclss 18753  LSAtomsclsa 33279  LSHypclsh 33280  LPolclpoN 35787 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pr 4833 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-sbc 3403  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-br 4584  df-opab 4644  df-mpt 4645  df-id 4953  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-iota 5768  df-fun 5806  df-fv 5812  df-ov 6552  df-lpolN 35788 This theorem is referenced by:  islpolN  35790
 Copyright terms: Public domain W3C validator