HSE Home Hilbert Space Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  HSE Home  >  Th. List  >  sshjval3 Structured version   Visualization version   GIF version

Theorem sshjval3 29617
Description: Value of join for subsets of Hilbert space in terms of supremum: the join is the supremum of its two arguments. Based on the definition of join in [Beran] p. 3. For later convenience we prove a general version that works for any subset of Hilbert space, not just the elements of the lattice C. (Contributed by NM, 2-Mar-2004.) (Revised by Mario Carneiro, 23-Dec-2013.) (New usage is discouraged.)
Assertion
Ref Expression
sshjval3 ((𝐴 ⊆ ℋ ∧ 𝐵 ⊆ ℋ) → (𝐴 𝐵) = ( ‘{𝐴, 𝐵}))

Proof of Theorem sshjval3
StepHypRef Expression
1 ax-hilex 29262 . . . . . 6 ℋ ∈ V
21elpw2 5264 . . . . 5 (𝐴 ∈ 𝒫 ℋ ↔ 𝐴 ⊆ ℋ)
31elpw2 5264 . . . . 5 (𝐵 ∈ 𝒫 ℋ ↔ 𝐵 ⊆ ℋ)
4 uniprg 4853 . . . . 5 ((𝐴 ∈ 𝒫 ℋ ∧ 𝐵 ∈ 𝒫 ℋ) → {𝐴, 𝐵} = (𝐴𝐵))
52, 3, 4syl2anbr 598 . . . 4 ((𝐴 ⊆ ℋ ∧ 𝐵 ⊆ ℋ) → {𝐴, 𝐵} = (𝐴𝐵))
65fveq2d 6760 . . 3 ((𝐴 ⊆ ℋ ∧ 𝐵 ⊆ ℋ) → (⊥‘ {𝐴, 𝐵}) = (⊥‘(𝐴𝐵)))
76fveq2d 6760 . 2 ((𝐴 ⊆ ℋ ∧ 𝐵 ⊆ ℋ) → (⊥‘(⊥‘ {𝐴, 𝐵})) = (⊥‘(⊥‘(𝐴𝐵))))
8 prssi 4751 . . . 4 ((𝐴 ∈ 𝒫 ℋ ∧ 𝐵 ∈ 𝒫 ℋ) → {𝐴, 𝐵} ⊆ 𝒫 ℋ)
92, 3, 8syl2anbr 598 . . 3 ((𝐴 ⊆ ℋ ∧ 𝐵 ⊆ ℋ) → {𝐴, 𝐵} ⊆ 𝒫 ℋ)
10 hsupval 29597 . . 3 ({𝐴, 𝐵} ⊆ 𝒫 ℋ → ( ‘{𝐴, 𝐵}) = (⊥‘(⊥‘ {𝐴, 𝐵})))
119, 10syl 17 . 2 ((𝐴 ⊆ ℋ ∧ 𝐵 ⊆ ℋ) → ( ‘{𝐴, 𝐵}) = (⊥‘(⊥‘ {𝐴, 𝐵})))
12 sshjval 29613 . 2 ((𝐴 ⊆ ℋ ∧ 𝐵 ⊆ ℋ) → (𝐴 𝐵) = (⊥‘(⊥‘(𝐴𝐵))))
137, 11, 123eqtr4rd 2789 1 ((𝐴 ⊆ ℋ ∧ 𝐵 ⊆ ℋ) → (𝐴 𝐵) = ( ‘{𝐴, 𝐵}))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1539  wcel 2108  cun 3881  wss 3883  𝒫 cpw 4530  {cpr 4560   cuni 4836  cfv 6418  (class class class)co 7255  chba 29182  cort 29193   chj 29196   chsup 29197
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347  ax-hilex 29262
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-sbc 3712  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-br 5071  df-opab 5133  df-mpt 5154  df-id 5480  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-iota 6376  df-fun 6420  df-fv 6426  df-ov 7258  df-oprab 7259  df-mpo 7260  df-chj 29573  df-chsup 29574
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator