| 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 18917 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ 𝐵) → (𝑁‘𝑌) ∈ 𝐵) |
| 4 | 3 | 3adant2 1131 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑁‘𝑌) ∈ 𝐵) |
| 5 | eqid 2736 | . . . . 5 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 6 | 1, 5, 2 | grpinvadd 18948 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ (𝑁‘𝑌) ∈ 𝐵) → (𝑁‘(𝑋(+g‘𝐺)(𝑁‘𝑌))) = ((𝑁‘(𝑁‘𝑌))(+g‘𝐺)(𝑁‘𝑋))) |
| 7 | 4, 6 | syld3an3 1411 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑁‘(𝑋(+g‘𝐺)(𝑁‘𝑌))) = ((𝑁‘(𝑁‘𝑌))(+g‘𝐺)(𝑁‘𝑋))) |
| 8 | 1, 2 | grpinvinv 18935 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ 𝐵) → (𝑁‘(𝑁‘𝑌)) = 𝑌) |
| 9 | 8 | 3adant2 1131 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑁‘(𝑁‘𝑌)) = 𝑌) |
| 10 | 9 | oveq1d 7373 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑁‘(𝑁‘𝑌))(+g‘𝐺)(𝑁‘𝑋)) = (𝑌(+g‘𝐺)(𝑁‘𝑋))) |
| 11 | 7, 10 | eqtrd 2771 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑁‘(𝑋(+g‘𝐺)(𝑁‘𝑌))) = (𝑌(+g‘𝐺)(𝑁‘𝑋))) |
| 12 | grpsubcl.m | . . . . 5 ⊢ − = (-g‘𝐺) | |
| 13 | 1, 5, 2, 12 | grpsubval 18915 | . . . 4 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 − 𝑌) = (𝑋(+g‘𝐺)(𝑁‘𝑌))) |
| 14 | 13 | 3adant1 1130 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 − 𝑌) = (𝑋(+g‘𝐺)(𝑁‘𝑌))) |
| 15 | 14 | fveq2d 6838 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑁‘(𝑋 − 𝑌)) = (𝑁‘(𝑋(+g‘𝐺)(𝑁‘𝑌)))) |
| 16 | 1, 5, 2, 12 | grpsubval 18915 | . . . 4 ⊢ ((𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → (𝑌 − 𝑋) = (𝑌(+g‘𝐺)(𝑁‘𝑋))) |
| 17 | 16 | ancoms 458 | . . 3 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑌 − 𝑋) = (𝑌(+g‘𝐺)(𝑁‘𝑋))) |
| 18 | 17 | 3adant1 1130 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑌 − 𝑋) = (𝑌(+g‘𝐺)(𝑁‘𝑋))) |
| 19 | 11, 15, 18 | 3eqtr4d 2781 | 1 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑁‘(𝑋 − 𝑌)) = (𝑌 − 𝑋)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1086 = wceq 1541 ∈ wcel 2113 ‘cfv 6492 (class class class)co 7358 Basecbs 17136 +gcplusg 17177 Grpcgrp 18863 invgcminusg 18864 -gcsg 18865 |
| 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 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3061 df-rmo 3350 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-id 5519 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-fv 6500 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-1st 7933 df-2nd 7934 df-0g 17361 df-mgm 18565 df-sgrp 18644 df-mnd 18660 df-grp 18866 df-minusg 18867 df-sbg 18868 |
| This theorem is referenced by: grpsubsub 18959 ablsub2inv 19737 lspsnsub 20958 ghmcnp 24059 nrmmetd 24518 nmsub 24567 gsummulsubdishift2 33152 erler 33347 mapdpglem14 41941 |
| Copyright terms: Public domain | W3C validator |