| Hilbert Space Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > HSE Home > Th. List > sshjval3 | Structured version Visualization version GIF version | ||
| 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.) |
| Ref | Expression |
|---|---|
| sshjval3 | ⊢ ((𝐴 ⊆ ℋ ∧ 𝐵 ⊆ ℋ) → (𝐴 ∨ℋ 𝐵) = ( ∨ℋ ‘{𝐴, 𝐵})) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ax-hilex 31466 | . . . . . 6 ⊢ ℋ ∈ V | |
| 2 | 1 | elpw2 5303 | . . . . 5 ⊢ (𝐴 ∈ 𝒫 ℋ ↔ 𝐴 ⊆ ℋ) |
| 3 | 1 | elpw2 5303 | . . . . 5 ⊢ (𝐵 ∈ 𝒫 ℋ ↔ 𝐵 ⊆ ℋ) |
| 4 | uniprg 4886 | . . . . 5 ⊢ ((𝐴 ∈ 𝒫 ℋ ∧ 𝐵 ∈ 𝒫 ℋ) → ∪ {𝐴, 𝐵} = (𝐴 ∪ 𝐵)) | |
| 5 | 2, 3, 4 | syl2anbr 611 | . . . 4 ⊢ ((𝐴 ⊆ ℋ ∧ 𝐵 ⊆ ℋ) → ∪ {𝐴, 𝐵} = (𝐴 ∪ 𝐵)) |
| 6 | 5 | fveq2d 6886 | . . 3 ⊢ ((𝐴 ⊆ ℋ ∧ 𝐵 ⊆ ℋ) → (⊥‘∪ {𝐴, 𝐵}) = (⊥‘(𝐴 ∪ 𝐵))) |
| 7 | 6 | fveq2d 6886 | . 2 ⊢ ((𝐴 ⊆ ℋ ∧ 𝐵 ⊆ ℋ) → (⊥‘(⊥‘∪ {𝐴, 𝐵})) = (⊥‘(⊥‘(𝐴 ∪ 𝐵)))) |
| 8 | prssi 4785 | . . . 4 ⊢ ((𝐴 ∈ 𝒫 ℋ ∧ 𝐵 ∈ 𝒫 ℋ) → {𝐴, 𝐵} ⊆ 𝒫 ℋ) | |
| 9 | 2, 3, 8 | syl2anbr 611 | . . 3 ⊢ ((𝐴 ⊆ ℋ ∧ 𝐵 ⊆ ℋ) → {𝐴, 𝐵} ⊆ 𝒫 ℋ) |
| 10 | hsupval 31801 | . . 3 ⊢ ({𝐴, 𝐵} ⊆ 𝒫 ℋ → ( ∨ℋ ‘{𝐴, 𝐵}) = (⊥‘(⊥‘∪ {𝐴, 𝐵}))) | |
| 11 | 9, 10 | syl 18 | . 2 ⊢ ((𝐴 ⊆ ℋ ∧ 𝐵 ⊆ ℋ) → ( ∨ℋ ‘{𝐴, 𝐵}) = (⊥‘(⊥‘∪ {𝐴, 𝐵}))) |
| 12 | sshjval 31817 | . 2 ⊢ ((𝐴 ⊆ ℋ ∧ 𝐵 ⊆ ℋ) → (𝐴 ∨ℋ 𝐵) = (⊥‘(⊥‘(𝐴 ∪ 𝐵)))) | |
| 13 | 7, 11, 12 | 3eqtr4rd 2808 | 1 ⊢ ((𝐴 ⊆ ℋ ∧ 𝐵 ⊆ ℋ) → (𝐴 ∨ℋ 𝐵) = ( ∨ℋ ‘{𝐴, 𝐵})) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ∪ cun 3900 ⊆ wss 3902 𝒫 cpw 4560 {cpr 4589 ∪ cuni 4870 ‘cfv 6537 (class class class)co 7416 ℋchba 31386 ⊥cort 31397 ∨ℋ chj 31400 ∨ℋ chsup 31401 |
| 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 2215 ax-ext 2734 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-hilex 31466 |
| 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 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-rab 3415 df-v 3455 df-sbc 3743 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-br 5108 df-opab 5172 df-mpt 5191 df-id 5554 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-iota 6493 df-fun 6539 df-fv 6545 df-ov 7419 df-oprab 7420 df-mpo 7421 df-chj 31777 df-chsup 31778 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |