| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > grpsubinv | Structured version Visualization version GIF version | ||
| Description: Subtraction of an inverse. (Contributed by NM, 7-Apr-2015.) |
| Ref | Expression |
|---|---|
| grpsubinv.b | ⊢ 𝐵 = (Base‘𝐺) |
| grpsubinv.p | ⊢ + = (+g‘𝐺) |
| grpsubinv.m | ⊢ − = (-g‘𝐺) |
| grpsubinv.n | ⊢ 𝑁 = (invg‘𝐺) |
| grpsubinv.g | ⊢ (𝜑 → 𝐺 ∈ Grp) |
| grpsubinv.x | ⊢ (𝜑 → 𝑋 ∈ 𝐵) |
| grpsubinv.y | ⊢ (𝜑 → 𝑌 ∈ 𝐵) |
| Ref | Expression |
|---|---|
| grpsubinv | ⊢ (𝜑 → (𝑋 − (𝑁‘𝑌)) = (𝑋 + 𝑌)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | grpsubinv.x | . . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
| 2 | grpsubinv.g | . . . 4 ⊢ (𝜑 → 𝐺 ∈ Grp) | |
| 3 | grpsubinv.y | . . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝐵) | |
| 4 | grpsubinv.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐺) | |
| 5 | grpsubinv.n | . . . . 5 ⊢ 𝑁 = (invg‘𝐺) | |
| 6 | 4, 5 | grpinvcl 19203 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ 𝐵) → (𝑁‘𝑌) ∈ 𝐵) |
| 7 | 2, 3, 6 | syl2anc 596 | . . 3 ⊢ (𝜑 → (𝑁‘𝑌) ∈ 𝐵) |
| 8 | grpsubinv.p | . . . 4 ⊢ + = (+g‘𝐺) | |
| 9 | grpsubinv.m | . . . 4 ⊢ − = (-g‘𝐺) | |
| 10 | 4, 8, 5, 9 | grpsubval 19201 | . . 3 ⊢ ((𝑋 ∈ 𝐵 ∧ (𝑁‘𝑌) ∈ 𝐵) → (𝑋 − (𝑁‘𝑌)) = (𝑋 + (𝑁‘(𝑁‘𝑌)))) |
| 11 | 1, 7, 10 | syl2anc 596 | . 2 ⊢ (𝜑 → (𝑋 − (𝑁‘𝑌)) = (𝑋 + (𝑁‘(𝑁‘𝑌)))) |
| 12 | 4, 5 | grpinvinv 19221 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ 𝐵) → (𝑁‘(𝑁‘𝑌)) = 𝑌) |
| 13 | 2, 3, 12 | syl2anc 596 | . . 3 ⊢ (𝜑 → (𝑁‘(𝑁‘𝑌)) = 𝑌) |
| 14 | 13 | oveq2d 7436 | . 2 ⊢ (𝜑 → (𝑋 + (𝑁‘(𝑁‘𝑌))) = (𝑋 + 𝑌)) |
| 15 | 11, 14 | eqtrd 2795 | 1 ⊢ (𝜑 → (𝑋 − (𝑁‘𝑌)) = (𝑋 + 𝑌)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1569 ∈ wcel 2144 ‘cfv 6538 (class class class)co 7420 Basecbs 17392 +gcplusg 17433 Grpcgrp 19149 invgcminusg 19150 -gcsg 19151 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7751 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5545 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-fv 6546 df-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-1st 8001 df-2nd 8002 df-0g 17617 df-mgm 18821 df-sgrp 18913 df-mnd 18929 df-grp 19152 df-minusg 19153 df-sbg 19154 |
| This theorem is used by: issubg4 19361 isnsg3 19375 lsmelvalm 19870 ablsub2inv 20027 ablsubsub4 20037 istgp2 24415 nmtri 24950 vietalem 34257 baerlem5amN 42866 baerlem5abmN 42868 |
| Copyright terms: Public domain | W3C validator |