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

Theorem sshjval3 31889
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 31534 . . . . . 6 ℋ ∈ V
21elpw2 5295 . . . . 5 (𝐴 ∈ 𝒫 ℋ ↔ 𝐴 ⊆ ℋ)
31elpw2 5295 . . . . 5 (𝐵 ∈ 𝒫 ℋ ↔ 𝐵 ⊆ ℋ)
4 uniprg 4882 . . . . 5 ((𝐴 ∈ 𝒫 ℋ ∧ 𝐵 ∈ 𝒫 ℋ) → ∪ {𝐴, 𝐵} = (𝐴 ∪ 𝐵))
52, 3, 4syl2anbr 611 . . . 4 ((𝐴 ⊆ ℋ ∧ 𝐵 ⊆ ℋ) → ∪ {𝐴, 𝐵} = (𝐴 ∪ 𝐵))
65fveq2d 6877 . . 3 ((𝐴 ⊆ ℋ ∧ 𝐵 ⊆ ℋ) → (⊥‘∪ {𝐴, 𝐵}) = (⊥‘(𝐴 ∪ 𝐵)))
76fveq2d 6877 . 2 ((𝐴 ⊆ ℋ ∧ 𝐵 ⊆ ℋ) → (⊥‘(⊥‘∪ {𝐴, 𝐵})) = (⊥‘(⊥‘(𝐴 ∪ 𝐵))))
8 prssi 4781 . . . 4 ((𝐴 ∈ 𝒫 ℋ ∧ 𝐵 ∈ 𝒫 ℋ) → {𝐴, 𝐵} ⊆ 𝒫 ℋ)
92, 3, 8syl2anbr 611 . . 3 ((𝐴 ⊆ ℋ ∧ 𝐵 ⊆ ℋ) → {𝐴, 𝐵} ⊆ 𝒫 ℋ)
10 hsupval 31869 . . 3 ({𝐴, 𝐵} ⊆ 𝒫 ℋ → ( ∨ℋ ‘{𝐴, 𝐵}) = (⊥‘(⊥‘∪ {𝐴, 𝐵})))
119, 10syl 18 . 2 ((𝐴 ⊆ ℋ ∧ 𝐵 ⊆ ℋ) → ( ∨ℋ ‘{𝐴, 𝐵}) = (⊥‘(⊥‘∪ {𝐴, 𝐵})))
12 sshjval 31885 . 2 ((𝐴 ⊆ ℋ ∧ 𝐵 ⊆ ℋ) → (𝐴 ∨ℋ 𝐵) = (⊥‘(⊥‘(𝐴 ∪ 𝐵))))
137, 11, 123eqtr4rd 2806 1 ((𝐴 ⊆ ℋ ∧ 𝐵 ⊆ ℋ) → (𝐴 ∨ℋ 𝐵) = ( ∨ℋ ‘{𝐴, 𝐵}))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145   ∪ cun 3896   ⊆ wss 3898  𝒫 cpw 4556  {cpr 4585  ∪ cuni 4866  ‘cfv 6527  (class class class)co 7408   ℋchba 31454  ⊥cort 31465   ∨ℋ chj 31468   ∨ℋ chsup 31469
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-hilex 31534
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5542  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-iota 6483  df-fun 6529  df-fv 6535  df-ov 7411  df-oprab 7412  df-mpo 7413  df-chj 31845  df-chsup 31846
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator