| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ablpncan3 | Structured version Visualization version GIF version | ||
| Description: A cancellation law for Abelian groups. (Contributed by NM, 23-Mar-2015.) |
| Ref | Expression |
|---|---|
| ablsubadd.b | ⊢ 𝐵 = (Base‘𝐺) |
| ablsubadd.p | ⊢ + = (+g‘𝐺) |
| ablsubadd.m | ⊢ − = (-g‘𝐺) |
| Ref | Expression |
|---|---|
| ablpncan3 | ⊢ ((𝐺 ∈ Abel ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑋 + (𝑌 − 𝑋)) = 𝑌) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpl 488 | . . 3 ⊢ ((𝐺 ∈ Abel ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → 𝐺 ∈ Abel) | |
| 2 | simprl 783 | . . 3 ⊢ ((𝐺 ∈ Abel ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → 𝑋 ∈ 𝐵) | |
| 3 | ablgrp 19992 | . . . . 5 ⊢ (𝐺 ∈ Abel → 𝐺 ∈ Grp) | |
| 4 | 3 | adantr 486 | . . . 4 ⊢ ((𝐺 ∈ Abel ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → 𝐺 ∈ Grp) |
| 5 | simprr 785 | . . . 4 ⊢ ((𝐺 ∈ Abel ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → 𝑌 ∈ 𝐵) | |
| 6 | ablsubadd.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐺) | |
| 7 | ablsubadd.m | . . . . 5 ⊢ − = (-g‘𝐺) | |
| 8 | 6, 7 | grpsubcl 19223 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → (𝑌 − 𝑋) ∈ 𝐵) |
| 9 | 4, 5, 2, 8 | syl3anc 1398 | . . 3 ⊢ ((𝐺 ∈ Abel ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑌 − 𝑋) ∈ 𝐵) |
| 10 | ablsubadd.p | . . . 4 ⊢ + = (+g‘𝐺) | |
| 11 | 6, 10 | ablcom 20006 | . . 3 ⊢ ((𝐺 ∈ Abel ∧ 𝑋 ∈ 𝐵 ∧ (𝑌 − 𝑋) ∈ 𝐵) → (𝑋 + (𝑌 − 𝑋)) = ((𝑌 − 𝑋) + 𝑋)) |
| 12 | 1, 2, 9, 11 | syl3anc 1398 | . 2 ⊢ ((𝐺 ∈ Abel ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑋 + (𝑌 − 𝑋)) = ((𝑌 − 𝑋) + 𝑋)) |
| 13 | 6, 10, 7 | grpnpcan 19235 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → ((𝑌 − 𝑋) + 𝑋) = 𝑌) |
| 14 | 4, 5, 2, 13 | syl3anc 1398 | . 2 ⊢ ((𝐺 ∈ Abel ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → ((𝑌 − 𝑋) + 𝑋) = 𝑌) |
| 15 | 12, 14 | eqtrd 2796 | 1 ⊢ ((𝐺 ∈ Abel ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑋 + (𝑌 − 𝑋)) = 𝑌) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ‘cfv 6537 (class class class)co 7418 Basecbs 17380 +gcplusg 17421 Grpcgrp 19137 -gcsg 19139 Abelcabl 19988 |
| 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 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7749 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-fv 6545 df-riota 7375 df-ov 7421 df-oprab 7422 df-mpo 7423 df-1st 7999 df-2nd 8000 df-0g 17605 df-mgm 18809 df-sgrp 18901 df-mnd 18917 df-grp 19140 df-minusg 19141 df-sbg 19142 df-cmn 19989 df-abl 19990 |
| This theorem is used by: ablnnncan 20029 tsmsxplem2 24466 pjthlem2 25752 dflring2 34018 |
| Copyright terms: Public domain | W3C validator |