Users' Mathboxes Mathbox for Norm Megill < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  psubspset Structured version   Visualization version   GIF version

Theorem psubspset 39347
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.
StepHypRef Expression
1 elex 3480 . 2 (𝐾𝐵𝐾 ∈ V)
2 psubspset.s . . 3 𝑆 = (PSubSp‘𝐾)
3 fveq2 6896 . . . . . . . 8 (𝑘 = 𝐾 → (Atoms‘𝑘) = (Atoms‘𝐾))
4 psubspset.a . . . . . . . 8 𝐴 = (Atoms‘𝐾)
53, 4eqtr4di 2783 . . . . . . 7 (𝑘 = 𝐾 → (Atoms‘𝑘) = 𝐴)
65sseq2d 4009 . . . . . 6 (𝑘 = 𝐾 → (𝑠 ⊆ (Atoms‘𝑘) ↔ 𝑠𝐴))
7 fveq2 6896 . . . . . . . . . . . . 13 (𝑘 = 𝐾 → (join‘𝑘) = (join‘𝐾))
8 psubspset.j . . . . . . . . . . . . 13 = (join‘𝐾)
97, 8eqtr4di 2783 . . . . . . . . . . . 12 (𝑘 = 𝐾 → (join‘𝑘) = )
109oveqd 7436 . . . . . . . . . . 11 (𝑘 = 𝐾 → (𝑝(join‘𝑘)𝑞) = (𝑝 𝑞))
1110breq2d 5161 . . . . . . . . . 10 (𝑘 = 𝐾 → (𝑟(le‘𝑘)(𝑝(join‘𝑘)𝑞) ↔ 𝑟(le‘𝑘)(𝑝 𝑞)))
12 fveq2 6896 . . . . . . . . . . . 12 (𝑘 = 𝐾 → (le‘𝑘) = (le‘𝐾))
13 psubspset.l . . . . . . . . . . . 12 = (le‘𝐾)
1412, 13eqtr4di 2783 . . . . . . . . . . 11 (𝑘 = 𝐾 → (le‘𝑘) = )
1514breqd 5160 . . . . . . . . . 10 (𝑘 = 𝐾 → (𝑟(le‘𝑘)(𝑝 𝑞) ↔ 𝑟 (𝑝 𝑞)))
1611, 15bitrd 278 . . . . . . . . 9 (𝑘 = 𝐾 → (𝑟(le‘𝑘)(𝑝(join‘𝑘)𝑞) ↔ 𝑟 (𝑝 𝑞)))
1716imbi1d 340 . . . . . . . 8 (𝑘 = 𝐾 → ((𝑟(le‘𝑘)(𝑝(join‘𝑘)𝑞) → 𝑟𝑠) ↔ (𝑟 (𝑝 𝑞) → 𝑟𝑠)))
185, 17raleqbidv 3329 . . . . . . 7 (𝑘 = 𝐾 → (∀𝑟 ∈ (Atoms‘𝑘)(𝑟(le‘𝑘)(𝑝(join‘𝑘)𝑞) → 𝑟𝑠) ↔ ∀𝑟𝐴 (𝑟 (𝑝 𝑞) → 𝑟𝑠)))
19182ralbidv 3208 . . . . . 6 (𝑘 = 𝐾 → (∀𝑝𝑠𝑞𝑠𝑟 ∈ (Atoms‘𝑘)(𝑟(le‘𝑘)(𝑝(join‘𝑘)𝑞) → 𝑟𝑠) ↔ ∀𝑝𝑠𝑞𝑠𝑟𝐴 (𝑟 (𝑝 𝑞) → 𝑟𝑠)))
206, 19anbi12d 630 . . . . 5 (𝑘 = 𝐾 → ((𝑠 ⊆ (Atoms‘𝑘) ∧ ∀𝑝𝑠𝑞𝑠𝑟 ∈ (Atoms‘𝑘)(𝑟(le‘𝑘)(𝑝(join‘𝑘)𝑞) → 𝑟𝑠)) ↔ (𝑠𝐴 ∧ ∀𝑝𝑠𝑞𝑠𝑟𝐴 (𝑟 (𝑝 𝑞) → 𝑟𝑠))))
2120abbidv 2794 . . . 4 (𝑘 = 𝐾 → {𝑠 ∣ (𝑠 ⊆ (Atoms‘𝑘) ∧ ∀𝑝𝑠𝑞𝑠𝑟 ∈ (Atoms‘𝑘)(𝑟(le‘𝑘)(𝑝(join‘𝑘)𝑞) → 𝑟𝑠))} = {𝑠 ∣ (𝑠𝐴 ∧ ∀𝑝𝑠𝑞𝑠𝑟𝐴 (𝑟 (𝑝 𝑞) → 𝑟𝑠))})
22 df-psubsp 39106 . . . 4 PSubSp = (𝑘 ∈ V ↦ {𝑠 ∣ (𝑠 ⊆ (Atoms‘𝑘) ∧ ∀𝑝𝑠𝑞𝑠𝑟 ∈ (Atoms‘𝑘)(𝑟(le‘𝑘)(𝑝(join‘𝑘)𝑞) → 𝑟𝑠))})
234fvexi 6910 . . . . . 6 𝐴 ∈ V
2423pwex 5380 . . . . 5 𝒫 𝐴 ∈ V
25 velpw 4609 . . . . . . . 8 (𝑠 ∈ 𝒫 𝐴𝑠𝐴)
2625anbi1i 622 . . . . . . 7 ((𝑠 ∈ 𝒫 𝐴 ∧ ∀𝑝𝑠𝑞𝑠𝑟𝐴 (𝑟 (𝑝 𝑞) → 𝑟𝑠)) ↔ (𝑠𝐴 ∧ ∀𝑝𝑠𝑞𝑠𝑟𝐴 (𝑟 (𝑝 𝑞) → 𝑟𝑠)))
2726abbii 2795 . . . . . 6 {𝑠 ∣ (𝑠 ∈ 𝒫 𝐴 ∧ ∀𝑝𝑠𝑞𝑠𝑟𝐴 (𝑟 (𝑝 𝑞) → 𝑟𝑠))} = {𝑠 ∣ (𝑠𝐴 ∧ ∀𝑝𝑠𝑞𝑠𝑟𝐴 (𝑟 (𝑝 𝑞) → 𝑟𝑠))}
28 ssab2 4072 . . . . . 6 {𝑠 ∣ (𝑠 ∈ 𝒫 𝐴 ∧ ∀𝑝𝑠𝑞𝑠𝑟𝐴 (𝑟 (𝑝 𝑞) → 𝑟𝑠))} ⊆ 𝒫 𝐴
2927, 28eqsstrri 4012 . . . . 5 {𝑠 ∣ (𝑠𝐴 ∧ ∀𝑝𝑠𝑞𝑠𝑟𝐴 (𝑟 (𝑝 𝑞) → 𝑟𝑠))} ⊆ 𝒫 𝐴
3024, 29ssexi 5323 . . . 4 {𝑠 ∣ (𝑠𝐴 ∧ ∀𝑝𝑠𝑞𝑠𝑟𝐴 (𝑟 (𝑝 𝑞) → 𝑟𝑠))} ∈ V
3121, 22, 30fvmpt 7004 . . 3 (𝐾 ∈ V → (PSubSp‘𝐾) = {𝑠 ∣ (𝑠𝐴 ∧ ∀𝑝𝑠𝑞𝑠𝑟𝐴 (𝑟 (𝑝 𝑞) → 𝑟𝑠))})
322, 31eqtrid 2777 . 2 (𝐾 ∈ V → 𝑆 = {𝑠 ∣ (𝑠𝐴 ∧ ∀𝑝𝑠𝑞𝑠𝑟𝐴 (𝑟 (𝑝 𝑞) → 𝑟𝑠))})
331, 32syl 17 1 (𝐾𝐵𝑆 = {𝑠 ∣ (𝑠𝐴 ∧ ∀𝑝𝑠𝑞𝑠𝑟𝐴 (𝑟 (𝑝 𝑞) → 𝑟𝑠))})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 394   = wceq 1533  wcel 2098  {cab 2702  wral 3050  Vcvv 3461  wss 3944  𝒫 cpw 4604   class class class wbr 5149  cfv 6549  (class class class)co 7419  lecple 17243  joincjn 18306  Atomscatm 38865  PSubSpcpsubsp 39099
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 2696  ax-sep 5300  ax-nul 5307  ax-pow 5365  ax-pr 5429
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 2528  df-eu 2557  df-clab 2703  df-cleq 2717  df-clel 2802  df-nfc 2877  df-ne 2930  df-ral 3051  df-rex 3060  df-rab 3419  df-v 3463  df-dif 3947  df-un 3949  df-in 3951  df-ss 3961  df-nul 4323  df-if 4531  df-pw 4606  df-sn 4631  df-pr 4633  df-op 4637  df-uni 4910  df-br 5150  df-opab 5212  df-mpt 5233  df-id 5576  df-xp 5684  df-rel 5685  df-cnv 5686  df-co 5687  df-dm 5688  df-iota 6501  df-fun 6551  df-fv 6557  df-ov 7422  df-psubsp 39106
This theorem is referenced by:  ispsubsp  39348
  Copyright terms: Public domain W3C validator