| Hilbert Space Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > HSE Home > Th. List > hvsubaddi | Structured version Visualization version GIF version | ||
| Description: Relationship between vector subtraction and addition. (Contributed by NM, 11-Sep-1999.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| hvnegdi.1 | ⊢ 𝐴 ∈ ℋ |
| hvnegdi.2 | ⊢ 𝐵 ∈ ℋ |
| hvaddcan.3 | ⊢ 𝐶 ∈ ℋ |
| Ref | Expression |
|---|---|
| hvsubaddi | ⊢ ((𝐴 −ℎ 𝐵) = 𝐶 ↔ (𝐵 +ℎ 𝐶) = 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | hvnegdi.1 | . . . 4 ⊢ 𝐴 ∈ ℋ | |
| 2 | hvnegdi.2 | . . . 4 ⊢ 𝐵 ∈ ℋ | |
| 3 | 1, 2 | hvsubvali 31381 | . . 3 ⊢ (𝐴 −ℎ 𝐵) = (𝐴 +ℎ (-1 ·ℎ 𝐵)) |
| 4 | 3 | eqeq1i 2768 | . 2 ⊢ ((𝐴 −ℎ 𝐵) = 𝐶 ↔ (𝐴 +ℎ (-1 ·ℎ 𝐵)) = 𝐶) |
| 5 | neg1cn 12207 | . . . . . . 7 ⊢ -1 ∈ ℂ | |
| 6 | 5, 2 | hvmulcli 31375 | . . . . . 6 ⊢ (-1 ·ℎ 𝐵) ∈ ℋ |
| 7 | 2, 1, 6 | hvadd12i 31418 | . . . . 5 ⊢ (𝐵 +ℎ (𝐴 +ℎ (-1 ·ℎ 𝐵))) = (𝐴 +ℎ (𝐵 +ℎ (-1 ·ℎ 𝐵))) |
| 8 | 2 | hvnegidi 31391 | . . . . . 6 ⊢ (𝐵 +ℎ (-1 ·ℎ 𝐵)) = 0ℎ |
| 9 | 8 | oveq2i 7421 | . . . . 5 ⊢ (𝐴 +ℎ (𝐵 +ℎ (-1 ·ℎ 𝐵))) = (𝐴 +ℎ 0ℎ) |
| 10 | ax-hvaddid 31365 | . . . . . 6 ⊢ (𝐴 ∈ ℋ → (𝐴 +ℎ 0ℎ) = 𝐴) | |
| 11 | 1, 10 | ax-mp 5 | . . . . 5 ⊢ (𝐴 +ℎ 0ℎ) = 𝐴 |
| 12 | 7, 9, 11 | 3eqtri 2790 | . . . 4 ⊢ (𝐵 +ℎ (𝐴 +ℎ (-1 ·ℎ 𝐵))) = 𝐴 |
| 13 | 12 | eqeq1i 2768 | . . 3 ⊢ ((𝐵 +ℎ (𝐴 +ℎ (-1 ·ℎ 𝐵))) = (𝐵 +ℎ 𝐶) ↔ 𝐴 = (𝐵 +ℎ 𝐶)) |
| 14 | 1, 6 | hvaddcli 31379 | . . . 4 ⊢ (𝐴 +ℎ (-1 ·ℎ 𝐵)) ∈ ℋ |
| 15 | hvaddcan.3 | . . . 4 ⊢ 𝐶 ∈ ℋ | |
| 16 | 2, 14, 15 | hvaddcani 31426 | . . 3 ⊢ ((𝐵 +ℎ (𝐴 +ℎ (-1 ·ℎ 𝐵))) = (𝐵 +ℎ 𝐶) ↔ (𝐴 +ℎ (-1 ·ℎ 𝐵)) = 𝐶) |
| 17 | eqcom 2770 | . . 3 ⊢ (𝐴 = (𝐵 +ℎ 𝐶) ↔ (𝐵 +ℎ 𝐶) = 𝐴) | |
| 18 | 13, 16, 17 | 3bitr3i 304 | . 2 ⊢ ((𝐴 +ℎ (-1 ·ℎ 𝐵)) = 𝐶 ↔ (𝐵 +ℎ 𝐶) = 𝐴) |
| 19 | 4, 18 | bitri 278 | 1 ⊢ ((𝐴 −ℎ 𝐵) = 𝐶 ↔ (𝐵 +ℎ 𝐶) = 𝐴) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 = wceq 1570 ∈ wcel 2143 (class class class)co 7410 1c1 11105 -cneg 11446 ℋchba 31280 +ℎ cva 31281 ·ℎ csm 31282 0ℎc0v 31285 −ℎ cmv 31286 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 ax-un 7732 ax-resscn 11161 ax-1cn 11162 ax-icn 11163 ax-addcl 11164 ax-addrcl 11165 ax-mulcl 11166 ax-mulrcl 11167 ax-mulcom 11168 ax-addass 11169 ax-mulass 11170 ax-distr 11171 ax-i2m1 11172 ax-1ne0 11173 ax-1rid 11174 ax-rnegex 11175 ax-rrecex 11176 ax-cnre 11177 ax-pre-lttri 11178 ax-pre-lttrn 11179 ax-pre-ltadd 11180 ax-hfvadd 31361 ax-hvcom 31362 ax-hvass 31363 ax-hv0cl 31364 ax-hvaddid 31365 ax-hfvmul 31366 ax-hvmulid 31367 ax-hvdistr2 31370 ax-hvmul0 31371 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-iun 4958 df-br 5110 df-opab 5174 df-mpt 5193 df-id 5556 df-po 5569 df-so 5570 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-er 8690 df-en 8940 df-dom 8941 df-sdom 8942 df-pnf 11249 df-mnf 11250 df-ltxr 11252 df-sub 11447 df-neg 11448 df-hvsub 31332 |
| This theorem is used by: hvsubadd 31438 omlsilem 31763 |
| Copyright terms: Public domain | W3C validator |