Theorem caovcang 6167

Description: Convert an operation cancellation law to class notation. (Contributed by NM, 20-Aug-1995.) (Revised by Mario Carneiro, 30-Dec-2014.)

Hypothesis

Ref	Expression
caovcang.1	|- ( ( ph /\ ( x e. T /\ y e. S /\ z e. S ) ) -> ( ( x F y ) = ( x F z ) <-> y = z ) )

Assertion

Ref	Expression
caovcang	|- ( ( ph /\ ( A e. T /\ B e. S /\ C e. S ) ) -> ( ( A F B ) = ( A F C ) <-> B = C ) )

Distinct variable groups:   x, y, z, A   x, B, y, z   x, C, y, z   ph, x, y, z   x, F, y, z   x, S, y, z   x, T, y, z

Proof of Theorem caovcang

Step	Hyp	Ref	Expression
1		caovcang.1	. . 3 |- ( ( ph /\ ( x e. T /\ y e. S /\ z e. S ) ) -> ( ( x F y ) = ( x F z ) <-> y = z ) )
2	1	ralrimivvva 2613	. 2 |- ( ph -> A. x e. T A. y e. S A. z e. S ( ( x F y ) = ( x F z ) <-> y = z ) )
3		oveq1 6008	. . . . 5 |- ( x = A -> ( x F y ) = ( A F y ) )
4		oveq1 6008	. . . . 5 |- ( x = A -> ( x F z ) = ( A F z ) )
5	3, 4	eqeq12d 2244	. . . 4 |- ( x = A -> ( ( x F y ) = ( x F z ) <-> ( A F y ) = ( A F z ) ) )
6	5	bibi1d 233	. . 3 |- ( x = A -> ( ( ( x F y ) = ( x F z ) <-> y = z ) <-> ( ( A F y ) = ( A F z ) <-> y = z ) ) )
7		oveq2 6009	. . . . 5 |- ( y = B -> ( A F y ) = ( A F B ) )
8	7	eqeq1d 2238	. . . 4 |- ( y = B -> ( ( A F y ) = ( A F z ) <-> ( A F B ) = ( A F z ) ) )
9		eqeq1 2236	. . . 4 |- ( y = B -> ( y = z <-> B = z ) )
10	8, 9	bibi12d 235	. . 3 |- ( y = B -> ( ( ( A F y ) = ( A F z ) <-> y = z ) <-> ( ( A F B ) = ( A F z ) <-> B = z ) ) )
11		oveq2 6009	. . . . 5 |- ( z = C -> ( A F z ) = ( A F C ) )
12	11	eqeq2d 2241	. . . 4 |- ( z = C -> ( ( A F B ) = ( A F z ) <-> ( A F B ) = ( A F C ) ) )
13		eqeq2 2239	. . . 4 |- ( z = C -> ( B = z <-> B = C ) )
14	12, 13	bibi12d 235	. . 3 |- ( z = C -> ( ( ( A F B ) = ( A F z ) <-> B = z ) <-> ( ( A F B ) = ( A F C ) <-> B = C ) ) )
15	6, 10, 14	rspc3v 2923	. 2 |- ( ( A e. T /\ B e. S /\ C e. S ) -> ( A. x e. T A. y e. S A. z e. S ( ( x F y ) = ( x F z ) <-> y = z ) -> ( ( A F B ) = ( A F C ) <-> B = C ) ) )
16	2, 15	mpan9 281	1 |- ( ( ph /\ ( A e. T /\ B e. S /\ C e. S ) ) -> ( ( A F B ) = ( A F C ) <-> B = C ) )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   /\ w3a 1002   = wceq 1395   e. wcel 2200   A.wral 2508  (class class class)co 6001

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 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-ext 2211

This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-v 2801  df-un 3201  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-br 4084  df-iota 5278  df-fv 5326  df-ov 6004

This theorem is referenced by:  caovcand  6168