| 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 7426 | . . . 4 ⊢ (𝐴 = if(𝐴 ∈ ℋ, 𝐴, 0ℎ) → (𝐴 −ℎ 𝐵) = (if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐵)) | |
| 2 | 1 | eqeq1d 2767 | . . 3 ⊢ (𝐴 = if(𝐴 ∈ ℋ, 𝐴, 0ℎ) → ((𝐴 −ℎ 𝐵) = 0ℎ ↔ (if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐵) = 0ℎ)) |
| 3 | eqeq1 2769 | . . 3 ⊢ (𝐴 = if(𝐴 ∈ ℋ, 𝐴, 0ℎ) → (𝐴 = 𝐵 ↔ if(𝐴 ∈ ℋ, 𝐴, 0ℎ) = 𝐵)) | |
| 4 | 2, 3 | bibi12d 348 | . 2 ⊢ (𝐴 = if(𝐴 ∈ ℋ, 𝐴, 0ℎ) → (((𝐴 −ℎ 𝐵) = 0ℎ ↔ 𝐴 = 𝐵) ↔ ((if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐵) = 0ℎ ↔ if(𝐴 ∈ ℋ, 𝐴, 0ℎ) = 𝐵))) |
| 5 | oveq2 7427 | . . . 4 ⊢ (𝐵 = if(𝐵 ∈ ℋ, 𝐵, 0ℎ) → (if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐵) = (if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ if(𝐵 ∈ ℋ, 𝐵, 0ℎ))) | |
| 6 | 5 | eqeq1d 2767 | . . 3 ⊢ (𝐵 = if(𝐵 ∈ ℋ, 𝐵, 0ℎ) → ((if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐵) = 0ℎ ↔ (if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ if(𝐵 ∈ ℋ, 𝐵, 0ℎ)) = 0ℎ)) |
| 7 | eqeq2 2777 | . . 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 31445 | . . 3 ⊢ if(𝐴 ∈ ℋ, 𝐴, 0ℎ) ∈ ℋ | |
| 10 | ifhvhv0 31445 | . . 3 ⊢ if(𝐵 ∈ ℋ, 𝐵, 0ℎ) ∈ ℋ | |
| 11 | 9, 10 | hvsubeq0i 31486 | . 2 ⊢ ((if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ if(𝐵 ∈ ℋ, 𝐵, 0ℎ)) = 0ℎ ↔ if(𝐴 ∈ ℋ, 𝐴, 0ℎ) = if(𝐵 ∈ ℋ, 𝐵, 0ℎ)) |
| 12 | 4, 8, 11 | dedth2h 4549 | 1 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → ((𝐴 −ℎ 𝐵) = 0ℎ ↔ 𝐴 = 𝐵)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2146 ifcif 4489 (class class class)co 7419 ℋchba 31342 0ℎc0v 31347 −ℎ cmv 31348 |
| 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 11172 ax-1cn 11173 ax-icn 11174 ax-addcl 11175 ax-addrcl 11176 ax-mulcl 11177 ax-mulrcl 11178 ax-mulcom 11179 ax-addass 11180 ax-mulass 11181 ax-distr 11182 ax-i2m1 11183 ax-1ne0 11184 ax-1rid 11185 ax-rnegex 11186 ax-rrecex 11187 ax-cnre 11188 ax-pre-lttri 11189 ax-pre-lttrn 11190 ax-pre-ltadd 11191 ax-hvcom 31424 ax-hvass 31425 ax-hv0cl 31426 ax-hvaddid 31427 ax-hfvmul 31428 ax-hvmulid 31429 ax-hvdistr2 31432 ax-hvmul0 31433 |
| 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 11260 df-mnf 11261 df-ltxr 11263 df-sub 11458 df-neg 11459 df-hvsub 31394 |
| This theorem is used by: hvaddeq0 31492 hvmulcan 31495 hvmulcan2 31496 hi2eq 31528 shuni 31723 unopf1o 32339 riesz4i 32486 hmopidmchi 32574 cdjreui 32855 |
| Copyright terms: Public domain | W3C validator |