Theorem isgrpinv 13256

Description: Properties showing that a function M is the inverse function of a group. (Contributed by NM, 7-Aug-2013.) (Revised by Mario Carneiro, 2-Oct-2015.)

Hypotheses

Ref	Expression
grpinv.b	|- B = ( Base ` G )
grpinv.p	|- .+ = ( +g ` G )
grpinv.u	|- .0. = ( 0g ` G )
grpinv.n	|- N = ( invg ` G )

Assertion

Ref	Expression
isgrpinv	|- ( G e. Grp -> ( ( M : B --> B /\ A. x e. B ( ( M ` x ) .+ x ) = .0. ) <-> N = M ) )

Distinct variable groups:   x, B   x, G   x, .0.   x, .+   x, M   x, N

Proof of Theorem isgrpinv

Dummy variable e is distinct from all other variables.

Step	Hyp	Ref	Expression
1		grpinv.b	. . . . . . . . . 10 |- B = ( Base ` G )
2		grpinv.p	. . . . . . . . . 10 |- .+ = ( +g ` G )
3		grpinv.u	. . . . . . . . . 10 |- .0. = ( 0g ` G )
4		grpinv.n	. . . . . . . . . 10 |- N = ( invg ` G )
5	1, 2, 3, 4	grpinvval 13245	. . . . . . . . 9 |- ( x e. B -> ( N ` x ) = ( iota_ e e. B ( e .+ x ) = .0. ) )
6	5	ad2antlr 489	. . . . . . . 8 |- ( ( ( ( G e. Grp /\ M : B --> B ) /\ x e. B ) /\ ( ( M ` x ) .+ x ) = .0. ) -> ( N ` x ) = ( iota_ e e. B ( e .+ x ) = .0. ) )
7		simpr 110	. . . . . . . . 9 |- ( ( ( ( G e. Grp /\ M : B --> B ) /\ x e. B ) /\ ( ( M ` x ) .+ x ) = .0. ) -> ( ( M ` x ) .+ x ) = .0. )
8		simpllr 534	. . . . . . . . . . 11 |- ( ( ( ( G e. Grp /\ M : B --> B ) /\ x e. B ) /\ ( ( M ` x ) .+ x ) = .0. ) -> M : B --> B )
9		simplr 528	. . . . . . . . . . 11 |- ( ( ( ( G e. Grp /\ M : B --> B ) /\ x e. B ) /\ ( ( M ` x ) .+ x ) = .0. ) -> x e. B )
10	8, 9	ffvelcdmd 5701	. . . . . . . . . 10 |- ( ( ( ( G e. Grp /\ M : B --> B ) /\ x e. B ) /\ ( ( M ` x ) .+ x ) = .0. ) -> ( M ` x ) e. B )
11	1, 2, 3	grpinveu 13240	. . . . . . . . . . 11 |- ( ( G e. Grp /\ x e. B ) -> E! e e. B ( e .+ x ) = .0. )
12	11	ad4ant13 513	. . . . . . . . . 10 |- ( ( ( ( G e. Grp /\ M : B --> B ) /\ x e. B ) /\ ( ( M ` x ) .+ x ) = .0. ) -> E! e e. B ( e .+ x ) = .0. )
13		oveq1 5932	. . . . . . . . . . . 12 |- ( e = ( M ` x ) -> ( e .+ x ) = ( ( M ` x ) .+ x ) )
14	13	eqeq1d 2205	. . . . . . . . . . 11 |- ( e = ( M ` x ) -> ( ( e .+ x ) = .0. <-> ( ( M ` x ) .+ x ) = .0. ) )
15	14	riota2 5903	. . . . . . . . . 10 |- ( ( ( M ` x ) e. B /\ E! e e. B ( e .+ x ) = .0. ) -> ( ( ( M ` x ) .+ x ) = .0. <-> ( iota_ e e. B ( e .+ x ) = .0. ) = ( M ` x ) ) )
16	10, 12, 15	syl2anc 411	. . . . . . . . 9 |- ( ( ( ( G e. Grp /\ M : B --> B ) /\ x e. B ) /\ ( ( M ` x ) .+ x ) = .0. ) -> ( ( ( M ` x ) .+ x ) = .0. <-> ( iota_ e e. B ( e .+ x ) = .0. ) = ( M ` x ) ) )
17	7, 16	mpbid 147	. . . . . . . 8 |- ( ( ( ( G e. Grp /\ M : B --> B ) /\ x e. B ) /\ ( ( M ` x ) .+ x ) = .0. ) -> ( iota_ e e. B ( e .+ x ) = .0. ) = ( M ` x ) )
18	6, 17	eqtrd 2229	. . . . . . 7 |- ( ( ( ( G e. Grp /\ M : B --> B ) /\ x e. B ) /\ ( ( M ` x ) .+ x ) = .0. ) -> ( N ` x ) = ( M ` x ) )
19	18	ex 115	. . . . . 6 |- ( ( ( G e. Grp /\ M : B --> B ) /\ x e. B ) -> ( ( ( M ` x ) .+ x ) = .0. -> ( N ` x ) = ( M ` x ) ) )
20	19	ralimdva 2564	. . . . 5 |- ( ( G e. Grp /\ M : B --> B ) -> ( A. x e. B ( ( M ` x ) .+ x ) = .0. -> A. x e. B ( N ` x ) = ( M ` x ) ) )
21	20	impr 379	. . . 4 |- ( ( G e. Grp /\ ( M : B --> B /\ A. x e. B ( ( M ` x ) .+ x ) = .0. ) ) -> A. x e. B ( N ` x ) = ( M ` x ) )
22	1, 4	grpinvfng 13246	. . . . 5 |- ( G e. Grp -> N Fn B )
23		ffn 5410	. . . . . 6 |- ( M : B --> B -> M Fn B )
24	23	ad2antrl 490	. . . . 5 |- ( ( G e. Grp /\ ( M : B --> B /\ A. x e. B ( ( M ` x ) .+ x ) = .0. ) ) -> M Fn B )
25		eqfnfv 5662	. . . . 5 |- ( ( N Fn B /\ M Fn B ) -> ( N = M <-> A. x e. B ( N ` x ) = ( M ` x ) ) )
26	22, 24, 25	syl2an2r 595	. . . 4 |- ( ( G e. Grp /\ ( M : B --> B /\ A. x e. B ( ( M ` x ) .+ x ) = .0. ) ) -> ( N = M <-> A. x e. B ( N ` x ) = ( M ` x ) ) )
27	21, 26	mpbird 167	. . 3 |- ( ( G e. Grp /\ ( M : B --> B /\ A. x e. B ( ( M ` x ) .+ x ) = .0. ) ) -> N = M )
28	27	ex 115	. 2 |- ( G e. Grp -> ( ( M : B --> B /\ A. x e. B ( ( M ` x ) .+ x ) = .0. ) -> N = M ) )
29	1, 4	grpinvf 13249	. . . 4 |- ( G e. Grp -> N : B --> B )
30	1, 2, 3, 4	grplinv 13252	. . . . 5 |- ( ( G e. Grp /\ x e. B ) -> ( ( N ` x ) .+ x ) = .0. )
31	30	ralrimiva 2570	. . . 4 |- ( G e. Grp -> A. x e. B ( ( N ` x ) .+ x ) = .0. )
32	29, 31	jca 306	. . 3 |- ( G e. Grp -> ( N : B --> B /\ A. x e. B ( ( N ` x ) .+ x ) = .0. ) )
33		feq1 5393	. . . 4 |- ( N = M -> ( N : B --> B <-> M : B --> B ) )
34		fveq1 5560	. . . . . . 7 |- ( N = M -> ( N ` x ) = ( M ` x ) )
35	34	oveq1d 5940	. . . . . 6 |- ( N = M -> ( ( N ` x ) .+ x ) = ( ( M ` x ) .+ x ) )
36	35	eqeq1d 2205	. . . . 5 |- ( N = M -> ( ( ( N ` x ) .+ x ) = .0. <-> ( ( M ` x ) .+ x ) = .0. ) )
37	36	ralbidv 2497	. . . 4 |- ( N = M -> ( A. x e. B ( ( N ` x ) .+ x ) = .0. <-> A. x e. B ( ( M ` x ) .+ x ) = .0. ) )
38	33, 37	anbi12d 473	. . 3 |- ( N = M -> ( ( N : B --> B /\ A. x e. B ( ( N ` x ) .+ x ) = .0. ) <-> ( M : B --> B /\ A. x e. B ( ( M ` x ) .+ x ) = .0. ) ) )
39	32, 38	syl5ibcom 155	. 2 |- ( G e. Grp -> ( N = M -> ( M : B --> B /\ A. x e. B ( ( M ` x ) .+ x ) = .0. ) ) )
40	28, 39	impbid 129	1 |- ( G e. Grp -> ( ( M : B --> B /\ A. x e. B ( ( M ` x ) .+ x ) = .0. ) <-> N = M ) )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1364   e. wcel 2167   A.wral 2475   E!wreu 2477   Fn wfn 5254   -->wf 5255   ` cfv 5259   iota_crio 5879  (class class class)co 5925   Basecbs 12703   +g cplusg 12780   0gc0g 12958   Grpcgrp 13202   invgcminusg 13203

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-coll 4149  ax-sep 4152  ax-pow 4208  ax-pr 4243  ax-un 4469  ax-cnex 7987  ax-resscn 7988  ax-1re 7990  ax-addrcl 7993

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ral 2480  df-rex 2481  df-reu 2482  df-rmo 2483  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-un 3161  df-in 3163  df-ss 3170  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-int 3876  df-iun 3919  df-br 4035  df-opab 4096  df-mpt 4097  df-id 4329  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-res 4676  df-ima 4677  df-iota 5220  df-fun 5261  df-fn 5262  df-f 5263  df-f1 5264  df-fo 5265  df-f1o 5266  df-fv 5267  df-riota 5880  df-ov 5928  df-inn 9008  df-2 9066  df-ndx 12706  df-slot 12707  df-base 12709  df-plusg 12793  df-0g 12960  df-mgm 13058  df-sgrp 13104  df-mnd 13119  df-grp 13205  df-minusg 13206

This theorem is referenced by: (None)