| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > grpinvval2 | GIF version | ||
| Description: A df-neg 8464-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 13788 | . . 3 ⊢ (𝐺 ∈ Grp → 0 ∈ 𝐵) |
| 4 | eqid 2234 | . . . 4 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 5 | grpinvsub.n | . . . 4 ⊢ 𝑁 = (invg‘𝐺) | |
| 6 | grpsubcl.m | . . . 4 ⊢ − = (-g‘𝐺) | |
| 7 | 1, 4, 5, 6 | grpsubval 13805 | . . 3 ⊢ (( 0 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → ( 0 − 𝑋) = ( 0 (+g‘𝐺)(𝑁‘𝑋))) |
| 8 | 3, 7 | sylan 283 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → ( 0 − 𝑋) = ( 0 (+g‘𝐺)(𝑁‘𝑋))) |
| 9 | 1, 5 | grpinvcl 13807 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑁‘𝑋) ∈ 𝐵) |
| 10 | 1, 4, 2 | grplid 13790 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ (𝑁‘𝑋) ∈ 𝐵) → ( 0 (+g‘𝐺)(𝑁‘𝑋)) = (𝑁‘𝑋)) |
| 11 | 9, 10 | syldan 282 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → ( 0 (+g‘𝐺)(𝑁‘𝑋)) = (𝑁‘𝑋)) |
| 12 | 8, 11 | eqtr2d 2268 | 1 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑁‘𝑋) = ( 0 − 𝑋)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1398 ∈ wcel 2205 ‘cfv 5357 (class class class)co 6058 Basecbs 13300 +gcplusg 13378 0gc0g 13557 Grpcgrp 13759 invgcminusg 13760 -gcsg 13761 |
| 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 2207 ax-14 2208 ax-ext 2216 ax-coll 4230 ax-sep 4233 ax-pow 4292 ax-pr 4327 ax-un 4559 ax-setind 4664 ax-cnex 8234 ax-resscn 8235 ax-1re 8237 ax-addrcl 8240 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ne 2415 df-ral 2527 df-rex 2528 df-reu 2529 df-rmo 2530 df-rab 2531 df-v 2817 df-sbc 3046 df-csb 3142 df-dif 3216 df-un 3218 df-in 3220 df-ss 3227 df-pw 3676 df-sn 3700 df-pr 3701 df-op 3703 df-uni 3920 df-int 3955 df-iun 3998 df-br 4115 df-opab 4177 df-mpt 4178 df-id 4419 df-xp 4760 df-rel 4761 df-cnv 4762 df-co 4763 df-dm 4764 df-rn 4765 df-res 4766 df-ima 4767 df-iota 5317 df-fun 5359 df-fn 5360 df-f 5361 df-f1 5362 df-fo 5363 df-f1o 5364 df-fv 5365 df-riota 6011 df-ov 6061 df-oprab 6062 df-mpo 6063 df-1st 6347 df-2nd 6348 df-inn 9258 df-2 9316 df-ndx 13303 df-slot 13304 df-base 13306 df-plusg 13391 df-0g 13559 df-mgm 13623 df-sgrp 13669 df-mnd 13682 df-grp 13762 df-minusg 13763 df-sbg 13764 |
| This theorem is referenced by: grpsubadd0sub 13846 |
| Copyright terms: Public domain | W3C validator |