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 39701
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 3509 . 2 (𝐾𝐵𝐾 ∈ V)
2 psubspset.s . . 3 𝑆 = (PSubSp‘𝐾)
3 fveq2 6920 . . . . . . . 8 (𝑘 = 𝐾 → (Atoms‘𝑘) = (Atoms‘𝐾))
4 psubspset.a . . . . . . . 8 𝐴 = (Atoms‘𝐾)
53, 4eqtr4di 2798 . . . . . . 7 (𝑘 = 𝐾 → (Atoms‘𝑘) = 𝐴)
65sseq2d 4041 . . . . . 6 (𝑘 = 𝐾 → (𝑠 ⊆ (Atoms‘𝑘) ↔ 𝑠𝐴))
7 fveq2 6920 . . . . . . . . . . . . 13 (𝑘 = 𝐾 → (join‘𝑘) = (join‘𝐾))
8 psubspset.j . . . . . . . . . . . . 13 = (join‘𝐾)
97, 8eqtr4di 2798 . . . . . . . . . . . 12 (𝑘 = 𝐾 → (join‘𝑘) = )
109oveqd 7465 . . . . . . . . . . 11 (𝑘 = 𝐾 → (𝑝(join‘𝑘)𝑞) = (𝑝 𝑞))
1110breq2d 5178 . . . . . . . . . 10 (𝑘 = 𝐾 → (𝑟(le‘𝑘)(𝑝(join‘𝑘)𝑞) ↔ 𝑟(le‘𝑘)(𝑝 𝑞)))
12 fveq2 6920 . . . . . . . . . . . 12 (𝑘 = 𝐾 → (le‘𝑘) = (le‘𝐾))
13 psubspset.l . . . . . . . . . . . 12 = (le‘𝐾)
1412, 13eqtr4di 2798 . . . . . . . . . . 11 (𝑘 = 𝐾 → (le‘𝑘) = )
1514breqd 5177 . . . . . . . . . 10 (𝑘 = 𝐾 → (𝑟(le‘𝑘)(𝑝 𝑞) ↔ 𝑟 (𝑝 𝑞)))
1611, 15bitrd 279 . . . . . . . . 9 (𝑘 = 𝐾 → (𝑟(le‘𝑘)(𝑝(join‘𝑘)𝑞) ↔ 𝑟 (𝑝 𝑞)))
1716imbi1d 341 . . . . . . . 8 (𝑘 = 𝐾 → ((𝑟(le‘𝑘)(𝑝(join‘𝑘)𝑞) → 𝑟𝑠) ↔ (𝑟 (𝑝 𝑞) → 𝑟𝑠)))
185, 17raleqbidv 3354 . . . . . . 7 (𝑘 = 𝐾 → (∀𝑟 ∈ (Atoms‘𝑘)(𝑟(le‘𝑘)(𝑝(join‘𝑘)𝑞) → 𝑟𝑠) ↔ ∀𝑟𝐴 (𝑟 (𝑝 𝑞) → 𝑟𝑠)))
19182ralbidv 3227 . . . . . 6 (𝑘 = 𝐾 → (∀𝑝𝑠𝑞𝑠𝑟 ∈ (Atoms‘𝑘)(𝑟(le‘𝑘)(𝑝(join‘𝑘)𝑞) → 𝑟𝑠) ↔ ∀𝑝𝑠𝑞𝑠𝑟𝐴 (𝑟 (𝑝 𝑞) → 𝑟𝑠)))
206, 19anbi12d 631 . . . . 5 (𝑘 = 𝐾 → ((𝑠 ⊆ (Atoms‘𝑘) ∧ ∀𝑝𝑠𝑞𝑠𝑟 ∈ (Atoms‘𝑘)(𝑟(le‘𝑘)(𝑝(join‘𝑘)𝑞) → 𝑟𝑠)) ↔ (𝑠𝐴 ∧ ∀𝑝𝑠𝑞𝑠𝑟𝐴 (𝑟 (𝑝 𝑞) → 𝑟𝑠))))
2120abbidv 2811 . . . 4 (𝑘 = 𝐾 → {𝑠 ∣ (𝑠 ⊆ (Atoms‘𝑘) ∧ ∀𝑝𝑠𝑞𝑠𝑟 ∈ (Atoms‘𝑘)(𝑟(le‘𝑘)(𝑝(join‘𝑘)𝑞) → 𝑟𝑠))} = {𝑠 ∣ (𝑠𝐴 ∧ ∀𝑝𝑠𝑞𝑠𝑟𝐴 (𝑟 (𝑝 𝑞) → 𝑟𝑠))})
22 df-psubsp 39460 . . . 4 PSubSp = (𝑘 ∈ V ↦ {𝑠 ∣ (𝑠 ⊆ (Atoms‘𝑘) ∧ ∀𝑝𝑠𝑞𝑠𝑟 ∈ (Atoms‘𝑘)(𝑟(le‘𝑘)(𝑝(join‘𝑘)𝑞) → 𝑟𝑠))})
234fvexi 6934 . . . . . 6 𝐴 ∈ V
2423pwex 5398 . . . . 5 𝒫 𝐴 ∈ V
25 velpw 4627 . . . . . . . 8 (𝑠 ∈ 𝒫 𝐴𝑠𝐴)
2625anbi1i 623 . . . . . . 7 ((𝑠 ∈ 𝒫 𝐴 ∧ ∀𝑝𝑠𝑞𝑠𝑟𝐴 (𝑟 (𝑝 𝑞) → 𝑟𝑠)) ↔ (𝑠𝐴 ∧ ∀𝑝𝑠𝑞𝑠𝑟𝐴 (𝑟 (𝑝 𝑞) → 𝑟𝑠)))
2726abbii 2812 . . . . . 6 {𝑠 ∣ (𝑠 ∈ 𝒫 𝐴 ∧ ∀𝑝𝑠𝑞𝑠𝑟𝐴 (𝑟 (𝑝 𝑞) → 𝑟𝑠))} = {𝑠 ∣ (𝑠𝐴 ∧ ∀𝑝𝑠𝑞𝑠𝑟𝐴 (𝑟 (𝑝 𝑞) → 𝑟𝑠))}
28 ssab2 4102 . . . . . 6 {𝑠 ∣ (𝑠 ∈ 𝒫 𝐴 ∧ ∀𝑝𝑠𝑞𝑠𝑟𝐴 (𝑟 (𝑝 𝑞) → 𝑟𝑠))} ⊆ 𝒫 𝐴
2927, 28eqsstrri 4044 . . . . 5 {𝑠 ∣ (𝑠𝐴 ∧ ∀𝑝𝑠𝑞𝑠𝑟𝐴 (𝑟 (𝑝 𝑞) → 𝑟𝑠))} ⊆ 𝒫 𝐴
3024, 29ssexi 5340 . . . 4 {𝑠 ∣ (𝑠𝐴 ∧ ∀𝑝𝑠𝑞𝑠𝑟𝐴 (𝑟 (𝑝 𝑞) → 𝑟𝑠))} ∈ V
3121, 22, 30fvmpt 7029 . . 3 (𝐾 ∈ V → (PSubSp‘𝐾) = {𝑠 ∣ (𝑠𝐴 ∧ ∀𝑝𝑠𝑞𝑠𝑟𝐴 (𝑟 (𝑝 𝑞) → 𝑟𝑠))})
322, 31eqtrid 2792 . 2 (𝐾 ∈ V → 𝑆 = {𝑠 ∣ (𝑠𝐴 ∧ ∀𝑝𝑠𝑞𝑠𝑟𝐴 (𝑟 (𝑝 𝑞) → 𝑟𝑠))})
331, 32syl 17 1 (𝐾𝐵𝑆 = {𝑠 ∣ (𝑠𝐴 ∧ ∀𝑝𝑠𝑞𝑠𝑟𝐴 (𝑟 (𝑝 𝑞) → 𝑟𝑠))})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1537  wcel 2108  {cab 2717  wral 3067  Vcvv 3488  wss 3976  𝒫 cpw 4622   class class class wbr 5166  cfv 6573  (class class class)co 7448  lecple 17318  joincjn 18381  Atomscatm 39219  PSubSpcpsubsp 39453
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pow 5383  ax-pr 5447
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-br 5167  df-opab 5229  df-mpt 5250  df-id 5593  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-iota 6525  df-fun 6575  df-fv 6581  df-ov 7451  df-psubsp 39460
This theorem is referenced by:  ispsubsp  39702
  Copyright terms: Public domain W3C validator