Hilbert Space Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > HSE Home > Th. List > hvmulcan | Structured version Visualization version GIF version |
Description: Cancellation law for scalar multiplication. (Contributed by NM, 19-May-2005.) (New usage is discouraged.) |
Ref | Expression |
---|---|
hvmulcan | ⊢ (((𝐴 ∈ ℂ ∧ 𝐴 ≠ 0) ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((𝐴 ·ℎ 𝐵) = (𝐴 ·ℎ 𝐶) ↔ 𝐵 = 𝐶)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-ne 3017 | . . . . 5 ⊢ (𝐴 ≠ 0 ↔ ¬ 𝐴 = 0) | |
2 | biorf 933 | . . . . 5 ⊢ (¬ 𝐴 = 0 → ((𝐵 −ℎ 𝐶) = 0ℎ ↔ (𝐴 = 0 ∨ (𝐵 −ℎ 𝐶) = 0ℎ))) | |
3 | 1, 2 | sylbi 219 | . . . 4 ⊢ (𝐴 ≠ 0 → ((𝐵 −ℎ 𝐶) = 0ℎ ↔ (𝐴 = 0 ∨ (𝐵 −ℎ 𝐶) = 0ℎ))) |
4 | 3 | ad2antlr 725 | . . 3 ⊢ (((𝐴 ∈ ℂ ∧ 𝐴 ≠ 0) ∧ 𝐵 ∈ ℋ) → ((𝐵 −ℎ 𝐶) = 0ℎ ↔ (𝐴 = 0 ∨ (𝐵 −ℎ 𝐶) = 0ℎ))) |
5 | 4 | 3adant3 1128 | . 2 ⊢ (((𝐴 ∈ ℂ ∧ 𝐴 ≠ 0) ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((𝐵 −ℎ 𝐶) = 0ℎ ↔ (𝐴 = 0 ∨ (𝐵 −ℎ 𝐶) = 0ℎ))) |
6 | hvsubeq0 28844 | . . 3 ⊢ ((𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((𝐵 −ℎ 𝐶) = 0ℎ ↔ 𝐵 = 𝐶)) | |
7 | 6 | 3adant1 1126 | . 2 ⊢ (((𝐴 ∈ ℂ ∧ 𝐴 ≠ 0) ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((𝐵 −ℎ 𝐶) = 0ℎ ↔ 𝐵 = 𝐶)) |
8 | hvsubdistr1 28825 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (𝐴 ·ℎ (𝐵 −ℎ 𝐶)) = ((𝐴 ·ℎ 𝐵) −ℎ (𝐴 ·ℎ 𝐶))) | |
9 | 8 | eqeq1d 2823 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((𝐴 ·ℎ (𝐵 −ℎ 𝐶)) = 0ℎ ↔ ((𝐴 ·ℎ 𝐵) −ℎ (𝐴 ·ℎ 𝐶)) = 0ℎ)) |
10 | hvsubcl 28793 | . . . . . 6 ⊢ ((𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (𝐵 −ℎ 𝐶) ∈ ℋ) | |
11 | hvmul0or 28801 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ (𝐵 −ℎ 𝐶) ∈ ℋ) → ((𝐴 ·ℎ (𝐵 −ℎ 𝐶)) = 0ℎ ↔ (𝐴 = 0 ∨ (𝐵 −ℎ 𝐶) = 0ℎ))) | |
12 | 10, 11 | sylan2 594 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ (𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ)) → ((𝐴 ·ℎ (𝐵 −ℎ 𝐶)) = 0ℎ ↔ (𝐴 = 0 ∨ (𝐵 −ℎ 𝐶) = 0ℎ))) |
13 | 12 | 3impb 1111 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((𝐴 ·ℎ (𝐵 −ℎ 𝐶)) = 0ℎ ↔ (𝐴 = 0 ∨ (𝐵 −ℎ 𝐶) = 0ℎ))) |
14 | hvmulcl 28789 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℋ) → (𝐴 ·ℎ 𝐵) ∈ ℋ) | |
15 | 14 | 3adant3 1128 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (𝐴 ·ℎ 𝐵) ∈ ℋ) |
16 | hvmulcl 28789 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝐶 ∈ ℋ) → (𝐴 ·ℎ 𝐶) ∈ ℋ) | |
17 | 16 | 3adant2 1127 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (𝐴 ·ℎ 𝐶) ∈ ℋ) |
18 | hvsubeq0 28844 | . . . . 5 ⊢ (((𝐴 ·ℎ 𝐵) ∈ ℋ ∧ (𝐴 ·ℎ 𝐶) ∈ ℋ) → (((𝐴 ·ℎ 𝐵) −ℎ (𝐴 ·ℎ 𝐶)) = 0ℎ ↔ (𝐴 ·ℎ 𝐵) = (𝐴 ·ℎ 𝐶))) | |
19 | 15, 17, 18 | syl2anc 586 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (((𝐴 ·ℎ 𝐵) −ℎ (𝐴 ·ℎ 𝐶)) = 0ℎ ↔ (𝐴 ·ℎ 𝐵) = (𝐴 ·ℎ 𝐶))) |
20 | 9, 13, 19 | 3bitr3d 311 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((𝐴 = 0 ∨ (𝐵 −ℎ 𝐶) = 0ℎ) ↔ (𝐴 ·ℎ 𝐵) = (𝐴 ·ℎ 𝐶))) |
21 | 20 | 3adant1r 1173 | . 2 ⊢ (((𝐴 ∈ ℂ ∧ 𝐴 ≠ 0) ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((𝐴 = 0 ∨ (𝐵 −ℎ 𝐶) = 0ℎ) ↔ (𝐴 ·ℎ 𝐵) = (𝐴 ·ℎ 𝐶))) |
22 | 5, 7, 21 | 3bitr3rd 312 | 1 ⊢ (((𝐴 ∈ ℂ ∧ 𝐴 ≠ 0) ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((𝐴 ·ℎ 𝐵) = (𝐴 ·ℎ 𝐶) ↔ 𝐵 = 𝐶)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∧ wa 398 ∨ wo 843 ∧ w3a 1083 = wceq 1533 ∈ wcel 2110 ≠ wne 3016 (class class class)co 7155 ℂcc 10534 0cc0 10536 ℋchba 28695 ·ℎ csm 28697 0ℎc0v 28700 −ℎ cmv 28701 |
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 5202 ax-nul 5209 ax-pow 5265 ax-pr 5329 ax-un 7460 ax-resscn 10593 ax-1cn 10594 ax-icn 10595 ax-addcl 10596 ax-addrcl 10597 ax-mulcl 10598 ax-mulrcl 10599 ax-mulcom 10600 ax-addass 10601 ax-mulass 10602 ax-distr 10603 ax-i2m1 10604 ax-1ne0 10605 ax-1rid 10606 ax-rnegex 10607 ax-rrecex 10608 ax-cnre 10609 ax-pre-lttri 10610 ax-pre-lttrn 10611 ax-pre-ltadd 10612 ax-pre-mulgt0 10613 ax-hfvadd 28776 ax-hvcom 28777 ax-hvass 28778 ax-hv0cl 28779 ax-hvaddid 28780 ax-hfvmul 28781 ax-hvmulid 28782 ax-hvmulass 28783 ax-hvdistr1 28784 ax-hvdistr2 28785 ax-hvmul0 28786 |
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 4567 df-pr 4569 df-op 4573 df-uni 4838 df-iun 4920 df-br 5066 df-opab 5128 df-mpt 5146 df-id 5459 df-po 5473 df-so 5474 df-xp 5560 df-rel 5561 df-cnv 5562 df-co 5563 df-dm 5564 df-rn 5565 df-res 5566 df-ima 5567 df-iota 6313 df-fun 6356 df-fn 6357 df-f 6358 df-f1 6359 df-fo 6360 df-f1o 6361 df-fv 6362 df-riota 7113 df-ov 7158 df-oprab 7159 df-mpo 7160 df-er 8288 df-en 8509 df-dom 8510 df-sdom 8511 df-pnf 10676 df-mnf 10677 df-xr 10678 df-ltxr 10679 df-le 10680 df-sub 10871 df-neg 10872 df-div 11297 df-hvsub 28747 |
This theorem is referenced by: hvsubcan 28850 hvsubcan2 28851 |
Copyright terms: Public domain | W3C validator |