HSE Home Hilbert Space Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  HSE Home  >  Th. List  >  shuni Structured version   Unicode version

Theorem shuni 26345
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.)
Hypotheses
Ref Expression
shuni.1  |-  ( ph  ->  H  e.  SH )
shuni.2  |-  ( ph  ->  K  e.  SH )
shuni.3  |-  ( ph  ->  ( H  i^i  K
)  =  0H )
shuni.4  |-  ( ph  ->  A  e.  H )
shuni.5  |-  ( ph  ->  B  e.  K )
shuni.6  |-  ( ph  ->  C  e.  H )
shuni.7  |-  ( ph  ->  D  e.  K )
shuni.8  |-  ( ph  ->  ( A  +h  B
)  =  ( C  +h  D ) )
Assertion
Ref Expression
shuni  |-  ( ph  ->  ( A  =  C  /\  B  =  D ) )

Proof of Theorem shuni
StepHypRef Expression
1 shuni.1 . . . . . . 7  |-  ( ph  ->  H  e.  SH )
2 shuni.4 . . . . . . 7  |-  ( ph  ->  A  e.  H )
3 shuni.6 . . . . . . 7  |-  ( ph  ->  C  e.  H )
4 shsubcl 26265 . . . . . . 7  |-  ( ( H  e.  SH  /\  A  e.  H  /\  C  e.  H )  ->  ( A  -h  C
)  e.  H )
51, 2, 3, 4syl3anc 1228 . . . . . 6  |-  ( ph  ->  ( A  -h  C
)  e.  H )
6 shuni.8 . . . . . . . 8  |-  ( ph  ->  ( A  +h  B
)  =  ( C  +h  D ) )
7 shel 26255 . . . . . . . . . 10  |-  ( ( H  e.  SH  /\  A  e.  H )  ->  A  e.  ~H )
81, 2, 7syl2anc 661 . . . . . . . . 9  |-  ( ph  ->  A  e.  ~H )
9 shuni.2 . . . . . . . . . 10  |-  ( ph  ->  K  e.  SH )
10 shuni.5 . . . . . . . . . 10  |-  ( ph  ->  B  e.  K )
11 shel 26255 . . . . . . . . . 10  |-  ( ( K  e.  SH  /\  B  e.  K )  ->  B  e.  ~H )
129, 10, 11syl2anc 661 . . . . . . . . 9  |-  ( ph  ->  B  e.  ~H )
13 shel 26255 . . . . . . . . . 10  |-  ( ( H  e.  SH  /\  C  e.  H )  ->  C  e.  ~H )
141, 3, 13syl2anc 661 . . . . . . . . 9  |-  ( ph  ->  C  e.  ~H )
15 shuni.7 . . . . . . . . . 10  |-  ( ph  ->  D  e.  K )
16 shel 26255 . . . . . . . . . 10  |-  ( ( K  e.  SH  /\  D  e.  K )  ->  D  e.  ~H )
179, 15, 16syl2anc 661 . . . . . . . . 9  |-  ( ph  ->  D  e.  ~H )
18 hvaddsub4 26122 . . . . . . . . 9  |-  ( ( ( A  e.  ~H  /\  B  e.  ~H )  /\  ( C  e.  ~H  /\  D  e.  ~H )
)  ->  ( ( A  +h  B )  =  ( C  +h  D
)  <->  ( A  -h  C )  =  ( D  -h  B ) ) )
198, 12, 14, 17, 18syl22anc 1229 . . . . . . . 8  |-  ( ph  ->  ( ( A  +h  B )  =  ( C  +h  D )  <-> 
( A  -h  C
)  =  ( D  -h  B ) ) )
206, 19mpbid 210 . . . . . . 7  |-  ( ph  ->  ( A  -h  C
)  =  ( D  -h  B ) )
21 shsubcl 26265 . . . . . . . 8  |-  ( ( K  e.  SH  /\  D  e.  K  /\  B  e.  K )  ->  ( D  -h  B
)  e.  K )
229, 15, 10, 21syl3anc 1228 . . . . . . 7  |-  ( ph  ->  ( D  -h  B
)  e.  K )
2320, 22eqeltrd 2545 . . . . . 6  |-  ( ph  ->  ( A  -h  C
)  e.  K )
245, 23elind 3684 . . . . 5  |-  ( ph  ->  ( A  -h  C
)  e.  ( H  i^i  K ) )
25 shuni.3 . . . . 5  |-  ( ph  ->  ( H  i^i  K
)  =  0H )
2624, 25eleqtrd 2547 . . . 4  |-  ( ph  ->  ( A  -h  C
)  e.  0H )
27 elch0 26299 . . . 4  |-  ( ( A  -h  C )  e.  0H  <->  ( A  -h  C )  =  0h )
2826, 27sylib 196 . . 3  |-  ( ph  ->  ( A  -h  C
)  =  0h )
29 hvsubeq0 26112 . . . 4  |-  ( ( A  e.  ~H  /\  C  e.  ~H )  ->  ( ( A  -h  C )  =  0h  <->  A  =  C ) )
308, 14, 29syl2anc 661 . . 3  |-  ( ph  ->  ( ( A  -h  C )  =  0h  <->  A  =  C ) )
3128, 30mpbid 210 . 2  |-  ( ph  ->  A  =  C )
3220, 28eqtr3d 2500 . . . 4  |-  ( ph  ->  ( D  -h  B
)  =  0h )
33 hvsubeq0 26112 . . . . 5  |-  ( ( D  e.  ~H  /\  B  e.  ~H )  ->  ( ( D  -h  B )  =  0h  <->  D  =  B ) )
3417, 12, 33syl2anc 661 . . . 4  |-  ( ph  ->  ( ( D  -h  B )  =  0h  <->  D  =  B ) )
3532, 34mpbid 210 . . 3  |-  ( ph  ->  D  =  B )
3635eqcomd 2465 . 2  |-  ( ph  ->  B  =  D )
3731, 36jca 532 1  |-  ( ph  ->  ( A  =  C  /\  B  =  D ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 184    /\ wa 369    = wceq 1395    e. wcel 1819    i^i cin 3470  (class class class)co 6296   ~Hchil 25963    +h cva 25964   0hc0v 25968    -h cmv 25969   SHcsh 25972   0Hc0h 25979
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1619  ax-4 1632  ax-5 1705  ax-6 1748  ax-7 1791  ax-8 1821  ax-9 1823  ax-10 1838  ax-11 1843  ax-12 1855  ax-13 2000  ax-ext 2435  ax-sep 4578  ax-nul 4586  ax-pow 4634  ax-pr 4695  ax-un 6591  ax-resscn 9566  ax-1cn 9567  ax-icn 9568  ax-addcl 9569  ax-addrcl 9570  ax-mulcl 9571  ax-mulrcl 9572  ax-mulcom 9573  ax-addass 9574  ax-mulass 9575  ax-distr 9576  ax-i2m1 9577  ax-1ne0 9578  ax-1rid 9579  ax-rnegex 9580  ax-rrecex 9581  ax-cnre 9582  ax-pre-lttri 9583  ax-pre-lttrn 9584  ax-pre-ltadd 9585  ax-pre-mulgt0 9586  ax-hilex 26043  ax-hfvadd 26044  ax-hvcom 26045  ax-hvass 26046  ax-hv0cl 26047  ax-hvaddid 26048  ax-hfvmul 26049  ax-hvmulid 26050  ax-hvmulass 26051  ax-hvdistr1 26052  ax-hvdistr2 26053  ax-hvmul0 26054
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3or 974  df-3an 975  df-tru 1398  df-ex 1614  df-nf 1618  df-sb 1741  df-eu 2287  df-mo 2288  df-clab 2443  df-cleq 2449  df-clel 2452  df-nfc 2607  df-ne 2654  df-nel 2655  df-ral 2812  df-rex 2813  df-reu 2814  df-rmo 2815  df-rab 2816  df-v 3111  df-sbc 3328  df-csb 3431  df-dif 3474  df-un 3476  df-in 3478  df-ss 3485  df-nul 3794  df-if 3945  df-pw 4017  df-sn 4033  df-pr 4035  df-op 4039  df-uni 4252  df-iun 4334  df-br 4457  df-opab 4516  df-mpt 4517  df-id 4804  df-po 4809  df-so 4810  df-xp 5014  df-rel 5015  df-cnv 5016  df-co 5017  df-dm 5018  df-rn 5019  df-res 5020  df-ima 5021  df-iota 5557  df-fun 5596  df-fn 5597  df-f 5598  df-f1 5599  df-fo 5600  df-f1o 5601  df-fv 5602  df-riota 6258  df-ov 6299  df-oprab 6300  df-mpt2 6301  df-er 7329  df-en 7536  df-dom 7537  df-sdom 7538  df-pnf 9647  df-mnf 9648  df-xr 9649  df-ltxr 9650  df-le 9651  df-sub 9826  df-neg 9827  df-div 10228  df-hvsub 26015  df-sh 26251  df-ch0 26298
This theorem is referenced by:  chocunii  26346  pjhthmo  26347  chscllem3  26684
  Copyright terms: Public domain W3C validator