Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > grpid | GIF version |
Description: Two ways of saying that an element of a group is the identity element. Provides a convenient way to compute the value of the identity element. (Contributed by NM, 24-Aug-2011.) |
Ref | Expression |
---|---|
grpinveu.b | ⊢ 𝐵 = (Base‘𝐺) |
grpinveu.p | ⊢ + = (+g‘𝐺) |
grpinveu.o | ⊢ 0 = (0g‘𝐺) |
Ref | Expression |
---|---|
grpid | ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → ((𝑋 + 𝑋) = 𝑋 ↔ 0 = 𝑋)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eqcom 2173 | . 2 ⊢ ( 0 = 𝑋 ↔ 𝑋 = 0 ) | |
2 | grpinveu.b | . . . . . . 7 ⊢ 𝐵 = (Base‘𝐺) | |
3 | grpinveu.o | . . . . . . 7 ⊢ 0 = (0g‘𝐺) | |
4 | 2, 3 | grpidcl 12738 | . . . . . 6 ⊢ (𝐺 ∈ Grp → 0 ∈ 𝐵) |
5 | grpinveu.p | . . . . . . . 8 ⊢ + = (+g‘𝐺) | |
6 | 2, 5 | grprcan 12744 | . . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ (𝑋 ∈ 𝐵 ∧ 0 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵)) → ((𝑋 + 𝑋) = ( 0 + 𝑋) ↔ 𝑋 = 0 )) |
7 | 6 | 3exp2 1221 | . . . . . 6 ⊢ (𝐺 ∈ Grp → (𝑋 ∈ 𝐵 → ( 0 ∈ 𝐵 → (𝑋 ∈ 𝐵 → ((𝑋 + 𝑋) = ( 0 + 𝑋) ↔ 𝑋 = 0 ))))) |
8 | 4, 7 | mpid 42 | . . . . 5 ⊢ (𝐺 ∈ Grp → (𝑋 ∈ 𝐵 → (𝑋 ∈ 𝐵 → ((𝑋 + 𝑋) = ( 0 + 𝑋) ↔ 𝑋 = 0 )))) |
9 | 8 | pm2.43d 50 | . . . 4 ⊢ (𝐺 ∈ Grp → (𝑋 ∈ 𝐵 → ((𝑋 + 𝑋) = ( 0 + 𝑋) ↔ 𝑋 = 0 ))) |
10 | 9 | imp 123 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → ((𝑋 + 𝑋) = ( 0 + 𝑋) ↔ 𝑋 = 0 )) |
11 | 2, 5, 3 | grplid 12740 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → ( 0 + 𝑋) = 𝑋) |
12 | 11 | eqeq2d 2183 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → ((𝑋 + 𝑋) = ( 0 + 𝑋) ↔ (𝑋 + 𝑋) = 𝑋)) |
13 | 10, 12 | bitr3d 189 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋 = 0 ↔ (𝑋 + 𝑋) = 𝑋)) |
14 | 1, 13 | bitr2id 192 | 1 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → ((𝑋 + 𝑋) = 𝑋 ↔ 0 = 𝑋)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ↔ wb 104 = wceq 1349 ∈ wcel 2142 ‘cfv 5200 (class class class)co 5857 Basecbs 12420 +gcplusg 12484 0gc0g 12600 Grpcgrp 12712 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 705 ax-5 1441 ax-7 1442 ax-gen 1443 ax-ie1 1487 ax-ie2 1488 ax-8 1498 ax-10 1499 ax-11 1500 ax-i12 1501 ax-bndl 1503 ax-4 1504 ax-17 1520 ax-i9 1524 ax-ial 1528 ax-i5r 1529 ax-13 2144 ax-14 2145 ax-ext 2153 ax-sep 4108 ax-pow 4161 ax-pr 4195 ax-un 4419 ax-cnex 7869 ax-resscn 7870 ax-1re 7872 ax-addrcl 7875 |
This theorem depends on definitions: df-bi 116 df-3an 976 df-tru 1352 df-nf 1455 df-sb 1757 df-eu 2023 df-mo 2024 df-clab 2158 df-cleq 2164 df-clel 2167 df-nfc 2302 df-ral 2454 df-rex 2455 df-reu 2456 df-rmo 2457 df-rab 2458 df-v 2733 df-sbc 2957 df-csb 3051 df-un 3126 df-in 3128 df-ss 3135 df-pw 3569 df-sn 3590 df-pr 3591 df-op 3593 df-uni 3798 df-int 3833 df-br 3991 df-opab 4052 df-mpt 4053 df-id 4279 df-xp 4618 df-rel 4619 df-cnv 4620 df-co 4621 df-dm 4622 df-rn 4623 df-res 4624 df-iota 5162 df-fun 5202 df-fn 5203 df-fv 5208 df-riota 5813 df-ov 5860 df-inn 8883 df-2 8941 df-ndx 12423 df-slot 12424 df-base 12426 df-plusg 12497 df-0g 12602 df-mgm 12614 df-sgrp 12647 df-mnd 12657 df-grp 12715 |
This theorem is referenced by: isgrpid2 12747 grpidd2 12748 |
Copyright terms: Public domain | W3C validator |