Theorem lpolsetN 40995

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 3492	. 2 ⊢ (𝑊 ∈ 𝑋 → 𝑊 ∈ V)
2		lpolset.p	. . 3 ⊢ 𝑃 = (LPol‘𝑊)
3		fveq2 6902	. . . . . . 7 ⊢ (𝑤 = 𝑊 → (LSubSp‘𝑤) = (LSubSp‘𝑊))
4		lpolset.s	. . . . . . 7 ⊢ 𝑆 = (LSubSp‘𝑊)
5	3, 4	eqtr4di 2786	. . . . . 6 ⊢ (𝑤 = 𝑊 → (LSubSp‘𝑤) = 𝑆)
6		fveq2 6902	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → (Base‘𝑤) = (Base‘𝑊))
7		lpolset.v	. . . . . . . 8 ⊢ 𝑉 = (Base‘𝑊)
8	6, 7	eqtr4di 2786	. . . . . . 7 ⊢ (𝑤 = 𝑊 → (Base‘𝑤) = 𝑉)
9	8	pweqd 4623	. . . . . 6 ⊢ (𝑤 = 𝑊 → 𝒫 (Base‘𝑤) = 𝒫 𝑉)
10	5, 9	oveq12d 7444	. . . . 5 ⊢ (𝑤 = 𝑊 → ((LSubSp‘𝑤) ↑m 𝒫 (Base‘𝑤)) = (𝑆 ↑m 𝒫 𝑉))
11	8	fveq2d 6906	. . . . . . 7 ⊢ (𝑤 = 𝑊 → (𝑜‘(Base‘𝑤)) = (𝑜‘𝑉))
12		fveq2 6902	. . . . . . . . 9 ⊢ (𝑤 = 𝑊 → (0g‘𝑤) = (0g‘𝑊))
13		lpolset.z	. . . . . . . . 9 ⊢ 0 = (0g‘𝑊)
14	12, 13	eqtr4di 2786	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → (0g‘𝑤) = 0 )
15	14	sneqd 4644	. . . . . . 7 ⊢ (𝑤 = 𝑊 → {(0g‘𝑤)} = { 0 })
16	11, 15	eqeq12d 2744	. . . . . 6 ⊢ (𝑤 = 𝑊 → ((𝑜‘(Base‘𝑤)) = {(0g‘𝑤)} ↔ (𝑜‘𝑉) = { 0 }))
17	8	sseq2d 4014	. . . . . . . . 9 ⊢ (𝑤 = 𝑊 → (𝑥 ⊆ (Base‘𝑤) ↔ 𝑥 ⊆ 𝑉))
18	8	sseq2d 4014	. . . . . . . . 9 ⊢ (𝑤 = 𝑊 → (𝑦 ⊆ (Base‘𝑤) ↔ 𝑦 ⊆ 𝑉))
19	17, 18	3anbi12d 1433	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → ((𝑥 ⊆ (Base‘𝑤) ∧ 𝑦 ⊆ (Base‘𝑤) ∧ 𝑥 ⊆ 𝑦) ↔ (𝑥 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑥 ⊆ 𝑦)))
20	19	imbi1d 340	. . . . . . 7 ⊢ (𝑤 = 𝑊 → (((𝑥 ⊆ (Base‘𝑤) ∧ 𝑦 ⊆ (Base‘𝑤) ∧ 𝑥 ⊆ 𝑦) → (𝑜‘𝑦) ⊆ (𝑜‘𝑥)) ↔ ((𝑥 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑥 ⊆ 𝑦) → (𝑜‘𝑦) ⊆ (𝑜‘𝑥))))
21	20	2albidv 1918	. . . . . 6 ⊢ (𝑤 = 𝑊 → (∀𝑥∀𝑦((𝑥 ⊆ (Base‘𝑤) ∧ 𝑦 ⊆ (Base‘𝑤) ∧ 𝑥 ⊆ 𝑦) → (𝑜‘𝑦) ⊆ (𝑜‘𝑥)) ↔ ∀𝑥∀𝑦((𝑥 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑥 ⊆ 𝑦) → (𝑜‘𝑦) ⊆ (𝑜‘𝑥))))
22		fveq2 6902	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → (LSAtoms‘𝑤) = (LSAtoms‘𝑊))
23		lpolset.a	. . . . . . . 8 ⊢ 𝐴 = (LSAtoms‘𝑊)
24	22, 23	eqtr4di 2786	. . . . . . 7 ⊢ (𝑤 = 𝑊 → (LSAtoms‘𝑤) = 𝐴)
25		fveq2 6902	. . . . . . . . . 10 ⊢ (𝑤 = 𝑊 → (LSHyp‘𝑤) = (LSHyp‘𝑊))
26		lpolset.h	. . . . . . . . . 10 ⊢ 𝐻 = (LSHyp‘𝑊)
27	25, 26	eqtr4di 2786	. . . . . . . . 9 ⊢ (𝑤 = 𝑊 → (LSHyp‘𝑤) = 𝐻)
28	27	eleq2d 2815	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → ((𝑜‘𝑥) ∈ (LSHyp‘𝑤) ↔ (𝑜‘𝑥) ∈ 𝐻))
29	28	anbi1d 629	. . . . . . 7 ⊢ (𝑤 = 𝑊 → (((𝑜‘𝑥) ∈ (LSHyp‘𝑤) ∧ (𝑜‘(𝑜‘𝑥)) = 𝑥) ↔ ((𝑜‘𝑥) ∈ 𝐻 ∧ (𝑜‘(𝑜‘𝑥)) = 𝑥)))
30	24, 29	raleqbidv 3340	. . . . . 6 ⊢ (𝑤 = 𝑊 → (∀𝑥 ∈ (LSAtoms‘𝑤)((𝑜‘𝑥) ∈ (LSHyp‘𝑤) ∧ (𝑜‘(𝑜‘𝑥)) = 𝑥) ↔ ∀𝑥 ∈ 𝐴 ((𝑜‘𝑥) ∈ 𝐻 ∧ (𝑜‘(𝑜‘𝑥)) = 𝑥)))
31	16, 21, 30	3anbi123d 1432	. . . . 5 ⊢ (𝑤 = 𝑊 → (((𝑜‘(Base‘𝑤)) = {(0g‘𝑤)} ∧ ∀𝑥∀𝑦((𝑥 ⊆ (Base‘𝑤) ∧ 𝑦 ⊆ (Base‘𝑤) ∧ 𝑥 ⊆ 𝑦) → (𝑜‘𝑦) ⊆ (𝑜‘𝑥)) ∧ ∀𝑥 ∈ (LSAtoms‘𝑤)((𝑜‘𝑥) ∈ (LSHyp‘𝑤) ∧ (𝑜‘(𝑜‘𝑥)) = 𝑥)) ↔ ((𝑜‘𝑉) = { 0 } ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑥 ⊆ 𝑦) → (𝑜‘𝑦) ⊆ (𝑜‘𝑥)) ∧ ∀𝑥 ∈ 𝐴 ((𝑜‘𝑥) ∈ 𝐻 ∧ (𝑜‘(𝑜‘𝑥)) = 𝑥))))
32	10, 31	rabeqbidv 3448	. . . 4 ⊢ (𝑤 = 𝑊 → {𝑜 ∈ ((LSubSp‘𝑤) ↑m 𝒫 (Base‘𝑤)) ∣ ((𝑜‘(Base‘𝑤)) = {(0g‘𝑤)} ∧ ∀𝑥∀𝑦((𝑥 ⊆ (Base‘𝑤) ∧ 𝑦 ⊆ (Base‘𝑤) ∧ 𝑥 ⊆ 𝑦) → (𝑜‘𝑦) ⊆ (𝑜‘𝑥)) ∧ ∀𝑥 ∈ (LSAtoms‘𝑤)((𝑜‘𝑥) ∈ (LSHyp‘𝑤) ∧ (𝑜‘(𝑜‘𝑥)) = 𝑥))} = {𝑜 ∈ (𝑆 ↑m 𝒫 𝑉) ∣ ((𝑜‘𝑉) = { 0 } ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑥 ⊆ 𝑦) → (𝑜‘𝑦) ⊆ (𝑜‘𝑥)) ∧ ∀𝑥 ∈ 𝐴 ((𝑜‘𝑥) ∈ 𝐻 ∧ (𝑜‘(𝑜‘𝑥)) = 𝑥))})
33		df-lpolN 40994	. . . 4 ⊢ LPol = (𝑤 ∈ V ↦ {𝑜 ∈ ((LSubSp‘𝑤) ↑m 𝒫 (Base‘𝑤)) ∣ ((𝑜‘(Base‘𝑤)) = {(0g‘𝑤)} ∧ ∀𝑥∀𝑦((𝑥 ⊆ (Base‘𝑤) ∧ 𝑦 ⊆ (Base‘𝑤) ∧ 𝑥 ⊆ 𝑦) → (𝑜‘𝑦) ⊆ (𝑜‘𝑥)) ∧ ∀𝑥 ∈ (LSAtoms‘𝑤)((𝑜‘𝑥) ∈ (LSHyp‘𝑤) ∧ (𝑜‘(𝑜‘𝑥)) = 𝑥))})
34		ovex 7459	. . . . 5 ⊢ (𝑆 ↑m 𝒫 𝑉) ∈ V
35	34	rabex 5338	. . . 4 ⊢ {𝑜 ∈ (𝑆 ↑m 𝒫 𝑉) ∣ ((𝑜‘𝑉) = { 0 } ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑥 ⊆ 𝑦) → (𝑜‘𝑦) ⊆ (𝑜‘𝑥)) ∧ ∀𝑥 ∈ 𝐴 ((𝑜‘𝑥) ∈ 𝐻 ∧ (𝑜‘(𝑜‘𝑥)) = 𝑥))} ∈ V
36	32, 33, 35	fvmpt 7010	. . 3 ⊢ (𝑊 ∈ V → (LPol‘𝑊) = {𝑜 ∈ (𝑆 ↑m 𝒫 𝑉) ∣ ((𝑜‘𝑉) = { 0 } ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑥 ⊆ 𝑦) → (𝑜‘𝑦) ⊆ (𝑜‘𝑥)) ∧ ∀𝑥 ∈ 𝐴 ((𝑜‘𝑥) ∈ 𝐻 ∧ (𝑜‘(𝑜‘𝑥)) = 𝑥))})
37	2, 36	eqtrid 2780	. 2 ⊢ (𝑊 ∈ V → 𝑃 = {𝑜 ∈ (𝑆 ↑m 𝒫 𝑉) ∣ ((𝑜‘𝑉) = { 0 } ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑥 ⊆ 𝑦) → (𝑜‘𝑦) ⊆ (𝑜‘𝑥)) ∧ ∀𝑥 ∈ 𝐴 ((𝑜‘𝑥) ∈ 𝐻 ∧ (𝑜‘(𝑜‘𝑥)) = 𝑥))})
38	1, 37	syl 17	1 ⊢ (𝑊 ∈ 𝑋 → 𝑃 = {𝑜 ∈ (𝑆 ↑m 𝒫 𝑉) ∣ ((𝑜‘𝑉) = { 0 } ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑥 ⊆ 𝑦) → (𝑜‘𝑦) ⊆ (𝑜‘𝑥)) ∧ ∀𝑥 ∈ 𝐴 ((𝑜‘𝑥) ∈ 𝐻 ∧ (𝑜‘(𝑜‘𝑥)) = 𝑥))})

