Hilbert Space Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > HSE Home > Th. List > hial2eq2 | Structured version Visualization version GIF version |
Description: Two vectors whose inner product is always equal are equal. (Contributed by NM, 28-Jan-2006.) (New usage is discouraged.) |
Ref | Expression |
---|---|
hial2eq2 | ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (∀𝑥 ∈ ℋ (𝑥 ·ih 𝐴) = (𝑥 ·ih 𝐵) ↔ 𝐴 = 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ax-his1 28853 | . . . . . 6 ⊢ ((𝐴 ∈ ℋ ∧ 𝑥 ∈ ℋ) → (𝐴 ·ih 𝑥) = (∗‘(𝑥 ·ih 𝐴))) | |
2 | ax-his1 28853 | . . . . . 6 ⊢ ((𝐵 ∈ ℋ ∧ 𝑥 ∈ ℋ) → (𝐵 ·ih 𝑥) = (∗‘(𝑥 ·ih 𝐵))) | |
3 | 1, 2 | eqeqan12d 2838 | . . . . 5 ⊢ (((𝐴 ∈ ℋ ∧ 𝑥 ∈ ℋ) ∧ (𝐵 ∈ ℋ ∧ 𝑥 ∈ ℋ)) → ((𝐴 ·ih 𝑥) = (𝐵 ·ih 𝑥) ↔ (∗‘(𝑥 ·ih 𝐴)) = (∗‘(𝑥 ·ih 𝐵)))) |
4 | hicl 28851 | . . . . . . 7 ⊢ ((𝑥 ∈ ℋ ∧ 𝐴 ∈ ℋ) → (𝑥 ·ih 𝐴) ∈ ℂ) | |
5 | 4 | ancoms 461 | . . . . . 6 ⊢ ((𝐴 ∈ ℋ ∧ 𝑥 ∈ ℋ) → (𝑥 ·ih 𝐴) ∈ ℂ) |
6 | hicl 28851 | . . . . . . 7 ⊢ ((𝑥 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (𝑥 ·ih 𝐵) ∈ ℂ) | |
7 | 6 | ancoms 461 | . . . . . 6 ⊢ ((𝐵 ∈ ℋ ∧ 𝑥 ∈ ℋ) → (𝑥 ·ih 𝐵) ∈ ℂ) |
8 | cj11 14515 | . . . . . 6 ⊢ (((𝑥 ·ih 𝐴) ∈ ℂ ∧ (𝑥 ·ih 𝐵) ∈ ℂ) → ((∗‘(𝑥 ·ih 𝐴)) = (∗‘(𝑥 ·ih 𝐵)) ↔ (𝑥 ·ih 𝐴) = (𝑥 ·ih 𝐵))) | |
9 | 5, 7, 8 | syl2an 597 | . . . . 5 ⊢ (((𝐴 ∈ ℋ ∧ 𝑥 ∈ ℋ) ∧ (𝐵 ∈ ℋ ∧ 𝑥 ∈ ℋ)) → ((∗‘(𝑥 ·ih 𝐴)) = (∗‘(𝑥 ·ih 𝐵)) ↔ (𝑥 ·ih 𝐴) = (𝑥 ·ih 𝐵))) |
10 | 3, 9 | bitr2d 282 | . . . 4 ⊢ (((𝐴 ∈ ℋ ∧ 𝑥 ∈ ℋ) ∧ (𝐵 ∈ ℋ ∧ 𝑥 ∈ ℋ)) → ((𝑥 ·ih 𝐴) = (𝑥 ·ih 𝐵) ↔ (𝐴 ·ih 𝑥) = (𝐵 ·ih 𝑥))) |
11 | 10 | anandirs 677 | . . 3 ⊢ (((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) ∧ 𝑥 ∈ ℋ) → ((𝑥 ·ih 𝐴) = (𝑥 ·ih 𝐵) ↔ (𝐴 ·ih 𝑥) = (𝐵 ·ih 𝑥))) |
12 | 11 | ralbidva 3196 | . 2 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (∀𝑥 ∈ ℋ (𝑥 ·ih 𝐴) = (𝑥 ·ih 𝐵) ↔ ∀𝑥 ∈ ℋ (𝐴 ·ih 𝑥) = (𝐵 ·ih 𝑥))) |
13 | hial2eq 28877 | . 2 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (∀𝑥 ∈ ℋ (𝐴 ·ih 𝑥) = (𝐵 ·ih 𝑥) ↔ 𝐴 = 𝐵)) | |
14 | 12, 13 | bitrd 281 | 1 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (∀𝑥 ∈ ℋ (𝑥 ·ih 𝐴) = (𝑥 ·ih 𝐵) ↔ 𝐴 = 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1533 ∈ wcel 2110 ∀wral 3138 ‘cfv 6349 (class class class)co 7150 ℂcc 10529 ∗ccj 14449 ℋchba 28690 ·ih csp 28693 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-sep 5195 ax-nul 5202 ax-pow 5258 ax-pr 5321 ax-un 7455 ax-resscn 10588 ax-1cn 10589 ax-icn 10590 ax-addcl 10591 ax-addrcl 10592 ax-mulcl 10593 ax-mulrcl 10594 ax-mulcom 10595 ax-addass 10596 ax-mulass 10597 ax-distr 10598 ax-i2m1 10599 ax-1ne0 10600 ax-1rid 10601 ax-rnegex 10602 ax-rrecex 10603 ax-cnre 10604 ax-pre-lttri 10605 ax-pre-lttrn 10606 ax-pre-ltadd 10607 ax-pre-mulgt0 10608 ax-hfvadd 28771 ax-hvcom 28772 ax-hvass 28773 ax-hv0cl 28774 ax-hvaddid 28775 ax-hfvmul 28776 ax-hvmulid 28777 ax-hvdistr2 28780 ax-hvmul0 28781 ax-hfi 28850 ax-his1 28853 ax-his2 28854 ax-his3 28855 ax-his4 28856 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 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-rmo 3146 df-rab 3147 df-v 3496 df-sbc 3772 df-csb 3883 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4561 df-pr 4563 df-op 4567 df-uni 4832 df-iun 4913 df-br 5059 df-opab 5121 df-mpt 5139 df-id 5454 df-po 5468 df-so 5469 df-xp 5555 df-rel 5556 df-cnv 5557 df-co 5558 df-dm 5559 df-rn 5560 df-res 5561 df-ima 5562 df-iota 6308 df-fun 6351 df-fn 6352 df-f 6353 df-f1 6354 df-fo 6355 df-f1o 6356 df-fv 6357 df-riota 7108 df-ov 7153 df-oprab 7154 df-mpo 7155 df-er 8283 df-en 8504 df-dom 8505 df-sdom 8506 df-pnf 10671 df-mnf 10672 df-xr 10673 df-ltxr 10674 df-le 10675 df-sub 10866 df-neg 10867 df-div 11292 df-2 11694 df-cj 14452 df-re 14453 df-im 14454 df-hvsub 28742 |
This theorem is referenced by: hoeq2 29602 adjvalval 29708 cnlnadjlem6 29843 adjlnop 29857 bra11 29879 |
Copyright terms: Public domain | W3C validator |