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 28778 | . . . . 5 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (𝐴 −ℎ 𝐵) ∈ ℋ) | |
2 | his2sub 28853 | . . . . 5 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ ∧ (𝐴 −ℎ 𝐵) ∈ ℋ) → ((𝐴 −ℎ 𝐵) ·ih (𝐴 −ℎ 𝐵)) = ((𝐴 ·ih (𝐴 −ℎ 𝐵)) − (𝐵 ·ih (𝐴 −ℎ 𝐵)))) | |
3 | 1, 2 | mpd3an3 1458 | . . . 4 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → ((𝐴 −ℎ 𝐵) ·ih (𝐴 −ℎ 𝐵)) = ((𝐴 ·ih (𝐴 −ℎ 𝐵)) − (𝐵 ·ih (𝐴 −ℎ 𝐵)))) |
4 | 3 | eqeq1d 2823 | . . 3 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (((𝐴 −ℎ 𝐵) ·ih (𝐴 −ℎ 𝐵)) = 0 ↔ ((𝐴 ·ih (𝐴 −ℎ 𝐵)) − (𝐵 ·ih (𝐴 −ℎ 𝐵))) = 0)) |
5 | his6 28860 | . . . 4 ⊢ ((𝐴 −ℎ 𝐵) ∈ ℋ → (((𝐴 −ℎ 𝐵) ·ih (𝐴 −ℎ 𝐵)) = 0 ↔ (𝐴 −ℎ 𝐵) = 0ℎ)) | |
6 | 1, 5 | syl 17 | . . 3 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (((𝐴 −ℎ 𝐵) ·ih (𝐴 −ℎ 𝐵)) = 0 ↔ (𝐴 −ℎ 𝐵) = 0ℎ)) |
7 | 4, 6 | bitr3d 283 | . 2 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (((𝐴 ·ih (𝐴 −ℎ 𝐵)) − (𝐵 ·ih (𝐴 −ℎ 𝐵))) = 0 ↔ (𝐴 −ℎ 𝐵) = 0ℎ)) |
8 | hicl 28841 | . . . 4 ⊢ ((𝐴 ∈ ℋ ∧ (𝐴 −ℎ 𝐵) ∈ ℋ) → (𝐴 ·ih (𝐴 −ℎ 𝐵)) ∈ ℂ) | |
9 | 1, 8 | syldan 593 | . . 3 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (𝐴 ·ih (𝐴 −ℎ 𝐵)) ∈ ℂ) |
10 | simpr 487 | . . . 4 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → 𝐵 ∈ ℋ) | |
11 | hicl 28841 | . . . 4 ⊢ ((𝐵 ∈ ℋ ∧ (𝐴 −ℎ 𝐵) ∈ ℋ) → (𝐵 ·ih (𝐴 −ℎ 𝐵)) ∈ ℂ) | |
12 | 10, 1, 11 | syl2anc 586 | . . 3 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (𝐵 ·ih (𝐴 −ℎ 𝐵)) ∈ ℂ) |
13 | 9, 12 | subeq0ad 10993 | . 2 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (((𝐴 ·ih (𝐴 −ℎ 𝐵)) − (𝐵 ·ih (𝐴 −ℎ 𝐵))) = 0 ↔ (𝐴 ·ih (𝐴 −ℎ 𝐵)) = (𝐵 ·ih (𝐴 −ℎ 𝐵)))) |
14 | hvsubeq0 28829 | . 2 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → ((𝐴 −ℎ 𝐵) = 0ℎ ↔ 𝐴 = 𝐵)) | |
15 | 7, 13, 14 | 3bitr3d 311 | 1 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → ((𝐴 ·ih (𝐴 −ℎ 𝐵)) = (𝐵 ·ih (𝐴 −ℎ 𝐵)) ↔ 𝐴 = 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1537 ∈ wcel 2114 (class class class)co 7142 ℂcc 10521 0cc0 10523 − cmin 10856 ℋchba 28680 ·ih csp 28683 0ℎc0v 28685 −ℎ cmv 28686 |
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 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-sep 5189 ax-nul 5196 ax-pow 5252 ax-pr 5316 ax-un 7447 ax-resscn 10580 ax-1cn 10581 ax-icn 10582 ax-addcl 10583 ax-addrcl 10584 ax-mulcl 10585 ax-mulrcl 10586 ax-mulcom 10587 ax-addass 10588 ax-mulass 10589 ax-distr 10590 ax-i2m1 10591 ax-1ne0 10592 ax-1rid 10593 ax-rnegex 10594 ax-rrecex 10595 ax-cnre 10596 ax-pre-lttri 10597 ax-pre-lttrn 10598 ax-pre-ltadd 10599 ax-hfvadd 28761 ax-hvcom 28762 ax-hvass 28763 ax-hv0cl 28764 ax-hvaddid 28765 ax-hfvmul 28766 ax-hvmulid 28767 ax-hvdistr2 28770 ax-hvmul0 28771 ax-hfi 28840 ax-his2 28844 ax-his3 28845 ax-his4 28846 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rab 3147 df-v 3488 df-sbc 3764 df-csb 3872 df-dif 3927 df-un 3929 df-in 3931 df-ss 3940 df-nul 4280 df-if 4454 df-pw 4527 df-sn 4554 df-pr 4556 df-op 4560 df-uni 4825 df-iun 4907 df-br 5053 df-opab 5115 df-mpt 5133 df-id 5446 df-po 5460 df-so 5461 df-xp 5547 df-rel 5548 df-cnv 5549 df-co 5550 df-dm 5551 df-rn 5552 df-res 5553 df-ima 5554 df-iota 6300 df-fun 6343 df-fn 6344 df-f 6345 df-f1 6346 df-fo 6347 df-f1o 6348 df-fv 6349 df-riota 7100 df-ov 7145 df-oprab 7146 df-mpo 7147 df-er 8275 df-en 8496 df-dom 8497 df-sdom 8498 df-pnf 10663 df-mnf 10664 df-ltxr 10666 df-sub 10858 df-neg 10859 df-hvsub 28732 |
This theorem is referenced by: hial2eq 28867 |
Copyright terms: Public domain | W3C validator |