Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > grpinvsub | Structured version Visualization version GIF version |
Description: Inverse of a group subtraction. (Contributed by NM, 9-Sep-2014.) |
Ref | Expression |
---|---|
grpsubcl.b | ⊢ 𝐵 = (Base‘𝐺) |
grpsubcl.m | ⊢ − = (-g‘𝐺) |
grpinvsub.n | ⊢ 𝑁 = (invg‘𝐺) |
Ref | Expression |
---|---|
grpinvsub | ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑁‘(𝑋 − 𝑌)) = (𝑌 − 𝑋)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | grpsubcl.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝐺) | |
2 | grpinvsub.n | . . . . . 6 ⊢ 𝑁 = (invg‘𝐺) | |
3 | 1, 2 | grpinvcl 17290 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ 𝐵) → (𝑁‘𝑌) ∈ 𝐵) |
4 | 3 | 3adant2 1073 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑁‘𝑌) ∈ 𝐵) |
5 | eqid 2610 | . . . . 5 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
6 | 1, 5, 2 | grpinvadd 17316 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ (𝑁‘𝑌) ∈ 𝐵) → (𝑁‘(𝑋(+g‘𝐺)(𝑁‘𝑌))) = ((𝑁‘(𝑁‘𝑌))(+g‘𝐺)(𝑁‘𝑋))) |
7 | 4, 6 | syld3an3 1363 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑁‘(𝑋(+g‘𝐺)(𝑁‘𝑌))) = ((𝑁‘(𝑁‘𝑌))(+g‘𝐺)(𝑁‘𝑋))) |
8 | 1, 2 | grpinvinv 17305 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ 𝐵) → (𝑁‘(𝑁‘𝑌)) = 𝑌) |
9 | 8 | 3adant2 1073 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑁‘(𝑁‘𝑌)) = 𝑌) |
10 | 9 | oveq1d 6564 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑁‘(𝑁‘𝑌))(+g‘𝐺)(𝑁‘𝑋)) = (𝑌(+g‘𝐺)(𝑁‘𝑋))) |
11 | 7, 10 | eqtrd 2644 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑁‘(𝑋(+g‘𝐺)(𝑁‘𝑌))) = (𝑌(+g‘𝐺)(𝑁‘𝑋))) |
12 | grpsubcl.m | . . . . 5 ⊢ − = (-g‘𝐺) | |
13 | 1, 5, 2, 12 | grpsubval 17288 | . . . 4 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 − 𝑌) = (𝑋(+g‘𝐺)(𝑁‘𝑌))) |
14 | 13 | 3adant1 1072 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 − 𝑌) = (𝑋(+g‘𝐺)(𝑁‘𝑌))) |
15 | 14 | fveq2d 6107 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑁‘(𝑋 − 𝑌)) = (𝑁‘(𝑋(+g‘𝐺)(𝑁‘𝑌)))) |
16 | 1, 5, 2, 12 | grpsubval 17288 | . . . 4 ⊢ ((𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → (𝑌 − 𝑋) = (𝑌(+g‘𝐺)(𝑁‘𝑋))) |
17 | 16 | ancoms 468 | . . 3 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑌 − 𝑋) = (𝑌(+g‘𝐺)(𝑁‘𝑋))) |
18 | 17 | 3adant1 1072 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑌 − 𝑋) = (𝑌(+g‘𝐺)(𝑁‘𝑋))) |
19 | 11, 15, 18 | 3eqtr4d 2654 | 1 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑁‘(𝑋 − 𝑌)) = (𝑌 − 𝑋)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ w3a 1031 = wceq 1475 ∈ wcel 1977 ‘cfv 5804 (class class class)co 6549 Basecbs 15695 +gcplusg 15768 Grpcgrp 17245 invgcminusg 17246 -gcsg 17247 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-rep 4699 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-ral 2901 df-rex 2902 df-reu 2903 df-rmo 2904 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-op 4132 df-uni 4373 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-id 4953 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-riota 6511 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-1st 7059 df-2nd 7060 df-0g 15925 df-mgm 17065 df-sgrp 17107 df-mnd 17118 df-grp 17248 df-minusg 17249 df-sbg 17250 |
This theorem is referenced by: grpsubsub 17327 ablsub2inv 18039 lspsnsub 18828 ghmcnp 21728 nrmmetd 22189 nmsub 22237 mapdpglem14 35992 |
Copyright terms: Public domain | W3C validator |