![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > grpasscan2 | Structured version Visualization version GIF version |
Description: An associative cancellation law for groups. (Contributed by Paul Chapman, 17-Apr-2009.) (Revised by AV, 30-Aug-2021.) |
Ref | Expression |
---|---|
grplcan.b | ⊢ 𝐵 = (Base‘𝐺) |
grplcan.p | ⊢ + = (+g‘𝐺) |
grpasscan1.n | ⊢ 𝑁 = (invg‘𝐺) |
Ref | Expression |
---|---|
grpasscan2 | ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑋 + (𝑁‘𝑌)) + 𝑌) = 𝑋) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simp1 1130 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝐺 ∈ Grp) | |
2 | simp2 1131 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑋 ∈ 𝐵) | |
3 | grplcan.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐺) | |
4 | grpasscan1.n | . . . . 5 ⊢ 𝑁 = (invg‘𝐺) | |
5 | 3, 4 | grpinvcl 17676 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ 𝐵) → (𝑁‘𝑌) ∈ 𝐵) |
6 | 5 | 3adant2 1125 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑁‘𝑌) ∈ 𝐵) |
7 | simp3 1132 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑌 ∈ 𝐵) | |
8 | grplcan.p | . . . 4 ⊢ + = (+g‘𝐺) | |
9 | 3, 8 | grpass 17640 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ (𝑋 ∈ 𝐵 ∧ (𝑁‘𝑌) ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → ((𝑋 + (𝑁‘𝑌)) + 𝑌) = (𝑋 + ((𝑁‘𝑌) + 𝑌))) |
10 | 1, 2, 6, 7, 9 | syl13anc 1478 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑋 + (𝑁‘𝑌)) + 𝑌) = (𝑋 + ((𝑁‘𝑌) + 𝑌))) |
11 | eqid 2771 | . . . . 5 ⊢ (0g‘𝐺) = (0g‘𝐺) | |
12 | 3, 8, 11, 4 | grplinv 17677 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ 𝐵) → ((𝑁‘𝑌) + 𝑌) = (0g‘𝐺)) |
13 | 12 | 3adant2 1125 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑁‘𝑌) + 𝑌) = (0g‘𝐺)) |
14 | 13 | oveq2d 6810 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 + ((𝑁‘𝑌) + 𝑌)) = (𝑋 + (0g‘𝐺))) |
15 | 3, 8, 11 | grprid 17662 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋 + (0g‘𝐺)) = 𝑋) |
16 | 15 | 3adant3 1126 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 + (0g‘𝐺)) = 𝑋) |
17 | 10, 14, 16 | 3eqtrd 2809 | 1 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑋 + (𝑁‘𝑌)) + 𝑌) = 𝑋) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ w3a 1071 = wceq 1631 ∈ wcel 2145 ‘cfv 6032 (class class class)co 6794 Basecbs 16065 +gcplusg 16150 0gc0g 16309 Grpcgrp 17631 invgcminusg 17632 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1870 ax-4 1885 ax-5 1991 ax-6 2057 ax-7 2093 ax-8 2147 ax-9 2154 ax-10 2174 ax-11 2190 ax-12 2203 ax-13 2408 ax-ext 2751 ax-rep 4905 ax-sep 4916 ax-nul 4924 ax-pow 4975 ax-pr 5035 |
This theorem depends on definitions: df-bi 197 df-an 383 df-or 829 df-3an 1073 df-tru 1634 df-ex 1853 df-nf 1858 df-sb 2050 df-eu 2622 df-mo 2623 df-clab 2758 df-cleq 2764 df-clel 2767 df-nfc 2902 df-ne 2944 df-ral 3066 df-rex 3067 df-reu 3068 df-rmo 3069 df-rab 3070 df-v 3353 df-sbc 3589 df-csb 3684 df-dif 3727 df-un 3729 df-in 3731 df-ss 3738 df-nul 4065 df-if 4227 df-sn 4318 df-pr 4320 df-op 4324 df-uni 4576 df-iun 4657 df-br 4788 df-opab 4848 df-mpt 4865 df-id 5158 df-xp 5256 df-rel 5257 df-cnv 5258 df-co 5259 df-dm 5260 df-rn 5261 df-res 5262 df-ima 5263 df-iota 5995 df-fun 6034 df-fn 6035 df-f 6036 df-f1 6037 df-fo 6038 df-f1o 6039 df-fv 6040 df-riota 6755 df-ov 6797 df-0g 16311 df-mgm 17451 df-sgrp 17493 df-mnd 17504 df-grp 17634 df-minusg 17635 |
This theorem is referenced by: mulgaddcomlem 17772 |
Copyright terms: Public domain | W3C validator |