| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > ablinvadd | 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 13881 | . . 3 ⊢ (𝐺 ∈ Abel → 𝐺 ∈ Grp) | |
| 2 | ablinvadd.b | . . . 4 ⊢ 𝐵 = (Base‘𝐺) | |
| 3 | ablinvadd.p | . . . 4 ⊢ + = (+g‘𝐺) | |
| 4 | ablinvadd.n | . . . 4 ⊢ 𝑁 = (invg‘𝐺) | |
| 5 | 2, 3, 4 | grpinvadd 13666 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑁‘(𝑋 + 𝑌)) = ((𝑁‘𝑌) + (𝑁‘𝑋))) |
| 6 | 1, 5 | syl3an1 1306 | . 2 ⊢ ((𝐺 ∈ Abel ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑁‘(𝑋 + 𝑌)) = ((𝑁‘𝑌) + (𝑁‘𝑋))) |
| 7 | simp1 1023 | . . 3 ⊢ ((𝐺 ∈ Abel ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝐺 ∈ Abel) | |
| 8 | 1 | 3ad2ant1 1044 | . . . 4 ⊢ ((𝐺 ∈ Abel ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝐺 ∈ Grp) |
| 9 | simp2 1024 | . . . 4 ⊢ ((𝐺 ∈ Abel ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑋 ∈ 𝐵) | |
| 10 | 2, 4 | grpinvcl 13636 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑁‘𝑋) ∈ 𝐵) |
| 11 | 8, 9, 10 | syl2anc 411 | . . 3 ⊢ ((𝐺 ∈ Abel ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑁‘𝑋) ∈ 𝐵) |
| 12 | simp3 1025 | . . . 4 ⊢ ((𝐺 ∈ Abel ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑌 ∈ 𝐵) | |
| 13 | 2, 4 | grpinvcl 13636 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ 𝐵) → (𝑁‘𝑌) ∈ 𝐵) |
| 14 | 8, 12, 13 | syl2anc 411 | . . 3 ⊢ ((𝐺 ∈ Abel ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑁‘𝑌) ∈ 𝐵) |
| 15 | 2, 3 | ablcom 13895 | . . 3 ⊢ ((𝐺 ∈ Abel ∧ (𝑁‘𝑋) ∈ 𝐵 ∧ (𝑁‘𝑌) ∈ 𝐵) → ((𝑁‘𝑋) + (𝑁‘𝑌)) = ((𝑁‘𝑌) + (𝑁‘𝑋))) |
| 16 | 7, 11, 14, 15 | syl3anc 1273 | . 2 ⊢ ((𝐺 ∈ Abel ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑁‘𝑋) + (𝑁‘𝑌)) = ((𝑁‘𝑌) + (𝑁‘𝑋))) |
| 17 | 6, 16 | eqtr4d 2267 | 1 ⊢ ((𝐺 ∈ Abel ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑁‘(𝑋 + 𝑌)) = ((𝑁‘𝑋) + (𝑁‘𝑌))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ w3a 1004 = wceq 1397 ∈ wcel 2202 ‘cfv 5326 (class class class)co 6018 Basecbs 13087 +gcplusg 13165 Grpcgrp 13588 invgcminusg 13589 Abelcabl 13877 |
| 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-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-coll 4204 ax-sep 4207 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-cnex 8123 ax-resscn 8124 ax-1re 8126 ax-addrcl 8129 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ral 2515 df-rex 2516 df-reu 2517 df-rmo 2518 df-rab 2519 df-v 2804 df-sbc 3032 df-csb 3128 df-un 3204 df-in 3206 df-ss 3213 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-int 3929 df-iun 3972 df-br 4089 df-opab 4151 df-mpt 4152 df-id 4390 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-rn 4736 df-res 4737 df-ima 4738 df-iota 5286 df-fun 5328 df-fn 5329 df-f 5330 df-f1 5331 df-fo 5332 df-f1o 5333 df-fv 5334 df-riota 5971 df-ov 6021 df-inn 9144 df-2 9202 df-ndx 13090 df-slot 13091 df-base 13093 df-plusg 13178 df-0g 13346 df-mgm 13444 df-sgrp 13490 df-mnd 13505 df-grp 13591 df-minusg 13592 df-cmn 13878 df-abl 13879 |
| This theorem is referenced by: ablsub4 13905 invghm 13921 lmodnegadd 14356 |
| Copyright terms: Public domain | W3C validator |