![]() |
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 30507 | . . . . . 6 ⊢ ℋ ∈ V | |
2 | 1 | elpw2 5345 | . . . . 5 ⊢ (𝐴 ∈ 𝒫 ℋ ↔ 𝐴 ⊆ ℋ) |
3 | 1 | elpw2 5345 | . . . . 5 ⊢ (𝐵 ∈ 𝒫 ℋ ↔ 𝐵 ⊆ ℋ) |
4 | uniprg 4925 | . . . . 5 ⊢ ((𝐴 ∈ 𝒫 ℋ ∧ 𝐵 ∈ 𝒫 ℋ) → ∪ {𝐴, 𝐵} = (𝐴 ∪ 𝐵)) | |
5 | 2, 3, 4 | syl2anbr 599 | . . . 4 ⊢ ((𝐴 ⊆ ℋ ∧ 𝐵 ⊆ ℋ) → ∪ {𝐴, 𝐵} = (𝐴 ∪ 𝐵)) |
6 | 5 | fveq2d 6895 | . . 3 ⊢ ((𝐴 ⊆ ℋ ∧ 𝐵 ⊆ ℋ) → (⊥‘∪ {𝐴, 𝐵}) = (⊥‘(𝐴 ∪ 𝐵))) |
7 | 6 | fveq2d 6895 | . 2 ⊢ ((𝐴 ⊆ ℋ ∧ 𝐵 ⊆ ℋ) → (⊥‘(⊥‘∪ {𝐴, 𝐵})) = (⊥‘(⊥‘(𝐴 ∪ 𝐵)))) |
8 | prssi 4824 | . . . 4 ⊢ ((𝐴 ∈ 𝒫 ℋ ∧ 𝐵 ∈ 𝒫 ℋ) → {𝐴, 𝐵} ⊆ 𝒫 ℋ) | |
9 | 2, 3, 8 | syl2anbr 599 | . . 3 ⊢ ((𝐴 ⊆ ℋ ∧ 𝐵 ⊆ ℋ) → {𝐴, 𝐵} ⊆ 𝒫 ℋ) |
10 | hsupval 30842 | . . 3 ⊢ ({𝐴, 𝐵} ⊆ 𝒫 ℋ → ( ∨ℋ ‘{𝐴, 𝐵}) = (⊥‘(⊥‘∪ {𝐴, 𝐵}))) | |
11 | 9, 10 | syl 17 | . 2 ⊢ ((𝐴 ⊆ ℋ ∧ 𝐵 ⊆ ℋ) → ( ∨ℋ ‘{𝐴, 𝐵}) = (⊥‘(⊥‘∪ {𝐴, 𝐵}))) |
12 | sshjval 30858 | . 2 ⊢ ((𝐴 ⊆ ℋ ∧ 𝐵 ⊆ ℋ) → (𝐴 ∨ℋ 𝐵) = (⊥‘(⊥‘(𝐴 ∪ 𝐵)))) | |
13 | 7, 11, 12 | 3eqtr4rd 2783 | 1 ⊢ ((𝐴 ⊆ ℋ ∧ 𝐵 ⊆ ℋ) → (𝐴 ∨ℋ 𝐵) = ( ∨ℋ ‘{𝐴, 𝐵})) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 = wceq 1541 ∈ wcel 2106 ∪ cun 3946 ⊆ wss 3948 𝒫 cpw 4602 {cpr 4630 ∪ cuni 4908 ‘cfv 6543 (class class class)co 7411 ℋchba 30427 ⊥cort 30438 ∨ℋ chj 30441 ∨ℋ chsup 30442 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-hilex 30507 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-ral 3062 df-rex 3071 df-rab 3433 df-v 3476 df-sbc 3778 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-br 5149 df-opab 5211 df-mpt 5232 df-id 5574 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-iota 6495 df-fun 6545 df-fv 6551 df-ov 7414 df-oprab 7415 df-mpo 7416 df-chj 30818 df-chsup 30819 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |