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

Theorem sshjval3 29710
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 29355 . . . . . 6 ℋ ∈ V
21elpw2 5273 . . . . 5 (𝐴 ∈ 𝒫 ℋ ↔ 𝐴 ⊆ ℋ)
31elpw2 5273 . . . . 5 (𝐵 ∈ 𝒫 ℋ ↔ 𝐵 ⊆ ℋ)
4 uniprg 4862 . . . . 5 ((𝐴 ∈ 𝒫 ℋ ∧ 𝐵 ∈ 𝒫 ℋ) → {𝐴, 𝐵} = (𝐴𝐵))
52, 3, 4syl2anbr 599 . . . 4 ((𝐴 ⊆ ℋ ∧ 𝐵 ⊆ ℋ) → {𝐴, 𝐵} = (𝐴𝐵))
65fveq2d 6773 . . 3 ((𝐴 ⊆ ℋ ∧ 𝐵 ⊆ ℋ) → (⊥‘ {𝐴, 𝐵}) = (⊥‘(𝐴𝐵)))
76fveq2d 6773 . 2 ((𝐴 ⊆ ℋ ∧ 𝐵 ⊆ ℋ) → (⊥‘(⊥‘ {𝐴, 𝐵})) = (⊥‘(⊥‘(𝐴𝐵))))
8 prssi 4760 . . . 4 ((𝐴 ∈ 𝒫 ℋ ∧ 𝐵 ∈ 𝒫 ℋ) → {𝐴, 𝐵} ⊆ 𝒫 ℋ)
92, 3, 8syl2anbr 599 . . 3 ((𝐴 ⊆ ℋ ∧ 𝐵 ⊆ ℋ) → {𝐴, 𝐵} ⊆ 𝒫 ℋ)
10 hsupval 29690 . . 3 ({𝐴, 𝐵} ⊆ 𝒫 ℋ → ( ‘{𝐴, 𝐵}) = (⊥‘(⊥‘ {𝐴, 𝐵})))
119, 10syl 17 . 2 ((𝐴 ⊆ ℋ ∧ 𝐵 ⊆ ℋ) → ( ‘{𝐴, 𝐵}) = (⊥‘(⊥‘ {𝐴, 𝐵})))
12 sshjval 29706 . 2 ((𝐴 ⊆ ℋ ∧ 𝐵 ⊆ ℋ) → (𝐴 𝐵) = (⊥‘(⊥‘(𝐴𝐵))))
137, 11, 123eqtr4rd 2791 1 ((𝐴 ⊆ ℋ ∧ 𝐵 ⊆ ℋ) → (𝐴 𝐵) = ( ‘{𝐴, 𝐵}))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396   = wceq 1542  wcel 2110  cun 3890  wss 3892  𝒫 cpw 4539  {cpr 4569   cuni 4845  cfv 6431  (class class class)co 7269  chba 29275  cort 29286   chj 29289   chsup 29290
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1975  ax-7 2015  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2158  ax-12 2175  ax-ext 2711  ax-sep 5227  ax-nul 5234  ax-pow 5292  ax-pr 5356  ax-hilex 29355
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1545  df-fal 1555  df-ex 1787  df-nf 1791  df-sb 2072  df-mo 2542  df-eu 2571  df-clab 2718  df-cleq 2732  df-clel 2818  df-nfc 2891  df-ral 3071  df-rex 3072  df-rab 3075  df-v 3433  df-sbc 3721  df-dif 3895  df-un 3897  df-in 3899  df-ss 3909  df-nul 4263  df-if 4466  df-pw 4541  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4846  df-br 5080  df-opab 5142  df-mpt 5163  df-id 5489  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-iota 6389  df-fun 6433  df-fv 6439  df-ov 7272  df-oprab 7273  df-mpo 7274  df-chj 29666  df-chsup 29667
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator