| Hilbert Space Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > HSE Home > Th. List > shlej1 | Structured version Visualization version GIF version | ||
| Description: Add disjunct to both sides of Hilbert subspace ordering. (Contributed by NM, 22-Jun-2004.) (Revised by Mario Carneiro, 15-May-2014.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| shlej1 | ⊢ (((𝐴 ∈ Sℋ ∧ 𝐵 ∈ Sℋ ∧ 𝐶 ∈ Sℋ ) ∧ 𝐴 ⊆ 𝐵) → (𝐴 ∨ℋ 𝐶) ⊆ (𝐵 ∨ℋ 𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpr 490 | . . 3 ⊢ (((𝐴 ∈ Sℋ ∧ 𝐵 ∈ Sℋ ∧ 𝐶 ∈ Sℋ ) ∧ 𝐴 ⊆ 𝐵) → 𝐴 ⊆ 𝐵) | |
| 2 | unss1 4186 | . . . 4 ⊢ (𝐴 ⊆ 𝐵 → (𝐴 ∪ 𝐶) ⊆ (𝐵 ∪ 𝐶)) | |
| 3 | simpl1 1210 | . . . . . . 7 ⊢ (((𝐴 ∈ Sℋ ∧ 𝐵 ∈ Sℋ ∧ 𝐶 ∈ Sℋ ) ∧ 𝐴 ⊆ 𝐵) → 𝐴 ∈ Sℋ ) | |
| 4 | shss 31869 | . . . . . . 7 ⊢ (𝐴 ∈ Sℋ → 𝐴 ⊆ ℋ) | |
| 5 | 3, 4 | syl 18 | . . . . . 6 ⊢ (((𝐴 ∈ Sℋ ∧ 𝐵 ∈ Sℋ ∧ 𝐶 ∈ Sℋ ) ∧ 𝐴 ⊆ 𝐵) → 𝐴 ⊆ ℋ) |
| 6 | simpl3 1212 | . . . . . . 7 ⊢ (((𝐴 ∈ Sℋ ∧ 𝐵 ∈ Sℋ ∧ 𝐶 ∈ Sℋ ) ∧ 𝐴 ⊆ 𝐵) → 𝐶 ∈ Sℋ ) | |
| 7 | shss 31869 | . . . . . . 7 ⊢ (𝐶 ∈ Sℋ → 𝐶 ⊆ ℋ) | |
| 8 | 6, 7 | syl 18 | . . . . . 6 ⊢ (((𝐴 ∈ Sℋ ∧ 𝐵 ∈ Sℋ ∧ 𝐶 ∈ Sℋ ) ∧ 𝐴 ⊆ 𝐵) → 𝐶 ⊆ ℋ) |
| 9 | 5, 8 | unssd 4193 | . . . . 5 ⊢ (((𝐴 ∈ Sℋ ∧ 𝐵 ∈ Sℋ ∧ 𝐶 ∈ Sℋ ) ∧ 𝐴 ⊆ 𝐵) → (𝐴 ∪ 𝐶) ⊆ ℋ) |
| 10 | simpl2 1211 | . . . . . . 7 ⊢ (((𝐴 ∈ Sℋ ∧ 𝐵 ∈ Sℋ ∧ 𝐶 ∈ Sℋ ) ∧ 𝐴 ⊆ 𝐵) → 𝐵 ∈ Sℋ ) | |
| 11 | shss 31869 | . . . . . . 7 ⊢ (𝐵 ∈ Sℋ → 𝐵 ⊆ ℋ) | |
| 12 | 10, 11 | syl 18 | . . . . . 6 ⊢ (((𝐴 ∈ Sℋ ∧ 𝐵 ∈ Sℋ ∧ 𝐶 ∈ Sℋ ) ∧ 𝐴 ⊆ 𝐵) → 𝐵 ⊆ ℋ) |
| 13 | 12, 8 | unssd 4193 | . . . . 5 ⊢ (((𝐴 ∈ Sℋ ∧ 𝐵 ∈ Sℋ ∧ 𝐶 ∈ Sℋ ) ∧ 𝐴 ⊆ 𝐵) → (𝐵 ∪ 𝐶) ⊆ ℋ) |
| 14 | occon2 31947 | . . . . 5 ⊢ (((𝐴 ∪ 𝐶) ⊆ ℋ ∧ (𝐵 ∪ 𝐶) ⊆ ℋ) → ((𝐴 ∪ 𝐶) ⊆ (𝐵 ∪ 𝐶) → (⊥‘(⊥‘(𝐴 ∪ 𝐶))) ⊆ (⊥‘(⊥‘(𝐵 ∪ 𝐶))))) | |
| 15 | 9, 13, 14 | syl2anc 596 | . . . 4 ⊢ (((𝐴 ∈ Sℋ ∧ 𝐵 ∈ Sℋ ∧ 𝐶 ∈ Sℋ ) ∧ 𝐴 ⊆ 𝐵) → ((𝐴 ∪ 𝐶) ⊆ (𝐵 ∪ 𝐶) → (⊥‘(⊥‘(𝐴 ∪ 𝐶))) ⊆ (⊥‘(⊥‘(𝐵 ∪ 𝐶))))) |
| 16 | 2, 15 | syl5 35 | . . 3 ⊢ (((𝐴 ∈ Sℋ ∧ 𝐵 ∈ Sℋ ∧ 𝐶 ∈ Sℋ ) ∧ 𝐴 ⊆ 𝐵) → (𝐴 ⊆ 𝐵 → (⊥‘(⊥‘(𝐴 ∪ 𝐶))) ⊆ (⊥‘(⊥‘(𝐵 ∪ 𝐶))))) |
| 17 | 1, 16 | mpd 16 | . 2 ⊢ (((𝐴 ∈ Sℋ ∧ 𝐵 ∈ Sℋ ∧ 𝐶 ∈ Sℋ ) ∧ 𝐴 ⊆ 𝐵) → (⊥‘(⊥‘(𝐴 ∪ 𝐶))) ⊆ (⊥‘(⊥‘(𝐵 ∪ 𝐶)))) |
| 18 | shjval 32010 | . . 3 ⊢ ((𝐴 ∈ Sℋ ∧ 𝐶 ∈ Sℋ ) → (𝐴 ∨ℋ 𝐶) = (⊥‘(⊥‘(𝐴 ∪ 𝐶)))) | |
| 19 | 3, 6, 18 | syl2anc 596 | . 2 ⊢ (((𝐴 ∈ Sℋ ∧ 𝐵 ∈ Sℋ ∧ 𝐶 ∈ Sℋ ) ∧ 𝐴 ⊆ 𝐵) → (𝐴 ∨ℋ 𝐶) = (⊥‘(⊥‘(𝐴 ∪ 𝐶)))) |
| 20 | shjval 32010 | . . 3 ⊢ ((𝐵 ∈ Sℋ ∧ 𝐶 ∈ Sℋ ) → (𝐵 ∨ℋ 𝐶) = (⊥‘(⊥‘(𝐵 ∪ 𝐶)))) | |
| 21 | 10, 6, 20 | syl2anc 596 | . 2 ⊢ (((𝐴 ∈ Sℋ ∧ 𝐵 ∈ Sℋ ∧ 𝐶 ∈ Sℋ ) ∧ 𝐴 ⊆ 𝐵) → (𝐵 ∨ℋ 𝐶) = (⊥‘(⊥‘(𝐵 ∪ 𝐶)))) |
| 22 | 17, 19, 21 | 3sstr4d 3968 | 1 ⊢ (((𝐴 ∈ Sℋ ∧ 𝐵 ∈ Sℋ ∧ 𝐶 ∈ Sℋ ) ∧ 𝐴 ⊆ 𝐵) → (𝐴 ∨ℋ 𝐶) ⊆ (𝐵 ∨ℋ 𝐶)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2147 ⊆ wss 3900 ∪ cun 4152 ‘cfv 6566 (class class class)co 7451 ℋchba 31578 Sℋ csh 31587 ⊥cort 31589 ∨ℋ chj 31592 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-hilex 31658 ax-hfvadd 31659 ax-hv0cl 31662 ax-hfvmul 31664 ax-hvmul0 31669 ax-hfi 31738 ax-his2 31742 ax-his3 31743 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-id 5553 df-po 5566 df-so 5567 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-ov 7454 df-oprab 7455 df-mpo 7456 df-er 8755 df-en 9012 df-dom 9013 df-sdom 9014 df-pnf 11384 df-mnf 11385 df-ltxr 11387 df-sh 31866 df-oc 31911 df-chj 31969 |
| This theorem is used by: shlej2 32020 shlej1i 32037 chlej1 32169 |
| Copyright terms: Public domain | W3C validator |