| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > grpid | Structured version Visualization version 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 2770 | . 2 ⊢ ( 0 = 𝑋 ↔ 𝑋 = 0 ) | |
| 2 | grpinveu.b | . . . . . . 7 ⊢ 𝐵 = (Base‘𝐺) | |
| 3 | grpinveu.o | . . . . . . 7 ⊢ 0 = (0g‘𝐺) | |
| 4 | 2, 3 | grpidcl 19205 | . . . . . 6 ⊢ (𝐺 ∈ Grp → 0 ∈ 𝐵) |
| 5 | grpinveu.p | . . . . . . . 8 ⊢ + = (+g‘𝐺) | |
| 6 | 2, 5 | grprcan 19213 | . . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ (𝑋 ∈ 𝐵 ∧ 0 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵)) → ((𝑋 + 𝑋) = ( 0 + 𝑋) ↔ 𝑋 = 0 )) |
| 7 | 6 | 3exp2 1373 | . . . . . 6 ⊢ (𝐺 ∈ Grp → (𝑋 ∈ 𝐵 → ( 0 ∈ 𝐵 → (𝑋 ∈ 𝐵 → ((𝑋 + 𝑋) = ( 0 + 𝑋) ↔ 𝑋 = 0 ))))) |
| 8 | 4, 7 | mpid 45 | . . . . 5 ⊢ (𝐺 ∈ Grp → (𝑋 ∈ 𝐵 → (𝑋 ∈ 𝐵 → ((𝑋 + 𝑋) = ( 0 + 𝑋) ↔ 𝑋 = 0 )))) |
| 9 | 8 | pm2.43d 54 | . . . 4 ⊢ (𝐺 ∈ Grp → (𝑋 ∈ 𝐵 → ((𝑋 + 𝑋) = ( 0 + 𝑋) ↔ 𝑋 = 0 ))) |
| 10 | 9 | imp 412 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → ((𝑋 + 𝑋) = ( 0 + 𝑋) ↔ 𝑋 = 0 )) |
| 11 | 2, 5, 3 | grplid 19207 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → ( 0 + 𝑋) = 𝑋) |
| 12 | 11 | eqeq2d 2774 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → ((𝑋 + 𝑋) = ( 0 + 𝑋) ↔ (𝑋 + 𝑋) = 𝑋)) |
| 13 | 10, 12 | bitr3d 284 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋 = 0 ↔ (𝑋 + 𝑋) = 𝑋)) |
| 14 | 1, 13 | bitr2id 287 | 1 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → ((𝑋 + 𝑋) = 𝑋 ↔ 0 = 𝑋)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2147 ‘cfv 6558 (class class class)co 7443 Basecbs 17416 +gcplusg 17457 0gc0g 17639 Grpcgrp 19173 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5252 ax-nul 5263 ax-pr 5395 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-br 5107 df-opab 5171 df-mpt 5190 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-iota 6512 df-fun 6560 df-fv 6566 df-riota 7400 df-ov 7446 df-0g 17641 df-mgm 18845 df-sgrp 18937 df-mnd 18953 df-grp 19176 |
| This theorem is used by: isgrpid2 19216 grpidd2 19217 subg0 19371 qus0 19433 ghmid 19465 isdrng2 21027 lmod0vid 21199 cnfld0 21732 psr0 22295 psd1 22518 ldual0v 40399 erng0g 42243 |
| Copyright terms: Public domain | W3C validator |