Syntax hints:   → wi 4   ∧ wa 394   ∧ w3a 1084  ∀wal 1531   = wceq 1533   ∈ wcel 2098  ∀wral 3058  {crab 3430  Vcvv 3473   ⊆ wss 3949  𝒫 cpw 4606  {csn 4632  ‘cfv 6553  (class class class)co 7426   ↑_m cmap 8853  Basecbs 17189  0_gc0g 17430  LSubSpclss 20829  LSAtomsclsa 38486  LSHypclsh 38487  LPolclpoN 40993

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2166  ax-ext 2699  ax-sep 5303  ax-nul 5310  ax-pr 5433

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2529  df-eu 2558  df-clab 2706  df-cleq 2720  df-clel 2806  df-nfc 2881  df-ne 2938  df-ral 3059  df-rex 3068  df-rab 3431  df-v 3475  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-nul 4327  df-if 4533  df-pw 4608  df-sn 4633  df-pr 4635  df-op 4639  df-uni 4913  df-br 5153  df-opab 5215  df-mpt 5236  df-id 5580  df-xp 5688  df-rel 5689  df-cnv 5690  df-co 5691  df-dm 5692  df-iota 6505  df-fun 6555  df-fv 6561  df-ov 7429  df-lpolN 40994

This theorem is referenced by:  islpolN  40996