| 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 2767 | . 2 ⊢ ( 0 = 𝑋 ↔ 𝑋 = 0 ) | |
| 2 | grpinveu.b | . . . . . . 7 ⊢ 𝐵 = (Base‘𝐺) | |
| 3 | grpinveu.o | . . . . . . 7 ⊢ 0 = (0g‘𝐺) | |
| 4 | 2, 3 | grpidcl 19137 | . . . . . 6 ⊢ (𝐺 ∈ Grp → 0 ∈ 𝐵) |
| 5 | grpinveu.p | . . . . . . . 8 ⊢ + = (+g‘𝐺) | |
| 6 | 2, 5 | grprcan 19145 | . . . . . . 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 19139 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → ( 0 + 𝑋) = 𝑋) |
| 12 | 11 | eqeq2d 2771 | . . 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 2145 ‘cfv 6527 (class class class)co 7408 Basecbs 17348 +gcplusg 17389 0gc0g 17571 Grpcgrp 19105 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pr 5390 |
| 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 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-nul 4279 df-if 4482 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5542 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-iota 6483 df-fun 6529 df-fv 6535 df-riota 7365 df-ov 7411 df-0g 17573 df-mgm 18777 df-sgrp 18869 df-mnd 18885 df-grp 19108 |
| This theorem is used by: isgrpid2 19148 grpidd2 19149 subg0 19303 qus0 19365 ghmid 19397 isdrng2 20958 lmod0vid 21130 cnfld0 21663 psr0 22226 psd1 22449 ldual0v 40127 erng0g 41971 |
| Copyright terms: Public domain | W3C validator |