![]() |
Mathbox for BJ |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > bj-grpssmnd | Structured version Visualization version GIF version |
Description: Groups are monoids. (Contributed by BJ, 5-Jan-2024.) (Proof modification is discouraged.) |
Ref | Expression |
---|---|
bj-grpssmnd | ⊢ Grp ⊆ Mnd |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-grp 18906 | . 2 ⊢ Grp = {𝑥 ∈ Mnd ∣ ∀𝑦 ∈ (Base‘𝑥)∃𝑧 ∈ (Base‘𝑥)(𝑧(+g‘𝑥)𝑦) = (0g‘𝑥)} | |
2 | 1 | ssrab3 4076 | 1 ⊢ Grp ⊆ Mnd |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1533 ∀wral 3050 ∃wrex 3059 ⊆ wss 3944 ‘cfv 6549 (class class class)co 7419 Basecbs 17188 +gcplusg 17241 0gc0g 17429 Mndcmnd 18702 Grpcgrp 18903 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-ext 2696 |
This theorem depends on definitions: df-bi 206 df-an 395 df-ex 1774 df-sb 2060 df-clab 2703 df-cleq 2717 df-clel 2802 df-rab 3419 df-ss 3961 df-grp 18906 |
This theorem is referenced by: bj-grpssmndel 36887 |
Copyright terms: Public domain | W3C validator |