| Hilbert Space Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > HSE Home > Th. List > hi2eq | Structured version Visualization version GIF version | ||
| Description: Lemma used to prove equality of vectors. (Contributed by NM, 16-Nov-1999.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| hi2eq | ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → ((𝐴 ·ih (𝐴 −ℎ 𝐵)) = (𝐵 ·ih (𝐴 −ℎ 𝐵)) ↔ 𝐴 = 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | hvsubcl 31552 | . . . . 5 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (𝐴 −ℎ 𝐵) ∈ ℋ) | |
| 2 | his2sub 31627 | . . . . 5 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ (𝐴 −ℎ 𝐵) ∈ ℋ) → ((𝐴 −ℎ 𝐵) ·ih (𝐴 −ℎ 𝐵)) = ((𝐴 ·ih (𝐴 −ℎ 𝐵)) − (𝐵 ·ih (𝐴 −ℎ 𝐵)))) | |
| 3 | 1, 2 | mpd3an3 1491 | . . . 4 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → ((𝐴 −ℎ 𝐵) ·ih (𝐴 −ℎ 𝐵)) = ((𝐴 ·ih (𝐴 −ℎ 𝐵)) − (𝐵 ·ih (𝐴 −ℎ 𝐵)))) |
| 4 | 3 | eqeq1d 2762 | . . 3 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (((𝐴 −ℎ 𝐵) ·ih (𝐴 −ℎ 𝐵)) = 0 ↔ ((𝐴 ·ih (𝐴 −ℎ 𝐵)) − (𝐵 ·ih (𝐴 −ℎ 𝐵))) = 0)) |
| 5 | his6 31634 | . . . 4 ⊢ ((𝐴 −ℎ 𝐵) ∈ ℋ → (((𝐴 −ℎ 𝐵) ·ih (𝐴 −ℎ 𝐵)) = 0 ↔ (𝐴 −ℎ 𝐵) = 0ℎ)) | |
| 6 | 1, 5 | syl 18 | . . 3 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (((𝐴 −ℎ 𝐵) ·ih (𝐴 −ℎ 𝐵)) = 0 ↔ (𝐴 −ℎ 𝐵) = 0ℎ)) |
| 7 | 4, 6 | bitr3d 284 | . 2 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (((𝐴 ·ih (𝐴 −ℎ 𝐵)) − (𝐵 ·ih (𝐴 −ℎ 𝐵))) = 0 ↔ (𝐴 −ℎ 𝐵) = 0ℎ)) |
| 8 | hicl 31615 | . . . 4 ⊢ ((𝐴 ∈ ℋ ∧ (𝐴 −ℎ 𝐵) ∈ ℋ) → (𝐴 ·ih (𝐴 −ℎ 𝐵)) ∈ ℂ) | |
| 9 | 1, 8 | syldan 603 | . . 3 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (𝐴 ·ih (𝐴 −ℎ 𝐵)) ∈ ℂ) |
| 10 | simpr 490 | . . . 4 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → 𝐵 ∈ ℋ) | |
| 11 | hicl 31615 | . . . 4 ⊢ ((𝐵 ∈ ℋ ∧ (𝐴 −ℎ 𝐵) ∈ ℋ) → (𝐵 ·ih (𝐴 −ℎ 𝐵)) ∈ ℂ) | |
| 12 | 10, 1, 11 | syl2anc 596 | . . 3 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (𝐵 ·ih (𝐴 −ℎ 𝐵)) ∈ ℂ) |
| 13 | 9, 12 | subeq0ad 11648 | . 2 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (((𝐴 ·ih (𝐴 −ℎ 𝐵)) − (𝐵 ·ih (𝐴 −ℎ 𝐵))) = 0 ↔ (𝐴 ·ih (𝐴 −ℎ 𝐵)) = (𝐵 ·ih (𝐴 −ℎ 𝐵)))) |
| 14 | hvsubeq0 31603 | . 2 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → ((𝐴 −ℎ 𝐵) = 0ℎ ↔ 𝐴 = 𝐵)) | |
| 15 | 7, 13, 14 | 3bitr3d 312 | 1 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → ((𝐴 ·ih (𝐴 −ℎ 𝐵)) = (𝐵 ·ih (𝐴 −ℎ 𝐵)) ↔ 𝐴 = 𝐵)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2145 (class class class)co 7408 ℂcc 11169 0cc0 11171 − cmin 11512 ℋchba 31454 ·ih csp 31457 0ℎc0v 31459 −ℎ cmv 31460 |
| 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 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7734 ax-resscn 11228 ax-1cn 11229 ax-icn 11230 ax-addcl 11231 ax-addrcl 11232 ax-mulcl 11233 ax-mulrcl 11234 ax-mulcom 11235 ax-addass 11236 ax-mulass 11237 ax-distr 11238 ax-i2m1 11239 ax-1ne0 11240 ax-1rid 11241 ax-rnegex 11242 ax-rrecex 11243 ax-cnre 11244 ax-pre-lttri 11245 ax-pre-lttrn 11246 ax-pre-ltadd 11247 ax-hfvadd 31535 ax-hvcom 31536 ax-hvass 31537 ax-hv0cl 31538 ax-hvaddid 31539 ax-hfvmul 31540 ax-hvmulid 31541 ax-hvdistr2 31544 ax-hvmul0 31545 ax-hfi 31614 ax-his2 31618 ax-his3 31619 ax-his4 31620 |
| 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 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5542 df-po 5555 df-so 5556 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-iota 6483 df-fun 6529 df-fn 6530 df-f 6531 df-f1 6532 df-fo 6533 df-f1o 6534 df-fv 6535 df-riota 7365 df-ov 7411 df-oprab 7412 df-mpo 7413 df-er 8695 df-en 8952 df-dom 8953 df-sdom 8954 df-pnf 11316 df-mnf 11317 df-ltxr 11319 df-sub 11514 df-neg 11515 df-hvsub 31506 |
| This theorem is used by: hial2eq 31641 |
| Copyright terms: Public domain | W3C validator |