HSE Home Hilbert Space Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  HSE Home  >  Th. List  >  pjhthmo Structured version   Visualization version   GIF version

Theorem pjhthmo 31246
Description: Projection Theorem, uniqueness part. Any two disjoint subspaces yield a unique decomposition of vectors into each subspace. (Contributed by Mario Carneiro, 15-May-2014.) (New usage is discouraged.)
Assertion
Ref Expression
pjhthmo ((𝐴S𝐵S ∧ (𝐴𝐵) = 0) → ∃*𝑥(𝑥𝐴 ∧ ∃𝑦𝐵 𝐶 = (𝑥 + 𝑦)))
Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵,𝑦   𝑥,𝐶,𝑦

Proof of Theorem pjhthmo
Dummy variables 𝑤 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 an4 656 . . . 4 (((𝑥𝐴𝑧𝐴) ∧ (∃𝑦𝐵 𝐶 = (𝑥 + 𝑦) ∧ ∃𝑤𝐵 𝐶 = (𝑧 + 𝑤))) ↔ ((𝑥𝐴 ∧ ∃𝑦𝐵 𝐶 = (𝑥 + 𝑦)) ∧ (𝑧𝐴 ∧ ∃𝑤𝐵 𝐶 = (𝑧 + 𝑤))))
2 reeanv 3201 . . . . . 6 (∃𝑦𝐵𝑤𝐵 (𝐶 = (𝑥 + 𝑦) ∧ 𝐶 = (𝑧 + 𝑤)) ↔ (∃𝑦𝐵 𝐶 = (𝑥 + 𝑦) ∧ ∃𝑤𝐵 𝐶 = (𝑧 + 𝑤)))
3 simpll1 1213 . . . . . . . . . 10 ((((𝐴S𝐵S ∧ (𝐴𝐵) = 0) ∧ (𝑥𝐴𝑧𝐴)) ∧ ((𝑦𝐵𝑤𝐵) ∧ (𝐶 = (𝑥 + 𝑦) ∧ 𝐶 = (𝑧 + 𝑤)))) → 𝐴S )
4 simpll2 1214 . . . . . . . . . 10 ((((𝐴S𝐵S ∧ (𝐴𝐵) = 0) ∧ (𝑥𝐴𝑧𝐴)) ∧ ((𝑦𝐵𝑤𝐵) ∧ (𝐶 = (𝑥 + 𝑦) ∧ 𝐶 = (𝑧 + 𝑤)))) → 𝐵S )
5 simpll3 1215 . . . . . . . . . 10 ((((𝐴S𝐵S ∧ (𝐴𝐵) = 0) ∧ (𝑥𝐴𝑧𝐴)) ∧ ((𝑦𝐵𝑤𝐵) ∧ (𝐶 = (𝑥 + 𝑦) ∧ 𝐶 = (𝑧 + 𝑤)))) → (𝐴𝐵) = 0)
6 simplrl 776 . . . . . . . . . 10 ((((𝐴S𝐵S ∧ (𝐴𝐵) = 0) ∧ (𝑥𝐴𝑧𝐴)) ∧ ((𝑦𝐵𝑤𝐵) ∧ (𝐶 = (𝑥 + 𝑦) ∧ 𝐶 = (𝑧 + 𝑤)))) → 𝑥𝐴)
7 simprll 778 . . . . . . . . . 10 ((((𝐴S𝐵S ∧ (𝐴𝐵) = 0) ∧ (𝑥𝐴𝑧𝐴)) ∧ ((𝑦𝐵𝑤𝐵) ∧ (𝐶 = (𝑥 + 𝑦) ∧ 𝐶 = (𝑧 + 𝑤)))) → 𝑦𝐵)
8 simplrr 777 . . . . . . . . . 10 ((((𝐴S𝐵S ∧ (𝐴𝐵) = 0) ∧ (𝑥𝐴𝑧𝐴)) ∧ ((𝑦𝐵𝑤𝐵) ∧ (𝐶 = (𝑥 + 𝑦) ∧ 𝐶 = (𝑧 + 𝑤)))) → 𝑧𝐴)
9 simprlr 779 . . . . . . . . . 10 ((((𝐴S𝐵S ∧ (𝐴𝐵) = 0) ∧ (𝑥𝐴𝑧𝐴)) ∧ ((𝑦𝐵𝑤𝐵) ∧ (𝐶 = (𝑥 + 𝑦) ∧ 𝐶 = (𝑧 + 𝑤)))) → 𝑤𝐵)
10 simprrl 780 . . . . . . . . . . 11 ((((𝐴S𝐵S ∧ (𝐴𝐵) = 0) ∧ (𝑥𝐴𝑧𝐴)) ∧ ((𝑦𝐵𝑤𝐵) ∧ (𝐶 = (𝑥 + 𝑦) ∧ 𝐶 = (𝑧 + 𝑤)))) → 𝐶 = (𝑥 + 𝑦))
11 simprrr 781 . . . . . . . . . . 11 ((((𝐴S𝐵S ∧ (𝐴𝐵) = 0) ∧ (𝑥𝐴𝑧𝐴)) ∧ ((𝑦𝐵𝑤𝐵) ∧ (𝐶 = (𝑥 + 𝑦) ∧ 𝐶 = (𝑧 + 𝑤)))) → 𝐶 = (𝑧 + 𝑤))
1210, 11eqtr3d 2766 . . . . . . . . . 10 ((((𝐴S𝐵S ∧ (𝐴𝐵) = 0) ∧ (𝑥𝐴𝑧𝐴)) ∧ ((𝑦𝐵𝑤𝐵) ∧ (𝐶 = (𝑥 + 𝑦) ∧ 𝐶 = (𝑧 + 𝑤)))) → (𝑥 + 𝑦) = (𝑧 + 𝑤))
133, 4, 5, 6, 7, 8, 9, 12shuni 31244 . . . . . . . . 9 ((((𝐴S𝐵S ∧ (𝐴𝐵) = 0) ∧ (𝑥𝐴𝑧𝐴)) ∧ ((𝑦𝐵𝑤𝐵) ∧ (𝐶 = (𝑥 + 𝑦) ∧ 𝐶 = (𝑧 + 𝑤)))) → (𝑥 = 𝑧𝑦 = 𝑤))
1413simpld 494 . . . . . . . 8 ((((𝐴S𝐵S ∧ (𝐴𝐵) = 0) ∧ (𝑥𝐴𝑧𝐴)) ∧ ((𝑦𝐵𝑤𝐵) ∧ (𝐶 = (𝑥 + 𝑦) ∧ 𝐶 = (𝑧 + 𝑤)))) → 𝑥 = 𝑧)
1514exp32 420 . . . . . . 7 (((𝐴S𝐵S ∧ (𝐴𝐵) = 0) ∧ (𝑥𝐴𝑧𝐴)) → ((𝑦𝐵𝑤𝐵) → ((𝐶 = (𝑥 + 𝑦) ∧ 𝐶 = (𝑧 + 𝑤)) → 𝑥 = 𝑧)))
1615rexlimdvv 3185 . . . . . 6 (((𝐴S𝐵S ∧ (𝐴𝐵) = 0) ∧ (𝑥𝐴𝑧𝐴)) → (∃𝑦𝐵𝑤𝐵 (𝐶 = (𝑥 + 𝑦) ∧ 𝐶 = (𝑧 + 𝑤)) → 𝑥 = 𝑧))
172, 16biimtrrid 243 . . . . 5 (((𝐴S𝐵S ∧ (𝐴𝐵) = 0) ∧ (𝑥𝐴𝑧𝐴)) → ((∃𝑦𝐵 𝐶 = (𝑥 + 𝑦) ∧ ∃𝑤𝐵 𝐶 = (𝑧 + 𝑤)) → 𝑥 = 𝑧))
1817expimpd 453 . . . 4 ((𝐴S𝐵S ∧ (𝐴𝐵) = 0) → (((𝑥𝐴𝑧𝐴) ∧ (∃𝑦𝐵 𝐶 = (𝑥 + 𝑦) ∧ ∃𝑤𝐵 𝐶 = (𝑧 + 𝑤))) → 𝑥 = 𝑧))
191, 18biimtrrid 243 . . 3 ((𝐴S𝐵S ∧ (𝐴𝐵) = 0) → (((𝑥𝐴 ∧ ∃𝑦𝐵 𝐶 = (𝑥 + 𝑦)) ∧ (𝑧𝐴 ∧ ∃𝑤𝐵 𝐶 = (𝑧 + 𝑤))) → 𝑥 = 𝑧))
2019alrimivv 1928 . 2 ((𝐴S𝐵S ∧ (𝐴𝐵) = 0) → ∀𝑥𝑧(((𝑥𝐴 ∧ ∃𝑦𝐵 𝐶 = (𝑥 + 𝑦)) ∧ (𝑧𝐴 ∧ ∃𝑤𝐵 𝐶 = (𝑧 + 𝑤))) → 𝑥 = 𝑧))
21 eleq1w 2811 . . . 4 (𝑥 = 𝑧 → (𝑥𝐴𝑧𝐴))
22 oveq1 7356 . . . . . . 7 (𝑥 = 𝑧 → (𝑥 + 𝑦) = (𝑧 + 𝑦))
2322eqeq2d 2740 . . . . . 6 (𝑥 = 𝑧 → (𝐶 = (𝑥 + 𝑦) ↔ 𝐶 = (𝑧 + 𝑦)))
2423rexbidv 3153 . . . . 5 (𝑥 = 𝑧 → (∃𝑦𝐵 𝐶 = (𝑥 + 𝑦) ↔ ∃𝑦𝐵 𝐶 = (𝑧 + 𝑦)))
25 oveq2 7357 . . . . . . 7 (𝑦 = 𝑤 → (𝑧 + 𝑦) = (𝑧 + 𝑤))
2625eqeq2d 2740 . . . . . 6 (𝑦 = 𝑤 → (𝐶 = (𝑧 + 𝑦) ↔ 𝐶 = (𝑧 + 𝑤)))
2726cbvrexvw 3208 . . . . 5 (∃𝑦𝐵 𝐶 = (𝑧 + 𝑦) ↔ ∃𝑤𝐵 𝐶 = (𝑧 + 𝑤))
2824, 27bitrdi 287 . . . 4 (𝑥 = 𝑧 → (∃𝑦𝐵 𝐶 = (𝑥 + 𝑦) ↔ ∃𝑤𝐵 𝐶 = (𝑧 + 𝑤)))
2921, 28anbi12d 632 . . 3 (𝑥 = 𝑧 → ((𝑥𝐴 ∧ ∃𝑦𝐵 𝐶 = (𝑥 + 𝑦)) ↔ (𝑧𝐴 ∧ ∃𝑤𝐵 𝐶 = (𝑧 + 𝑤))))
3029mo4 2559 . 2 (∃*𝑥(𝑥𝐴 ∧ ∃𝑦𝐵 𝐶 = (𝑥 + 𝑦)) ↔ ∀𝑥𝑧(((𝑥𝐴 ∧ ∃𝑦𝐵 𝐶 = (𝑥 + 𝑦)) ∧ (𝑧𝐴 ∧ ∃𝑤𝐵 𝐶 = (𝑧 + 𝑤))) → 𝑥 = 𝑧))
3120, 30sylibr 234 1 ((𝐴S𝐵S ∧ (𝐴𝐵) = 0) → ∃*𝑥(𝑥𝐴 ∧ ∃𝑦𝐵 𝐶 = (𝑥 + 𝑦)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1086  wal 1538   = wceq 1540  wcel 2109  ∃*wmo 2531  wrex 3053  cin 3902  (class class class)co 7349   + cva 30864   S csh 30872  0c0h 30879
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5235  ax-nul 5245  ax-pow 5304  ax-pr 5371  ax-un 7671  ax-resscn 11066  ax-1cn 11067  ax-icn 11068  ax-addcl 11069  ax-addrcl 11070  ax-mulcl 11071  ax-mulrcl 11072  ax-mulcom 11073  ax-addass 11074  ax-mulass 11075  ax-distr 11076  ax-i2m1 11077  ax-1ne0 11078  ax-1rid 11079  ax-rnegex 11080  ax-rrecex 11081  ax-cnre 11082  ax-pre-lttri 11083  ax-pre-lttrn 11084  ax-pre-ltadd 11085  ax-pre-mulgt0 11086  ax-hilex 30943  ax-hfvadd 30944  ax-hvcom 30945  ax-hvass 30946  ax-hv0cl 30947  ax-hvaddid 30948  ax-hfvmul 30949  ax-hvmulid 30950  ax-hvmulass 30951  ax-hvdistr1 30952  ax-hvdistr2 30953  ax-hvmul0 30954
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-nel 3030  df-ral 3045  df-rex 3054  df-rmo 3343  df-reu 3344  df-rab 3395  df-v 3438  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4285  df-if 4477  df-pw 4553  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4859  df-iun 4943  df-br 5093  df-opab 5155  df-mpt 5174  df-id 5514  df-po 5527  df-so 5528  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-rn 5630  df-res 5631  df-ima 5632  df-iota 6438  df-fun 6484  df-fn 6485  df-f 6486  df-f1 6487  df-fo 6488  df-f1o 6489  df-fv 6490  df-riota 7306  df-ov 7352  df-oprab 7353  df-mpo 7354  df-er 8625  df-en 8873  df-dom 8874  df-sdom 8875  df-pnf 11151  df-mnf 11152  df-xr 11153  df-ltxr 11154  df-le 11155  df-sub 11349  df-neg 11350  df-div 11778  df-hvsub 30915  df-sh 31151  df-ch0 31197
This theorem is referenced by:  pjhtheu  31338  pjpreeq  31342
  Copyright terms: Public domain W3C validator