| Hilbert Space Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > HSE Home > Th. List > hvsubcan2i | Structured version Visualization version GIF version | ||
| Description: Vector cancellation law. (Contributed by NM, 3-Sep-1999.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| hvnegdi.1 | ⊢ 𝐴 ∈ ℋ |
| hvnegdi.2 | ⊢ 𝐵 ∈ ℋ |
| Ref | Expression |
|---|---|
| hvsubcan2i | ⊢ ((𝐴 +ℎ 𝐵) +ℎ (𝐴 −ℎ 𝐵)) = (2 ·ℎ 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | hvnegdi.1 | . . . 4 ⊢ 𝐴 ∈ ℋ | |
| 2 | hvnegdi.2 | . . . 4 ⊢ 𝐵 ∈ ℋ | |
| 3 | 1, 2 | hvsubvali 31501 | . . 3 ⊢ (𝐴 −ℎ 𝐵) = (𝐴 +ℎ (-1 ·ℎ 𝐵)) |
| 4 | 3 | oveq2i 7424 | . 2 ⊢ ((𝐴 +ℎ 𝐵) +ℎ (𝐴 −ℎ 𝐵)) = ((𝐴 +ℎ 𝐵) +ℎ (𝐴 +ℎ (-1 ·ℎ 𝐵))) |
| 5 | neg1cn 12227 | . . . . . 6 ⊢ -1 ∈ ℂ | |
| 6 | 5, 2 | hvmulcli 31495 | . . . . 5 ⊢ (-1 ·ℎ 𝐵) ∈ ℋ |
| 7 | 1, 2, 1, 6 | hvadd4i 31539 | . . . 4 ⊢ ((𝐴 +ℎ 𝐵) +ℎ (𝐴 +ℎ (-1 ·ℎ 𝐵))) = ((𝐴 +ℎ 𝐴) +ℎ (𝐵 +ℎ (-1 ·ℎ 𝐵))) |
| 8 | hv2times 31542 | . . . . . . 7 ⊢ (𝐴 ∈ ℋ → (2 ·ℎ 𝐴) = (𝐴 +ℎ 𝐴)) | |
| 9 | 1, 8 | ax-mp 5 | . . . . . 6 ⊢ (2 ·ℎ 𝐴) = (𝐴 +ℎ 𝐴) |
| 10 | 9 | eqcomi 2769 | . . . . 5 ⊢ (𝐴 +ℎ 𝐴) = (2 ·ℎ 𝐴) |
| 11 | 2 | hvnegidi 31511 | . . . . 5 ⊢ (𝐵 +ℎ (-1 ·ℎ 𝐵)) = 0ℎ |
| 12 | 10, 11 | oveq12i 7425 | . . . 4 ⊢ ((𝐴 +ℎ 𝐴) +ℎ (𝐵 +ℎ (-1 ·ℎ 𝐵))) = ((2 ·ℎ 𝐴) +ℎ 0ℎ) |
| 13 | 7, 12 | eqtri 2783 | . . 3 ⊢ ((𝐴 +ℎ 𝐵) +ℎ (𝐴 +ℎ (-1 ·ℎ 𝐵))) = ((2 ·ℎ 𝐴) +ℎ 0ℎ) |
| 14 | 2cn 12340 | . . . . 5 ⊢ 2 ∈ ℂ | |
| 15 | 14, 1 | hvmulcli 31495 | . . . 4 ⊢ (2 ·ℎ 𝐴) ∈ ℋ |
| 16 | ax-hvaddid 31485 | . . . 4 ⊢ ((2 ·ℎ 𝐴) ∈ ℋ → ((2 ·ℎ 𝐴) +ℎ 0ℎ) = (2 ·ℎ 𝐴)) | |
| 17 | 15, 16 | ax-mp 5 | . . 3 ⊢ ((2 ·ℎ 𝐴) +ℎ 0ℎ) = (2 ·ℎ 𝐴) |
| 18 | 13, 17 | eqtri 2783 | . 2 ⊢ ((𝐴 +ℎ 𝐵) +ℎ (𝐴 +ℎ (-1 ·ℎ 𝐵))) = (2 ·ℎ 𝐴) |
| 19 | 4, 18 | eqtri 2783 | 1 ⊢ ((𝐴 +ℎ 𝐵) +ℎ (𝐴 −ℎ 𝐵)) = (2 ·ℎ 𝐴) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 ∈ wcel 2145 (class class class)co 7413 1c1 11125 -cneg 11466 2c2 12319 ℋchba 31400 +ℎ cva 31401 ·ℎ csm 31402 0ℎc0v 31405 −ℎ cmv 31406 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7736 ax-resscn 11181 ax-1cn 11182 ax-icn 11183 ax-addcl 11184 ax-addrcl 11185 ax-mulcl 11186 ax-mulrcl 11187 ax-mulcom 11188 ax-addass 11189 ax-mulass 11190 ax-distr 11191 ax-i2m1 11192 ax-1ne0 11193 ax-1rid 11194 ax-rnegex 11195 ax-rrecex 11196 ax-cnre 11197 ax-pre-lttri 11198 ax-pre-lttrn 11199 ax-pre-ltadd 11200 ax-hfvadd 31481 ax-hvcom 31482 ax-hvass 31483 ax-hvaddid 31485 ax-hfvmul 31486 ax-hvmulid 31487 ax-hvdistr1 31489 ax-hvdistr2 31490 ax-hvmul0 31491 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5550 df-po 5563 df-so 5564 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7370 df-ov 7416 df-oprab 7417 df-mpo 7418 df-er 8696 df-en 8953 df-dom 8954 df-sdom 8955 df-pnf 11269 df-mnf 11270 df-ltxr 11272 df-sub 11467 df-neg 11468 df-2 12327 df-hvsub 31452 |
| This theorem is used by: normpar2i 31637 |
| Copyright terms: Public domain | W3C validator |