| 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 2231 | . . . 4 ⊢ (invg‘𝐺) = (invg‘𝐺) | |
| 4 | grpsubid.m | . . . 4 ⊢ − = (-g‘𝐺) | |
| 5 | 1, 2, 3, 4 | grpsubval 13628 | . . 3 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 − 𝑌) = (𝑋 + ((invg‘𝐺)‘𝑌))) |
| 6 | 5 | 3adant1 1041 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 − 𝑌) = (𝑋 + ((invg‘𝐺)‘𝑌))) |
| 7 | grpsubid.o | . . . . 5 ⊢ 0 = (0g‘𝐺) | |
| 8 | 1, 4, 3, 7 | grpinvval2 13665 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ 𝐵) → ((invg‘𝐺)‘𝑌) = ( 0 − 𝑌)) |
| 9 | 8 | 3adant2 1042 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((invg‘𝐺)‘𝑌) = ( 0 − 𝑌)) |
| 10 | 9 | oveq2d 6033 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 + ((invg‘𝐺)‘𝑌)) = (𝑋 + ( 0 − 𝑌))) |
| 11 | 6, 10 | eqtrd 2264 | 1 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 − 𝑌) = (𝑋 + ( 0 − 𝑌))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ w3a 1004 = wceq 1397 ∈ wcel 2202 ‘cfv 5326 (class class class)co 6017 Basecbs 13081 +gcplusg 13159 0gc0g 13338 Grpcgrp 13582 invgcminusg 13583 -gcsg 13584 |
| 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 619 ax-in2 620 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-coll 4204 ax-sep 4207 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-setind 4635 ax-cnex 8122 ax-resscn 8123 ax-1re 8125 ax-addrcl 8128 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-ral 2515 df-rex 2516 df-reu 2517 df-rmo 2518 df-rab 2519 df-v 2804 df-sbc 3032 df-csb 3128 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-int 3929 df-iun 3972 df-br 4089 df-opab 4151 df-mpt 4152 df-id 4390 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-rn 4736 df-res 4737 df-ima 4738 df-iota 5286 df-fun 5328 df-fn 5329 df-f 5330 df-f1 5331 df-fo 5332 df-f1o 5333 df-fv 5334 df-riota 5970 df-ov 6020 df-oprab 6021 df-mpo 6022 df-1st 6302 df-2nd 6303 df-inn 9143 df-2 9201 df-ndx 13084 df-slot 13085 df-base 13087 df-plusg 13172 df-0g 13340 df-mgm 13438 df-sgrp 13484 df-mnd 13499 df-grp 13585 df-minusg 13586 df-sbg 13587 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |