Theorem cntrval 14145

Description: Substitute definition of the center. (Contributed by Stefan O'Rear, 5-Sep-2015.)

Hypotheses

Ref	Expression
cntrval.b	|- B = ( Base ` M )
cntrval.z	|- Z = (Cntz ` M )

Assertion

Ref	Expression
cntrval	|- ( Z ` B ) = (Cntr ` M )

Proof of Theorem cntrval

Dummy variables k m j s x y are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		elfvm 5729	. . . 4 |- ( k e. ( Z ` B ) -> E. j j e. Z )
2		df-cntz 14142	. . . . . . 7 |- Cntz = ( m e. _V |-> ( s e. ~P ( Base ` m ) |-> { x e. ( Base ` m ) | A. y e. s ( x ( +g ` m ) y ) = ( y ( +g ` m ) x ) } ) )
3	2	mptrcl 5788	. . . . . 6 |- ( j e. (Cntz ` M ) -> M e. _V )
4		cntrval.z	. . . . . 6 |- Z = (Cntz ` M )
5	3, 4	eleq2s 2333	. . . . 5 |- ( j e. Z -> M e. _V )
6	5	exlimiv 1651	. . . 4 |- ( E. j j e. Z -> M e. _V )
7	1, 6	syl 14	. . 3 |- ( k e. ( Z ` B ) -> M e. _V )
8		df-cntr 14143	. . . 4 |- Cntr = ( m e. _V |-> ( (Cntz ` m ) ` ( Base ` m ) ) )
9	8	mptrcl 5788	. . 3 |- ( k e. (Cntr ` M ) -> M e. _V )
10		fveq2 5695	. . . . . . . 8 |- ( m = M -> (Cntz ` m ) = (Cntz ` M ) )
11	10, 4	eqtr4di 2289	. . . . . . 7 |- ( m = M -> (Cntz ` m ) = Z )
12		fveq2 5695	. . . . . . . 8 |- ( m = M -> ( Base ` m ) = ( Base ` M ) )
13		cntrval.b	. . . . . . . 8 |- B = ( Base ` M )
14	12, 13	eqtr4di 2289	. . . . . . 7 |- ( m = M -> ( Base ` m ) = B )
15	11, 14	fveq12d 5702	. . . . . 6 |- ( m = M -> ( (Cntz ` m ) ` ( Base ` m ) ) = ( Z ` B ) )
16		id 19	. . . . . 6 |- ( M e. _V -> M e. _V )
17	4	cntzex 14144	. . . . . . 7 |- ( M e. _V -> Z e. _V )
18		basfn 13463	. . . . . . . . 9 |- Base Fn _V
19		funfvex 5712	. . . . . . . . . 10 |- ( ( Fun Base /\ M e. dom Base ) -> ( Base ` M ) e. _V )
20	19	funfni 5483	. . . . . . . . 9 |- ( ( Base Fn _V /\ M e. _V ) -> ( Base ` M ) e. _V )
21	18, 20	mpan 428	. . . . . . . 8 |- ( M e. _V -> ( Base ` M ) e. _V )
22	13, 21	eqeltrid 2325	. . . . . . 7 |- ( M e. _V -> B e. _V )
23		fvexg 5714	. . . . . . 7 |- ( ( Z e. _V /\ B e. _V ) -> ( Z ` B ) e. _V )
24	17, 22, 23	syl2anc 415	. . . . . 6 |- ( M e. _V -> ( Z ` B ) e. _V )
25	8, 15, 16, 24	fvmptd3 5799	. . . . 5 |- ( M e. _V -> (Cntr ` M ) = ( Z ` B ) )
26	25	eqcomd 2244	. . . 4 |- ( M e. _V -> ( Z ` B ) = (Cntr ` M ) )
27	26	eleq2d 2308	. . 3 |- ( M e. _V -> ( k e. ( Z ` B ) <-> k e. (Cntr ` M ) ) )
28	7, 9, 27	pm5.21nii 716	. 2 |- ( k e. ( Z ` B ) <-> k e. (Cntr ` M ) )
29	28	eqriv 2235	1 |- ( Z ` B ) = (Cntr ` M )

This proof depends on syntax axioms:   = wceq 1402   E.wex 1545   e. wcel 2209   A.wral 2528   {crab 2532   _Vcvv 2821   ~Pcpw 3688   |-> cmpt 4192   Fn wfn 5372   ` cfv 5377  (class class class)co 6085   Basecbs 13404   +g cplusg 13484  Cntzccntz 14140  Cntrccntr 14141

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-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-cnex 8271  ax-resscn 8272  ax-1re 8274  ax-addrcl 8277

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  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-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  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-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-ov 6088  df-inn 9308  df-ndx 13407  df-slot 13408  df-base 13410  df-cntz 14142  df-cntr 14143

This theorem is used by:  elcntr  14157  cntrss  14158  cntri  14159  cntrsubgnsg  14169  cntrnsg  14170