![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > grpsubinv | 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 12944 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ 𝐵) → (𝑁‘𝑌) ∈ 𝐵) |
7 | 2, 3, 6 | syl2anc 411 | . . 3 ⊢ (𝜑 → (𝑁‘𝑌) ∈ 𝐵) |
8 | grpsubinv.p | . . . 4 ⊢ + = (+g‘𝐺) | |
9 | grpsubinv.m | . . . 4 ⊢ − = (-g‘𝐺) | |
10 | 4, 8, 5, 9 | grpsubval 12942 | . . 3 ⊢ ((𝑋 ∈ 𝐵 ∧ (𝑁‘𝑌) ∈ 𝐵) → (𝑋 − (𝑁‘𝑌)) = (𝑋 + (𝑁‘(𝑁‘𝑌)))) |
11 | 1, 7, 10 | syl2anc 411 | . 2 ⊢ (𝜑 → (𝑋 − (𝑁‘𝑌)) = (𝑋 + (𝑁‘(𝑁‘𝑌)))) |
12 | 4, 5 | grpinvinv 12963 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ 𝐵) → (𝑁‘(𝑁‘𝑌)) = 𝑌) |
13 | 2, 3, 12 | syl2anc 411 | . . 3 ⊢ (𝜑 → (𝑁‘(𝑁‘𝑌)) = 𝑌) |
14 | 13 | oveq2d 5904 | . 2 ⊢ (𝜑 → (𝑋 + (𝑁‘(𝑁‘𝑌))) = (𝑋 + 𝑌)) |
15 | 11, 14 | eqtrd 2220 | 1 ⊢ (𝜑 → (𝑋 − (𝑁‘𝑌)) = (𝑋 + 𝑌)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 = wceq 1363 ∈ wcel 2158 ‘cfv 5228 (class class class)co 5888 Basecbs 12475 +gcplusg 12550 Grpcgrp 12898 invgcminusg 12899 -gcsg 12900 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 615 ax-in2 616 ax-io 710 ax-5 1457 ax-7 1458 ax-gen 1459 ax-ie1 1503 ax-ie2 1504 ax-8 1514 ax-10 1515 ax-11 1516 ax-i12 1517 ax-bndl 1519 ax-4 1520 ax-17 1536 ax-i9 1540 ax-ial 1544 ax-i5r 1545 ax-13 2160 ax-14 2161 ax-ext 2169 ax-coll 4130 ax-sep 4133 ax-pow 4186 ax-pr 4221 ax-un 4445 ax-setind 4548 ax-cnex 7915 ax-resscn 7916 ax-1re 7918 ax-addrcl 7921 |
This theorem depends on definitions: df-bi 117 df-3an 981 df-tru 1366 df-fal 1369 df-nf 1471 df-sb 1773 df-eu 2039 df-mo 2040 df-clab 2174 df-cleq 2180 df-clel 2183 df-nfc 2318 df-ne 2358 df-ral 2470 df-rex 2471 df-reu 2472 df-rmo 2473 df-rab 2474 df-v 2751 df-sbc 2975 df-csb 3070 df-dif 3143 df-un 3145 df-in 3147 df-ss 3154 df-pw 3589 df-sn 3610 df-pr 3611 df-op 3613 df-uni 3822 df-int 3857 df-iun 3900 df-br 4016 df-opab 4077 df-mpt 4078 df-id 4305 df-xp 4644 df-rel 4645 df-cnv 4646 df-co 4647 df-dm 4648 df-rn 4649 df-res 4650 df-ima 4651 df-iota 5190 df-fun 5230 df-fn 5231 df-f 5232 df-f1 5233 df-fo 5234 df-f1o 5235 df-fv 5236 df-riota 5844 df-ov 5891 df-oprab 5892 df-mpo 5893 df-1st 6154 df-2nd 6155 df-inn 8933 df-2 8991 df-ndx 12478 df-slot 12479 df-base 12481 df-plusg 12563 df-0g 12724 df-mgm 12793 df-sgrp 12826 df-mnd 12839 df-grp 12901 df-minusg 12902 df-sbg 12903 |
This theorem is referenced by: issubg4m 13084 isnsg3 13098 ablsub2inv 13147 ablsubsub4 13155 |
Copyright terms: Public domain | W3C validator |