| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > grpsubadd0sub | GIF version | ||
| Description: Subtraction expressed as addition of the difference of the identity element and the subtrahend. (Contributed by AV, 9-Nov-2019.) |
| Ref | Expression |
|---|---|
| grpsubid.b | ⊢ 𝐵 = (Base‘𝐺) |
| grpsubid.o | ⊢ 0 = (0g‘𝐺) |
| grpsubid.m | ⊢ − = (-g‘𝐺) |
| grpsubadd0sub.p | ⊢ + = (+g‘𝐺) |
| Ref | Expression |
|---|---|
| grpsubadd0sub | ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 − 𝑌) = (𝑋 + ( 0 − 𝑌))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | grpsubid.b | . . . 4 ⊢ 𝐵 = (Base‘𝐺) | |
| 2 | grpsubadd0sub.p | . . . 4 ⊢ + = (+g‘𝐺) | |
| 3 | eqid 2238 | . . . 4 ⊢ (invg‘𝐺) = (invg‘𝐺) | |
| 4 | grpsubid.m | . . . 4 ⊢ − = (-g‘𝐺) | |
| 5 | 1, 2, 3, 4 | grpsubval 13851 | . . 3 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 − 𝑌) = (𝑋 + ((invg‘𝐺)‘𝑌))) |
| 6 | 5 | 3adant1 1046 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 − 𝑌) = (𝑋 + ((invg‘𝐺)‘𝑌))) |
| 7 | grpsubid.o | . . . . 5 ⊢ 0 = (0g‘𝐺) | |
| 8 | 1, 4, 3, 7 | grpinvval2 13888 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ 𝐵) → ((invg‘𝐺)‘𝑌) = ( 0 − 𝑌)) |
| 9 | 8 | 3adant2 1047 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((invg‘𝐺)‘𝑌) = ( 0 − 𝑌)) |
| 10 | 9 | oveq2d 6101 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 + ((invg‘𝐺)‘𝑌)) = (𝑋 + ( 0 − 𝑌))) |
| 11 | 6, 10 | eqtrd 2271 | 1 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 − 𝑌) = (𝑋 + ( 0 − 𝑌))) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 ∧ w3a 1009 = wceq 1402 ∈ wcel 2209 ‘cfv 5377 (class class class)co 6085 Basecbs 13352 +gcplusg 13431 0gc0g 13610 Grpcgrp 13805 invgcminusg 13806 -gcsg 13807 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4246 ax-sep 4249 ax-pow 4311 ax-pr 4346 ax-un 4578 ax-setind 4684 ax-cnex 8270 ax-resscn 8271 ax-1re 8273 ax-addrcl 8276 |
| This proof depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-ral 2533 df-rex 2534 df-reu 2535 df-rmo 2536 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-iun 4014 df-br 4131 df-opab 4193 df-mpt 4194 df-id 4438 df-xp 4780 df-rel 4781 df-cnv 4782 df-co 4783 df-dm 4784 df-rn 4785 df-res 4786 df-ima 4787 df-iota 5337 df-fun 5379 df-fn 5380 df-f 5381 df-f1 5382 df-fo 5383 df-f1o 5384 df-fv 5385 df-riota 6038 df-ov 6088 df-oprab 6089 df-mpo 6090 df-1st 6374 df-2nd 6375 df-inn 9305 df-2 9363 df-ndx 13355 df-slot 13356 df-base 13358 df-plusg 13444 df-0g 13612 df-mgm 13676 df-sgrp 13717 df-mnd 13730 df-grp 13808 df-minusg 13809 df-sbg 13810 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |