| Hilbert Space Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > HSE Home > Th. List > hvsubeq0 | Structured version Visualization version GIF version | ||
| Description: If the difference between two vectors is zero, they are equal. (Contributed by NM, 23-Oct-1999.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| hvsubeq0 | ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → ((𝐴 −ℎ 𝐵) = 0ℎ ↔ 𝐴 = 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | oveq1 7458 | . . . 4 ⊢ (𝐴 = if(𝐴 ∈ ℋ, 𝐴, 0ℎ) → (𝐴 −ℎ 𝐵) = (if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐵)) | |
| 2 | 1 | eqeq1d 2765 | . . 3 ⊢ (𝐴 = if(𝐴 ∈ ℋ, 𝐴, 0ℎ) → ((𝐴 −ℎ 𝐵) = 0ℎ ↔ (if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐵) = 0ℎ)) |
| 3 | eqeq1 2767 | . . 3 ⊢ (𝐴 = if(𝐴 ∈ ℋ, 𝐴, 0ℎ) → (𝐴 = 𝐵 ↔ if(𝐴 ∈ ℋ, 𝐴, 0ℎ) = 𝐵)) | |
| 4 | 2, 3 | bibi12d 348 | . 2 ⊢ (𝐴 = if(𝐴 ∈ ℋ, 𝐴, 0ℎ) → (((𝐴 −ℎ 𝐵) = 0ℎ ↔ 𝐴 = 𝐵) ↔ ((if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐵) = 0ℎ ↔ if(𝐴 ∈ ℋ, 𝐴, 0ℎ) = 𝐵))) |
| 5 | oveq2 7459 | . . . 4 ⊢ (𝐵 = if(𝐵 ∈ ℋ, 𝐵, 0ℎ) → (if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐵) = (if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ if(𝐵 ∈ ℋ, 𝐵, 0ℎ))) | |
| 6 | 5 | eqeq1d 2765 | . . 3 ⊢ (𝐵 = if(𝐵 ∈ ℋ, 𝐵, 0ℎ) → ((if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐵) = 0ℎ ↔ (if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ if(𝐵 ∈ ℋ, 𝐵, 0ℎ)) = 0ℎ)) |
| 7 | eqeq2 2775 | . . 3 ⊢ (𝐵 = if(𝐵 ∈ ℋ, 𝐵, 0ℎ) → (if(𝐴 ∈ ℋ, 𝐴, 0ℎ) = 𝐵 ↔ if(𝐴 ∈ ℋ, 𝐴, 0ℎ) = if(𝐵 ∈ ℋ, 𝐵, 0ℎ))) | |
| 8 | 6, 7 | bibi12d 348 | . 2 ⊢ (𝐵 = if(𝐵 ∈ ℋ, 𝐵, 0ℎ) → (((if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐵) = 0ℎ ↔ if(𝐴 ∈ ℋ, 𝐴, 0ℎ) = 𝐵) ↔ ((if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ if(𝐵 ∈ ℋ, 𝐵, 0ℎ)) = 0ℎ ↔ if(𝐴 ∈ ℋ, 𝐴, 0ℎ) = if(𝐵 ∈ ℋ, 𝐵, 0ℎ)))) |
| 9 | ifhvhv0 31681 | . . 3 ⊢ if(𝐴 ∈ ℋ, 𝐴, 0ℎ) ∈ ℋ | |
| 10 | ifhvhv0 31681 | . . 3 ⊢ if(𝐵 ∈ ℋ, 𝐵, 0ℎ) ∈ ℋ | |
| 11 | 9, 10 | hvsubeq0i 31722 | . 2 ⊢ ((if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ if(𝐵 ∈ ℋ, 𝐵, 0ℎ)) = 0ℎ ↔ if(𝐴 ∈ ℋ, 𝐴, 0ℎ) = if(𝐵 ∈ ℋ, 𝐵, 0ℎ)) |
| 12 | 4, 8, 11 | dedth2h 4545 | 1 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → ((𝐴 −ℎ 𝐵) = 0ℎ ↔ 𝐴 = 𝐵)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2147 ifcif 4485 (class class class)co 7451 ℋchba 31578 0ℎc0v 31583 −ℎ cmv 31584 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-hvcom 31660 ax-hvass 31661 ax-hv0cl 31662 ax-hvaddid 31663 ax-hfvmul 31664 ax-hvmulid 31665 ax-hvdistr2 31668 ax-hvmul0 31669 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-id 5553 df-po 5566 df-so 5567 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-er 8755 df-en 9012 df-dom 9013 df-sdom 9014 df-pnf 11384 df-mnf 11385 df-ltxr 11387 df-sub 11582 df-neg 11583 df-hvsub 31630 |
| This theorem is used by: hvaddeq0 31728 hvmulcan 31731 hvmulcan2 31732 hi2eq 31764 shuni 31959 unopf1o 32575 riesz4i 32722 hmopidmchi 32810 cdjreui 33091 |
| Copyright terms: Public domain | W3C validator |