| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > isgrp | Structured version Visualization version GIF version | ||
| Description: The predicate "is a group". (This theorem demonstrates the use of symbols as variable names, first proposed by FL in 2010.) (Contributed by NM, 17-Oct-2012.) (Revised by Mario Carneiro, 6-Jan-2015.) |
| Ref | Expression |
|---|---|
| isgrp.b | ⊢ 𝐵 = (Base‘𝐺) |
| isgrp.p | ⊢ + = (+g‘𝐺) |
| isgrp.z | ⊢ 0 = (0g‘𝐺) |
| Ref | Expression |
|---|---|
| isgrp | ⊢ (𝐺 ∈ Grp ↔ (𝐺 ∈ Mnd ∧ ∀𝑎 ∈ 𝐵 ∃𝑚 ∈ 𝐵 (𝑚 + 𝑎) = 0 )) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fveq2 6871 | . . . 4 ⊢ (𝑔 = 𝐺 → (Base‘𝑔) = (Base‘𝐺)) | |
| 2 | isgrp.b | . . . 4 ⊢ 𝐵 = (Base‘𝐺) | |
| 3 | 1, 2 | eqtr4di 2818 | . . 3 ⊢ (𝑔 = 𝐺 → (Base‘𝑔) = 𝐵) |
| 4 | fveq2 6871 | . . . . . . 7 ⊢ (𝑔 = 𝐺 → (+g‘𝑔) = (+g‘𝐺)) | |
| 5 | isgrp.p | . . . . . . 7 ⊢ + = (+g‘𝐺) | |
| 6 | 4, 5 | eqtr4di 2818 | . . . . . 6 ⊢ (𝑔 = 𝐺 → (+g‘𝑔) = + ) |
| 7 | 6 | oveqd 7417 | . . . . 5 ⊢ (𝑔 = 𝐺 → (𝑚(+g‘𝑔)𝑎) = (𝑚 + 𝑎)) |
| 8 | fveq2 6871 | . . . . . 6 ⊢ (𝑔 = 𝐺 → (0g‘𝑔) = (0g‘𝐺)) | |
| 9 | isgrp.z | . . . . . 6 ⊢ 0 = (0g‘𝐺) | |
| 10 | 8, 9 | eqtr4di 2818 | . . . . 5 ⊢ (𝑔 = 𝐺 → (0g‘𝑔) = 0 ) |
| 11 | 7, 10 | eqeq12d 2781 | . . . 4 ⊢ (𝑔 = 𝐺 → ((𝑚(+g‘𝑔)𝑎) = (0g‘𝑔) ↔ (𝑚 + 𝑎) = 0 )) |
| 12 | 3, 11 | rexeqbidv 3340 | . . 3 ⊢ (𝑔 = 𝐺 → (∃𝑚 ∈ (Base‘𝑔)(𝑚(+g‘𝑔)𝑎) = (0g‘𝑔) ↔ ∃𝑚 ∈ 𝐵 (𝑚 + 𝑎) = 0 )) |
| 13 | 3, 12 | raleqbidv 3339 | . 2 ⊢ (𝑔 = 𝐺 → (∀𝑎 ∈ (Base‘𝑔)∃𝑚 ∈ (Base‘𝑔)(𝑚(+g‘𝑔)𝑎) = (0g‘𝑔) ↔ ∀𝑎 ∈ 𝐵 ∃𝑚 ∈ 𝐵 (𝑚 + 𝑎) = 0 )) |
| 14 | df-grp 18993 | . 2 ⊢ Grp = {𝑔 ∈ Mnd ∣ ∀𝑎 ∈ (Base‘𝑔)∃𝑚 ∈ (Base‘𝑔)(𝑚(+g‘𝑔)𝑎) = (0g‘𝑔)} | |
| 15 | 13, 14 | elrab2 3657 | 1 ⊢ (𝐺 ∈ Grp ↔ (𝐺 ∈ Mnd ∧ ∀𝑎 ∈ 𝐵 ∃𝑚 ∈ 𝐵 (𝑚 + 𝑎) = 0 )) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 209 ∧ wa 400 = wceq 1563 ∈ wcel 2145 ∀wral 3079 ∃wrex 3089 ‘cfv 6525 (class class class)co 7400 Basecbs 17259 +gcplusg 17300 0gc0g 17482 Mndcmnd 18782 Grpcgrp 18990 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-ext 2737 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-sb 2094 df-clab 2744 df-cleq 2757 df-clel 2840 df-ral 3080 df-rex 3090 df-rab 3418 df-v 3459 df-dif 3910 df-un 3912 df-ss 3924 df-nul 4289 df-if 4484 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4869 df-br 5106 df-iota 6481 df-fv 6533 df-ov 7403 df-grp 18993 |
| This theorem is referenced by: grpmnd 18997 grpinvex 19000 grppropd 19008 isgrpd2e 19012 grp1 19104 ghmgrp 19123 primrootsunit1 42726 2zrngagrp 48869 |
| Copyright terms: Public domain | W3C validator |