| 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 19085 | . . . 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 19083 | . . 3 ⊢ ((𝑋 ∈ 𝐵 ∧ (𝑁‘𝑌) ∈ 𝐵) → (𝑋 − (𝑁‘𝑌)) = (𝑋 + (𝑁‘(𝑁‘𝑌)))) |
| 11 | 1, 7, 10 | syl2anc 596 | . 2 ⊢ (𝜑 → (𝑋 − (𝑁‘𝑌)) = (𝑋 + (𝑁‘(𝑁‘𝑌)))) |
| 12 | 4, 5 | grpinvinv 19103 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ 𝐵) → (𝑁‘(𝑁‘𝑌)) = 𝑌) |
| 13 | 2, 3, 12 | syl2anc 596 | . . 3 ⊢ (𝜑 → (𝑁‘(𝑁‘𝑌)) = 𝑌) |
| 14 | 13 | oveq2d 7439 | . 2 ⊢ (𝜑 → (𝑋 + (𝑁‘(𝑁‘𝑌))) = (𝑋 + 𝑌)) |
| 15 | 11, 14 | eqtrd 2801 | 1 ⊢ (𝜑 → (𝑋 − (𝑁‘𝑌)) = (𝑋 + 𝑌)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2146 ‘cfv 6543 (class class class)co 7423 Basecbs 17294 +gcplusg 17335 Grpcgrp 19031 invgcminusg 19032 -gcsg 19033 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2738 ax-sep 5262 ax-nul 5274 ax-pow 5341 ax-pr 5409 ax-un 7745 |
| 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 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2841 df-nfc 2915 df-ne 2962 df-ral 3083 df-rex 3093 df-rmo 3372 df-reu 3373 df-rab 3420 df-v 3460 df-sbc 3748 df-csb 3857 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-nul 4290 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-iun 4963 df-br 5115 df-opab 5179 df-mpt 5198 df-id 5561 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 df-iota 6499 df-fun 6545 df-fn 6546 df-f 6547 df-fv 6551 df-riota 7380 df-ov 7426 df-oprab 7427 df-mpo 7428 df-1st 7995 df-2nd 7996 df-0g 17519 df-mgm 18723 df-sgrp 18806 df-mnd 18822 df-grp 19034 df-minusg 19035 df-sbg 19036 |
| This theorem is used by: issubg4 19243 isnsg3 19257 lsmelvalm 19752 ablsub2inv 19909 ablsubsub4 19919 istgp2 24285 nmtri 24820 vietalem 34000 baerlem5amN 42531 baerlem5abmN 42533 |
| Copyright terms: Public domain | W3C validator |