| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > ablpncan2 | GIF version | ||
| Description: Cancellation law for subtraction in an Abelian group. (Contributed by NM, 2-Oct-2014.) |
| Ref | Expression |
|---|---|
| ablsubadd.b | ⊢ 𝐵 = (Base‘𝐺) |
| ablsubadd.p | ⊢ + = (+g‘𝐺) |
| ablsubadd.m | ⊢ − = (-g‘𝐺) |
| Ref | Expression |
|---|---|
| ablpncan2 | ⊢ ((𝐺 ∈ Abel ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑋 + 𝑌) − 𝑋) = 𝑌) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simp1 1024 | . . 3 ⊢ ((𝐺 ∈ Abel ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝐺 ∈ Abel) | |
| 2 | simp2 1025 | . . 3 ⊢ ((𝐺 ∈ Abel ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑋 ∈ 𝐵) | |
| 3 | simp3 1026 | . . 3 ⊢ ((𝐺 ∈ Abel ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑌 ∈ 𝐵) | |
| 4 | ablsubadd.b | . . . 4 ⊢ 𝐵 = (Base‘𝐺) | |
| 5 | ablsubadd.p | . . . 4 ⊢ + = (+g‘𝐺) | |
| 6 | ablsubadd.m | . . . 4 ⊢ − = (-g‘𝐺) | |
| 7 | 4, 5, 6 | abladdsub 13963 | . . 3 ⊢ ((𝐺 ∈ Abel ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵)) → ((𝑋 + 𝑌) − 𝑋) = ((𝑋 − 𝑋) + 𝑌)) |
| 8 | 1, 2, 3, 2, 7 | syl13anc 1276 | . 2 ⊢ ((𝐺 ∈ Abel ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑋 + 𝑌) − 𝑋) = ((𝑋 − 𝑋) + 𝑌)) |
| 9 | ablgrp 13937 | . . . . 5 ⊢ (𝐺 ∈ Abel → 𝐺 ∈ Grp) | |
| 10 | 1, 9 | syl 14 | . . . 4 ⊢ ((𝐺 ∈ Abel ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝐺 ∈ Grp) |
| 11 | eqid 2231 | . . . . 5 ⊢ (0g‘𝐺) = (0g‘𝐺) | |
| 12 | 4, 11, 6 | grpsubid 13728 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋 − 𝑋) = (0g‘𝐺)) |
| 13 | 10, 2, 12 | syl2anc 411 | . . 3 ⊢ ((𝐺 ∈ Abel ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 − 𝑋) = (0g‘𝐺)) |
| 14 | 13 | oveq1d 6043 | . 2 ⊢ ((𝐺 ∈ Abel ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑋 − 𝑋) + 𝑌) = ((0g‘𝐺) + 𝑌)) |
| 15 | 4, 5, 11 | grplid 13675 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ 𝐵) → ((0g‘𝐺) + 𝑌) = 𝑌) |
| 16 | 10, 3, 15 | syl2anc 411 | . 2 ⊢ ((𝐺 ∈ Abel ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((0g‘𝐺) + 𝑌) = 𝑌) |
| 17 | 8, 14, 16 | 3eqtrd 2268 | 1 ⊢ ((𝐺 ∈ Abel ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑋 + 𝑌) − 𝑋) = 𝑌) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ w3a 1005 = wceq 1398 ∈ wcel 2202 ‘cfv 5333 (class class class)co 6028 Basecbs 13143 +gcplusg 13221 0gc0g 13400 Grpcgrp 13644 -gcsg 13646 Abelcabl 13933 |
| 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 8166 ax-resscn 8167 ax-1re 8169 ax-addrcl 8172 |
| 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-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-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-inn 9187 df-2 9245 df-ndx 13146 df-slot 13147 df-base 13149 df-plusg 13234 df-0g 13402 df-mgm 13500 df-sgrp 13546 df-mnd 13561 df-grp 13647 df-minusg 13648 df-sbg 13649 df-cmn 13934 df-abl 13935 |
| This theorem is referenced by: lssvancl1 14443 |
| Copyright terms: Public domain | W3C validator |