Theorem psubclsetN 40913

Description: The set of closed projective subspaces in a Hilbert lattice. (Contributed by NM, 23-Jan-2012.) (New usage is discouraged.)

Hypotheses

Ref	Expression
psubclset.a	⊢ 𝐴 = (Atoms‘𝐾)
psubclset.p	⊢ ⊥ = (⊥𝑃‘𝐾)
psubclset.c	⊢ 𝐶 = (PSubCl‘𝐾)

Assertion

Ref	Expression
psubclsetN	⊢ (𝐾 ∈ 𝐵 → 𝐶 = {𝑠 ∣ (𝑠 ⊆ 𝐴 ∧ ( ⊥ ‘( ⊥ ‘𝑠)) = 𝑠)})

Distinct variable groups:   𝐴,𝑠   𝐾,𝑠

Allowed substitution hints:   𝐵(𝑠)   𝐶(𝑠)   ⊥ (𝑠)

Proof of Theorem psubclsetN

Dummy variable 𝑘 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		elex 3471	. 2 ⊢ (𝐾 ∈ 𝐵 → 𝐾 ∈ V)
2		psubclset.c	. . 3 ⊢ 𝐶 = (PSubCl‘𝐾)
3		fveq2 6873	. . . . . . . 8 ⊢ (𝑘 = 𝐾 → (Atoms‘𝑘) = (Atoms‘𝐾))
4		psubclset.a	. . . . . . . 8 ⊢ 𝐴 = (Atoms‘𝐾)
5	3, 4	eqtr4di 2813	. . . . . . 7 ⊢ (𝑘 = 𝐾 → (Atoms‘𝑘) = 𝐴)
6	5	sseq2d 3962	. . . . . 6 ⊢ (𝑘 = 𝐾 → (𝑠 ⊆ (Atoms‘𝑘) ↔ 𝑠 ⊆ 𝐴))
7		fveq2 6873	. . . . . . . . 9 ⊢ (𝑘 = 𝐾 → (⊥𝑃‘𝑘) = (⊥𝑃‘𝐾))
8		psubclset.p	. . . . . . . . 9 ⊢ ⊥ = (⊥𝑃‘𝐾)
9	7, 8	eqtr4di 2813	. . . . . . . 8 ⊢ (𝑘 = 𝐾 → (⊥𝑃‘𝑘) = ⊥ )
10	9	fveq1d 6875	. . . . . . . 8 ⊢ (𝑘 = 𝐾 → ((⊥𝑃‘𝑘)‘𝑠) = ( ⊥ ‘𝑠))
11	9, 10	fveq12d 6880	. . . . . . 7 ⊢ (𝑘 = 𝐾 → ((⊥𝑃‘𝑘)‘((⊥𝑃‘𝑘)‘𝑠)) = ( ⊥ ‘( ⊥ ‘𝑠)))
12	11	eqeq1d 2762	. . . . . 6 ⊢ (𝑘 = 𝐾 → (((⊥𝑃‘𝑘)‘((⊥𝑃‘𝑘)‘𝑠)) = 𝑠 ↔ ( ⊥ ‘( ⊥ ‘𝑠)) = 𝑠))
13	6, 12	anbi12d 644	. . . . 5 ⊢ (𝑘 = 𝐾 → ((𝑠 ⊆ (Atoms‘𝑘) ∧ ((⊥𝑃‘𝑘)‘((⊥𝑃‘𝑘)‘𝑠)) = 𝑠) ↔ (𝑠 ⊆ 𝐴 ∧ ( ⊥ ‘( ⊥ ‘𝑠)) = 𝑠)))
14	13	abbidv 2826	. . . 4 ⊢ (𝑘 = 𝐾 → {𝑠 ∣ (𝑠 ⊆ (Atoms‘𝑘) ∧ ((⊥𝑃‘𝑘)‘((⊥𝑃‘𝑘)‘𝑠)) = 𝑠)} = {𝑠 ∣ (𝑠 ⊆ 𝐴 ∧ ( ⊥ ‘( ⊥ ‘𝑠)) = 𝑠)})
15		df-psubclN 40912	. . . 4 ⊢ PSubCl = (𝑘 ∈ V ↦ {𝑠 ∣ (𝑠 ⊆ (Atoms‘𝑘) ∧ ((⊥𝑃‘𝑘)‘((⊥𝑃‘𝑘)‘𝑠)) = 𝑠)})
16	4	fvexi 6887	. . . . . 6 ⊢ 𝐴 ∈ V
17	16	pwex 5341	. . . . 5 ⊢ 𝒫 𝐴 ∈ V
18		velpw 4561	. . . . . . . 8 ⊢ (𝑠 ∈ 𝒫 𝐴 ↔ 𝑠 ⊆ 𝐴)
19	18	anbi1i 636	. . . . . . 7 ⊢ ((𝑠 ∈ 𝒫 𝐴 ∧ ( ⊥ ‘( ⊥ ‘𝑠)) = 𝑠) ↔ (𝑠 ⊆ 𝐴 ∧ ( ⊥ ‘( ⊥ ‘𝑠)) = 𝑠))
20	19	abbii 2827	. . . . . 6 ⊢ {𝑠 ∣ (𝑠 ∈ 𝒫 𝐴 ∧ ( ⊥ ‘( ⊥ ‘𝑠)) = 𝑠)} = {𝑠 ∣ (𝑠 ⊆ 𝐴 ∧ ( ⊥ ‘( ⊥ ‘𝑠)) = 𝑠)}
21		ssab2 4026	. . . . . 6 ⊢ {𝑠 ∣ (𝑠 ∈ 𝒫 𝐴 ∧ ( ⊥ ‘( ⊥ ‘𝑠)) = 𝑠)} ⊆ 𝒫 𝐴
22	20, 21	eqsstrri 3977	. . . . 5 ⊢ {𝑠 ∣ (𝑠 ⊆ 𝐴 ∧ ( ⊥ ‘( ⊥ ‘𝑠)) = 𝑠)} ⊆ 𝒫 𝐴
23	17, 22	ssexi 5283	. . . 4 ⊢ {𝑠 ∣ (𝑠 ⊆ 𝐴 ∧ ( ⊥ ‘( ⊥ ‘𝑠)) = 𝑠)} ∈ V
24	14, 15, 23	fvmpt 6981	. . 3 ⊢ (𝐾 ∈ V → (PSubCl‘𝐾) = {𝑠 ∣ (𝑠 ⊆ 𝐴 ∧ ( ⊥ ‘( ⊥ ‘𝑠)) = 𝑠)})
25	2, 24	eqtrid 2807	. 2 ⊢ (𝐾 ∈ V → 𝐶 = {𝑠 ∣ (𝑠 ⊆ 𝐴 ∧ ( ⊥ ‘( ⊥ ‘𝑠)) = 𝑠)})
26	1, 25	syl 18	1 ⊢ (𝐾 ∈ 𝐵 → 𝐶 = {𝑠 ∣ (𝑠 ⊆ 𝐴 ∧ ( ⊥ ‘( ⊥ ‘𝑠)) = 𝑠)})

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  {cab 2738  Vcvv 3450   ⊆ wss 3898  𝒫 cpw 4556  ‘cfv 6527  Atomscatm 40240  ⊥_𝑃cpolN 40879  PSubClcpscN 40911

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 2732  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390

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 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5542  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-iota 6483  df-fun 6529  df-fv 6535  df-psubclN 40912

This theorem is used by:  ispsubclN  40914