| Hilbert Space Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > HSE Home > Th. List > hvsubeq0i | Structured version Visualization version GIF version | ||
| Description: If the difference between two vectors is zero, they are equal. (Contributed by NM, 18-Aug-1999.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| hvnegdi.1 | ⊢ 𝐴 ∈ ℋ |
| hvnegdi.2 | ⊢ 𝐵 ∈ ℋ |
| Ref | Expression |
|---|---|
| hvsubeq0i | ⊢ ((𝐴 −ℎ 𝐵) = 0ℎ ↔ 𝐴 = 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | hvnegdi.1 | . . . . . 6 ⊢ 𝐴 ∈ ℋ | |
| 2 | hvnegdi.2 | . . . . . 6 ⊢ 𝐵 ∈ ℋ | |
| 3 | 1, 2 | hvsubvali 31447 | . . . . 5 ⊢ (𝐴 −ℎ 𝐵) = (𝐴 +ℎ (-1 ·ℎ 𝐵)) |
| 4 | 3 | eqeq1i 2770 | . . . 4 ⊢ ((𝐴 −ℎ 𝐵) = 0ℎ ↔ (𝐴 +ℎ (-1 ·ℎ 𝐵)) = 0ℎ) |
| 5 | oveq1 7426 | . . . 4 ⊢ ((𝐴 +ℎ (-1 ·ℎ 𝐵)) = 0ℎ → ((𝐴 +ℎ (-1 ·ℎ 𝐵)) +ℎ 𝐵) = (0ℎ +ℎ 𝐵)) | |
| 6 | 4, 5 | sylbi 220 | . . 3 ⊢ ((𝐴 −ℎ 𝐵) = 0ℎ → ((𝐴 +ℎ (-1 ·ℎ 𝐵)) +ℎ 𝐵) = (0ℎ +ℎ 𝐵)) |
| 7 | neg1cn 12222 | . . . . . 6 ⊢ -1 ∈ ℂ | |
| 8 | 7, 2 | hvmulcli 31441 | . . . . 5 ⊢ (-1 ·ℎ 𝐵) ∈ ℋ |
| 9 | 1, 8, 2 | hvadd32i 31481 | . . . 4 ⊢ ((𝐴 +ℎ (-1 ·ℎ 𝐵)) +ℎ 𝐵) = ((𝐴 +ℎ 𝐵) +ℎ (-1 ·ℎ 𝐵)) |
| 10 | 1, 2, 8 | hvassi 31480 | . . . . 5 ⊢ ((𝐴 +ℎ 𝐵) +ℎ (-1 ·ℎ 𝐵)) = (𝐴 +ℎ (𝐵 +ℎ (-1 ·ℎ 𝐵))) |
| 11 | 2 | hvnegidi 31457 | . . . . . . 7 ⊢ (𝐵 +ℎ (-1 ·ℎ 𝐵)) = 0ℎ |
| 12 | 11 | oveq2i 7430 | . . . . . 6 ⊢ (𝐴 +ℎ (𝐵 +ℎ (-1 ·ℎ 𝐵))) = (𝐴 +ℎ 0ℎ) |
| 13 | ax-hvaddid 31431 | . . . . . . 7 ⊢ (𝐴 ∈ ℋ → (𝐴 +ℎ 0ℎ) = 𝐴) | |
| 14 | 1, 13 | ax-mp 5 | . . . . . 6 ⊢ (𝐴 +ℎ 0ℎ) = 𝐴 |
| 15 | 12, 14 | eqtri 2788 | . . . . 5 ⊢ (𝐴 +ℎ (𝐵 +ℎ (-1 ·ℎ 𝐵))) = 𝐴 |
| 16 | 10, 15 | eqtri 2788 | . . . 4 ⊢ ((𝐴 +ℎ 𝐵) +ℎ (-1 ·ℎ 𝐵)) = 𝐴 |
| 17 | 9, 16 | eqtri 2788 | . . 3 ⊢ ((𝐴 +ℎ (-1 ·ℎ 𝐵)) +ℎ 𝐵) = 𝐴 |
| 18 | 2 | hvaddlidi 31456 | . . 3 ⊢ (0ℎ +ℎ 𝐵) = 𝐵 |
| 19 | 6, 17, 18 | 3eqtr3g 2823 | . 2 ⊢ ((𝐴 −ℎ 𝐵) = 0ℎ → 𝐴 = 𝐵) |
| 20 | oveq1 7426 | . . 3 ⊢ (𝐴 = 𝐵 → (𝐴 −ℎ 𝐵) = (𝐵 −ℎ 𝐵)) | |
| 21 | hvsubid 31453 | . . . 4 ⊢ (𝐵 ∈ ℋ → (𝐵 −ℎ 𝐵) = 0ℎ) | |
| 22 | 2, 21 | ax-mp 5 | . . 3 ⊢ (𝐵 −ℎ 𝐵) = 0ℎ |
| 23 | 20, 22 | eqtrdi 2816 | . 2 ⊢ (𝐴 = 𝐵 → (𝐴 −ℎ 𝐵) = 0ℎ) |
| 24 | 19, 23 | impbii 212 | 1 ⊢ ((𝐴 −ℎ 𝐵) = 0ℎ ↔ 𝐴 = 𝐵) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 = wceq 1570 ∈ wcel 2146 (class class class)co 7419 1c1 11120 -cneg 11461 ℋchba 31346 +ℎ cva 31347 ·ℎ csm 31348 0ℎc0v 31351 −ℎ cmv 31352 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7742 ax-resscn 11176 ax-1cn 11177 ax-icn 11178 ax-addcl 11179 ax-addrcl 11180 ax-mulcl 11181 ax-mulrcl 11182 ax-mulcom 11183 ax-addass 11184 ax-mulass 11185 ax-distr 11186 ax-i2m1 11187 ax-1ne0 11188 ax-1rid 11189 ax-rnegex 11190 ax-rrecex 11191 ax-cnre 11192 ax-pre-lttri 11193 ax-pre-lttrn 11194 ax-pre-ltadd 11195 ax-hvcom 31428 ax-hvass 31429 ax-hv0cl 31430 ax-hvaddid 31431 ax-hfvmul 31432 ax-hvmulid 31433 ax-hvdistr2 31436 ax-hvmul0 31437 |
| 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 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3067 df-ral 3082 df-rex 3092 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-id 5558 df-po 5571 df-so 5572 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7376 df-ov 7422 df-oprab 7423 df-mpo 7424 df-er 8700 df-en 8950 df-dom 8951 df-sdom 8952 df-pnf 11264 df-mnf 11265 df-ltxr 11267 df-sub 11462 df-neg 11463 df-hvsub 31398 |
| This theorem is used by: hvsubeq0 31495 bcseqi 31547 normsub0i 31562 pjss2i 32107 |
| Copyright terms: Public domain | W3C validator |