| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > grpinvval2 | GIF version | ||
| Description: A df-neg 8253-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 13405 | . . 3 ⊢ (𝐺 ∈ Grp → 0 ∈ 𝐵) |
| 4 | eqid 2206 | . . . 4 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 5 | grpinvsub.n | . . . 4 ⊢ 𝑁 = (invg‘𝐺) | |
| 6 | grpsubcl.m | . . . 4 ⊢ − = (-g‘𝐺) | |
| 7 | 1, 4, 5, 6 | grpsubval 13422 | . . 3 ⊢ (( 0 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → ( 0 − 𝑋) = ( 0 (+g‘𝐺)(𝑁‘𝑋))) |
| 8 | 3, 7 | sylan 283 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → ( 0 − 𝑋) = ( 0 (+g‘𝐺)(𝑁‘𝑋))) |
| 9 | 1, 5 | grpinvcl 13424 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑁‘𝑋) ∈ 𝐵) |
| 10 | 1, 4, 2 | grplid 13407 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ (𝑁‘𝑋) ∈ 𝐵) → ( 0 (+g‘𝐺)(𝑁‘𝑋)) = (𝑁‘𝑋)) |
| 11 | 9, 10 | syldan 282 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → ( 0 (+g‘𝐺)(𝑁‘𝑋)) = (𝑁‘𝑋)) |
| 12 | 8, 11 | eqtr2d 2240 | 1 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑁‘𝑋) = ( 0 − 𝑋)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1373 ∈ wcel 2177 ‘cfv 5276 (class class class)co 5951 Basecbs 12876 +gcplusg 12953 0gc0g 13132 Grpcgrp 13376 invgcminusg 13377 -gcsg 13378 |
| 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 615 ax-in2 616 ax-io 711 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-13 2179 ax-14 2180 ax-ext 2188 ax-coll 4163 ax-sep 4166 ax-pow 4222 ax-pr 4257 ax-un 4484 ax-setind 4589 ax-cnex 8023 ax-resscn 8024 ax-1re 8026 ax-addrcl 8029 |
| This theorem depends on definitions: df-bi 117 df-3an 983 df-tru 1376 df-fal 1379 df-nf 1485 df-sb 1787 df-eu 2058 df-mo 2059 df-clab 2193 df-cleq 2199 df-clel 2202 df-nfc 2338 df-ne 2378 df-ral 2490 df-rex 2491 df-reu 2492 df-rmo 2493 df-rab 2494 df-v 2775 df-sbc 3000 df-csb 3095 df-dif 3169 df-un 3171 df-in 3173 df-ss 3180 df-pw 3619 df-sn 3640 df-pr 3641 df-op 3643 df-uni 3853 df-int 3888 df-iun 3931 df-br 4048 df-opab 4110 df-mpt 4111 df-id 4344 df-xp 4685 df-rel 4686 df-cnv 4687 df-co 4688 df-dm 4689 df-rn 4690 df-res 4691 df-ima 4692 df-iota 5237 df-fun 5278 df-fn 5279 df-f 5280 df-f1 5281 df-fo 5282 df-f1o 5283 df-fv 5284 df-riota 5906 df-ov 5954 df-oprab 5955 df-mpo 5956 df-1st 6233 df-2nd 6234 df-inn 9044 df-2 9102 df-ndx 12879 df-slot 12880 df-base 12882 df-plusg 12966 df-0g 13134 df-mgm 13232 df-sgrp 13278 df-mnd 13293 df-grp 13379 df-minusg 13380 df-sbg 13381 |
| This theorem is referenced by: grpsubadd0sub 13463 |
| Copyright terms: Public domain | W3C validator |