| 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 31609 | . . . . . . 7 ⊢ ((𝐻 ∈ Sℋ ∧ 𝐴 ∈ 𝐻 ∧ 𝐶 ∈ 𝐻) → (𝐴 −ℎ 𝐶) ∈ 𝐻) | |
| 5 | 1, 2, 3, 4 | syl3anc 1398 | . . . . . 6 ⊢ (𝜑 → (𝐴 −ℎ 𝐶) ∈ 𝐻) |
| 6 | shuni.8 | . . . . . . . 8 ⊢ (𝜑 → (𝐴 +ℎ 𝐵) = (𝐶 +ℎ 𝐷)) | |
| 7 | shel 31600 | . . . . . . . . . 10 ⊢ ((𝐻 ∈ Sℋ ∧ 𝐴 ∈ 𝐻) → 𝐴 ∈ ℋ) | |
| 8 | 1, 2, 7 | syl2anc 596 | . . . . . . . . 9 ⊢ (𝜑 → 𝐴 ∈ ℋ) |
| 9 | shuni.2 | . . . . . . . . . 10 ⊢ (𝜑 → 𝐾 ∈ Sℋ ) | |
| 10 | shuni.5 | . . . . . . . . . 10 ⊢ (𝜑 → 𝐵 ∈ 𝐾) | |
| 11 | shel 31600 | . . . . . . . . . 10 ⊢ ((𝐾 ∈ Sℋ ∧ 𝐵 ∈ 𝐾) → 𝐵 ∈ ℋ) | |
| 12 | 9, 10, 11 | syl2anc 596 | . . . . . . . . 9 ⊢ (𝜑 → 𝐵 ∈ ℋ) |
| 13 | shel 31600 | . . . . . . . . . 10 ⊢ ((𝐻 ∈ Sℋ ∧ 𝐶 ∈ 𝐻) → 𝐶 ∈ ℋ) | |
| 14 | 1, 3, 13 | syl2anc 596 | . . . . . . . . 9 ⊢ (𝜑 → 𝐶 ∈ ℋ) |
| 15 | shuni.7 | . . . . . . . . . 10 ⊢ (𝜑 → 𝐷 ∈ 𝐾) | |
| 16 | shel 31600 | . . . . . . . . . 10 ⊢ ((𝐾 ∈ Sℋ ∧ 𝐷 ∈ 𝐾) → 𝐷 ∈ ℋ) | |
| 17 | 9, 15, 16 | syl2anc 596 | . . . . . . . . 9 ⊢ (𝜑 → 𝐷 ∈ ℋ) |
| 18 | hvaddsub4 31467 | . . . . . . . . 9 ⊢ (((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) ∧ (𝐶 ∈ ℋ ∧ 𝐷 ∈ ℋ)) → ((𝐴 +ℎ 𝐵) = (𝐶 +ℎ 𝐷) ↔ (𝐴 −ℎ 𝐶) = (𝐷 −ℎ 𝐵))) | |
| 19 | 8, 12, 14, 17, 18 | syl22anc 852 | . . . . . . . 8 ⊢ (𝜑 → ((𝐴 +ℎ 𝐵) = (𝐶 +ℎ 𝐷) ↔ (𝐴 −ℎ 𝐶) = (𝐷 −ℎ 𝐵))) |
| 20 | 6, 19 | mpbid 235 | . . . . . . 7 ⊢ (𝜑 → (𝐴 −ℎ 𝐶) = (𝐷 −ℎ 𝐵)) |
| 21 | shsubcl 31609 | . . . . . . . 8 ⊢ ((𝐾 ∈ Sℋ ∧ 𝐷 ∈ 𝐾 ∧ 𝐵 ∈ 𝐾) → (𝐷 −ℎ 𝐵) ∈ 𝐾) | |
| 22 | 9, 15, 10, 21 | syl3anc 1398 | . . . . . . 7 ⊢ (𝜑 → (𝐷 −ℎ 𝐵) ∈ 𝐾) |
| 23 | 20, 22 | eqeltrd 2866 | . . . . . 6 ⊢ (𝜑 → (𝐴 −ℎ 𝐶) ∈ 𝐾) |
| 24 | 5, 23 | elind 4156 | . . . . 5 ⊢ (𝜑 → (𝐴 −ℎ 𝐶) ∈ (𝐻 ∩ 𝐾)) |
| 25 | shuni.3 | . . . . 5 ⊢ (𝜑 → (𝐻 ∩ 𝐾) = 0ℋ) | |
| 26 | 24, 25 | eleqtrd 2868 | . . . 4 ⊢ (𝜑 → (𝐴 −ℎ 𝐶) ∈ 0ℋ) |
| 27 | elch0 31643 | . . . 4 ⊢ ((𝐴 −ℎ 𝐶) ∈ 0ℋ ↔ (𝐴 −ℎ 𝐶) = 0ℎ) | |
| 28 | 26, 27 | sylib 221 | . . 3 ⊢ (𝜑 → (𝐴 −ℎ 𝐶) = 0ℎ) |
| 29 | hvsubeq0 31457 | . . . 4 ⊢ ((𝐴 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((𝐴 −ℎ 𝐶) = 0ℎ ↔ 𝐴 = 𝐶)) | |
| 30 | 8, 14, 29 | syl2anc 596 | . . 3 ⊢ (𝜑 → ((𝐴 −ℎ 𝐶) = 0ℎ ↔ 𝐴 = 𝐶)) |
| 31 | 28, 30 | mpbid 235 | . 2 ⊢ (𝜑 → 𝐴 = 𝐶) |
| 32 | 20, 28 | eqtr3d 2803 | . . . 4 ⊢ (𝜑 → (𝐷 −ℎ 𝐵) = 0ℎ) |
| 33 | hvsubeq0 31457 | . . . . 5 ⊢ ((𝐷 ∈ ℋ ∧ 𝐵 ∈ ℋ) → ((𝐷 −ℎ 𝐵) = 0ℎ ↔ 𝐷 = 𝐵)) | |
| 34 | 17, 12, 33 | syl2anc 596 | . . . 4 ⊢ (𝜑 → ((𝐷 −ℎ 𝐵) = 0ℎ ↔ 𝐷 = 𝐵)) |
| 35 | 32, 34 | mpbid 235 | . . 3 ⊢ (𝜑 → 𝐷 = 𝐵) |
| 36 | 35 | eqcomd 2772 | . 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 1570 ∈ wcel 2146 ∩ cin 3907 (class class class)co 7423 ℋchba 31308 +ℎ cva 31309 0ℎc0v 31313 −ℎ cmv 31314 Sℋ csh 31317 0ℋc0h 31324 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2738 ax-sep 5262 ax-nul 5274 ax-pow 5341 ax-pr 5409 ax-un 7745 ax-resscn 11175 ax-1cn 11176 ax-icn 11177 ax-addcl 11178 ax-addrcl 11179 ax-mulcl 11180 ax-mulrcl 11181 ax-mulcom 11182 ax-addass 11183 ax-mulass 11184 ax-distr 11185 ax-i2m1 11186 ax-1ne0 11187 ax-1rid 11188 ax-rnegex 11189 ax-rrecex 11190 ax-cnre 11191 ax-pre-lttri 11192 ax-pre-lttrn 11193 ax-pre-ltadd 11194 ax-pre-mulgt0 11195 ax-hilex 31388 ax-hfvadd 31389 ax-hvcom 31390 ax-hvass 31391 ax-hv0cl 31392 ax-hvaddid 31393 ax-hfvmul 31394 ax-hvmulid 31395 ax-hvmulass 31396 ax-hvdistr1 31397 ax-hvdistr2 31398 ax-hvmul0 31399 |
| 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 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2841 df-nfc 2915 df-ne 2962 df-nel 3068 df-ral 3083 df-rex 3093 df-rmo 3372 df-reu 3373 df-rab 3420 df-v 3460 df-sbc 3748 df-csb 3857 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-nul 4290 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-iun 4963 df-br 5115 df-opab 5179 df-mpt 5198 df-id 5561 df-po 5574 df-so 5575 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 df-iota 6499 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7380 df-ov 7426 df-oprab 7427 df-mpo 7428 df-er 8703 df-en 8953 df-dom 8954 df-sdom 8955 df-pnf 11263 df-mnf 11264 df-xr 11265 df-ltxr 11266 df-le 11267 df-sub 11461 df-neg 11462 df-div 11890 df-hvsub 31360 df-sh 31596 df-ch0 31642 |
| This theorem is used by: chocunii 31690 pjhthmo 31691 chscllem3 32028 |
| Copyright terms: Public domain | W3C validator |