Metamath Proof Explorer


Theorem pjhthmo

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.)

Ref Expression
Assertion pjhthmo ⊢ A ∈ S ℋ ∧ B ∈ S ℋ ∧ A ∩ B = 0 ℋ → ∃* x x ∈ A ∧ ∃ y ∈ B C = x + ℎ y

Proof

Step Hyp Ref Expression
1 an4 ⊢ x ∈ A ∧ z ∈ A ∧ ∃ y ∈ B C = x + ℎ y ∧ ∃ w ∈ B C = z + ℎ w ↔ x ∈ A ∧ ∃ y ∈ B C = x + ℎ y ∧ z ∈ A ∧ ∃ w ∈ B C = z + ℎ w
2 reeanv ⊢ ∃ y ∈ B ∃ w ∈ B C = x + ℎ y ∧ C = z + ℎ w ↔ ∃ y ∈ B C = x + ℎ y ∧ ∃ w ∈ B C = z + ℎ w
3 simpll1 ⊢ A ∈ S ℋ ∧ B ∈ S ℋ ∧ A ∩ B = 0 ℋ ∧ x ∈ A ∧ z ∈ A ∧ y ∈ B ∧ w ∈ B ∧ C = x + ℎ y ∧ C = z + ℎ w → A ∈ S ℋ
4 simpll2 ⊢ A ∈ S ℋ ∧ B ∈ S ℋ ∧ A ∩ B = 0 ℋ ∧ x ∈ A ∧ z ∈ A ∧ y ∈ B ∧ w ∈ B ∧ C = x + ℎ y ∧ C = z + ℎ w → B ∈ S ℋ
5 simpll3 ⊢ A ∈ S ℋ ∧ B ∈ S ℋ ∧ A ∩ B = 0 ℋ ∧ x ∈ A ∧ z ∈ A ∧ y ∈ B ∧ w ∈ B ∧ C = x + ℎ y ∧ C = z + ℎ w → A ∩ B = 0 ℋ
6 simplrl ⊢ A ∈ S ℋ ∧ B ∈ S ℋ ∧ A ∩ B = 0 ℋ ∧ x ∈ A ∧ z ∈ A ∧ y ∈ B ∧ w ∈ B ∧ C = x + ℎ y ∧ C = z + ℎ w → x ∈ A
7 simprll ⊢ A ∈ S ℋ ∧ B ∈ S ℋ ∧ A ∩ B = 0 ℋ ∧ x ∈ A ∧ z ∈ A ∧ y ∈ B ∧ w ∈ B ∧ C = x + ℎ y ∧ C = z + ℎ w → y ∈ B
8 simplrr ⊢ A ∈ S ℋ ∧ B ∈ S ℋ ∧ A ∩ B = 0 ℋ ∧ x ∈ A ∧ z ∈ A ∧ y ∈ B ∧ w ∈ B ∧ C = x + ℎ y ∧ C = z + ℎ w → z ∈ A
9 simprlr ⊢ A ∈ S ℋ ∧ B ∈ S ℋ ∧ A ∩ B = 0 ℋ ∧ x ∈ A ∧ z ∈ A ∧ y ∈ B ∧ w ∈ B ∧ C = x + ℎ y ∧ C = z + ℎ w → w ∈ B
10 simprrl ⊢ A ∈ S ℋ ∧ B ∈ S ℋ ∧ A ∩ B = 0 ℋ ∧ x ∈ A ∧ z ∈ A ∧ y ∈ B ∧ w ∈ B ∧ C = x + ℎ y ∧ C = z + ℎ w → C = x + ℎ y
11 simprrr ⊢ A ∈ S ℋ ∧ B ∈ S ℋ ∧ A ∩ B = 0 ℋ ∧ x ∈ A ∧ z ∈ A ∧ y ∈ B ∧ w ∈ B ∧ C = x + ℎ y ∧ C = z + ℎ w → C = z + ℎ w
12 10 11 eqtr3d ⊢ A ∈ S ℋ ∧ B ∈ S ℋ ∧ A ∩ B = 0 ℋ ∧ x ∈ A ∧ z ∈ A ∧ y ∈ B ∧ w ∈ B ∧ C = x + ℎ y ∧ C = z + ℎ w → x + ℎ y = z + ℎ w
13 3 4 5 6 7 8 9 12 shuni ⊢ A ∈ S ℋ ∧ B ∈ S ℋ ∧ A ∩ B = 0 ℋ ∧ x ∈ A ∧ z ∈ A ∧ y ∈ B ∧ w ∈ B ∧ C = x + ℎ y ∧ C = z + ℎ w → x = z ∧ y = w
14 13 simpld ⊢ A ∈ S ℋ ∧ B ∈ S ℋ ∧ A ∩ B = 0 ℋ ∧ x ∈ A ∧ z ∈ A ∧ y ∈ B ∧ w ∈ B ∧ C = x + ℎ y ∧ C = z + ℎ w → x = z
15 14 exp32 ⊢ A ∈ S ℋ ∧ B ∈ S ℋ ∧ A ∩ B = 0 ℋ ∧ x ∈ A ∧ z ∈ A → y ∈ B ∧ w ∈ B → C = x + ℎ y ∧ C = z + ℎ w → x = z
16 15 rexlimdvv ⊢ A ∈ S ℋ ∧ B ∈ S ℋ ∧ A ∩ B = 0 ℋ ∧ x ∈ A ∧ z ∈ A → ∃ y ∈ B ∃ w ∈ B C = x + ℎ y ∧ C = z + ℎ w → x = z
17 2 16 biimtrrid ⊢ A ∈ S ℋ ∧ B ∈ S ℋ ∧ A ∩ B = 0 ℋ ∧ x ∈ A ∧ z ∈ A → ∃ y ∈ B C = x + ℎ y ∧ ∃ w ∈ B C = z + ℎ w → x = z
18 17 expimpd ⊢ A ∈ S ℋ ∧ B ∈ S ℋ ∧ A ∩ B = 0 ℋ → x ∈ A ∧ z ∈ A ∧ ∃ y ∈ B C = x + ℎ y ∧ ∃ w ∈ B C = z + ℎ w → x = z
19 1 18 biimtrrid ⊢ A ∈ S ℋ ∧ B ∈ S ℋ ∧ A ∩ B = 0 ℋ → x ∈ A ∧ ∃ y ∈ B C = x + ℎ y ∧ z ∈ A ∧ ∃ w ∈ B C = z + ℎ w → x = z
20 19 alrimivv ⊢ A ∈ S ℋ ∧ B ∈ S ℋ ∧ A ∩ B = 0 ℋ → ∀ x ∀ z x ∈ A ∧ ∃ y ∈ B C = x + ℎ y ∧ z ∈ A ∧ ∃ w ∈ B C = z + ℎ w → x = z
21 eleq1w ⊢ x = z → x ∈ A ↔ z ∈ A
22 oveq1 ⊢ x = z → x + ℎ y = z + ℎ y
23 22 eqeq2d ⊢ x = z → C = x + ℎ y ↔ C = z + ℎ y
24 23 rexbidv ⊢ x = z → ∃ y ∈ B C = x + ℎ y ↔ ∃ y ∈ B C = z + ℎ y
25 oveq2 ⊢ y = w → z + ℎ y = z + ℎ w
26 25 eqeq2d ⊢ y = w → C = z + ℎ y ↔ C = z + ℎ w
27 26 cbvrexvw ⊢ ∃ y ∈ B C = z + ℎ y ↔ ∃ w ∈ B C = z + ℎ w
28 24 27 bitrdi ⊢ x = z → ∃ y ∈ B C = x + ℎ y ↔ ∃ w ∈ B C = z + ℎ w
29 21 28 anbi12d ⊢ x = z → x ∈ A ∧ ∃ y ∈ B C = x + ℎ y ↔ z ∈ A ∧ ∃ w ∈ B C = z + ℎ w
30 29 mo4 ⊢ ∃* x x ∈ A ∧ ∃ y ∈ B C = x + ℎ y ↔ ∀ x ∀ z x ∈ A ∧ ∃ y ∈ B C = x + ℎ y ∧ z ∈ A ∧ ∃ w ∈ B C = z + ℎ w → x = z
31 20 30 sylibr ⊢ A ∈ S ℋ ∧ B ∈ S ℋ ∧ A ∩ B = 0 ℋ → ∃* x x ∈ A ∧ ∃ y ∈ B C = x + ℎ y