Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ablsub2inv | Structured version Visualization version GIF version |
Description: Abelian group subtraction of two inverses. (Contributed by Stefan O'Rear, 24-May-2015.) |
Ref | Expression |
---|---|
ablsub2inv.b | ⊢ 𝐵 = (Base‘𝐺) |
ablsub2inv.m | ⊢ − = (-g‘𝐺) |
ablsub2inv.n | ⊢ 𝑁 = (invg‘𝐺) |
ablsub2inv.g | ⊢ (𝜑 → 𝐺 ∈ Abel) |
ablsub2inv.x | ⊢ (𝜑 → 𝑋 ∈ 𝐵) |
ablsub2inv.y | ⊢ (𝜑 → 𝑌 ∈ 𝐵) |
Ref | Expression |
---|---|
ablsub2inv | ⊢ (𝜑 → ((𝑁‘𝑋) − (𝑁‘𝑌)) = (𝑌 − 𝑋)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ablsub2inv.b | . . 3 ⊢ 𝐵 = (Base‘𝐺) | |
2 | eqid 2821 | . . 3 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
3 | ablsub2inv.m | . . 3 ⊢ − = (-g‘𝐺) | |
4 | ablsub2inv.n | . . 3 ⊢ 𝑁 = (invg‘𝐺) | |
5 | ablsub2inv.g | . . . 4 ⊢ (𝜑 → 𝐺 ∈ Abel) | |
6 | ablgrp 18911 | . . . 4 ⊢ (𝐺 ∈ Abel → 𝐺 ∈ Grp) | |
7 | 5, 6 | syl 17 | . . 3 ⊢ (𝜑 → 𝐺 ∈ Grp) |
8 | ablsub2inv.x | . . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
9 | 1, 4 | grpinvcl 18151 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑁‘𝑋) ∈ 𝐵) |
10 | 7, 8, 9 | syl2anc 586 | . . 3 ⊢ (𝜑 → (𝑁‘𝑋) ∈ 𝐵) |
11 | ablsub2inv.y | . . 3 ⊢ (𝜑 → 𝑌 ∈ 𝐵) | |
12 | 1, 2, 3, 4, 7, 10, 11 | grpsubinv 18172 | . 2 ⊢ (𝜑 → ((𝑁‘𝑋) − (𝑁‘𝑌)) = ((𝑁‘𝑋)(+g‘𝐺)𝑌)) |
13 | 1, 2 | ablcom 18924 | . . . . . 6 ⊢ ((𝐺 ∈ Abel ∧ (𝑁‘𝑋) ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑁‘𝑋)(+g‘𝐺)𝑌) = (𝑌(+g‘𝐺)(𝑁‘𝑋))) |
14 | 5, 10, 11, 13 | syl3anc 1367 | . . . . 5 ⊢ (𝜑 → ((𝑁‘𝑋)(+g‘𝐺)𝑌) = (𝑌(+g‘𝐺)(𝑁‘𝑋))) |
15 | 1, 4 | grpinvinv 18166 | . . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ 𝐵) → (𝑁‘(𝑁‘𝑌)) = 𝑌) |
16 | 7, 11, 15 | syl2anc 586 | . . . . . 6 ⊢ (𝜑 → (𝑁‘(𝑁‘𝑌)) = 𝑌) |
17 | 16 | oveq1d 7171 | . . . . 5 ⊢ (𝜑 → ((𝑁‘(𝑁‘𝑌))(+g‘𝐺)(𝑁‘𝑋)) = (𝑌(+g‘𝐺)(𝑁‘𝑋))) |
18 | 14, 17 | eqtr4d 2859 | . . . 4 ⊢ (𝜑 → ((𝑁‘𝑋)(+g‘𝐺)𝑌) = ((𝑁‘(𝑁‘𝑌))(+g‘𝐺)(𝑁‘𝑋))) |
19 | 1, 4 | grpinvcl 18151 | . . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ 𝐵) → (𝑁‘𝑌) ∈ 𝐵) |
20 | 7, 11, 19 | syl2anc 586 | . . . . 5 ⊢ (𝜑 → (𝑁‘𝑌) ∈ 𝐵) |
21 | 1, 2, 4 | grpinvadd 18177 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ (𝑁‘𝑌) ∈ 𝐵) → (𝑁‘(𝑋(+g‘𝐺)(𝑁‘𝑌))) = ((𝑁‘(𝑁‘𝑌))(+g‘𝐺)(𝑁‘𝑋))) |
22 | 7, 8, 20, 21 | syl3anc 1367 | . . . 4 ⊢ (𝜑 → (𝑁‘(𝑋(+g‘𝐺)(𝑁‘𝑌))) = ((𝑁‘(𝑁‘𝑌))(+g‘𝐺)(𝑁‘𝑋))) |
23 | 18, 22 | eqtr4d 2859 | . . 3 ⊢ (𝜑 → ((𝑁‘𝑋)(+g‘𝐺)𝑌) = (𝑁‘(𝑋(+g‘𝐺)(𝑁‘𝑌)))) |
24 | 1, 2, 4, 3 | grpsubval 18149 | . . . . 5 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 − 𝑌) = (𝑋(+g‘𝐺)(𝑁‘𝑌))) |
25 | 8, 11, 24 | syl2anc 586 | . . . 4 ⊢ (𝜑 → (𝑋 − 𝑌) = (𝑋(+g‘𝐺)(𝑁‘𝑌))) |
26 | 25 | fveq2d 6674 | . . 3 ⊢ (𝜑 → (𝑁‘(𝑋 − 𝑌)) = (𝑁‘(𝑋(+g‘𝐺)(𝑁‘𝑌)))) |
27 | 23, 26 | eqtr4d 2859 | . 2 ⊢ (𝜑 → ((𝑁‘𝑋)(+g‘𝐺)𝑌) = (𝑁‘(𝑋 − 𝑌))) |
28 | 1, 3, 4 | grpinvsub 18181 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑁‘(𝑋 − 𝑌)) = (𝑌 − 𝑋)) |
29 | 7, 8, 11, 28 | syl3anc 1367 | . 2 ⊢ (𝜑 → (𝑁‘(𝑋 − 𝑌)) = (𝑌 − 𝑋)) |
30 | 12, 27, 29 | 3eqtrd 2860 | 1 ⊢ (𝜑 → ((𝑁‘𝑋) − (𝑁‘𝑌)) = (𝑌 − 𝑋)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1537 ∈ wcel 2114 ‘cfv 6355 (class class class)co 7156 Basecbs 16483 +gcplusg 16565 Grpcgrp 18103 invgcminusg 18104 -gcsg 18105 Abelcabl 18907 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 ax-un 7461 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3496 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4839 df-iun 4921 df-br 5067 df-opab 5129 df-mpt 5147 df-id 5460 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-fv 6363 df-riota 7114 df-ov 7159 df-oprab 7160 df-mpo 7161 df-1st 7689 df-2nd 7690 df-0g 16715 df-mgm 17852 df-sgrp 17901 df-mnd 17912 df-grp 18106 df-minusg 18107 df-sbg 18108 df-cmn 18908 df-abl 18909 |
This theorem is referenced by: ngpinvds 23222 |
Copyright terms: Public domain | W3C validator |