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 18627 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ 𝐵) → (𝑁‘𝑌) ∈ 𝐵) |
4 | 3 | 3adant2 1130 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑁‘𝑌) ∈ 𝐵) |
5 | eqid 2738 | . . . . 5 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
6 | 1, 5, 2 | grpinvadd 18653 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ (𝑁‘𝑌) ∈ 𝐵) → (𝑁‘(𝑋(+g‘𝐺)(𝑁‘𝑌))) = ((𝑁‘(𝑁‘𝑌))(+g‘𝐺)(𝑁‘𝑋))) |
7 | 4, 6 | syld3an3 1408 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑁‘(𝑋(+g‘𝐺)(𝑁‘𝑌))) = ((𝑁‘(𝑁‘𝑌))(+g‘𝐺)(𝑁‘𝑋))) |
8 | 1, 2 | grpinvinv 18642 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ 𝐵) → (𝑁‘(𝑁‘𝑌)) = 𝑌) |
9 | 8 | 3adant2 1130 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑁‘(𝑁‘𝑌)) = 𝑌) |
10 | 9 | oveq1d 7290 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑁‘(𝑁‘𝑌))(+g‘𝐺)(𝑁‘𝑋)) = (𝑌(+g‘𝐺)(𝑁‘𝑋))) |
11 | 7, 10 | eqtrd 2778 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑁‘(𝑋(+g‘𝐺)(𝑁‘𝑌))) = (𝑌(+g‘𝐺)(𝑁‘𝑋))) |
12 | grpsubcl.m | . . . . 5 ⊢ − = (-g‘𝐺) | |
13 | 1, 5, 2, 12 | grpsubval 18625 | . . . 4 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 − 𝑌) = (𝑋(+g‘𝐺)(𝑁‘𝑌))) |
14 | 13 | 3adant1 1129 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 − 𝑌) = (𝑋(+g‘𝐺)(𝑁‘𝑌))) |
15 | 14 | fveq2d 6778 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑁‘(𝑋 − 𝑌)) = (𝑁‘(𝑋(+g‘𝐺)(𝑁‘𝑌)))) |
16 | 1, 5, 2, 12 | grpsubval 18625 | . . . 4 ⊢ ((𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → (𝑌 − 𝑋) = (𝑌(+g‘𝐺)(𝑁‘𝑋))) |
17 | 16 | ancoms 459 | . . 3 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑌 − 𝑋) = (𝑌(+g‘𝐺)(𝑁‘𝑋))) |
18 | 17 | 3adant1 1129 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑌 − 𝑋) = (𝑌(+g‘𝐺)(𝑁‘𝑋))) |
19 | 11, 15, 18 | 3eqtr4d 2788 | 1 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑁‘(𝑋 − 𝑌)) = (𝑌 − 𝑋)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ w3a 1086 = wceq 1539 ∈ wcel 2106 ‘cfv 6433 (class class class)co 7275 Basecbs 16912 +gcplusg 16962 Grpcgrp 18577 invgcminusg 18578 -gcsg 18579 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-sep 5223 ax-nul 5230 ax-pow 5288 ax-pr 5352 ax-un 7588 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-ral 3069 df-rex 3070 df-rmo 3071 df-reu 3072 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-iun 4926 df-br 5075 df-opab 5137 df-mpt 5158 df-id 5489 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-fv 6441 df-riota 7232 df-ov 7278 df-oprab 7279 df-mpo 7280 df-1st 7831 df-2nd 7832 df-0g 17152 df-mgm 18326 df-sgrp 18375 df-mnd 18386 df-grp 18580 df-minusg 18581 df-sbg 18582 |
This theorem is referenced by: grpsubsub 18664 ablsub2inv 19412 lspsnsub 20269 ghmcnp 23266 nrmmetd 23730 nmsub 23779 mapdpglem14 39699 |
Copyright terms: Public domain | W3C validator |