Theorem lpolsetN 42805

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	⊢ (𝑊 ∈ 𝑋 → 𝑃 = {𝑜 ∈ (𝑆 ↑m 𝒫 𝑉) ∣ ((𝑜‘𝑉) = { 0 } ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑥 ⊆ 𝑦) → (𝑜‘𝑦) ⊆ (𝑜‘𝑥)) ∧ ∀𝑥 ∈ 𝐴 ((𝑜‘𝑥) ∈ 𝐻 ∧ (𝑜‘(𝑜‘𝑥)) = 𝑥))})

Distinct variable groups:   𝑥,𝐴   𝑆,𝑜   𝑜,𝑉   𝑥,𝑜,𝑦,𝑊

Allowed substitution hints:   𝐴(𝑦, 𝑜)   𝑃(𝑥, 𝑦, 𝑜)   𝑆(𝑥, 𝑦)   𝐻(𝑥, 𝑦, 𝑜)   𝑉(𝑥, 𝑦)   𝑋(𝑥, 𝑦, 𝑜)   0 (𝑥, 𝑦, 𝑜)

Proof of Theorem lpolsetN

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		elex 3475	. 2 ⊢ (𝑊 ∈ 𝑋 → 𝑊 ∈ V)
2		lpolset.p	. . 3 ⊢ 𝑃 = (LPol‘𝑊)
3		fveq2 6916	. . . . . . 7 ⊢ (𝑤 = 𝑊 → (LSubSp‘𝑤) = (LSubSp‘𝑊))
4		lpolset.s	. . . . . . 7 ⊢ 𝑆 = (LSubSp‘𝑊)
5	3, 4	eqtr4di 2816	. . . . . 6 ⊢ (𝑤 = 𝑊 → (LSubSp‘𝑤) = 𝑆)
6		fveq2 6916	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → (Base‘𝑤) = (Base‘𝑊))
7		lpolset.v	. . . . . . . 8 ⊢ 𝑉 = (Base‘𝑊)
8	6, 7	eqtr4di 2816	. . . . . . 7 ⊢ (𝑤 = 𝑊 → (Base‘𝑤) = 𝑉)
9	8	pweqd 4577	. . . . . 6 ⊢ (𝑤 = 𝑊 → 𝒫 (Base‘𝑤) = 𝒫 𝑉)
10	5, 9	oveq12d 7469	. . . . 5 ⊢ (𝑤 = 𝑊 → ((LSubSp‘𝑤) ↑m 𝒫 (Base‘𝑤)) = (𝑆 ↑m 𝒫 𝑉))
11	8	fveq2d 6920	. . . . . . 7 ⊢ (𝑤 = 𝑊 → (𝑜‘(Base‘𝑤)) = (𝑜‘𝑉))
12		fveq2 6916	. . . . . . . . 9 ⊢ (𝑤 = 𝑊 → (0g‘𝑤) = (0g‘𝑊))
13		lpolset.z	. . . . . . . . 9 ⊢ 0 = (0g‘𝑊)
14	12, 13	eqtr4di 2816	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → (0g‘𝑤) = 0 )
15	14	sneqd 4596	. . . . . . 7 ⊢ (𝑤 = 𝑊 → {(0g‘𝑤)} = { 0 })
16	11, 15	eqeq12d 2779	. . . . . 6 ⊢ (𝑤 = 𝑊 → ((𝑜‘(Base‘𝑤)) = {(0g‘𝑤)} ↔ (𝑜‘𝑉) = { 0 }))
17	8	sseq2d 3945	. . . . . . . . 9 ⊢ (𝑤 = 𝑊 → (𝑥 ⊆ (Base‘𝑤) ↔ 𝑥 ⊆ 𝑉))
18	8	sseq2d 3945	. . . . . . . . 9 ⊢ (𝑤 = 𝑊 → (𝑦 ⊆ (Base‘𝑤) ↔ 𝑦 ⊆ 𝑉))
19	17, 18	3anbi12d 1466	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → ((𝑥 ⊆ (Base‘𝑤) ∧ 𝑦 ⊆ (Base‘𝑤) ∧ 𝑥 ⊆ 𝑦) ↔ (𝑥 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑥 ⊆ 𝑦)))
20	19	imbi1d 344	. . . . . . 7 ⊢ (𝑤 = 𝑊 → (((𝑥 ⊆ (Base‘𝑤) ∧ 𝑦 ⊆ (Base‘𝑤) ∧ 𝑥 ⊆ 𝑦) → (𝑜‘𝑦) ⊆ (𝑜‘𝑥)) ↔ ((𝑥 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑥 ⊆ 𝑦) → (𝑜‘𝑦) ⊆ (𝑜‘𝑥))))
21	20	2albidv 1958	. . . . . 6 ⊢ (𝑤 = 𝑊 → (∀𝑥∀𝑦((𝑥 ⊆ (Base‘𝑤) ∧ 𝑦 ⊆ (Base‘𝑤) ∧ 𝑥 ⊆ 𝑦) → (𝑜‘𝑦) ⊆ (𝑜‘𝑥)) ↔ ∀𝑥∀𝑦((𝑥 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑥 ⊆ 𝑦) → (𝑜‘𝑦) ⊆ (𝑜‘𝑥))))
22		fveq2 6916	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → (LSAtoms‘𝑤) = (LSAtoms‘𝑊))
23		lpolset.a	. . . . . . . 8 ⊢ 𝐴 = (LSAtoms‘𝑊)
24	22, 23	eqtr4di 2816	. . . . . . 7 ⊢ (𝑤 = 𝑊 → (LSAtoms‘𝑤) = 𝐴)
25		fveq2 6916	. . . . . . . . . 10 ⊢ (𝑤 = 𝑊 → (LSHyp‘𝑤) = (LSHyp‘𝑊))
26		lpolset.h	. . . . . . . . . 10 ⊢ 𝐻 = (LSHyp‘𝑊)
27	25, 26	eqtr4di 2816	. . . . . . . . 9 ⊢ (𝑤 = 𝑊 → (LSHyp‘𝑤) = 𝐻)
28	27	eleq2d 2850	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → ((𝑜‘𝑥) ∈ (LSHyp‘𝑤) ↔ (𝑜‘𝑥) ∈ 𝐻))
29	28	anbi1d 643	. . . . . . 7 ⊢ (𝑤 = 𝑊 → (((𝑜‘𝑥) ∈ (LSHyp‘𝑤) ∧ (𝑜‘(𝑜‘𝑥)) = 𝑥) ↔ ((𝑜‘𝑥) ∈ 𝐻 ∧ (𝑜‘(𝑜‘𝑥)) = 𝑥)))
30	24, 29	raleqbidv 3338	. . . . . 6 ⊢ (𝑤 = 𝑊 → (∀𝑥 ∈ (LSAtoms‘𝑤)((𝑜‘𝑥) ∈ (LSHyp‘𝑤) ∧ (𝑜‘(𝑜‘𝑥)) = 𝑥) ↔ ∀𝑥 ∈ 𝐴 ((𝑜‘𝑥) ∈ 𝐻 ∧ (𝑜‘(𝑜‘𝑥)) = 𝑥)))
31	16, 21, 30	3anbi123d 1465	. . . . 5 ⊢ (𝑤 = 𝑊 → (((𝑜‘(Base‘𝑤)) = {(0g‘𝑤)} ∧ ∀𝑥∀𝑦((𝑥 ⊆ (Base‘𝑤) ∧ 𝑦 ⊆ (Base‘𝑤) ∧ 𝑥 ⊆ 𝑦) → (𝑜‘𝑦) ⊆ (𝑜‘𝑥)) ∧ ∀𝑥 ∈ (LSAtoms‘𝑤)((𝑜‘𝑥) ∈ (LSHyp‘𝑤) ∧ (𝑜‘(𝑜‘𝑥)) = 𝑥)) ↔ ((𝑜‘𝑉) = { 0 } ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑥 ⊆ 𝑦) → (𝑜‘𝑦) ⊆ (𝑜‘𝑥)) ∧ ∀𝑥 ∈ 𝐴 ((𝑜‘𝑥) ∈ 𝐻 ∧ (𝑜‘(𝑜‘𝑥)) = 𝑥))))
32	10, 31	rabeqbidv 3433	. . . 4 ⊢ (𝑤 = 𝑊 → {𝑜 ∈ ((LSubSp‘𝑤) ↑m 𝒫 (Base‘𝑤)) ∣ ((𝑜‘(Base‘𝑤)) = {(0g‘𝑤)} ∧ ∀𝑥∀𝑦((𝑥 ⊆ (Base‘𝑤) ∧ 𝑦 ⊆ (Base‘𝑤) ∧ 𝑥 ⊆ 𝑦) → (𝑜‘𝑦) ⊆ (𝑜‘𝑥)) ∧ ∀𝑥 ∈ (LSAtoms‘𝑤)((𝑜‘𝑥) ∈ (LSHyp‘𝑤) ∧ (𝑜‘(𝑜‘𝑥)) = 𝑥))} = {𝑜 ∈ (𝑆 ↑m 𝒫 𝑉) ∣ ((𝑜‘𝑉) = { 0 } ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑥 ⊆ 𝑦) → (𝑜‘𝑦) ⊆ (𝑜‘𝑥)) ∧ ∀𝑥 ∈ 𝐴 ((𝑜‘𝑥) ∈ 𝐻 ∧ (𝑜‘(𝑜‘𝑥)) = 𝑥))})
33		df-lpolN 42804	. . . 4 ⊢ LPol = (𝑤 ∈ V ↦ {𝑜 ∈ ((LSubSp‘𝑤) ↑m 𝒫 (Base‘𝑤)) ∣ ((𝑜‘(Base‘𝑤)) = {(0g‘𝑤)} ∧ ∀𝑥∀𝑦((𝑥 ⊆ (Base‘𝑤) ∧ 𝑦 ⊆ (Base‘𝑤) ∧ 𝑥 ⊆ 𝑦) → (𝑜‘𝑦) ⊆ (𝑜‘𝑥)) ∧ ∀𝑥 ∈ (LSAtoms‘𝑤)((𝑜‘𝑥) ∈ (LSHyp‘𝑤) ∧ (𝑜‘(𝑜‘𝑥)) = 𝑥))})
34		ovex 7484	. . . . 5 ⊢ (𝑆 ↑m 𝒫 𝑉) ∈ V
35	34	rabex 5307	. . . 4 ⊢ {𝑜 ∈ (𝑆 ↑m 𝒫 𝑉) ∣ ((𝑜‘𝑉) = { 0 } ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑥 ⊆ 𝑦) → (𝑜‘𝑦) ⊆ (𝑜‘𝑥)) ∧ ∀𝑥 ∈ 𝐴 ((𝑜‘𝑥) ∈ 𝐻 ∧ (𝑜‘(𝑜‘𝑥)) = 𝑥))} ∈ V
36	32, 33, 35	fvmpt 7024	. . 3 ⊢ (𝑊 ∈ V → (LPol‘𝑊) = {𝑜 ∈ (𝑆 ↑m 𝒫 𝑉) ∣ ((𝑜‘𝑉) = { 0 } ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑥 ⊆ 𝑦) → (𝑜‘𝑦) ⊆ (𝑜‘𝑥)) ∧ ∀𝑥 ∈ 𝐴 ((𝑜‘𝑥) ∈ 𝐻 ∧ (𝑜‘(𝑜‘𝑥)) = 𝑥))})
37	2, 36	eqtrid 2810	. 2 ⊢ (𝑊 ∈ V → 𝑃 = {𝑜 ∈ (𝑆 ↑m 𝒫 𝑉) ∣ ((𝑜‘𝑉) = { 0 } ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑥 ⊆ 𝑦) → (𝑜‘𝑦) ⊆ (𝑜‘𝑥)) ∧ ∀𝑥 ∈ 𝐴 ((𝑜‘𝑥) ∈ 𝐻 ∧ (𝑜‘(𝑜‘𝑥)) = 𝑥))})
38	1, 37	syl 18	1 ⊢ (𝑊 ∈ 𝑋 → 𝑃 = {𝑜 ∈ (𝑆 ↑m 𝒫 𝑉) ∣ ((𝑜‘𝑉) = { 0 } ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑥 ⊆ 𝑦) → (𝑜‘𝑦) ⊆ (𝑜‘𝑥)) ∧ ∀𝑥 ∈ 𝐴 ((𝑜‘𝑥) ∈ 𝐻 ∧ (𝑜‘(𝑜‘𝑥)) = 𝑥))})

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103  ∀wal 1568   = wceq 1570   ∈ wcel 2147  ∀wral 3080  {crab 3416  Vcvv 3454   ⊆ wss 3900  𝒫 cpw 4560  {csn 4588  ‘cfv 6566  (class class class)co 7451   ↑_m cmap 8885  Basecbs 17431  0_gc0g 17660  LSubSpclss 21257  LSAtomsclsa 40297  LSHypclsh 40298  LPolclpoN 42803

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pr 5398

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-iota 6520  df-fun 6568  df-fv 6574  df-ov 7454  df-lpolN 42804

This theorem is used by:  islpolN  42806