| 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 19117 | . . . 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 19115 | . . 3 ⊢ ((𝑋 ∈ 𝐵 ∧ (𝑁‘𝑌) ∈ 𝐵) → (𝑋 − (𝑁‘𝑌)) = (𝑋 + (𝑁‘(𝑁‘𝑌)))) |
| 11 | 1, 7, 10 | syl2anc 596 | . 2 ⊢ (𝜑 → (𝑋 − (𝑁‘𝑌)) = (𝑋 + (𝑁‘(𝑁‘𝑌)))) |
| 12 | 4, 5 | grpinvinv 19135 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ 𝐵) → (𝑁‘(𝑁‘𝑌)) = 𝑌) |
| 13 | 2, 3, 12 | syl2anc 596 | . . 3 ⊢ (𝜑 → (𝑁‘(𝑁‘𝑌)) = 𝑌) |
| 14 | 13 | oveq2d 7433 | . 2 ⊢ (𝜑 → (𝑋 + (𝑁‘(𝑁‘𝑌))) = (𝑋 + 𝑌)) |
| 15 | 11, 14 | eqtrd 2797 | 1 ⊢ (𝜑 → (𝑋 − (𝑁‘𝑌)) = (𝑋 + 𝑌)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2145 ‘cfv 6537 (class class class)co 7417 Basecbs 17307 +gcplusg 17348 Grpcgrp 19063 invgcminusg 19064 -gcsg 19065 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7740 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-id 5554 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-fv 6545 df-riota 7374 df-ov 7420 df-oprab 7421 df-mpo 7422 df-1st 7990 df-2nd 7991 df-0g 17532 df-mgm 18736 df-sgrp 18827 df-mnd 18843 df-grp 19066 df-minusg 19067 df-sbg 19068 |
| This theorem is used by: issubg4 19275 isnsg3 19289 lsmelvalm 19784 ablsub2inv 19941 ablsubsub4 19951 istgp2 24323 nmtri 24858 vietalem 34097 baerlem5amN 42597 baerlem5abmN 42599 |
| Copyright terms: Public domain | W3C validator |