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 12751 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ 𝐵) → (𝑁‘𝑌) ∈ 𝐵) |
7 | 2, 3, 6 | syl2anc 409 | . . 3 ⊢ (𝜑 → (𝑁‘𝑌) ∈ 𝐵) |
8 | grpsubinv.p | . . . 4 ⊢ + = (+g‘𝐺) | |
9 | grpsubinv.m | . . . 4 ⊢ − = (-g‘𝐺) | |
10 | 4, 8, 5, 9 | grpsubval 12749 | . . 3 ⊢ ((𝑋 ∈ 𝐵 ∧ (𝑁‘𝑌) ∈ 𝐵) → (𝑋 − (𝑁‘𝑌)) = (𝑋 + (𝑁‘(𝑁‘𝑌)))) |
11 | 1, 7, 10 | syl2anc 409 | . 2 ⊢ (𝜑 → (𝑋 − (𝑁‘𝑌)) = (𝑋 + (𝑁‘(𝑁‘𝑌)))) |
12 | 4, 5 | grpinvinv 12766 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ 𝐵) → (𝑁‘(𝑁‘𝑌)) = 𝑌) |
13 | 2, 3, 12 | syl2anc 409 | . . 3 ⊢ (𝜑 → (𝑁‘(𝑁‘𝑌)) = 𝑌) |
14 | 13 | oveq2d 5869 | . 2 ⊢ (𝜑 → (𝑋 + (𝑁‘(𝑁‘𝑌))) = (𝑋 + 𝑌)) |
15 | 11, 14 | eqtrd 2203 | 1 ⊢ (𝜑 → (𝑋 − (𝑁‘𝑌)) = (𝑋 + 𝑌)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 = wceq 1348 ∈ wcel 2141 ‘cfv 5198 (class class class)co 5853 Basecbs 12416 +gcplusg 12480 Grpcgrp 12708 invgcminusg 12709 -gcsg 12710 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 609 ax-in2 610 ax-io 704 ax-5 1440 ax-7 1441 ax-gen 1442 ax-ie1 1486 ax-ie2 1487 ax-8 1497 ax-10 1498 ax-11 1499 ax-i12 1500 ax-bndl 1502 ax-4 1503 ax-17 1519 ax-i9 1523 ax-ial 1527 ax-i5r 1528 ax-13 2143 ax-14 2144 ax-ext 2152 ax-coll 4104 ax-sep 4107 ax-pow 4160 ax-pr 4194 ax-un 4418 ax-setind 4521 ax-cnex 7865 ax-resscn 7866 ax-1re 7868 ax-addrcl 7871 |
This theorem depends on definitions: df-bi 116 df-3an 975 df-tru 1351 df-fal 1354 df-nf 1454 df-sb 1756 df-eu 2022 df-mo 2023 df-clab 2157 df-cleq 2163 df-clel 2166 df-nfc 2301 df-ne 2341 df-ral 2453 df-rex 2454 df-reu 2455 df-rmo 2456 df-rab 2457 df-v 2732 df-sbc 2956 df-csb 3050 df-dif 3123 df-un 3125 df-in 3127 df-ss 3134 df-pw 3568 df-sn 3589 df-pr 3590 df-op 3592 df-uni 3797 df-int 3832 df-iun 3875 df-br 3990 df-opab 4051 df-mpt 4052 df-id 4278 df-xp 4617 df-rel 4618 df-cnv 4619 df-co 4620 df-dm 4621 df-rn 4622 df-res 4623 df-ima 4624 df-iota 5160 df-fun 5200 df-fn 5201 df-f 5202 df-f1 5203 df-fo 5204 df-f1o 5205 df-fv 5206 df-riota 5809 df-ov 5856 df-oprab 5857 df-mpo 5858 df-1st 6119 df-2nd 6120 df-inn 8879 df-2 8937 df-ndx 12419 df-slot 12420 df-base 12422 df-plusg 12493 df-0g 12598 df-mgm 12610 df-sgrp 12643 df-mnd 12653 df-grp 12711 df-minusg 12712 df-sbg 12713 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |