| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > lmodvaddsub4 | GIF version | ||
| Description: Vector addition/subtraction law. (Contributed by NM, 31-Mar-2014.) (Revised by Mario Carneiro, 19-Jun-2014.) |
| Ref | Expression |
|---|---|
| lmod4.v | ⊢ 𝑉 = (Base‘𝑊) |
| lmod4.p | ⊢ + = (+g‘𝑊) |
| lmodvaddsub4.m | ⊢ − = (-g‘𝑊) |
| Ref | Expression |
|---|---|
| lmodvaddsub4 | ⊢ ((𝑊 ∈ LMod ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) ∧ (𝐶 ∈ 𝑉 ∧ 𝐷 ∈ 𝑉)) → ((𝐴 + 𝐵) = (𝐶 + 𝐷) ↔ (𝐴 − 𝐶) = (𝐷 − 𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | lmodabl 14430 | . 2 ⊢ (𝑊 ∈ LMod → 𝑊 ∈ Abel) | |
| 2 | lmod4.v | . . 3 ⊢ 𝑉 = (Base‘𝑊) | |
| 3 | lmod4.p | . . 3 ⊢ + = (+g‘𝑊) | |
| 4 | lmodvaddsub4.m | . . 3 ⊢ − = (-g‘𝑊) | |
| 5 | 2, 3, 4 | abladdsub4 13981 | . 2 ⊢ ((𝑊 ∈ Abel ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) ∧ (𝐶 ∈ 𝑉 ∧ 𝐷 ∈ 𝑉)) → ((𝐴 + 𝐵) = (𝐶 + 𝐷) ↔ (𝐴 − 𝐶) = (𝐷 − 𝐵))) |
| 6 | 1, 5 | syl3an1 1307 | 1 ⊢ ((𝑊 ∈ LMod ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) ∧ (𝐶 ∈ 𝑉 ∧ 𝐷 ∈ 𝑉)) → ((𝐴 + 𝐵) = (𝐶 + 𝐷) ↔ (𝐴 − 𝐶) = (𝐷 − 𝐵))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∧ w3a 1005 = wceq 1398 ∈ wcel 2202 ‘cfv 5333 (class class class)co 6028 Basecbs 13162 +gcplusg 13240 -gcsg 13665 Abelcabl 13952 LModclmod 14383 |
| 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 2204 ax-14 2205 ax-ext 2213 ax-coll 4209 ax-sep 4212 ax-pow 4270 ax-pr 4305 ax-un 4536 ax-setind 4641 ax-cnex 8183 ax-resscn 8184 ax-1cn 8185 ax-1re 8186 ax-icn 8187 ax-addcl 8188 ax-addrcl 8189 ax-mulcl 8190 ax-addcom 8192 ax-addass 8194 ax-i2m1 8197 ax-0lt1 8198 ax-0id 8200 ax-rnegex 8201 ax-pre-ltirr 8204 ax-pre-ltadd 8208 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ne 2404 df-nel 2499 df-ral 2516 df-rex 2517 df-reu 2518 df-rmo 2519 df-rab 2520 df-v 2805 df-sbc 3033 df-csb 3129 df-dif 3203 df-un 3205 df-in 3207 df-ss 3214 df-nul 3497 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-uni 3899 df-int 3934 df-iun 3977 df-br 4094 df-opab 4156 df-mpt 4157 df-id 4396 df-xp 4737 df-rel 4738 df-cnv 4739 df-co 4740 df-dm 4741 df-rn 4742 df-res 4743 df-ima 4744 df-iota 5293 df-fun 5335 df-fn 5336 df-f 5337 df-f1 5338 df-fo 5339 df-f1o 5340 df-fv 5341 df-riota 5981 df-ov 6031 df-oprab 6032 df-mpo 6033 df-1st 6312 df-2nd 6313 df-pnf 8275 df-mnf 8276 df-ltxr 8278 df-inn 9203 df-2 9261 df-3 9262 df-4 9263 df-5 9264 df-6 9265 df-ndx 13165 df-slot 13166 df-base 13168 df-sets 13169 df-plusg 13253 df-mulr 13254 df-sca 13256 df-vsca 13257 df-0g 13421 df-mgm 13519 df-sgrp 13565 df-mnd 13580 df-grp 13666 df-minusg 13667 df-sbg 13668 df-cmn 13953 df-abl 13954 df-mgp 14015 df-ur 14054 df-ring 14092 df-lmod 14385 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |