| 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 6882 | . . . 4 ⊢ (𝑔 = 𝐺 → (Base‘𝑔) = (Base‘𝐺)) | |
| 2 | isgrp.b | . . . 4 ⊢ 𝐵 = (Base‘𝐺) | |
| 3 | 1, 2 | eqtr4di 2815 | . . 3 ⊢ (𝑔 = 𝐺 → (Base‘𝑔) = 𝐵) |
| 4 | fveq2 6882 | . . . . . . 7 ⊢ (𝑔 = 𝐺 → (+g‘𝑔) = (+g‘𝐺)) | |
| 5 | isgrp.p | . . . . . . 7 ⊢ + = (+g‘𝐺) | |
| 6 | 4, 5 | eqtr4di 2815 | . . . . . 6 ⊢ (𝑔 = 𝐺 → (+g‘𝑔) = + ) |
| 7 | 6 | oveqd 7434 | . . . . 5 ⊢ (𝑔 = 𝐺 → (𝑚(+g‘𝑔)𝑎) = (𝑚 + 𝑎)) |
| 8 | fveq2 6882 | . . . . . 6 ⊢ (𝑔 = 𝐺 → (0g‘𝑔) = (0g‘𝐺)) | |
| 9 | isgrp.z | . . . . . 6 ⊢ 0 = (0g‘𝐺) | |
| 10 | 8, 9 | eqtr4di 2815 | . . . . 5 ⊢ (𝑔 = 𝐺 → (0g‘𝑔) = 0 ) |
| 11 | 7, 10 | eqeq12d 2778 | . . . 4 ⊢ (𝑔 = 𝐺 → ((𝑚(+g‘𝑔)𝑎) = (0g‘𝑔) ↔ (𝑚 + 𝑎) = 0 )) |
| 12 | 3, 11 | rexeqbidv 3337 | . . 3 ⊢ (𝑔 = 𝐺 → (∃𝑚 ∈ (Base‘𝑔)(𝑚(+g‘𝑔)𝑎) = (0g‘𝑔) ↔ ∃𝑚 ∈ 𝐵 (𝑚 + 𝑎) = 0 )) |
| 13 | 3, 12 | raleqbidv 3336 | . 2 ⊢ (𝑔 = 𝐺 → (∀𝑎 ∈ (Base‘𝑔)∃𝑚 ∈ (Base‘𝑔)(𝑚(+g‘𝑔)𝑎) = (0g‘𝑔) ↔ ∀𝑎 ∈ 𝐵 ∃𝑚 ∈ 𝐵 (𝑚 + 𝑎) = 0 )) |
| 14 | df-grp 19066 | . 2 ⊢ Grp = {𝑔 ∈ Mnd ∣ ∀𝑎 ∈ (Base‘𝑔)∃𝑚 ∈ (Base‘𝑔)(𝑚(+g‘𝑔)𝑎) = (0g‘𝑔)} | |
| 15 | 13, 14 | elrab2 3652 | 1 ⊢ (𝐺 ∈ Grp ↔ (𝐺 ∈ Mnd ∧ ∀𝑎 ∈ 𝐵 ∃𝑚 ∈ 𝐵 (𝑚 + 𝑎) = 0 )) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ∀wral 3078 ∃wrex 3088 ‘cfv 6537 (class class class)co 7417 Basecbs 17307 +gcplusg 17348 0gc0g 17530 Mndcmnd 18842 Grpcgrp 19063 |
| 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-ext 2734 |
| 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-sb 2100 df-clab 2741 df-cleq 2754 df-clel 2837 df-ral 3079 df-rex 3089 df-rab 3415 df-v 3455 df-dif 3905 df-un 3907 df-ss 3919 df-nul 4283 df-if 4486 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-br 5108 df-iota 6493 df-fv 6545 df-ov 7420 df-grp 19066 |
| This theorem is used by: grpmnd 19070 grpinvex 19073 grppropd 19081 isgrpd2e 19085 grp1 19176 ghmgrp 19195 primrootsunit1 42971 2zrngagrp 49172 |
| Copyright terms: Public domain | W3C validator |