![]() |
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 31252 | . . . . . . 7 ⊢ ((𝐻 ∈ Sℋ ∧ 𝐴 ∈ 𝐻 ∧ 𝐶 ∈ 𝐻) → (𝐴 −ℎ 𝐶) ∈ 𝐻) | |
5 | 1, 2, 3, 4 | syl3anc 1371 | . . . . . 6 ⊢ (𝜑 → (𝐴 −ℎ 𝐶) ∈ 𝐻) |
6 | shuni.8 | . . . . . . . 8 ⊢ (𝜑 → (𝐴 +ℎ 𝐵) = (𝐶 +ℎ 𝐷)) | |
7 | shel 31243 | . . . . . . . . . 10 ⊢ ((𝐻 ∈ Sℋ ∧ 𝐴 ∈ 𝐻) → 𝐴 ∈ ℋ) | |
8 | 1, 2, 7 | syl2anc 583 | . . . . . . . . 9 ⊢ (𝜑 → 𝐴 ∈ ℋ) |
9 | shuni.2 | . . . . . . . . . 10 ⊢ (𝜑 → 𝐾 ∈ Sℋ ) | |
10 | shuni.5 | . . . . . . . . . 10 ⊢ (𝜑 → 𝐵 ∈ 𝐾) | |
11 | shel 31243 | . . . . . . . . . 10 ⊢ ((𝐾 ∈ Sℋ ∧ 𝐵 ∈ 𝐾) → 𝐵 ∈ ℋ) | |
12 | 9, 10, 11 | syl2anc 583 | . . . . . . . . 9 ⊢ (𝜑 → 𝐵 ∈ ℋ) |
13 | shel 31243 | . . . . . . . . . 10 ⊢ ((𝐻 ∈ Sℋ ∧ 𝐶 ∈ 𝐻) → 𝐶 ∈ ℋ) | |
14 | 1, 3, 13 | syl2anc 583 | . . . . . . . . 9 ⊢ (𝜑 → 𝐶 ∈ ℋ) |
15 | shuni.7 | . . . . . . . . . 10 ⊢ (𝜑 → 𝐷 ∈ 𝐾) | |
16 | shel 31243 | . . . . . . . . . 10 ⊢ ((𝐾 ∈ Sℋ ∧ 𝐷 ∈ 𝐾) → 𝐷 ∈ ℋ) | |
17 | 9, 15, 16 | syl2anc 583 | . . . . . . . . 9 ⊢ (𝜑 → 𝐷 ∈ ℋ) |
18 | hvaddsub4 31110 | . . . . . . . . 9 ⊢ (((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) ∧ (𝐶 ∈ ℋ ∧ 𝐷 ∈ ℋ)) → ((𝐴 +ℎ 𝐵) = (𝐶 +ℎ 𝐷) ↔ (𝐴 −ℎ 𝐶) = (𝐷 −ℎ 𝐵))) | |
19 | 8, 12, 14, 17, 18 | syl22anc 838 | . . . . . . . 8 ⊢ (𝜑 → ((𝐴 +ℎ 𝐵) = (𝐶 +ℎ 𝐷) ↔ (𝐴 −ℎ 𝐶) = (𝐷 −ℎ 𝐵))) |
20 | 6, 19 | mpbid 232 | . . . . . . 7 ⊢ (𝜑 → (𝐴 −ℎ 𝐶) = (𝐷 −ℎ 𝐵)) |
21 | shsubcl 31252 | . . . . . . . 8 ⊢ ((𝐾 ∈ Sℋ ∧ 𝐷 ∈ 𝐾 ∧ 𝐵 ∈ 𝐾) → (𝐷 −ℎ 𝐵) ∈ 𝐾) | |
22 | 9, 15, 10, 21 | syl3anc 1371 | . . . . . . 7 ⊢ (𝜑 → (𝐷 −ℎ 𝐵) ∈ 𝐾) |
23 | 20, 22 | eqeltrd 2844 | . . . . . 6 ⊢ (𝜑 → (𝐴 −ℎ 𝐶) ∈ 𝐾) |
24 | 5, 23 | elind 4223 | . . . . 5 ⊢ (𝜑 → (𝐴 −ℎ 𝐶) ∈ (𝐻 ∩ 𝐾)) |
25 | shuni.3 | . . . . 5 ⊢ (𝜑 → (𝐻 ∩ 𝐾) = 0ℋ) | |
26 | 24, 25 | eleqtrd 2846 | . . . 4 ⊢ (𝜑 → (𝐴 −ℎ 𝐶) ∈ 0ℋ) |
27 | elch0 31286 | . . . 4 ⊢ ((𝐴 −ℎ 𝐶) ∈ 0ℋ ↔ (𝐴 −ℎ 𝐶) = 0ℎ) | |
28 | 26, 27 | sylib 218 | . . 3 ⊢ (𝜑 → (𝐴 −ℎ 𝐶) = 0ℎ) |
29 | hvsubeq0 31100 | . . . 4 ⊢ ((𝐴 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((𝐴 −ℎ 𝐶) = 0ℎ ↔ 𝐴 = 𝐶)) | |
30 | 8, 14, 29 | syl2anc 583 | . . 3 ⊢ (𝜑 → ((𝐴 −ℎ 𝐶) = 0ℎ ↔ 𝐴 = 𝐶)) |
31 | 28, 30 | mpbid 232 | . 2 ⊢ (𝜑 → 𝐴 = 𝐶) |
32 | 20, 28 | eqtr3d 2782 | . . . 4 ⊢ (𝜑 → (𝐷 −ℎ 𝐵) = 0ℎ) |
33 | hvsubeq0 31100 | . . . . 5 ⊢ ((𝐷 ∈ ℋ ∧ 𝐵 ∈ ℋ) → ((𝐷 −ℎ 𝐵) = 0ℎ ↔ 𝐷 = 𝐵)) | |
34 | 17, 12, 33 | syl2anc 583 | . . . 4 ⊢ (𝜑 → ((𝐷 −ℎ 𝐵) = 0ℎ ↔ 𝐷 = 𝐵)) |
35 | 32, 34 | mpbid 232 | . . 3 ⊢ (𝜑 → 𝐷 = 𝐵) |
36 | 35 | eqcomd 2746 | . 2 ⊢ (𝜑 → 𝐵 = 𝐷) |
37 | 31, 36 | jca 511 | 1 ⊢ (𝜑 → (𝐴 = 𝐶 ∧ 𝐵 = 𝐷)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1537 ∈ wcel 2108 ∩ cin 3975 (class class class)co 7448 ℋchba 30951 +ℎ cva 30952 0ℎc0v 30956 −ℎ cmv 30957 Sℋ csh 30960 0ℋc0h 30967 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 ax-un 7770 ax-resscn 11241 ax-1cn 11242 ax-icn 11243 ax-addcl 11244 ax-addrcl 11245 ax-mulcl 11246 ax-mulrcl 11247 ax-mulcom 11248 ax-addass 11249 ax-mulass 11250 ax-distr 11251 ax-i2m1 11252 ax-1ne0 11253 ax-1rid 11254 ax-rnegex 11255 ax-rrecex 11256 ax-cnre 11257 ax-pre-lttri 11258 ax-pre-lttrn 11259 ax-pre-ltadd 11260 ax-pre-mulgt0 11261 ax-hilex 31031 ax-hfvadd 31032 ax-hvcom 31033 ax-hvass 31034 ax-hv0cl 31035 ax-hvaddid 31036 ax-hfvmul 31037 ax-hvmulid 31038 ax-hvmulass 31039 ax-hvdistr1 31040 ax-hvdistr2 31041 ax-hvmul0 31042 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3or 1088 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-nel 3053 df-ral 3068 df-rex 3077 df-rmo 3388 df-reu 3389 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-iun 5017 df-br 5167 df-opab 5229 df-mpt 5250 df-id 5593 df-po 5607 df-so 5608 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-iota 6525 df-fun 6575 df-fn 6576 df-f 6577 df-f1 6578 df-fo 6579 df-f1o 6580 df-fv 6581 df-riota 7404 df-ov 7451 df-oprab 7452 df-mpo 7453 df-er 8763 df-en 9004 df-dom 9005 df-sdom 9006 df-pnf 11326 df-mnf 11327 df-xr 11328 df-ltxr 11329 df-le 11330 df-sub 11522 df-neg 11523 df-div 11948 df-hvsub 31003 df-sh 31239 df-ch0 31285 |
This theorem is referenced by: chocunii 31333 pjhthmo 31334 chscllem3 31671 |
Copyright terms: Public domain | W3C validator |