| 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 31160 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 2934 | . . . 4 ⊢ (𝐴 ≠ 0 ↔ ¬ 𝐴 = 0 ) | |
| 3 | biorf 937 | . . . 4 ⊢ (¬ 𝐴 = 0 → ((𝑋(-g‘𝑊)𝑌) = (0g‘𝑊) ↔ (𝐴 = 0 ∨ (𝑋(-g‘𝑊)𝑌) = (0g‘𝑊)))) | |
| 4 | 2, 3 | sylbi 217 | . . 3 ⊢ (𝐴 ≠ 0 → ((𝑋(-g‘𝑊)𝑌) = (0g‘𝑊) ↔ (𝐴 = 0 ∨ (𝑋(-g‘𝑊)𝑌) = (0g‘𝑊)))) |
| 5 | 1, 4 | syl 17 | . 2 ⊢ (𝜑 → ((𝑋(-g‘𝑊)𝑌) = (0g‘𝑊) ↔ (𝐴 = 0 ∨ (𝑋(-g‘𝑊)𝑌) = (0g‘𝑊)))) |
| 6 | lvecmulcan.w | . . . 4 ⊢ (𝜑 → 𝑊 ∈ LVec) | |
| 7 | lveclmod 21070 | . . . 4 ⊢ (𝑊 ∈ LVec → 𝑊 ∈ LMod) | |
| 8 | 6, 7 | syl 17 | . . 3 ⊢ (𝜑 → 𝑊 ∈ LMod) |
| 9 | lvecmulcan.x | . . 3 ⊢ (𝜑 → 𝑋 ∈ 𝑉) | |
| 10 | lvecmulcan.y | . . 3 ⊢ (𝜑 → 𝑌 ∈ 𝑉) | |
| 11 | lvecmulcan.v | . . . 4 ⊢ 𝑉 = (Base‘𝑊) | |
| 12 | eqid 2737 | . . . 4 ⊢ (0g‘𝑊) = (0g‘𝑊) | |
| 13 | eqid 2737 | . . . 4 ⊢ (-g‘𝑊) = (-g‘𝑊) | |
| 14 | 11, 12, 13 | lmodsubeq0 20884 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → ((𝑋(-g‘𝑊)𝑌) = (0g‘𝑊) ↔ 𝑋 = 𝑌)) |
| 15 | 8, 9, 10, 14 | syl3anc 1374 | . 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 20882 | . . . 4 ⊢ (𝜑 → (𝐴 · (𝑋(-g‘𝑊)𝑌)) = ((𝐴 · 𝑋)(-g‘𝑊)(𝐴 · 𝑌))) |
| 21 | 20 | eqeq1d 2739 | . . 3 ⊢ (𝜑 → ((𝐴 · (𝑋(-g‘𝑊)𝑌)) = (0g‘𝑊) ↔ ((𝐴 · 𝑋)(-g‘𝑊)(𝐴 · 𝑌)) = (0g‘𝑊))) |
| 22 | lvecmulcan.o | . . . 4 ⊢ 0 = (0g‘𝐹) | |
| 23 | 11, 13 | lmodvsubcl 20870 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → (𝑋(-g‘𝑊)𝑌) ∈ 𝑉) |
| 24 | 8, 9, 10, 23 | syl3anc 1374 | . . . 4 ⊢ (𝜑 → (𝑋(-g‘𝑊)𝑌) ∈ 𝑉) |
| 25 | 11, 16, 17, 18, 22, 12, 6, 19, 24 | lvecvs0or 21075 | . . 3 ⊢ (𝜑 → ((𝐴 · (𝑋(-g‘𝑊)𝑌)) = (0g‘𝑊) ↔ (𝐴 = 0 ∨ (𝑋(-g‘𝑊)𝑌) = (0g‘𝑊)))) |
| 26 | 11, 17, 16, 18 | lmodvscl 20841 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝐴 ∈ 𝐾 ∧ 𝑋 ∈ 𝑉) → (𝐴 · 𝑋) ∈ 𝑉) |
| 27 | 8, 19, 9, 26 | syl3anc 1374 | . . . 4 ⊢ (𝜑 → (𝐴 · 𝑋) ∈ 𝑉) |
| 28 | 11, 17, 16, 18 | lmodvscl 20841 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝐴 ∈ 𝐾 ∧ 𝑌 ∈ 𝑉) → (𝐴 · 𝑌) ∈ 𝑉) |
| 29 | 8, 19, 10, 28 | syl3anc 1374 | . . . 4 ⊢ (𝜑 → (𝐴 · 𝑌) ∈ 𝑉) |
| 30 | 11, 12, 13 | lmodsubeq0 20884 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ (𝐴 · 𝑋) ∈ 𝑉 ∧ (𝐴 · 𝑌) ∈ 𝑉) → (((𝐴 · 𝑋)(-g‘𝑊)(𝐴 · 𝑌)) = (0g‘𝑊) ↔ (𝐴 · 𝑋) = (𝐴 · 𝑌))) |
| 31 | 8, 27, 29, 30 | syl3anc 1374 | . . 3 ⊢ (𝜑 → (((𝐴 · 𝑋)(-g‘𝑊)(𝐴 · 𝑌)) = (0g‘𝑊) ↔ (𝐴 · 𝑋) = (𝐴 · 𝑌))) |
| 32 | 21, 25, 31 | 3bitr3d 309 | . 2 ⊢ (𝜑 → ((𝐴 = 0 ∨ (𝑋(-g‘𝑊)𝑌) = (0g‘𝑊)) ↔ (𝐴 · 𝑋) = (𝐴 · 𝑌))) |
| 33 | 5, 15, 32 | 3bitr3rd 310 | 1 ⊢ (𝜑 → ((𝐴 · 𝑋) = (𝐴 · 𝑌) ↔ 𝑋 = 𝑌)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∨ wo 848 = wceq 1542 ∈ wcel 2114 ≠ wne 2933 ‘cfv 6500 (class class class)co 7368 Basecbs 17148 Scalarcsca 17192 ·𝑠 cvsca 17193 0gc0g 17371 -gcsg 18877 LModclmod 20823 LVecclvec 21066 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5226 ax-sep 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3352 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5527 df-eprel 5532 df-po 5540 df-so 5541 df-fr 5585 df-we 5587 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-pred 6267 df-ord 6328 df-on 6329 df-lim 6330 df-suc 6331 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-riota 7325 df-ov 7371 df-oprab 7372 df-mpo 7373 df-om 7819 df-1st 7943 df-2nd 7944 df-tpos 8178 df-frecs 8233 df-wrecs 8264 df-recs 8313 df-rdg 8351 df-er 8645 df-en 8896 df-dom 8897 df-sdom 8898 df-pnf 11180 df-mnf 11181 df-xr 11182 df-ltxr 11183 df-le 11184 df-sub 11378 df-neg 11379 df-nn 12158 df-2 12220 df-3 12221 df-sets 17103 df-slot 17121 df-ndx 17133 df-base 17149 df-ress 17170 df-plusg 17202 df-mulr 17203 df-0g 17373 df-mgm 18577 df-sgrp 18656 df-mnd 18672 df-grp 18878 df-minusg 18879 df-sbg 18880 df-cmn 19723 df-abl 19724 df-mgp 20088 df-rng 20100 df-ur 20129 df-ring 20182 df-oppr 20285 df-dvdsr 20305 df-unit 20306 df-invr 20336 df-drng 20676 df-lmod 20825 df-lvec 21067 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |