Theorem lpolsetN 42519

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 3472	. 2 ⊢ (𝑊 ∈ 𝑋 → 𝑊 ∈ V)
2		lpolset.p	. . 3 ⊢ 𝑃 = (LPol‘𝑊)
3		fveq2 6883	. . . . . . 7 ⊢ (𝑤 = 𝑊 → (LSubSp‘𝑤) = (LSubSp‘𝑊))
4		lpolset.s	. . . . . . 7 ⊢ 𝑆 = (LSubSp‘𝑊)
5	3, 4	eqtr4di 2814	. . . . . 6 ⊢ (𝑤 = 𝑊 → (LSubSp‘𝑤) = 𝑆)
6		fveq2 6883	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → (Base‘𝑤) = (Base‘𝑊))
7		lpolset.v	. . . . . . . 8 ⊢ 𝑉 = (Base‘𝑊)
8	6, 7	eqtr4di 2814	. . . . . . 7 ⊢ (𝑤 = 𝑊 → (Base‘𝑤) = 𝑉)
9	8	pweqd 4574	. . . . . 6 ⊢ (𝑤 = 𝑊 → 𝒫 (Base‘𝑤) = 𝒫 𝑉)
10	5, 9	oveq12d 7436	. . . . 5 ⊢ (𝑤 = 𝑊 → ((LSubSp‘𝑤) ↑m 𝒫 (Base‘𝑤)) = (𝑆 ↑m 𝒫 𝑉))
11	8	fveq2d 6887	. . . . . . 7 ⊢ (𝑤 = 𝑊 → (𝑜‘(Base‘𝑤)) = (𝑜‘𝑉))
12		fveq2 6883	. . . . . . . . 9 ⊢ (𝑤 = 𝑊 → (0g‘𝑤) = (0g‘𝑊))
13		lpolset.z	. . . . . . . . 9 ⊢ 0 = (0g‘𝑊)
14	12, 13	eqtr4di 2814	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → (0g‘𝑤) = 0 )
15	14	sneqd 4596	. . . . . . 7 ⊢ (𝑤 = 𝑊 → {(0g‘𝑤)} = { 0 })
16	11, 15	eqeq12d 2777	. . . . . 6 ⊢ (𝑤 = 𝑊 → ((𝑜‘(Base‘𝑤)) = {(0g‘𝑤)} ↔ (𝑜‘𝑉) = { 0 }))
17	8	sseq2d 3963	. . . . . . . . 9 ⊢ (𝑤 = 𝑊 → (𝑥 ⊆ (Base‘𝑤) ↔ 𝑥 ⊆ 𝑉))
18	8	sseq2d 3963	. . . . . . . . 9 ⊢ (𝑤 = 𝑊 → (𝑦 ⊆ (Base‘𝑤) ↔ 𝑦 ⊆ 𝑉))
19	17, 18	3anbi12d 1465	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → ((𝑥 ⊆ (Base‘𝑤) ∧ 𝑦 ⊆ (Base‘𝑤) ∧ 𝑥 ⊆ 𝑦) ↔ (𝑥 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑥 ⊆ 𝑦)))
20	19	imbi1d 344	. . . . . . 7 ⊢ (𝑤 = 𝑊 → (((𝑥 ⊆ (Base‘𝑤) ∧ 𝑦 ⊆ (Base‘𝑤) ∧ 𝑥 ⊆ 𝑦) → (𝑜‘𝑦) ⊆ (𝑜‘𝑥)) ↔ ((𝑥 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑥 ⊆ 𝑦) → (𝑜‘𝑦) ⊆ (𝑜‘𝑥))))
21	20	2albidv 1956	. . . . . 6 ⊢ (𝑤 = 𝑊 → (∀𝑥∀𝑦((𝑥 ⊆ (Base‘𝑤) ∧ 𝑦 ⊆ (Base‘𝑤) ∧ 𝑥 ⊆ 𝑦) → (𝑜‘𝑦) ⊆ (𝑜‘𝑥)) ↔ ∀𝑥∀𝑦((𝑥 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑥 ⊆ 𝑦) → (𝑜‘𝑦) ⊆ (𝑜‘𝑥))))
22		fveq2 6883	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → (LSAtoms‘𝑤) = (LSAtoms‘𝑊))
23		lpolset.a	. . . . . . . 8 ⊢ 𝐴 = (LSAtoms‘𝑊)
24	22, 23	eqtr4di 2814	. . . . . . 7 ⊢ (𝑤 = 𝑊 → (LSAtoms‘𝑤) = 𝐴)
25		fveq2 6883	. . . . . . . . . 10 ⊢ (𝑤 = 𝑊 → (LSHyp‘𝑤) = (LSHyp‘𝑊))
26		lpolset.h	. . . . . . . . . 10 ⊢ 𝐻 = (LSHyp‘𝑊)
27	25, 26	eqtr4di 2814	. . . . . . . . 9 ⊢ (𝑤 = 𝑊 → (LSHyp‘𝑤) = 𝐻)
28	27	eleq2d 2847	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → ((𝑜‘𝑥) ∈ (LSHyp‘𝑤) ↔ (𝑜‘𝑥) ∈ 𝐻))
29	28	anbi1d 643	. . . . . . 7 ⊢ (𝑤 = 𝑊 → (((𝑜‘𝑥) ∈ (LSHyp‘𝑤) ∧ (𝑜‘(𝑜‘𝑥)) = 𝑥) ↔ ((𝑜‘𝑥) ∈ 𝐻 ∧ (𝑜‘(𝑜‘𝑥)) = 𝑥)))
30	24, 29	raleqbidv 3335	. . . . . 6 ⊢ (𝑤 = 𝑊 → (∀𝑥 ∈ (LSAtoms‘𝑤)((𝑜‘𝑥) ∈ (LSHyp‘𝑤) ∧ (𝑜‘(𝑜‘𝑥)) = 𝑥) ↔ ∀𝑥 ∈ 𝐴 ((𝑜‘𝑥) ∈ 𝐻 ∧ (𝑜‘(𝑜‘𝑥)) = 𝑥)))
31	16, 21, 30	3anbi123d 1464	. . . . 5 ⊢ (𝑤 = 𝑊 → (((𝑜‘(Base‘𝑤)) = {(0g‘𝑤)} ∧ ∀𝑥∀𝑦((𝑥 ⊆ (Base‘𝑤) ∧ 𝑦 ⊆ (Base‘𝑤) ∧ 𝑥 ⊆ 𝑦) → (𝑜‘𝑦) ⊆ (𝑜‘𝑥)) ∧ ∀𝑥 ∈ (LSAtoms‘𝑤)((𝑜‘𝑥) ∈ (LSHyp‘𝑤) ∧ (𝑜‘(𝑜‘𝑥)) = 𝑥)) ↔ ((𝑜‘𝑉) = { 0 } ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑥 ⊆ 𝑦) → (𝑜‘𝑦) ⊆ (𝑜‘𝑥)) ∧ ∀𝑥 ∈ 𝐴 ((𝑜‘𝑥) ∈ 𝐻 ∧ (𝑜‘(𝑜‘𝑥)) = 𝑥))))
32	10, 31	rabeqbidv 3430	. . . 4 ⊢ (𝑤 = 𝑊 → {𝑜 ∈ ((LSubSp‘𝑤) ↑m 𝒫 (Base‘𝑤)) ∣ ((𝑜‘(Base‘𝑤)) = {(0g‘𝑤)} ∧ ∀𝑥∀𝑦((𝑥 ⊆ (Base‘𝑤) ∧ 𝑦 ⊆ (Base‘𝑤) ∧ 𝑥 ⊆ 𝑦) → (𝑜‘𝑦) ⊆ (𝑜‘𝑥)) ∧ ∀𝑥 ∈ (LSAtoms‘𝑤)((𝑜‘𝑥) ∈ (LSHyp‘𝑤) ∧ (𝑜‘(𝑜‘𝑥)) = 𝑥))} = {𝑜 ∈ (𝑆 ↑m 𝒫 𝑉) ∣ ((𝑜‘𝑉) = { 0 } ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑥 ⊆ 𝑦) → (𝑜‘𝑦) ⊆ (𝑜‘𝑥)) ∧ ∀𝑥 ∈ 𝐴 ((𝑜‘𝑥) ∈ 𝐻 ∧ (𝑜‘(𝑜‘𝑥)) = 𝑥))})
33		df-lpolN 42518	. . . 4 ⊢ LPol = (𝑤 ∈ V ↦ {𝑜 ∈ ((LSubSp‘𝑤) ↑m 𝒫 (Base‘𝑤)) ∣ ((𝑜‘(Base‘𝑤)) = {(0g‘𝑤)} ∧ ∀𝑥∀𝑦((𝑥 ⊆ (Base‘𝑤) ∧ 𝑦 ⊆ (Base‘𝑤) ∧ 𝑥 ⊆ 𝑦) → (𝑜‘𝑦) ⊆ (𝑜‘𝑥)) ∧ ∀𝑥 ∈ (LSAtoms‘𝑤)((𝑜‘𝑥) ∈ (LSHyp‘𝑤) ∧ (𝑜‘(𝑜‘𝑥)) = 𝑥))})
34		ovex 7451	. . . . 5 ⊢ (𝑆 ↑m 𝒫 𝑉) ∈ V
35	34	rabex 5300	. . . 4 ⊢ {𝑜 ∈ (𝑆 ↑m 𝒫 𝑉) ∣ ((𝑜‘𝑉) = { 0 } ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑥 ⊆ 𝑦) → (𝑜‘𝑦) ⊆ (𝑜‘𝑥)) ∧ ∀𝑥 ∈ 𝐴 ((𝑜‘𝑥) ∈ 𝐻 ∧ (𝑜‘(𝑜‘𝑥)) = 𝑥))} ∈ V
36	32, 33, 35	fvmpt 6991	. . 3 ⊢ (𝑊 ∈ V → (LPol‘𝑊) = {𝑜 ∈ (𝑆 ↑m 𝒫 𝑉) ∣ ((𝑜‘𝑉) = { 0 } ∧ ∀𝑥∀𝑦((𝑥 ⊆ 𝑉 ∧ 𝑦 ⊆ 𝑉 ∧ 𝑥 ⊆ 𝑦) → (𝑜‘𝑦) ⊆ (𝑜‘𝑥)) ∧ ∀𝑥 ∈ 𝐴 ((𝑜‘𝑥) ∈ 𝐻 ∧ (𝑜‘(𝑜‘𝑥)) = 𝑥))})
37	2, 36	eqtrid 2808	. 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 2145  ∀wral 3077  {crab 3413  Vcvv 3451   ⊆ wss 3899  𝒫 cpw 4557  {csn 4584  ‘cfv 6537  (class class class)co 7418   ↑_m cmap 8840  Basecbs 17380  0_gc0g 17603  LSubSpclss 21199  LSAtomsclsa 40011  LSHypclsh 40012  LPolclpoN 42517

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391

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 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-iota 6493  df-fun 6539  df-fv 6545  df-ov 7421  df-lpolN 42518

This theorem is used by:  islpolN  42520