| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > grpinvval2 | GIF version | ||
| Description: A df-neg 8396-like equation for inverse in terms of group subtraction. (Contributed by Mario Carneiro, 4-Oct-2015.) |
| Ref | Expression |
|---|---|
| grpsubcl.b | ⊢ 𝐵 = (Base‘𝐺) |
| grpsubcl.m | ⊢ − = (-g‘𝐺) |
| grpinvsub.n | ⊢ 𝑁 = (invg‘𝐺) |
| grpinvval2.z | ⊢ 0 = (0g‘𝐺) |
| Ref | Expression |
|---|---|
| grpinvval2 | ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑁‘𝑋) = ( 0 − 𝑋)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | grpsubcl.b | . . . 4 ⊢ 𝐵 = (Base‘𝐺) | |
| 2 | grpinvval2.z | . . . 4 ⊢ 0 = (0g‘𝐺) | |
| 3 | 1, 2 | grpidcl 13673 | . . 3 ⊢ (𝐺 ∈ Grp → 0 ∈ 𝐵) |
| 4 | eqid 2231 | . . . 4 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 5 | grpinvsub.n | . . . 4 ⊢ 𝑁 = (invg‘𝐺) | |
| 6 | grpsubcl.m | . . . 4 ⊢ − = (-g‘𝐺) | |
| 7 | 1, 4, 5, 6 | grpsubval 13690 | . . 3 ⊢ (( 0 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → ( 0 − 𝑋) = ( 0 (+g‘𝐺)(𝑁‘𝑋))) |
| 8 | 3, 7 | sylan 283 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → ( 0 − 𝑋) = ( 0 (+g‘𝐺)(𝑁‘𝑋))) |
| 9 | 1, 5 | grpinvcl 13692 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑁‘𝑋) ∈ 𝐵) |
| 10 | 1, 4, 2 | grplid 13675 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ (𝑁‘𝑋) ∈ 𝐵) → ( 0 (+g‘𝐺)(𝑁‘𝑋)) = (𝑁‘𝑋)) |
| 11 | 9, 10 | syldan 282 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → ( 0 (+g‘𝐺)(𝑁‘𝑋)) = (𝑁‘𝑋)) |
| 12 | 8, 11 | eqtr2d 2265 | 1 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑁‘𝑋) = ( 0 − 𝑋)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1398 ∈ wcel 2202 ‘cfv 5333 (class class class)co 6028 Basecbs 13143 +gcplusg 13221 0gc0g 13400 Grpcgrp 13644 invgcminusg 13645 -gcsg 13646 |
| 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 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2204 ax-14 2205 ax-ext 2213 ax-coll 4209 ax-sep 4212 ax-pow 4270 ax-pr 4305 ax-un 4536 ax-setind 4641 ax-cnex 8166 ax-resscn 8167 ax-1re 8169 ax-addrcl 8172 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ne 2404 df-ral 2516 df-rex 2517 df-reu 2518 df-rmo 2519 df-rab 2520 df-v 2805 df-sbc 3033 df-csb 3129 df-dif 3203 df-un 3205 df-in 3207 df-ss 3214 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-uni 3899 df-int 3934 df-iun 3977 df-br 4094 df-opab 4156 df-mpt 4157 df-id 4396 df-xp 4737 df-rel 4738 df-cnv 4739 df-co 4740 df-dm 4741 df-rn 4742 df-res 4743 df-ima 4744 df-iota 5293 df-fun 5335 df-fn 5336 df-f 5337 df-f1 5338 df-fo 5339 df-f1o 5340 df-fv 5341 df-riota 5981 df-ov 6031 df-oprab 6032 df-mpo 6033 df-1st 6312 df-2nd 6313 df-inn 9187 df-2 9245 df-ndx 13146 df-slot 13147 df-base 13149 df-plusg 13234 df-0g 13402 df-mgm 13500 df-sgrp 13546 df-mnd 13561 df-grp 13647 df-minusg 13648 df-sbg 13649 |
| This theorem is referenced by: grpsubadd0sub 13731 |
| Copyright terms: Public domain | W3C validator |