| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ablinvadd | Structured version Visualization version GIF version | ||
| Description: The inverse of an Abelian group operation. (Contributed by NM, 31-Mar-2014.) |
| Ref | Expression |
|---|---|
| ablinvadd.b | ⊢ 𝐵 = (Base‘𝐺) |
| ablinvadd.p | ⊢ + = (+g‘𝐺) |
| ablinvadd.n | ⊢ 𝑁 = (invg‘𝐺) |
| Ref | Expression |
|---|---|
| ablinvadd | ⊢ ((𝐺 ∈ Abel ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑁‘(𝑋 + 𝑌)) = ((𝑁‘𝑋) + (𝑁‘𝑌))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ablgrp 19912 | . . 3 ⊢ (𝐺 ∈ Abel → 𝐺 ∈ Grp) | |
| 2 | ablinvadd.b | . . . 4 ⊢ 𝐵 = (Base‘𝐺) | |
| 3 | ablinvadd.p | . . . 4 ⊢ + = (+g‘𝐺) | |
| 4 | ablinvadd.n | . . . 4 ⊢ 𝑁 = (invg‘𝐺) | |
| 5 | 2, 3, 4 | grpinvadd 19141 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑁‘(𝑋 + 𝑌)) = ((𝑁‘𝑌) + (𝑁‘𝑋))) |
| 6 | 1, 5 | syl3an1 1181 | . 2 ⊢ ((𝐺 ∈ Abel ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑁‘(𝑋 + 𝑌)) = ((𝑁‘𝑌) + (𝑁‘𝑋))) |
| 7 | simp1 1154 | . . 3 ⊢ ((𝐺 ∈ Abel ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝐺 ∈ Abel) | |
| 8 | 1 | 3ad2ant1 1151 | . . . 4 ⊢ ((𝐺 ∈ Abel ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝐺 ∈ Grp) |
| 9 | simp2 1155 | . . . 4 ⊢ ((𝐺 ∈ Abel ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑋 ∈ 𝐵) | |
| 10 | 2, 4 | grpinvcl 19111 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑁‘𝑋) ∈ 𝐵) |
| 11 | 8, 9, 10 | syl2anc 596 | . . 3 ⊢ ((𝐺 ∈ Abel ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑁‘𝑋) ∈ 𝐵) |
| 12 | simp3 1156 | . . . 4 ⊢ ((𝐺 ∈ Abel ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑌 ∈ 𝐵) | |
| 13 | 2, 4 | grpinvcl 19111 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ 𝐵) → (𝑁‘𝑌) ∈ 𝐵) |
| 14 | 8, 12, 13 | syl2anc 596 | . . 3 ⊢ ((𝐺 ∈ Abel ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑁‘𝑌) ∈ 𝐵) |
| 15 | 2, 3 | ablcom 19926 | . . 3 ⊢ ((𝐺 ∈ Abel ∧ (𝑁‘𝑋) ∈ 𝐵 ∧ (𝑁‘𝑌) ∈ 𝐵) → ((𝑁‘𝑋) + (𝑁‘𝑌)) = ((𝑁‘𝑌) + (𝑁‘𝑋))) |
| 16 | 7, 11, 14, 15 | syl3anc 1398 | . 2 ⊢ ((𝐺 ∈ Abel ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑁‘𝑋) + (𝑁‘𝑌)) = ((𝑁‘𝑌) + (𝑁‘𝑋))) |
| 17 | 6, 16 | eqtr4d 2798 | 1 ⊢ ((𝐺 ∈ Abel ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑁‘(𝑋 + 𝑌)) = ((𝑁‘𝑋) + (𝑁‘𝑌))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 ‘cfv 6533 (class class class)co 7413 Basecbs 17301 +gcplusg 17342 Grpcgrp 19057 invgcminusg 19058 Abelcabl 19908 |
| 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 2732 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7736 |
| 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 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 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-br 5104 df-opab 5168 df-mpt 5187 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-fv 6541 df-riota 7370 df-ov 7416 df-0g 17526 df-mgm 18730 df-sgrp 18821 df-mnd 18837 df-grp 19060 df-minusg 19061 df-cmn 19909 df-abl 19910 |
| This theorem is used by: ablsub4 19937 mulgdi 19953 invghm 19960 lmodnegadd 21095 gsummulsubdishift2 33509 lflnegcl 39948 baerlem3lem1 42580 |
| Copyright terms: Public domain | W3C validator |