| Hilbert Space Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > HSE Home > Th. List > shuni | Structured version Visualization version GIF version | ||
| Description: Two subspaces with trivial intersection have a unique decomposition of the elements of the subspace sum. (Contributed by Mario Carneiro, 15-May-2014.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| shuni.1 | ⊢ (𝜑 → 𝐻 ∈ Sℋ ) |
| shuni.2 | ⊢ (𝜑 → 𝐾 ∈ Sℋ ) |
| shuni.3 | ⊢ (𝜑 → (𝐻 ∩ 𝐾) = 0ℋ) |
| shuni.4 | ⊢ (𝜑 → 𝐴 ∈ 𝐻) |
| shuni.5 | ⊢ (𝜑 → 𝐵 ∈ 𝐾) |
| shuni.6 | ⊢ (𝜑 → 𝐶 ∈ 𝐻) |
| shuni.7 | ⊢ (𝜑 → 𝐷 ∈ 𝐾) |
| shuni.8 | ⊢ (𝜑 → (𝐴 +ℎ 𝐵) = (𝐶 +ℎ 𝐷)) |
| Ref | Expression |
|---|---|
| shuni | ⊢ (𝜑 → (𝐴 = 𝐶 ∧ 𝐵 = 𝐷)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | shuni.1 | . . . . . . 7 ⊢ (𝜑 → 𝐻 ∈ Sℋ ) | |
| 2 | shuni.4 | . . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ 𝐻) | |
| 3 | shuni.6 | . . . . . . 7 ⊢ (𝜑 → 𝐶 ∈ 𝐻) | |
| 4 | shsubcl 31827 | . . . . . . 7 ⊢ ((𝐻 ∈ Sℋ ∧ 𝐴 ∈ 𝐻 ∧ 𝐶 ∈ 𝐻) → (𝐴 −ℎ 𝐶) ∈ 𝐻) | |
| 5 | 1, 2, 3, 4 | syl3anc 1398 | . . . . . 6 ⊢ (𝜑 → (𝐴 −ℎ 𝐶) ∈ 𝐻) |
| 6 | shuni.8 | . . . . . . . 8 ⊢ (𝜑 → (𝐴 +ℎ 𝐵) = (𝐶 +ℎ 𝐷)) | |
| 7 | shel 31818 | . . . . . . . . . 10 ⊢ ((𝐻 ∈ Sℋ ∧ 𝐴 ∈ 𝐻) → 𝐴 ∈ ℋ) | |
| 8 | 1, 2, 7 | syl2anc 596 | . . . . . . . . 9 ⊢ (𝜑 → 𝐴 ∈ ℋ) |
| 9 | shuni.2 | . . . . . . . . . 10 ⊢ (𝜑 → 𝐾 ∈ Sℋ ) | |
| 10 | shuni.5 | . . . . . . . . . 10 ⊢ (𝜑 → 𝐵 ∈ 𝐾) | |
| 11 | shel 31818 | . . . . . . . . . 10 ⊢ ((𝐾 ∈ Sℋ ∧ 𝐵 ∈ 𝐾) → 𝐵 ∈ ℋ) | |
| 12 | 9, 10, 11 | syl2anc 596 | . . . . . . . . 9 ⊢ (𝜑 → 𝐵 ∈ ℋ) |
| 13 | shel 31818 | . . . . . . . . . 10 ⊢ ((𝐻 ∈ Sℋ ∧ 𝐶 ∈ 𝐻) → 𝐶 ∈ ℋ) | |
| 14 | 1, 3, 13 | syl2anc 596 | . . . . . . . . 9 ⊢ (𝜑 → 𝐶 ∈ ℋ) |
| 15 | shuni.7 | . . . . . . . . . 10 ⊢ (𝜑 → 𝐷 ∈ 𝐾) | |
| 16 | shel 31818 | . . . . . . . . . 10 ⊢ ((𝐾 ∈ Sℋ ∧ 𝐷 ∈ 𝐾) → 𝐷 ∈ ℋ) | |
| 17 | 9, 15, 16 | syl2anc 596 | . . . . . . . . 9 ⊢ (𝜑 → 𝐷 ∈ ℋ) |
| 18 | hvaddsub4 31685 | . . . . . . . . 9 ⊢ (((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) ∧ (𝐶 ∈ ℋ ∧ 𝐷 ∈ ℋ)) → ((𝐴 +ℎ 𝐵) = (𝐶 +ℎ 𝐷) ↔ (𝐴 −ℎ 𝐶) = (𝐷 −ℎ 𝐵))) | |
| 19 | 8, 12, 14, 17, 18 | syl22anc 852 | . . . . . . . 8 ⊢ (𝜑 → ((𝐴 +ℎ 𝐵) = (𝐶 +ℎ 𝐷) ↔ (𝐴 −ℎ 𝐶) = (𝐷 −ℎ 𝐵))) |
| 20 | 6, 19 | mpbid 235 | . . . . . . 7 ⊢ (𝜑 → (𝐴 −ℎ 𝐶) = (𝐷 −ℎ 𝐵)) |
| 21 | shsubcl 31827 | . . . . . . . 8 ⊢ ((𝐾 ∈ Sℋ ∧ 𝐷 ∈ 𝐾 ∧ 𝐵 ∈ 𝐾) → (𝐷 −ℎ 𝐵) ∈ 𝐾) | |
| 22 | 9, 15, 10, 21 | syl3anc 1398 | . . . . . . 7 ⊢ (𝜑 → (𝐷 −ℎ 𝐵) ∈ 𝐾) |
| 23 | 20, 22 | eqeltrd 2860 | . . . . . 6 ⊢ (𝜑 → (𝐴 −ℎ 𝐶) ∈ 𝐾) |
| 24 | 5, 23 | elind 4097 | . . . . 5 ⊢ (𝜑 → (𝐴 −ℎ 𝐶) ∈ (𝐻 ∩ 𝐾)) |
| 25 | shuni.3 | . . . . 5 ⊢ (𝜑 → (𝐻 ∩ 𝐾) = 0ℋ) | |
| 26 | 24, 25 | eleqtrd 2862 | . . . 4 ⊢ (𝜑 → (𝐴 −ℎ 𝐶) ∈ 0ℋ) |
| 27 | elch0 31861 | . . . 4 ⊢ ((𝐴 −ℎ 𝐶) ∈ 0ℋ ↔ (𝐴 −ℎ 𝐶) = 0ℎ) | |
| 28 | 26, 27 | sylib 221 | . . 3 ⊢ (𝜑 → (𝐴 −ℎ 𝐶) = 0ℎ) |
| 29 | hvsubeq0 31675 | . . . 4 ⊢ ((𝐴 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((𝐴 −ℎ 𝐶) = 0ℎ ↔ 𝐴 = 𝐶)) | |
| 30 | 8, 14, 29 | syl2anc 596 | . . 3 ⊢ (𝜑 → ((𝐴 −ℎ 𝐶) = 0ℎ ↔ 𝐴 = 𝐶)) |
| 31 | 28, 30 | mpbid 235 | . 2 ⊢ (𝜑 → 𝐴 = 𝐶) |
| 32 | 20, 28 | eqtr3d 2797 | . . . 4 ⊢ (𝜑 → (𝐷 −ℎ 𝐵) = 0ℎ) |
| 33 | hvsubeq0 31675 | . . . . 5 ⊢ ((𝐷 ∈ ℋ ∧ 𝐵 ∈ ℋ) → ((𝐷 −ℎ 𝐵) = 0ℎ ↔ 𝐷 = 𝐵)) | |
| 34 | 17, 12, 33 | syl2anc 596 | . . . 4 ⊢ (𝜑 → ((𝐷 −ℎ 𝐵) = 0ℎ ↔ 𝐷 = 𝐵)) |
| 35 | 32, 34 | mpbid 235 | . . 3 ⊢ (𝜑 → 𝐷 = 𝐵) |
| 36 | 35 | eqcomd 2766 | . 2 ⊢ (𝜑 → 𝐵 = 𝐷) |
| 37 | 31, 36 | jca 521 | 1 ⊢ (𝜑 → (𝐴 = 𝐶 ∧ 𝐵 = 𝐷)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1569 ∈ wcel 2144 ∩ cin 4089 (class class class)co 7420 ℋchba 31526 +ℎ cva 31527 0ℎc0v 31531 −ℎ cmv 31532 Sℋ csh 31535 0ℋc0h 31542 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7751 ax-resscn 11260 ax-1cn 11261 ax-icn 11262 ax-addcl 11263 ax-addrcl 11264 ax-mulcl 11265 ax-mulrcl 11266 ax-mulcom 11267 ax-addass 11268 ax-mulass 11269 ax-distr 11270 ax-i2m1 11271 ax-1ne0 11272 ax-1rid 11273 ax-rnegex 11274 ax-rrecex 11275 ax-cnre 11276 ax-pre-lttri 11277 ax-pre-lttrn 11278 ax-pre-ltadd 11279 ax-pre-mulgt0 11280 ax-hilex 31606 ax-hfvadd 31607 ax-hvcom 31608 ax-hvass 31609 ax-hv0cl 31610 ax-hvaddid 31611 ax-hfvmul 31612 ax-hvmulid 31613 ax-hvmulass 31614 ax-hvdistr1 31615 ax-hvdistr2 31616 ax-hvmul0 31617 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5545 df-po 5558 df-so 5559 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-er 8720 df-en 8977 df-dom 8978 df-sdom 8979 df-pnf 11348 df-mnf 11349 df-xr 11350 df-ltxr 11351 df-le 11352 df-sub 11546 df-neg 11547 df-div 11977 df-hvsub 31578 df-sh 31814 df-ch0 31860 |
| This theorem is used by: chocunii 31908 pjhthmo 31909 chscllem3 32246 |
| Copyright terms: Public domain | W3C validator |