Theorem mndsgrp 17299

Description: A monoid is a semigroup. (Contributed by FL, 2-Nov-2009.) (Revised by AV, 6-Jan-2020.) (Proof shortened by AV, 6-Feb-2020.)

Assertion

Ref	Expression
mndsgrp	|- ( G e. Mnd -> G e. SGrp )

Proof of Theorem mndsgrp

Dummy variables e x are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2622	. . 3 |- ( Base ` G ) = ( Base ` G )
2		eqid 2622	. . 3 |- ( +g ` G ) = ( +g ` G )
3	1, 2	ismnddef 17296	. 2 |- ( G e. Mnd <-> ( G e. SGrp /\ E. e e. ( Base ` G ) A. x e. ( Base ` G ) ( ( e ( +g ` G ) x ) = x /\ ( x ( +g ` G ) e ) = x ) ) )
4	3	simplbi 476	1 |- ( G e. Mnd -> G e. SGrp )

Syntax hints:   -> wi 4   /\ wa 384   = wceq 1483   e. wcel 1990   A.wral 2912   E.wrex 2913   ` cfv 5888  (class class class)co 6650   Basecbs 15857   +g cplusg 15941  SGrpcsgrp 17283   Mndcmnd 17294

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-nul 4789

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-sbc 3436  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-iota 5851  df-fv 5896  df-ov 6653  df-mnd 17295

This theorem is referenced by:  mndmgm  17300  mndass  17302  mndsssgrp  17421  grpsgrp  17446  mulgnn0dir  17571  mulgnn0ass  17578  ringrng  41879