| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > lvecvscan | Structured version Visualization version GIF version | ||
| Description: Cancellation law for scalar multiplication. (hvmulcan 31471 analog.) (Contributed by NM, 2-Jul-2014.) |
| Ref | Expression |
|---|---|
| lvecmulcan.v | ⊢ 𝑉 = (Base‘𝑊) |
| lvecmulcan.s | ⊢ · = ( ·𝑠 ‘𝑊) |
| lvecmulcan.f | ⊢ 𝐹 = (Scalar‘𝑊) |
| lvecmulcan.k | ⊢ 𝐾 = (Base‘𝐹) |
| lvecmulcan.o | ⊢ 0 = (0g‘𝐹) |
| lvecmulcan.w | ⊢ (𝜑 → 𝑊 ∈ LVec) |
| lvecmulcan.a | ⊢ (𝜑 → 𝐴 ∈ 𝐾) |
| lvecmulcan.x | ⊢ (𝜑 → 𝑋 ∈ 𝑉) |
| lvecmulcan.y | ⊢ (𝜑 → 𝑌 ∈ 𝑉) |
| lvecmulcan.n | ⊢ (𝜑 → 𝐴 ≠ 0 ) |
| Ref | Expression |
|---|---|
| lvecvscan | ⊢ (𝜑 → ((𝐴 · 𝑋) = (𝐴 · 𝑌) ↔ 𝑋 = 𝑌)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | lvecmulcan.n | . . 3 ⊢ (𝜑 → 𝐴 ≠ 0 ) | |
| 2 | df-ne 2961 | . . . 4 ⊢ (𝐴 ≠ 0 ↔ ¬ 𝐴 = 0 ) | |
| 3 | biorf 950 | . . . 4 ⊢ (¬ 𝐴 = 0 → ((𝑋(-g‘𝑊)𝑌) = (0g‘𝑊) ↔ (𝐴 = 0 ∨ (𝑋(-g‘𝑊)𝑌) = (0g‘𝑊)))) | |
| 4 | 2, 3 | sylbi 220 | . . 3 ⊢ (𝐴 ≠ 0 → ((𝑋(-g‘𝑊)𝑌) = (0g‘𝑊) ↔ (𝐴 = 0 ∨ (𝑋(-g‘𝑊)𝑌) = (0g‘𝑊)))) |
| 5 | 1, 4 | syl 18 | . 2 ⊢ (𝜑 → ((𝑋(-g‘𝑊)𝑌) = (0g‘𝑊) ↔ (𝐴 = 0 ∨ (𝑋(-g‘𝑊)𝑌) = (0g‘𝑊)))) |
| 6 | lvecmulcan.w | . . . 4 ⊢ (𝜑 → 𝑊 ∈ LVec) | |
| 7 | lveclmod 21257 | . . . 4 ⊢ (𝑊 ∈ LVec → 𝑊 ∈ LMod) | |
| 8 | 6, 7 | syl 18 | . . 3 ⊢ (𝜑 → 𝑊 ∈ LMod) |
| 9 | lvecmulcan.x | . . 3 ⊢ (𝜑 → 𝑋 ∈ 𝑉) | |
| 10 | lvecmulcan.y | . . 3 ⊢ (𝜑 → 𝑌 ∈ 𝑉) | |
| 11 | lvecmulcan.v | . . . 4 ⊢ 𝑉 = (Base‘𝑊) | |
| 12 | eqid 2765 | . . . 4 ⊢ (0g‘𝑊) = (0g‘𝑊) | |
| 13 | eqid 2765 | . . . 4 ⊢ (-g‘𝑊) = (-g‘𝑊) | |
| 14 | 11, 12, 13 | lmodsubeq0 21072 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → ((𝑋(-g‘𝑊)𝑌) = (0g‘𝑊) ↔ 𝑋 = 𝑌)) |
| 15 | 8, 9, 10, 14 | syl3anc 1398 | . 2 ⊢ (𝜑 → ((𝑋(-g‘𝑊)𝑌) = (0g‘𝑊) ↔ 𝑋 = 𝑌)) |
| 16 | lvecmulcan.s | . . . . 5 ⊢ · = ( ·𝑠 ‘𝑊) | |
| 17 | lvecmulcan.f | . . . . 5 ⊢ 𝐹 = (Scalar‘𝑊) | |
| 18 | lvecmulcan.k | . . . . 5 ⊢ 𝐾 = (Base‘𝐹) | |
| 19 | lvecmulcan.a | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ 𝐾) | |
| 20 | 11, 16, 17, 18, 13, 8, 19, 9, 10 | lmodsubdi 21070 | . . . 4 ⊢ (𝜑 → (𝐴 · (𝑋(-g‘𝑊)𝑌)) = ((𝐴 · 𝑋)(-g‘𝑊)(𝐴 · 𝑌))) |
| 21 | 20 | eqeq1d 2767 | . . 3 ⊢ (𝜑 → ((𝐴 · (𝑋(-g‘𝑊)𝑌)) = (0g‘𝑊) ↔ ((𝐴 · 𝑋)(-g‘𝑊)(𝐴 · 𝑌)) = (0g‘𝑊))) |
| 22 | lvecmulcan.o | . . . 4 ⊢ 0 = (0g‘𝐹) | |
| 23 | 11, 13 | lmodvsubcl 21058 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → (𝑋(-g‘𝑊)𝑌) ∈ 𝑉) |
| 24 | 8, 9, 10, 23 | syl3anc 1398 | . . . 4 ⊢ (𝜑 → (𝑋(-g‘𝑊)𝑌) ∈ 𝑉) |
| 25 | 11, 16, 17, 18, 22, 12, 6, 19, 24 | lvecvs0or 21262 | . . 3 ⊢ (𝜑 → ((𝐴 · (𝑋(-g‘𝑊)𝑌)) = (0g‘𝑊) ↔ (𝐴 = 0 ∨ (𝑋(-g‘𝑊)𝑌) = (0g‘𝑊)))) |
| 26 | 11, 17, 16, 18 | lmodvscl 21029 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝐴 ∈ 𝐾 ∧ 𝑋 ∈ 𝑉) → (𝐴 · 𝑋) ∈ 𝑉) |
| 27 | 8, 19, 9, 26 | syl3anc 1398 | . . . 4 ⊢ (𝜑 → (𝐴 · 𝑋) ∈ 𝑉) |
| 28 | 11, 17, 16, 18 | lmodvscl 21029 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝐴 ∈ 𝐾 ∧ 𝑌 ∈ 𝑉) → (𝐴 · 𝑌) ∈ 𝑉) |
| 29 | 8, 19, 10, 28 | syl3anc 1398 | . . . 4 ⊢ (𝜑 → (𝐴 · 𝑌) ∈ 𝑉) |
| 30 | 11, 12, 13 | lmodsubeq0 21072 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ (𝐴 · 𝑋) ∈ 𝑉 ∧ (𝐴 · 𝑌) ∈ 𝑉) → (((𝐴 · 𝑋)(-g‘𝑊)(𝐴 · 𝑌)) = (0g‘𝑊) ↔ (𝐴 · 𝑋) = (𝐴 · 𝑌))) |
| 31 | 8, 27, 29, 30 | syl3anc 1398 | . . 3 ⊢ (𝜑 → (((𝐴 · 𝑋)(-g‘𝑊)(𝐴 · 𝑌)) = (0g‘𝑊) ↔ (𝐴 · 𝑋) = (𝐴 · 𝑌))) |
| 32 | 21, 25, 31 | 3bitr3d 312 | . 2 ⊢ (𝜑 → ((𝐴 = 0 ∨ (𝑋(-g‘𝑊)𝑌) = (0g‘𝑊)) ↔ (𝐴 · 𝑋) = (𝐴 · 𝑌))) |
| 33 | 5, 15, 32 | 3bitr3rd 313 | 1 ⊢ (𝜑 → ((𝐴 · 𝑋) = (𝐴 · 𝑌) ↔ 𝑋 = 𝑌)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∨ wo 861 = wceq 1570 ∈ wcel 2146 ≠ wne 2960 ‘cfv 6540 (class class class)co 7416 Basecbs 17287 Scalarcsca 17331 ·𝑠 cvsca 17332 0gc0g 17510 -gcsg 19026 LModclmod 21011 LVecclvec 21253 |
| 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-rep 5240 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7738 ax-cnex 11167 ax-resscn 11168 ax-1cn 11169 ax-icn 11170 ax-addcl 11171 ax-addrcl 11172 ax-mulcl 11173 ax-mulrcl 11174 ax-mulcom 11175 ax-addass 11176 ax-mulass 11177 ax-distr 11178 ax-i2m1 11179 ax-1ne0 11180 ax-1rid 11181 ax-rnegex 11182 ax-rrecex 11183 ax-cnre 11184 ax-pre-lttri 11185 ax-pre-lttrn 11186 ax-pre-ltadd 11187 ax-pre-mulgt0 11188 |
| 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-rmo 3371 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-pss 3926 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-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 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-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 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 7373 df-ov 7419 df-oprab 7420 df-mpo 7421 df-om 7865 df-1st 7988 df-2nd 7989 df-tpos 8224 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-rdg 8399 df-er 8696 df-en 8946 df-dom 8947 df-sdom 8948 df-pnf 11256 df-mnf 11257 df-xr 11258 df-ltxr 11259 df-le 11260 df-sub 11454 df-neg 11455 df-nn 12245 df-2 12314 df-3 12315 df-sets 17242 df-slot 17260 df-ndx 17272 df-base 17288 df-ress 17309 df-plusg 17341 df-mulr 17342 df-0g 17512 df-mgm 18716 df-sgrp 18799 df-mnd 18815 df-grp 19027 df-minusg 19028 df-sbg 19029 df-cmn 19876 df-abl 19877 df-mgp 20241 df-rng 20255 df-ur 20288 df-ring 20341 df-oppr 20445 df-dvdsr 20465 df-unit 20466 df-invr 20496 df-drng 20859 df-lmod 21013 df-lvec 21254 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |