Theorem isgrpinv 12756

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 12746	. . . . . . . . 9 |- ( x e. B -> ( N ` x ) = ( iota_ e e. B ( e .+ x ) = .0. ) )
6	5	ad2antlr 486	. . . . . . . 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 109	. . . . . . . . 9 |- ( ( ( ( G e. Grp /\ M : B --> B ) /\ x e. B ) /\ ( ( M ` x ) .+ x ) = .0. ) -> ( ( M ` x ) .+ x ) = .0. )
8		simpllr 529	. . . . . . . . . . 11 |- ( ( ( ( G e. Grp /\ M : B --> B ) /\ x e. B ) /\ ( ( M ` x ) .+ x ) = .0. ) -> M : B --> B )
9		simplr 525	. . . . . . . . . . 11 |- ( ( ( ( G e. Grp /\ M : B --> B ) /\ x e. B ) /\ ( ( M ` x ) .+ x ) = .0. ) -> x e. B )
10	8, 9	ffvelrnd 5632	. . . . . . . . . 10 |- ( ( ( ( G e. Grp /\ M : B --> B ) /\ x e. B ) /\ ( ( M ` x ) .+ x ) = .0. ) -> ( M ` x ) e. B )
11	1, 2, 3	grpinveu 12741	. . . . . . . . . . 11 |- ( ( G e. Grp /\ x e. B ) -> E! e e. B ( e .+ x ) = .0. )
12	11	ad4ant13 510	. . . . . . . . . 10 |- ( ( ( ( G e. Grp /\ M : B --> B ) /\ x e. B ) /\ ( ( M ` x ) .+ x ) = .0. ) -> E! e e. B ( e .+ x ) = .0. )
13		oveq1 5860	. . . . . . . . . . . 12 |- ( e = ( M ` x ) -> ( e .+ x ) = ( ( M ` x ) .+ x ) )
14	13	eqeq1d 2179	. . . . . . . . . . 11 |- ( e = ( M ` x ) -> ( ( e .+ x ) = .0. <-> ( ( M ` x ) .+ x ) = .0. ) )
15	14	riota2 5831	. . . . . . . . . 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 409	. . . . . . . . 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 146	. . . . . . . 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 2203	. . . . . . 7 |- ( ( ( ( G e. Grp /\ M : B --> B ) /\ x e. B ) /\ ( ( M ` x ) .+ x ) = .0. ) -> ( N ` x ) = ( M ` x ) )
19	18	ex 114	. . . . . 6 |- ( ( ( G e. Grp /\ M : B --> B ) /\ x e. B ) -> ( ( ( M ` x ) .+ x ) = .0. -> ( N ` x ) = ( M ` x ) ) )
20	19	ralimdva 2537	. . . . 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 377	. . . 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 12747	. . . . 5 |- ( G e. Grp -> N Fn B )
23		ffn 5347	. . . . . 6 |- ( M : B --> B -> M Fn B )
24	23	ad2antrl 487	. . . . 5 |- ( ( G e. Grp /\ ( M : B --> B /\ A. x e. B ( ( M ` x ) .+ x ) = .0. ) ) -> M Fn B )
25		eqfnfv 5593	. . . . 5 |- ( ( N Fn B /\ M Fn B ) -> ( N = M <-> A. x e. B ( N ` x ) = ( M ` x ) ) )
26	22, 24, 25	syl2an2r 590	. . . 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 166	. . 3 |- ( ( G e. Grp /\ ( M : B --> B /\ A. x e. B ( ( M ` x ) .+ x ) = .0. ) ) -> N = M )
28	27	ex 114	. 2 |- ( G e. Grp -> ( ( M : B --> B /\ A. x e. B ( ( M ` x ) .+ x ) = .0. ) -> N = M ) )
29	1, 4	grpinvf 12750	. . . 4 |- ( G e. Grp -> N : B --> B )
30	1, 2, 3, 4	grplinv 12752	. . . . 5 |- ( ( G e. Grp /\ x e. B ) -> ( ( N ` x ) .+ x ) = .0. )
31	30	ralrimiva 2543	. . . 4 |- ( G e. Grp -> A. x e. B ( ( N ` x ) .+ x ) = .0. )
32	29, 31	jca 304	. . 3 |- ( G e. Grp -> ( N : B --> B /\ A. x e. B ( ( N ` x ) .+ x ) = .0. ) )
33		feq1 5330	. . . 4 |- ( N = M -> ( N : B --> B <-> M : B --> B ) )
34		fveq1 5495	. . . . . . 7 |- ( N = M -> ( N ` x ) = ( M ` x ) )
35	34	oveq1d 5868	. . . . . 6 |- ( N = M -> ( ( N ` x ) .+ x ) = ( ( M ` x ) .+ x ) )
36	35	eqeq1d 2179	. . . . 5 |- ( N = M -> ( ( ( N ` x ) .+ x ) = .0. <-> ( ( M ` x ) .+ x ) = .0. ) )
37	36	ralbidv 2470	. . . 4 |- ( N = M -> ( A. x e. B ( ( N ` x ) .+ x ) = .0. <-> A. x e. B ( ( M ` x ) .+ x ) = .0. ) )
38	33, 37	anbi12d 470	. . 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 154	. 2 |- ( G e. Grp -> ( N = M -> ( M : B --> B /\ A. x e. B ( ( M ` x ) .+ x ) = .0. ) ) )
40	28, 39	impbid 128	1 |- ( G e. Grp -> ( ( M : B --> B /\ A. x e. B ( ( M ` x ) .+ x ) = .0. ) <-> N = M ) )

Syntax hints:   -> wi 4   /\ wa 103   <-> wb 104   = wceq 1348   e. wcel 2141   A.wral 2448   E!wreu 2450   Fn wfn 5193   -->wf 5194   ` cfv 5198   iota_crio 5808  (class class class)co 5853   Basecbs 12416   +g cplusg 12480   0gc0g 12596   Grpcgrp 12708   invgcminusg 12709

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-13 2143  ax-14 2144  ax-ext 2152  ax-coll 4104  ax-sep 4107  ax-pow 4160  ax-pr 4194  ax-un 4418  ax-cnex 7865  ax-resscn 7866  ax-1re 7868  ax-addrcl 7871

This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ral 2453  df-rex 2454  df-reu 2455  df-rmo 2456  df-rab 2457  df-v 2732  df-sbc 2956  df-csb 3050  df-un 3125  df-in 3127  df-ss 3134  df-pw 3568  df-sn 3589  df-pr 3590  df-op 3592  df-uni 3797  df-int 3832  df-iun 3875  df-br 3990  df-opab 4051  df-mpt 4052  df-id 4278  df-xp 4617  df-rel 4618  df-cnv 4619  df-co 4620  df-dm 4621  df-rn 4622  df-res 4623  df-ima 4624  df-iota 5160  df-fun 5200  df-fn 5201  df-f 5202  df-f1 5203  df-fo 5204  df-f1o 5205  df-fv 5206  df-riota 5809  df-ov 5856  df-inn 8879  df-2 8937  df-ndx 12419  df-slot 12420  df-base 12422  df-plusg 12493  df-0g 12598  df-mgm 12610  df-sgrp 12643  df-mnd 12653  df-grp 12711  df-minusg 12712

This theorem is referenced by: (None)