| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > lmodsubvs | GIF version | ||
| Description: Subtraction of a scalar product in terms of addition. (Contributed by NM, 9-Apr-2015.) |
| Ref | Expression |
|---|---|
| lmodsubvs.v | ⊢ 𝑉 = (Base‘𝑊) |
| lmodsubvs.p | ⊢ + = (+g‘𝑊) |
| lmodsubvs.m | ⊢ − = (-g‘𝑊) |
| lmodsubvs.t | ⊢ · = ( ·𝑠 ‘𝑊) |
| lmodsubvs.f | ⊢ 𝐹 = (Scalar‘𝑊) |
| lmodsubvs.k | ⊢ 𝐾 = (Base‘𝐹) |
| lmodsubvs.n | ⊢ 𝑁 = (invg‘𝐹) |
| lmodsubvs.w | ⊢ (𝜑 → 𝑊 ∈ LMod) |
| lmodsubvs.a | ⊢ (𝜑 → 𝐴 ∈ 𝐾) |
| lmodsubvs.x | ⊢ (𝜑 → 𝑋 ∈ 𝑉) |
| lmodsubvs.y | ⊢ (𝜑 → 𝑌 ∈ 𝑉) |
| Ref | Expression |
|---|---|
| lmodsubvs | ⊢ (𝜑 → (𝑋 − (𝐴 · 𝑌)) = (𝑋 + ((𝑁‘𝐴) · 𝑌))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | lmodsubvs.w | . . 3 ⊢ (𝜑 → 𝑊 ∈ LMod) | |
| 2 | lmodsubvs.x | . . 3 ⊢ (𝜑 → 𝑋 ∈ 𝑉) | |
| 3 | lmodsubvs.a | . . . 4 ⊢ (𝜑 → 𝐴 ∈ 𝐾) | |
| 4 | lmodsubvs.y | . . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝑉) | |
| 5 | lmodsubvs.v | . . . . 5 ⊢ 𝑉 = (Base‘𝑊) | |
| 6 | lmodsubvs.f | . . . . 5 ⊢ 𝐹 = (Scalar‘𝑊) | |
| 7 | lmodsubvs.t | . . . . 5 ⊢ · = ( ·𝑠 ‘𝑊) | |
| 8 | lmodsubvs.k | . . . . 5 ⊢ 𝐾 = (Base‘𝐹) | |
| 9 | 5, 6, 7, 8 | lmodvscl 14445 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝐴 ∈ 𝐾 ∧ 𝑌 ∈ 𝑉) → (𝐴 · 𝑌) ∈ 𝑉) |
| 10 | 1, 3, 4, 9 | syl3anc 1274 | . . 3 ⊢ (𝜑 → (𝐴 · 𝑌) ∈ 𝑉) |
| 11 | lmodsubvs.p | . . . 4 ⊢ + = (+g‘𝑊) | |
| 12 | lmodsubvs.m | . . . 4 ⊢ − = (-g‘𝑊) | |
| 13 | lmodsubvs.n | . . . 4 ⊢ 𝑁 = (invg‘𝐹) | |
| 14 | eqid 2232 | . . . 4 ⊢ (1r‘𝐹) = (1r‘𝐹) | |
| 15 | 5, 11, 12, 6, 7, 13, 14 | lmodvsubval2 14482 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉 ∧ (𝐴 · 𝑌) ∈ 𝑉) → (𝑋 − (𝐴 · 𝑌)) = (𝑋 + ((𝑁‘(1r‘𝐹)) · (𝐴 · 𝑌)))) |
| 16 | 1, 2, 10, 15 | syl3anc 1274 | . 2 ⊢ (𝜑 → (𝑋 − (𝐴 · 𝑌)) = (𝑋 + ((𝑁‘(1r‘𝐹)) · (𝐴 · 𝑌)))) |
| 17 | 6 | lmodring 14435 | . . . . . . . 8 ⊢ (𝑊 ∈ LMod → 𝐹 ∈ Ring) |
| 18 | 1, 17 | syl 14 | . . . . . . 7 ⊢ (𝜑 → 𝐹 ∈ Ring) |
| 19 | ringgrp 14137 | . . . . . . 7 ⊢ (𝐹 ∈ Ring → 𝐹 ∈ Grp) | |
| 20 | 18, 19 | syl 14 | . . . . . 6 ⊢ (𝜑 → 𝐹 ∈ Grp) |
| 21 | 8, 14 | ringidcl 14156 | . . . . . . 7 ⊢ (𝐹 ∈ Ring → (1r‘𝐹) ∈ 𝐾) |
| 22 | 18, 21 | syl 14 | . . . . . 6 ⊢ (𝜑 → (1r‘𝐹) ∈ 𝐾) |
| 23 | 8, 13 | grpinvcl 13753 | . . . . . 6 ⊢ ((𝐹 ∈ Grp ∧ (1r‘𝐹) ∈ 𝐾) → (𝑁‘(1r‘𝐹)) ∈ 𝐾) |
| 24 | 20, 22, 23 | syl2anc 411 | . . . . 5 ⊢ (𝜑 → (𝑁‘(1r‘𝐹)) ∈ 𝐾) |
| 25 | eqid 2232 | . . . . . 6 ⊢ (.r‘𝐹) = (.r‘𝐹) | |
| 26 | 5, 6, 7, 8, 25 | lmodvsass 14453 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ ((𝑁‘(1r‘𝐹)) ∈ 𝐾 ∧ 𝐴 ∈ 𝐾 ∧ 𝑌 ∈ 𝑉)) → (((𝑁‘(1r‘𝐹))(.r‘𝐹)𝐴) · 𝑌) = ((𝑁‘(1r‘𝐹)) · (𝐴 · 𝑌))) |
| 27 | 1, 24, 3, 4, 26 | syl13anc 1276 | . . . 4 ⊢ (𝜑 → (((𝑁‘(1r‘𝐹))(.r‘𝐹)𝐴) · 𝑌) = ((𝑁‘(1r‘𝐹)) · (𝐴 · 𝑌))) |
| 28 | 8, 25, 14, 13, 18, 3 | ringnegl 14187 | . . . . 5 ⊢ (𝜑 → ((𝑁‘(1r‘𝐹))(.r‘𝐹)𝐴) = (𝑁‘𝐴)) |
| 29 | 28 | oveq1d 6064 | . . . 4 ⊢ (𝜑 → (((𝑁‘(1r‘𝐹))(.r‘𝐹)𝐴) · 𝑌) = ((𝑁‘𝐴) · 𝑌)) |
| 30 | 27, 29 | eqtr3d 2267 | . . 3 ⊢ (𝜑 → ((𝑁‘(1r‘𝐹)) · (𝐴 · 𝑌)) = ((𝑁‘𝐴) · 𝑌)) |
| 31 | 30 | oveq2d 6065 | . 2 ⊢ (𝜑 → (𝑋 + ((𝑁‘(1r‘𝐹)) · (𝐴 · 𝑌))) = (𝑋 + ((𝑁‘𝐴) · 𝑌))) |
| 32 | 16, 31 | eqtrd 2265 | 1 ⊢ (𝜑 → (𝑋 − (𝐴 · 𝑌)) = (𝑋 + ((𝑁‘𝐴) · 𝑌))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1398 ∈ wcel 2203 ‘cfv 5351 (class class class)co 6049 Basecbs 13204 +gcplusg 13282 .rcmulr 13283 Scalarcsca 13285 ·𝑠 cvsca 13286 Grpcgrp 13705 invgcminusg 13706 -gcsg 13707 1rcur 14095 Ringcrg 14132 LModclmod 14427 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2205 ax-14 2206 ax-ext 2214 ax-coll 4224 ax-sep 4227 ax-pow 4286 ax-pr 4321 ax-un 4553 ax-setind 4658 ax-cnex 8217 ax-resscn 8218 ax-1cn 8219 ax-1re 8220 ax-icn 8221 ax-addcl 8222 ax-addrcl 8223 ax-mulcl 8224 ax-addcom 8226 ax-addass 8228 ax-i2m1 8231 ax-0lt1 8232 ax-0id 8234 ax-rnegex 8235 ax-pre-ltirr 8238 ax-pre-ltadd 8242 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2083 df-mo 2084 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-ne 2413 df-nel 2508 df-ral 2525 df-rex 2526 df-reu 2527 df-rmo 2528 df-rab 2529 df-v 2814 df-sbc 3042 df-csb 3138 df-dif 3212 df-un 3214 df-in 3216 df-ss 3223 df-nul 3508 df-pw 3670 df-sn 3694 df-pr 3695 df-op 3697 df-uni 3914 df-int 3949 df-iun 3992 df-br 4109 df-opab 4171 df-mpt 4172 df-id 4413 df-xp 4754 df-rel 4755 df-cnv 4756 df-co 4757 df-dm 4758 df-rn 4759 df-res 4760 df-ima 4761 df-iota 5311 df-fun 5353 df-fn 5354 df-f 5355 df-f1 5356 df-fo 5357 df-f1o 5358 df-fv 5359 df-riota 6002 df-ov 6052 df-oprab 6053 df-mpo 6054 df-1st 6333 df-2nd 6334 df-pnf 8309 df-mnf 8310 df-ltxr 8312 df-inn 9237 df-2 9295 df-3 9296 df-4 9297 df-5 9298 df-6 9299 df-ndx 13207 df-slot 13208 df-base 13210 df-sets 13211 df-plusg 13295 df-mulr 13296 df-sca 13298 df-vsca 13299 df-0g 13463 df-mgm 13561 df-sgrp 13607 df-mnd 13622 df-grp 13708 df-minusg 13709 df-sbg 13710 df-mgp 14057 df-ur 14096 df-ring 14134 df-lmod 14429 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |