Theorem ecopover 6801

Description: Assuming that operation F is commutative (second hypothesis), closed (third hypothesis), associative (fourth hypothesis), and has the cancellation property (fifth hypothesis), show that the relation .~, specified by the first hypothesis, is an equivalence relation. (Contributed by NM, 16-Feb-1996.) (Revised by Mario Carneiro, 12-Aug-2015.)

Hypotheses

Ref	Expression
ecopopr.1	|- .~ = { <. x , y >. | ( ( x e. ( S X. S ) /\ y e. ( S X. S ) ) /\ E. z E. w E. v E. u ( ( x = <. z , w >. /\ y = <. v , u >. ) /\ ( z .+ u ) = ( w .+ v ) ) ) }
ecopopr.com	|- ( x .+ y ) = ( y .+ x )
ecopopr.cl	|- ( ( x e. S /\ y e. S ) -> ( x .+ y ) e. S )
ecopopr.ass	|- ( ( x .+ y ) .+ z ) = ( x .+ ( y .+ z ) )
ecopopr.can	|- ( ( x e. S /\ y e. S ) -> ( ( x .+ y ) = ( x .+ z ) -> y = z ) )

Assertion

Ref	Expression
ecopover	|- .~ Er ( S X. S )

Distinct variable groups:   x, y, z, w, v, u, .+   x, S, y, z, w, v, u

Allowed substitution hints:   .~ ( x, y, z, w, v, u)

Proof of Theorem ecopover

Dummy variables f g h are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ecopopr.1	. . . . 5 |- .~ = { <. x , y >. | ( ( x e. ( S X. S ) /\ y e. ( S X. S ) ) /\ E. z E. w E. v E. u ( ( x = <. z , w >. /\ y = <. v , u >. ) /\ ( z .+ u ) = ( w .+ v ) ) ) }
2	1	relopabi 4855	. . . 4 |- Rel .~
3	2	a1i 9	. . 3 |- ( T. -> Rel .~ )
4		ecopopr.com	. . . . 5 |- ( x .+ y ) = ( y .+ x )
5	1, 4	ecopovsym 6799	. . . 4 |- ( f .~ g -> g .~ f )
6	5	adantl 277	. . 3 |- ( ( T. /\ f .~ g ) -> g .~ f )
7		ecopopr.cl	. . . . 5 |- ( ( x e. S /\ y e. S ) -> ( x .+ y ) e. S )
8		ecopopr.ass	. . . . 5 |- ( ( x .+ y ) .+ z ) = ( x .+ ( y .+ z ) )
9		ecopopr.can	. . . . 5 |- ( ( x e. S /\ y e. S ) -> ( ( x .+ y ) = ( x .+ z ) -> y = z ) )
10	1, 4, 7, 8, 9	ecopovtrn 6800	. . . 4 |- ( ( f .~ g /\ g .~ h ) -> f .~ h )
11	10	adantl 277	. . 3 |- ( ( T. /\ ( f .~ g /\ g .~ h ) ) -> f .~ h )
12		vex 2805	. . . . . . . . . . 11 |- g e. _V
13		vex 2805	. . . . . . . . . . 11 |- h e. _V
14	12, 13, 4	caovcom 6179	. . . . . . . . . 10 |- ( g .+ h ) = ( h .+ g )
15	1	ecopoveq 6798	. . . . . . . . . 10 |- ( ( ( g e. S /\ h e. S ) /\ ( g e. S /\ h e. S ) ) -> ( <. g , h >. .~ <. g , h >. <-> ( g .+ h ) = ( h .+ g ) ) )
16	14, 15	mpbiri 168	. . . . . . . . 9 |- ( ( ( g e. S /\ h e. S ) /\ ( g e. S /\ h e. S ) ) -> <. g , h >. .~ <. g , h >. )
17	16	anidms 397	. . . . . . . 8 |- ( ( g e. S /\ h e. S ) -> <. g , h >. .~ <. g , h >. )
18	17	rgen2a 2586	. . . . . . 7 |- A. g e. S A. h e. S <. g , h >. .~ <. g , h >.
19		breq12 4093	. . . . . . . . 9 |- ( ( f = <. g , h >. /\ f = <. g , h >. ) -> ( f .~ f <-> <. g , h >. .~ <. g , h >. ) )
20	19	anidms 397	. . . . . . . 8 |- ( f = <. g , h >. -> ( f .~ f <-> <. g , h >. .~ <. g , h >. ) )
21	20	ralxp 4873	. . . . . . 7 |- ( A. f e. ( S X. S ) f .~ f <-> A. g e. S A. h e. S <. g , h >. .~ <. g , h >. )
22	18, 21	mpbir 146	. . . . . 6 |- A. f e. ( S X. S ) f .~ f
23	22	rspec 2584	. . . . 5 |- ( f e. ( S X. S ) -> f .~ f )
24	23	a1i 9	. . . 4 |- ( T. -> ( f e. ( S X. S ) -> f .~ f ) )
25		opabssxp 4800	. . . . . . 7 |- { <. x , y >. | ( ( x e. ( S X. S ) /\ y e. ( S X. S ) ) /\ E. z E. w E. v E. u ( ( x = <. z , w >. /\ y = <. v , u >. ) /\ ( z .+ u ) = ( w .+ v ) ) ) } C_ ( ( S X. S ) X. ( S X. S ) )
26	1, 25	eqsstri 3259	. . . . . 6 |- .~ C_ ( ( S X. S ) X. ( S X. S ) )
27	26	ssbri 4133	. . . . 5 |- ( f .~ f -> f ( ( S X. S ) X. ( S X. S ) ) f )
28		brxp 4756	. . . . . 6 |- ( f ( ( S X. S ) X. ( S X. S ) ) f <-> ( f e. ( S X. S ) /\ f e. ( S X. S ) ) )
29	28	simplbi 274	. . . . 5 |- ( f ( ( S X. S ) X. ( S X. S ) ) f -> f e. ( S X. S ) )
30	27, 29	syl 14	. . . 4 |- ( f .~ f -> f e. ( S X. S ) )
31	24, 30	impbid1 142	. . 3 |- ( T. -> ( f e. ( S X. S ) <-> f .~ f ) )
32	3, 6, 11, 31	iserd 6727	. 2 |- ( T. -> .~ Er ( S X. S ) )
33	32	mptru 1406	1 |- .~ Er ( S X. S )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1397   T. wtru 1398   E.wex 1540   e. wcel 2202   A.wral 2510   <.cop 3672   class class class wbr 4088   {copab 4149   X. cxp 4723   Rel wrel 4730  (class class class)co 6017   Er wer 6698

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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299

This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-v 2804  df-sbc 3032  df-csb 3128  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-iun 3972  df-br 4089  df-opab 4151  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-iota 5286  df-fv 5334  df-ov 6020  df-er 6701

This theorem is referenced by: (None)