Theorem isgrp 13811

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.)

Hypotheses

Ref	Expression
isgrp.b	|- B = ( Base ` G )
isgrp.p	|- .+ = ( +g ` G )
isgrp.z	|- .0. = ( 0g ` G )

Assertion

Ref	Expression
isgrp	|- ( G e. Grp <-> ( G e. Mnd /\ A. a e. B E. m e. B ( m .+ a ) = .0. ) )

Distinct variable groups:   m, a, B   G, a, m

Allowed substitution hints:   .+ ( m, a)   .0. ( m, a)

Proof of Theorem isgrp

Dummy variable g is distinct from all other variables.

Step	Hyp	Ref	Expression
1		fveq2 5695	. . . 4 |- ( g = G -> ( Base ` g ) = ( Base ` G ) )
2		isgrp.b	. . . 4 |- B = ( Base ` G )
3	1, 2	eqtr4di 2289	. . 3 |- ( g = G -> ( Base ` g ) = B )
4		fveq2 5695	. . . . . . 7 |- ( g = G -> ( +g ` g ) = ( +g ` G ) )
5		isgrp.p	. . . . . . 7 |- .+ = ( +g ` G )
6	4, 5	eqtr4di 2289	. . . . . 6 |- ( g = G -> ( +g ` g ) = .+ )
7	6	oveqd 6102	. . . . 5 |- ( g = G -> ( m ( +g ` g ) a ) = ( m .+ a ) )
8		fveq2 5695	. . . . . 6 |- ( g = G -> ( 0g ` g ) = ( 0g ` G ) )
9		isgrp.z	. . . . . 6 |- .0. = ( 0g ` G )
10	8, 9	eqtr4di 2289	. . . . 5 |- ( g = G -> ( 0g ` g ) = .0. )
11	7, 10	eqeq12d 2253	. . . 4 |- ( g = G -> ( ( m ( +g ` g ) a ) = ( 0g ` g ) <-> ( m .+ a ) = .0. ) )
12	3, 11	rexeqbidv 2766	. . 3 |- ( g = G -> ( E. m e. ( Base ` g ) ( m ( +g ` g ) a ) = ( 0g ` g ) <-> E. m e. B ( m .+ a ) = .0. ) )
13	3, 12	raleqbidv 2765	. 2 |- ( g = G -> ( A. a e. ( Base ` g ) E. m e. ( Base ` g ) ( m ( +g ` g ) a ) = ( 0g ` g ) <-> A. a e. B E. m e. B ( m .+ a ) = .0. ) )
14		df-grp 13808	. 2 |- Grp = { g e. Mnd | A. a e. ( Base ` g ) E. m e. ( Base ` g ) ( m ( +g ` g ) a ) = ( 0g ` g ) }
15	13, 14	elrab2 2985	1 |- ( G e. Grp <-> ( G e. Mnd /\ A. a e. B E. m e. B ( m .+ a ) = .0. ) )

This proof depends on syntax axioms:   /\ wa 104   <-> wb 105   = wceq 1402   e. wcel 2209   A.wral 2528   E.wrex 2529   ` cfv 5377  (class class class)co 6085   Basecbs 13352   +g cplusg 13431   0gc0g 13610   Mndcmnd 13729   Grpcgrp 13805

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-un 3224  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-iota 5337  df-fv 5385  df-ov 6088  df-grp 13808

This theorem is used by:  grpmnd  13812  grpinvex  13815  grppropd  13822  isgrpd2e  13825  grp1  13911  ghmgrp  13921