| Hilbert Space Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > HSE Home > Th. List > hvaddeq0 | Structured version Visualization version GIF version | ||
| Description: If the sum of two vectors is zero, one is the negative of the other. (Contributed by NM, 10-Jun-2006.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| hvaddeq0 | ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → ((𝐴 +ℎ 𝐵) = 0ℎ ↔ 𝐴 = (-1 ·ℎ 𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | hvaddsubval 31024 | . . 3 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (𝐴 +ℎ 𝐵) = (𝐴 −ℎ (-1 ·ℎ 𝐵))) | |
| 2 | 1 | eqeq1d 2735 | . 2 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → ((𝐴 +ℎ 𝐵) = 0ℎ ↔ (𝐴 −ℎ (-1 ·ℎ 𝐵)) = 0ℎ)) |
| 3 | neg1cn 12120 | . . . 4 ⊢ -1 ∈ ℂ | |
| 4 | hvmulcl 31004 | . . . 4 ⊢ ((-1 ∈ ℂ ∧ 𝐵 ∈ ℋ) → (-1 ·ℎ 𝐵) ∈ ℋ) | |
| 5 | 3, 4 | mpan 690 | . . 3 ⊢ (𝐵 ∈ ℋ → (-1 ·ℎ 𝐵) ∈ ℋ) |
| 6 | hvsubeq0 31059 | . . 3 ⊢ ((𝐴 ∈ ℋ ∧ (-1 ·ℎ 𝐵) ∈ ℋ) → ((𝐴 −ℎ (-1 ·ℎ 𝐵)) = 0ℎ ↔ 𝐴 = (-1 ·ℎ 𝐵))) | |
| 7 | 5, 6 | sylan2 593 | . 2 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → ((𝐴 −ℎ (-1 ·ℎ 𝐵)) = 0ℎ ↔ 𝐴 = (-1 ·ℎ 𝐵))) |
| 8 | 2, 7 | bitrd 279 | 1 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → ((𝐴 +ℎ 𝐵) = 0ℎ ↔ 𝐴 = (-1 ·ℎ 𝐵))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1541 ∈ wcel 2113 (class class class)co 7355 ℂcc 11014 1c1 11017 -cneg 11355 ℋchba 30910 +ℎ cva 30911 ·ℎ csm 30912 0ℎc0v 30915 −ℎ cmv 30916 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2705 ax-sep 5238 ax-nul 5248 ax-pow 5307 ax-pr 5374 ax-un 7677 ax-resscn 11073 ax-1cn 11074 ax-icn 11075 ax-addcl 11076 ax-addrcl 11077 ax-mulcl 11078 ax-mulrcl 11079 ax-mulcom 11080 ax-addass 11081 ax-mulass 11082 ax-distr 11083 ax-i2m1 11084 ax-1ne0 11085 ax-1rid 11086 ax-rnegex 11087 ax-rrecex 11088 ax-cnre 11089 ax-pre-lttri 11090 ax-pre-lttrn 11091 ax-pre-ltadd 11092 ax-hvcom 30992 ax-hvass 30993 ax-hv0cl 30994 ax-hvaddid 30995 ax-hfvmul 30996 ax-hvmulid 30997 ax-hvmulass 30998 ax-hvdistr2 31000 ax-hvmul0 31001 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2566 df-clab 2712 df-cleq 2725 df-clel 2808 df-nfc 2883 df-ne 2931 df-nel 3035 df-ral 3050 df-rex 3059 df-reu 3349 df-rab 3398 df-v 3440 df-sbc 3739 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4285 df-if 4477 df-pw 4553 df-sn 4578 df-pr 4580 df-op 4584 df-uni 4861 df-iun 4945 df-br 5096 df-opab 5158 df-mpt 5177 df-id 5516 df-po 5529 df-so 5530 df-xp 5627 df-rel 5628 df-cnv 5629 df-co 5630 df-dm 5631 df-rn 5632 df-res 5633 df-ima 5634 df-iota 6445 df-fun 6491 df-fn 6492 df-f 6493 df-f1 6494 df-fo 6495 df-f1o 6496 df-fv 6497 df-riota 7312 df-ov 7358 df-oprab 7359 df-mpo 7360 df-er 8631 df-en 8879 df-dom 8880 df-sdom 8881 df-pnf 11158 df-mnf 11159 df-ltxr 11161 df-sub 11356 df-neg 11357 df-hvsub 30962 |
| This theorem is referenced by: superpos 32345 |
| Copyright terms: Public domain | W3C validator |