| Hilbert Space Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > HSE Home > Th. List > hsupss | Structured version Visualization version GIF version | ||
| Description: Subset relation for supremum of Hilbert space subsets. (Contributed by NM, 24-Nov-2004.) (Revised by Mario Carneiro, 15-May-2014.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| hsupss | ⊢ ((𝐴 ⊆ 𝒫 ℋ ∧ 𝐵 ⊆ 𝒫 ℋ) → (𝐴 ⊆ 𝐵 → ( ∨ℋ ‘𝐴) ⊆ ( ∨ℋ ‘𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | uniss 4878 | . . 3 ⊢ (𝐴 ⊆ 𝐵 → ∪ 𝐴 ⊆ ∪ 𝐵) | |
| 2 | sspwuni 5064 | . . . 4 ⊢ (𝐴 ⊆ 𝒫 ℋ ↔ ∪ 𝐴 ⊆ ℋ) | |
| 3 | sspwuni 5064 | . . . 4 ⊢ (𝐵 ⊆ 𝒫 ℋ ↔ ∪ 𝐵 ⊆ ℋ) | |
| 4 | occon2 31753 | . . . 4 ⊢ ((∪ 𝐴 ⊆ ℋ ∧ ∪ 𝐵 ⊆ ℋ) → (∪ 𝐴 ⊆ ∪ 𝐵 → (⊥‘(⊥‘∪ 𝐴)) ⊆ (⊥‘(⊥‘∪ 𝐵)))) | |
| 5 | 2, 3, 4 | syl2anb 610 | . . 3 ⊢ ((𝐴 ⊆ 𝒫 ℋ ∧ 𝐵 ⊆ 𝒫 ℋ) → (∪ 𝐴 ⊆ ∪ 𝐵 → (⊥‘(⊥‘∪ 𝐴)) ⊆ (⊥‘(⊥‘∪ 𝐵)))) |
| 6 | 1, 5 | syl5 35 | . 2 ⊢ ((𝐴 ⊆ 𝒫 ℋ ∧ 𝐵 ⊆ 𝒫 ℋ) → (𝐴 ⊆ 𝐵 → (⊥‘(⊥‘∪ 𝐴)) ⊆ (⊥‘(⊥‘∪ 𝐵)))) |
| 7 | hsupval 31799 | . . . 4 ⊢ (𝐴 ⊆ 𝒫 ℋ → ( ∨ℋ ‘𝐴) = (⊥‘(⊥‘∪ 𝐴))) | |
| 8 | 7 | adantr 486 | . . 3 ⊢ ((𝐴 ⊆ 𝒫 ℋ ∧ 𝐵 ⊆ 𝒫 ℋ) → ( ∨ℋ ‘𝐴) = (⊥‘(⊥‘∪ 𝐴))) |
| 9 | hsupval 31799 | . . . 4 ⊢ (𝐵 ⊆ 𝒫 ℋ → ( ∨ℋ ‘𝐵) = (⊥‘(⊥‘∪ 𝐵))) | |
| 10 | 9 | adantl 487 | . . 3 ⊢ ((𝐴 ⊆ 𝒫 ℋ ∧ 𝐵 ⊆ 𝒫 ℋ) → ( ∨ℋ ‘𝐵) = (⊥‘(⊥‘∪ 𝐵))) |
| 11 | 8, 10 | sseq12d 3967 | . 2 ⊢ ((𝐴 ⊆ 𝒫 ℋ ∧ 𝐵 ⊆ 𝒫 ℋ) → (( ∨ℋ ‘𝐴) ⊆ ( ∨ℋ ‘𝐵) ↔ (⊥‘(⊥‘∪ 𝐴)) ⊆ (⊥‘(⊥‘∪ 𝐵)))) |
| 12 | 6, 11 | sylibrd 262 | 1 ⊢ ((𝐴 ⊆ 𝒫 ℋ ∧ 𝐵 ⊆ 𝒫 ℋ) → (𝐴 ⊆ 𝐵 → ( ∨ℋ ‘𝐴) ⊆ ( ∨ℋ ‘𝐵))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ⊆ wss 3902 𝒫 cpw 4560 ∪ cuni 4870 ‘cfv 6537 ℋchba 31384 ⊥cort 31395 ∨ℋ chsup 31399 |
| 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-un 7739 ax-resscn 11182 ax-1cn 11183 ax-icn 11184 ax-addcl 11185 ax-addrcl 11186 ax-mulcl 11187 ax-mulrcl 11188 ax-mulcom 11189 ax-addass 11190 ax-mulass 11191 ax-distr 11192 ax-i2m1 11193 ax-1ne0 11194 ax-1rid 11195 ax-rnegex 11196 ax-rrecex 11197 ax-cnre 11198 ax-pre-lttri 11199 ax-pre-lttrn 11200 ax-pre-ltadd 11201 ax-hilex 31464 ax-hfvadd 31465 ax-hv0cl 31468 ax-hfvmul 31470 ax-hvmul0 31475 ax-hfi 31544 ax-his2 31548 ax-his3 31549 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 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-nel 3064 df-ral 3079 df-rex 3089 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 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-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-id 5554 df-po 5567 df-so 5568 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-ov 7419 df-er 8699 df-en 8956 df-dom 8957 df-sdom 8958 df-pnf 11270 df-mnf 11271 df-ltxr 11273 df-sh 31672 df-oc 31717 df-chsup 31776 |
| This theorem is used by: chsupss 31807 |
| Copyright terms: Public domain | W3C validator |