| 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 6822 | . . . 4 ⊢ (𝑔 = 𝐺 → (Base‘𝑔) = (Base‘𝐺)) | |
| 2 | isgrp.b | . . . 4 ⊢ 𝐵 = (Base‘𝐺) | |
| 3 | 1, 2 | eqtr4di 2784 | . . 3 ⊢ (𝑔 = 𝐺 → (Base‘𝑔) = 𝐵) |
| 4 | fveq2 6822 | . . . . . . 7 ⊢ (𝑔 = 𝐺 → (+g‘𝑔) = (+g‘𝐺)) | |
| 5 | isgrp.p | . . . . . . 7 ⊢ + = (+g‘𝐺) | |
| 6 | 4, 5 | eqtr4di 2784 | . . . . . 6 ⊢ (𝑔 = 𝐺 → (+g‘𝑔) = + ) |
| 7 | 6 | oveqd 7363 | . . . . 5 ⊢ (𝑔 = 𝐺 → (𝑚(+g‘𝑔)𝑎) = (𝑚 + 𝑎)) |
| 8 | fveq2 6822 | . . . . . 6 ⊢ (𝑔 = 𝐺 → (0g‘𝑔) = (0g‘𝐺)) | |
| 9 | isgrp.z | . . . . . 6 ⊢ 0 = (0g‘𝐺) | |
| 10 | 8, 9 | eqtr4di 2784 | . . . . 5 ⊢ (𝑔 = 𝐺 → (0g‘𝑔) = 0 ) |
| 11 | 7, 10 | eqeq12d 2747 | . . . 4 ⊢ (𝑔 = 𝐺 → ((𝑚(+g‘𝑔)𝑎) = (0g‘𝑔) ↔ (𝑚 + 𝑎) = 0 )) |
| 12 | 3, 11 | rexeqbidv 3313 | . . 3 ⊢ (𝑔 = 𝐺 → (∃𝑚 ∈ (Base‘𝑔)(𝑚(+g‘𝑔)𝑎) = (0g‘𝑔) ↔ ∃𝑚 ∈ 𝐵 (𝑚 + 𝑎) = 0 )) |
| 13 | 3, 12 | raleqbidv 3312 | . 2 ⊢ (𝑔 = 𝐺 → (∀𝑎 ∈ (Base‘𝑔)∃𝑚 ∈ (Base‘𝑔)(𝑚(+g‘𝑔)𝑎) = (0g‘𝑔) ↔ ∀𝑎 ∈ 𝐵 ∃𝑚 ∈ 𝐵 (𝑚 + 𝑎) = 0 )) |
| 14 | df-grp 18846 | . 2 ⊢ Grp = {𝑔 ∈ Mnd ∣ ∀𝑎 ∈ (Base‘𝑔)∃𝑚 ∈ (Base‘𝑔)(𝑚(+g‘𝑔)𝑎) = (0g‘𝑔)} | |
| 15 | 13, 14 | elrab2 3650 | 1 ⊢ (𝐺 ∈ Grp ↔ (𝐺 ∈ Mnd ∧ ∀𝑎 ∈ 𝐵 ∃𝑚 ∈ 𝐵 (𝑚 + 𝑎) = 0 )) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 ∧ wa 395 = wceq 1541 ∈ wcel 2111 ∀wral 3047 ∃wrex 3056 ‘cfv 6481 (class class class)co 7346 Basecbs 17117 +gcplusg 17158 0gc0g 17340 Mndcmnd 18639 Grpcgrp 18843 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-ext 2703 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-sb 2068 df-clab 2710 df-cleq 2723 df-clel 2806 df-ral 3048 df-rex 3057 df-rab 3396 df-v 3438 df-dif 3905 df-un 3907 df-ss 3919 df-nul 4284 df-if 4476 df-sn 4577 df-pr 4579 df-op 4583 df-uni 4860 df-br 5092 df-iota 6437 df-fv 6489 df-ov 7349 df-grp 18846 |
| This theorem is referenced by: grpmnd 18850 grpinvex 18853 grppropd 18861 isgrpd2e 18865 grp1 18957 ghmgrp 18976 primrootsunit1 42129 2zrngagrp 48279 |
| Copyright terms: Public domain | W3C validator |