Theorem psubspset 40332

Description: The set of projective subspaces in a Hilbert lattice. (Contributed by NM, 2-Oct-2011.)

Hypotheses

Ref	Expression
psubspset.l	⊢ ≤ = (le‘𝐾)
psubspset.j	⊢ ∨ = (join‘𝐾)
psubspset.a	⊢ 𝐴 = (Atoms‘𝐾)
psubspset.s	⊢ 𝑆 = (PSubSp‘𝐾)

Assertion

Ref	Expression
psubspset	⊢ (𝐾 ∈ 𝐵 → 𝑆 = {𝑠 ∣ (𝑠 ⊆ 𝐴 ∧ ∀𝑝 ∈ 𝑠 ∀𝑞 ∈ 𝑠 ∀𝑟 ∈ 𝐴 (𝑟 ≤ (𝑝 ∨ 𝑞) → 𝑟 ∈ 𝑠))})

Distinct variable groups:   𝑠,𝑟,𝐴   𝑞,𝑝,𝑟,𝑠,𝐾

Allowed substitution hints:   𝐴(𝑞,𝑝)   𝐵(𝑠,𝑟,𝑞,𝑝)   𝑆(𝑠,𝑟,𝑞,𝑝)   ∨ (𝑠,𝑟,𝑞,𝑝)   ≤ (𝑠,𝑟,𝑞,𝑝)

Proof of Theorem psubspset

