Theorem mgpplusg 14222

Description: Value of the group operation of the multiplication group. (Contributed by Mario Carneiro, 21-Dec-2014.)

Hypotheses

Ref	Expression
mgpval.1	|- M = (mulGrp ` R )
mgpval.2	|- .x. = ( .r ` R )

Assertion

Ref	Expression
mgpplusg	|- .x. = ( +g ` M )

Proof of Theorem mgpplusg

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

Step	Hyp	Ref	Expression
1		df-slot 13356	. . . . . . . . 9 |- Slot ( .r ` ndx ) = ( x e. _V |-> ( x ` ( .r ` ndx ) ) )
2	1	funmpt2 5416	. . . . . . . 8 |- Fun Slot ( .r ` ndx )
3		mulridx 13485	. . . . . . . . 9 |- .r = Slot ( .r ` ndx )
4	3	funeqi 5398	. . . . . . . 8 |- ( Fun .r <-> Fun Slot ( .r ` ndx ) )
5	2, 4	mpbir 146	. . . . . . 7 |- Fun .r
6		funrel 5394	. . . . . . 7 |- ( Fun .r -> Rel .r )
7	5, 6	ax-mp 5	. . . . . 6 |- Rel .r
8		relelfvdm 5727	. . . . . 6 |- ( ( Rel .r /\ x e. ( .r ` R ) ) -> R e. dom .r )
9	7, 8	mpan 428	. . . . 5 |- ( x e. ( .r ` R ) -> R e. dom .r )
10	9	elexd 2835	. . . 4 |- ( x e. ( .r ` R ) -> R e. _V )
11		mgpval.2	. . . 4 |- .x. = ( .r ` R )
12	10, 11	eleq2s 2333	. . 3 |- ( x e. .x. -> R e. _V )
13		plusgslid 13466	. . . . 5 |- ( +g = Slot ( +g ` ndx ) /\ ( +g ` ndx ) e. NN )
14	13	slotm 13415	. . . 4 |- ( x e. ( +g ` M ) -> E. j j e. M )
15		fnmgp 14219	. . . . . . . . 9 |- mulGrp Fn _V
16		fnrel 5479	. . . . . . . . 9 |- (mulGrp Fn _V -> Rel mulGrp )
17	15, 16	ax-mp 5	. . . . . . . 8 |- Rel mulGrp
18		relelfvdm 5727	. . . . . . . 8 |- ( ( Rel mulGrp /\ j e. (mulGrp ` R ) ) -> R e. dom mulGrp )
19	17, 18	mpan 428	. . . . . . 7 |- ( j e. (mulGrp ` R ) -> R e. dom mulGrp )
20	19	elexd 2835	. . . . . 6 |- ( j e. (mulGrp ` R ) -> R e. _V )
21		mgpval.1	. . . . . 6 |- M = (mulGrp ` R )
22	20, 21	eleq2s 2333	. . . . 5 |- ( j e. M -> R e. _V )
23	22	exlimiv 1651	. . . 4 |- ( E. j j e. M -> R e. _V )
24	14, 23	syl 14	. . 3 |- ( x e. ( +g ` M ) -> R e. _V )
25	21, 11	mgpplusgg 14221	. . . 4 |- ( R e. _V -> .x. = ( +g ` M ) )
26	25	eleq2d 2308	. . 3 |- ( R e. _V -> ( x e. .x. <-> x e. ( +g ` M ) ) )
27	12, 24, 26	pm5.21nii 716	. 2 |- ( x e. .x. <-> x e. ( +g ` M ) )
28	27	eqriv 2235	1 |- .x. = ( +g ` M )

This proof depends on syntax axioms:   = wceq 1402   E.wex 1545   e. wcel 2209   _Vcvv 2821   dom cdm 4774   Rel wrel 4779   Fun wfun 5371   Fn wfn 5372   ` cfv 5377   ndxcnx 13349  Slot cslot 13351   +g cplusg 13431   .rcmulr 13432  mulGrpcmgp 14217

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  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-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1re 8273  ax-addrcl 8276

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-iota 5337  df-fun 5379  df-fn 5380  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-inn 9305  df-2 9363  df-3 9364  df-ndx 13355  df-slot 13356  df-sets 13359  df-plusg 13444  df-mulr 13445  df-mgp 14218

This theorem is used by:  assamulgscmlem2  15042