Hilbert Space Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > HSE Home > Th. List > hisubcomi | Structured version Visualization version GIF version |
Description: Two vector subtractions simultaneously commute in an inner product. (Contributed by NM, 1-Jul-2005.) (New usage is discouraged.) |
Ref | Expression |
---|---|
hisubcom.1 | ⊢ 𝐴 ∈ ℋ |
hisubcom.2 | ⊢ 𝐵 ∈ ℋ |
hisubcom.3 | ⊢ 𝐶 ∈ ℋ |
hisubcom.4 | ⊢ 𝐷 ∈ ℋ |
Ref | Expression |
---|---|
hisubcomi | ⊢ ((𝐴 −ℎ 𝐵) ·ih (𝐶 −ℎ 𝐷)) = ((𝐵 −ℎ 𝐴) ·ih (𝐷 −ℎ 𝐶)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | hisubcom.2 | . . . 4 ⊢ 𝐵 ∈ ℋ | |
2 | hisubcom.1 | . . . 4 ⊢ 𝐴 ∈ ℋ | |
3 | 1, 2 | hvnegdii 28845 | . . 3 ⊢ (-1 ·ℎ (𝐵 −ℎ 𝐴)) = (𝐴 −ℎ 𝐵) |
4 | hisubcom.4 | . . . 4 ⊢ 𝐷 ∈ ℋ | |
5 | hisubcom.3 | . . . 4 ⊢ 𝐶 ∈ ℋ | |
6 | 4, 5 | hvnegdii 28845 | . . 3 ⊢ (-1 ·ℎ (𝐷 −ℎ 𝐶)) = (𝐶 −ℎ 𝐷) |
7 | 3, 6 | oveq12i 7147 | . 2 ⊢ ((-1 ·ℎ (𝐵 −ℎ 𝐴)) ·ih (-1 ·ℎ (𝐷 −ℎ 𝐶))) = ((𝐴 −ℎ 𝐵) ·ih (𝐶 −ℎ 𝐷)) |
8 | neg1cn 11739 | . . . 4 ⊢ -1 ∈ ℂ | |
9 | 1, 2 | hvsubcli 28804 | . . . 4 ⊢ (𝐵 −ℎ 𝐴) ∈ ℋ |
10 | 4, 5 | hvsubcli 28804 | . . . 4 ⊢ (𝐷 −ℎ 𝐶) ∈ ℋ |
11 | 8, 8, 9, 10 | his35i 28872 | . . 3 ⊢ ((-1 ·ℎ (𝐵 −ℎ 𝐴)) ·ih (-1 ·ℎ (𝐷 −ℎ 𝐶))) = ((-1 · (∗‘-1)) · ((𝐵 −ℎ 𝐴) ·ih (𝐷 −ℎ 𝐶))) |
12 | neg1rr 11740 | . . . . . . 7 ⊢ -1 ∈ ℝ | |
13 | cjre 14490 | . . . . . . 7 ⊢ (-1 ∈ ℝ → (∗‘-1) = -1) | |
14 | 12, 13 | ax-mp 5 | . . . . . 6 ⊢ (∗‘-1) = -1 |
15 | 14 | oveq2i 7146 | . . . . 5 ⊢ (-1 · (∗‘-1)) = (-1 · -1) |
16 | ax-1cn 10584 | . . . . . 6 ⊢ 1 ∈ ℂ | |
17 | 16, 16 | mul2negi 11077 | . . . . 5 ⊢ (-1 · -1) = (1 · 1) |
18 | 1t1e1 11787 | . . . . 5 ⊢ (1 · 1) = 1 | |
19 | 15, 17, 18 | 3eqtri 2825 | . . . 4 ⊢ (-1 · (∗‘-1)) = 1 |
20 | 19 | oveq1i 7145 | . . 3 ⊢ ((-1 · (∗‘-1)) · ((𝐵 −ℎ 𝐴) ·ih (𝐷 −ℎ 𝐶))) = (1 · ((𝐵 −ℎ 𝐴) ·ih (𝐷 −ℎ 𝐶))) |
21 | 9, 10 | hicli 28864 | . . . 4 ⊢ ((𝐵 −ℎ 𝐴) ·ih (𝐷 −ℎ 𝐶)) ∈ ℂ |
22 | 21 | mulid2i 10635 | . . 3 ⊢ (1 · ((𝐵 −ℎ 𝐴) ·ih (𝐷 −ℎ 𝐶))) = ((𝐵 −ℎ 𝐴) ·ih (𝐷 −ℎ 𝐶)) |
23 | 11, 20, 22 | 3eqtri 2825 | . 2 ⊢ ((-1 ·ℎ (𝐵 −ℎ 𝐴)) ·ih (-1 ·ℎ (𝐷 −ℎ 𝐶))) = ((𝐵 −ℎ 𝐴) ·ih (𝐷 −ℎ 𝐶)) |
24 | 7, 23 | eqtr3i 2823 | 1 ⊢ ((𝐴 −ℎ 𝐵) ·ih (𝐶 −ℎ 𝐷)) = ((𝐵 −ℎ 𝐴) ·ih (𝐷 −ℎ 𝐶)) |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1538 ∈ wcel 2111 ‘cfv 6324 (class class class)co 7135 ℝcr 10525 1c1 10527 · cmul 10531 -cneg 10860 ∗ccj 14447 ℋchba 28702 ·ℎ csm 28704 ·ih csp 28705 −ℎ cmv 28708 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 ax-pre-mulgt0 10603 ax-hfvadd 28783 ax-hvcom 28784 ax-hfvmul 28788 ax-hvmulid 28789 ax-hvmulass 28790 ax-hvdistr1 28791 ax-hfi 28862 ax-his1 28865 ax-his3 28867 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rmo 3114 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-id 5425 df-po 5438 df-so 5439 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-er 8272 df-en 8493 df-dom 8494 df-sdom 8495 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862 df-div 11287 df-2 11688 df-cj 14450 df-re 14451 df-im 14452 df-hvsub 28754 |
This theorem is referenced by: lnophmlem2 29800 |
Copyright terms: Public domain | W3C validator |