Dummy variable 𝑘 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		elex 3474	. 2 ⊢ (𝐾 ∈ 𝐵 → 𝐾 ∈ V)
2		psubspset.s	. . 3 ⊢ 𝑆 = (PSubSp‘𝐾)
3		fveq2 6863	. . . . . . . 8 ⊢ (𝑘 = 𝐾 → (Atoms‘𝑘) = (Atoms‘𝐾))
4		psubspset.a	. . . . . . . 8 ⊢ 𝐴 = (Atoms‘𝐾)
5	3, 4	eqtr4di 2814	. . . . . . 7 ⊢ (𝑘 = 𝐾 → (Atoms‘𝑘) = 𝐴)
6	5	sseq2d 3968	. . . . . 6 ⊢ (𝑘 = 𝐾 → (𝑠 ⊆ (Atoms‘𝑘) ↔ 𝑠 ⊆ 𝐴))
7		fveq2 6863	. . . . . . . . . . . . 13 ⊢ (𝑘 = 𝐾 → (join‘𝑘) = (join‘𝐾))
8		psubspset.j	. . . . . . . . . . . . 13 ⊢ ∨ = (join‘𝐾)
9	7, 8	eqtr4di 2814	. . . . . . . . . . . 12 ⊢ (𝑘 = 𝐾 → (join‘𝑘) = ∨ )
10	9	oveqd 7409	. . . . . . . . . . 11 ⊢ (𝑘 = 𝐾 → (𝑝(join‘𝑘)𝑞) = (𝑝 ∨ 𝑞))
11	10	breq2d 5111	. . . . . . . . . 10 ⊢ (𝑘 = 𝐾 → (𝑟(le‘𝑘)(𝑝(join‘𝑘)𝑞) ↔ 𝑟(le‘𝑘)(𝑝 ∨ 𝑞)))
12		fveq2 6863	. . . . . . . . . . . 12 ⊢ (𝑘 = 𝐾 → (le‘𝑘) = (le‘𝐾))
13		psubspset.l	. . . . . . . . . . . 12 ⊢ ≤ = (le‘𝐾)
14	12, 13	eqtr4di 2814	. . . . . . . . . . 11 ⊢ (𝑘 = 𝐾 → (le‘𝑘) = ≤ )
15	14	breqd 5110	. . . . . . . . . 10 ⊢ (𝑘 = 𝐾 → (𝑟(le‘𝑘)(𝑝 ∨ 𝑞) ↔ 𝑟 ≤ (𝑝 ∨ 𝑞)))
16	11, 15	bitrd 281	. . . . . . . . 9 ⊢ (𝑘 = 𝐾 → (𝑟(le‘𝑘)(𝑝(join‘𝑘)𝑞) ↔ 𝑟 ≤ (𝑝 ∨ 𝑞)))
17	16	imbi1d 343	. . . . . . . 8 ⊢ (𝑘 = 𝐾 → ((𝑟(le‘𝑘)(𝑝(join‘𝑘)𝑞) → 𝑟 ∈ 𝑠) ↔ (𝑟 ≤ (𝑝 ∨ 𝑞) → 𝑟 ∈ 𝑠)))
18	5, 17	raleqbidv 3335	. . . . . . 7 ⊢ (𝑘 = 𝐾 → (∀𝑟 ∈ (Atoms‘𝑘)(𝑟(le‘𝑘)(𝑝(join‘𝑘)𝑞) → 𝑟 ∈ 𝑠) ↔ ∀𝑟 ∈ 𝐴 (𝑟 ≤ (𝑝 ∨ 𝑞) → 𝑟 ∈ 𝑠)))
19	18	2ralbidv 3225	. . . . . 6 ⊢ (𝑘 = 𝐾 → (∀𝑝 ∈ 𝑠 ∀𝑞 ∈ 𝑠 ∀𝑟 ∈ (Atoms‘𝑘)(𝑟(le‘𝑘)(𝑝(join‘𝑘)𝑞) → 𝑟 ∈ 𝑠) ↔ ∀𝑝 ∈ 𝑠 ∀𝑞 ∈ 𝑠 ∀𝑟 ∈ 𝐴 (𝑟 ≤ (𝑝 ∨ 𝑞) → 𝑟 ∈ 𝑠)))
20	6, 19	anbi12d 641	. . . . 5 ⊢ (𝑘 = 𝐾 → ((𝑠 ⊆ (Atoms‘𝑘) ∧ ∀𝑝 ∈ 𝑠 ∀𝑞 ∈ 𝑠 ∀𝑟 ∈ (Atoms‘𝑘)(𝑟(le‘𝑘)(𝑝(join‘𝑘)𝑞) → 𝑟 ∈ 𝑠)) ↔ (𝑠 ⊆ 𝐴 ∧ ∀𝑝 ∈ 𝑠 ∀𝑞 ∈ 𝑠 ∀𝑟 ∈ 𝐴 (𝑟 ≤ (𝑝 ∨ 𝑞) → 𝑟 ∈ 𝑠))))
21	20	abbidv 2827	. . . 4 ⊢ (𝑘 = 𝐾 → {𝑠 ∣ (𝑠 ⊆ (Atoms‘𝑘) ∧ ∀𝑝 ∈ 𝑠 ∀𝑞 ∈ 𝑠 ∀𝑟 ∈ (Atoms‘𝑘)(𝑟(le‘𝑘)(𝑝(join‘𝑘)𝑞) → 𝑟 ∈ 𝑠))} = {𝑠 ∣ (𝑠 ⊆ 𝐴 ∧ ∀𝑝 ∈ 𝑠 ∀𝑞 ∈ 𝑠 ∀𝑟 ∈ 𝐴 (𝑟 ≤ (𝑝 ∨ 𝑞) → 𝑟 ∈ 𝑠))})
22		df-psubsp 40091	. . . 4 ⊢ PSubSp = (𝑘 ∈ V ↦ {𝑠 ∣ (𝑠 ⊆ (Atoms‘𝑘) ∧ ∀𝑝 ∈ 𝑠 ∀𝑞 ∈ 𝑠 ∀𝑟 ∈ (Atoms‘𝑘)(𝑟(le‘𝑘)(𝑝(join‘𝑘)𝑞) → 𝑟 ∈ 𝑠))})
23	4	fvexi 6877	. . . . . 6 ⊢ 𝐴 ∈ V
24	23	pwex 5336	. . . . 5 ⊢ 𝒫 𝐴 ∈ V
25		velpw 4559	. . . . . . . 8 ⊢ (𝑠 ∈ 𝒫 𝐴 ↔ 𝑠 ⊆ 𝐴)
26	25	anbi1i 633	. . . . . . 7 ⊢ ((𝑠 ∈ 𝒫 𝐴 ∧ ∀𝑝 ∈ 𝑠 ∀𝑞 ∈ 𝑠 ∀𝑟 ∈ 𝐴 (𝑟 ≤ (𝑝 ∨ 𝑞) → 𝑟 ∈ 𝑠)) ↔ (𝑠 ⊆ 𝐴 ∧ ∀𝑝 ∈ 𝑠 ∀𝑞 ∈ 𝑠 ∀𝑟 ∈ 𝐴 (𝑟 ≤ (𝑝 ∨ 𝑞) → 𝑟 ∈ 𝑠)))
27	26	abbii 2828	. . . . . 6 ⊢ {𝑠 ∣ (𝑠 ∈ 𝒫 𝐴 ∧ ∀𝑝 ∈ 𝑠 ∀𝑞 ∈ 𝑠 ∀𝑟 ∈ 𝐴 (𝑟 ≤ (𝑝 ∨ 𝑞) → 𝑟 ∈ 𝑠))} = {𝑠 ∣ (𝑠 ⊆ 𝐴 ∧ ∀𝑝 ∈ 𝑠 ∀𝑞 ∈ 𝑠 ∀𝑟 ∈ 𝐴 (𝑟 ≤ (𝑝 ∨ 𝑞) → 𝑟 ∈ 𝑠))}
28		ssab2 4032	. . . . . 6 ⊢ {𝑠 ∣ (𝑠 ∈ 𝒫 𝐴 ∧ ∀𝑝 ∈ 𝑠 ∀𝑞 ∈ 𝑠 ∀𝑟 ∈ 𝐴 (𝑟 ≤ (𝑝 ∨ 𝑞) → 𝑟 ∈ 𝑠))} ⊆ 𝒫 𝐴
29	27, 28	eqsstrri 3983	. . . . 5 ⊢ {𝑠 ∣ (𝑠 ⊆ 𝐴 ∧ ∀𝑝 ∈ 𝑠 ∀𝑞 ∈ 𝑠 ∀𝑟 ∈ 𝐴 (𝑟 ≤ (𝑝 ∨ 𝑞) → 𝑟 ∈ 𝑠))} ⊆ 𝒫 𝐴
30	24, 29	ssexi 5277	. . . 4 ⊢ {𝑠 ∣ (𝑠 ⊆ 𝐴 ∧ ∀𝑝 ∈ 𝑠 ∀𝑞 ∈ 𝑠 ∀𝑟 ∈ 𝐴 (𝑟 ≤ (𝑝 ∨ 𝑞) → 𝑟 ∈ 𝑠))} ∈ V
31	21, 22, 30	fvmpt 6971	. . 3 ⊢ (𝐾 ∈ V → (PSubSp‘𝐾) = {𝑠 ∣ (𝑠 ⊆ 𝐴 ∧ ∀𝑝 ∈ 𝑠 ∀𝑞 ∈ 𝑠 ∀𝑟 ∈ 𝐴 (𝑟 ≤ (𝑝 ∨ 𝑞) → 𝑟 ∈ 𝑠))})
32	2, 31	eqtrid 2808	. 2 ⊢ (𝐾 ∈ V → 𝑆 = {𝑠 ∣ (𝑠 ⊆ 𝐴 ∧ ∀𝑝 ∈ 𝑠 ∀𝑞 ∈ 𝑠 ∀𝑟 ∈ 𝐴 (𝑟 ≤ (𝑝 ∨ 𝑞) → 𝑟 ∈ 𝑠))})
33	1, 32	syl 17	1 ⊢ (𝐾 ∈ 𝐵 → 𝑆 = {𝑠 ∣ (𝑠 ⊆ 𝐴 ∧ ∀𝑝 ∈ 𝑠 ∀𝑞 ∈ 𝑠 ∀𝑟 ∈ 𝐴 (𝑟 ≤ (𝑝 ∨ 𝑞) → 𝑟 ∈ 𝑠))})

Syntax hints:   → wi 4   ∧ wa 399   = wceq 1559   ∈ wcel 2141  {cab 2739  ∀wral 3075  Vcvv 3453   ⊆ wss 3904  𝒫 cpw 4554   class class class wbr 5099  ‘cfv 6517  (class class class)co 7392  lecple 17276  joincjn 18326  Atomscatm 39851  PSubSpcpsubsp 40084

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-sep 5245  ax-nul 5255  ax-pow 5321  ax-pr 5389

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3076  df-rex 3086  df-rab 3414  df-v 3455  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-br 5100  df-opab 5162  df-mpt 5181  df-id 5540  df-xp 5651  df-rel 5652  df-cnv 5653  df-co 5654  df-dm 5655  df-iota 6473  df-fun 6519  df-fv 6525  df-ov 7395  df-psubsp 40091

This theorem is referenced by:  ispsubsp  40333