![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > grpsubid1 | GIF version |
Description: Subtraction of the identity from a group element. (Contributed by Mario Carneiro, 14-Jan-2015.) |
Ref | Expression |
---|---|
grpsubid.b | ⊢ 𝐵 = (Base‘𝐺) |
grpsubid.o | ⊢ 0 = (0g‘𝐺) |
grpsubid.m | ⊢ − = (-g‘𝐺) |
Ref | Expression |
---|---|
grpsubid1 | ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋 − 0 ) = 𝑋) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | id 19 | . . 3 ⊢ (𝑋 ∈ 𝐵 → 𝑋 ∈ 𝐵) | |
2 | grpsubid.b | . . . 4 ⊢ 𝐵 = (Base‘𝐺) | |
3 | grpsubid.o | . . . 4 ⊢ 0 = (0g‘𝐺) | |
4 | 2, 3 | grpidcl 12904 | . . 3 ⊢ (𝐺 ∈ Grp → 0 ∈ 𝐵) |
5 | eqid 2177 | . . . 4 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
6 | eqid 2177 | . . . 4 ⊢ (invg‘𝐺) = (invg‘𝐺) | |
7 | grpsubid.m | . . . 4 ⊢ − = (-g‘𝐺) | |
8 | 2, 5, 6, 7 | grpsubval 12919 | . . 3 ⊢ ((𝑋 ∈ 𝐵 ∧ 0 ∈ 𝐵) → (𝑋 − 0 ) = (𝑋(+g‘𝐺)((invg‘𝐺)‘ 0 ))) |
9 | 1, 4, 8 | syl2anr 290 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋 − 0 ) = (𝑋(+g‘𝐺)((invg‘𝐺)‘ 0 ))) |
10 | 3, 6 | grpinvid 12930 | . . . 4 ⊢ (𝐺 ∈ Grp → ((invg‘𝐺)‘ 0 ) = 0 ) |
11 | 10 | adantr 276 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → ((invg‘𝐺)‘ 0 ) = 0 ) |
12 | 11 | oveq2d 5891 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋(+g‘𝐺)((invg‘𝐺)‘ 0 )) = (𝑋(+g‘𝐺) 0 )) |
13 | 2, 5, 3 | grprid 12907 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋(+g‘𝐺) 0 ) = 𝑋) |
14 | 9, 12, 13 | 3eqtrd 2214 | 1 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋 − 0 ) = 𝑋) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 = wceq 1353 ∈ wcel 2148 ‘cfv 5217 (class class class)co 5875 Basecbs 12462 +gcplusg 12536 0gc0g 12705 Grpcgrp 12877 invgcminusg 12878 -gcsg 12879 |
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 614 ax-in2 615 ax-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-13 2150 ax-14 2151 ax-ext 2159 ax-coll 4119 ax-sep 4122 ax-pow 4175 ax-pr 4210 ax-un 4434 ax-setind 4537 ax-cnex 7902 ax-resscn 7903 ax-1re 7905 ax-addrcl 7908 |
This theorem depends on definitions: df-bi 117 df-3an 980 df-tru 1356 df-fal 1359 df-nf 1461 df-sb 1763 df-eu 2029 df-mo 2030 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ne 2348 df-ral 2460 df-rex 2461 df-reu 2462 df-rmo 2463 df-rab 2464 df-v 2740 df-sbc 2964 df-csb 3059 df-dif 3132 df-un 3134 df-in 3136 df-ss 3143 df-pw 3578 df-sn 3599 df-pr 3600 df-op 3602 df-uni 3811 df-int 3846 df-iun 3889 df-br 4005 df-opab 4066 df-mpt 4067 df-id 4294 df-xp 4633 df-rel 4634 df-cnv 4635 df-co 4636 df-dm 4637 df-rn 4638 df-res 4639 df-ima 4640 df-iota 5179 df-fun 5219 df-fn 5220 df-f 5221 df-f1 5222 df-fo 5223 df-f1o 5224 df-fv 5225 df-riota 5831 df-ov 5878 df-oprab 5879 df-mpo 5880 df-1st 6141 df-2nd 6142 df-inn 8920 df-2 8978 df-ndx 12465 df-slot 12466 df-base 12468 df-plusg 12549 df-0g 12707 df-mgm 12775 df-sgrp 12808 df-mnd 12818 df-grp 12880 df-minusg 12881 df-sbg 12882 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |