Theorem caovcang 6835

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 2972	. 2 |- ( ph -> A. x e. T A. y e. S A. z e. S ( ( x F y ) = ( x F z ) <-> y = z ) )
3		oveq1 6657	. . . . 5 |- ( x = A -> ( x F y ) = ( A F y ) )
4		oveq1 6657	. . . . 5 |- ( x = A -> ( x F z ) = ( A F z ) )
5	3, 4	eqeq12d 2637	. . . 4 |- ( x = A -> ( ( x F y ) = ( x F z ) <-> ( A F y ) = ( A F z ) ) )
6	5	bibi1d 333	. . 3 |- ( x = A -> ( ( ( x F y ) = ( x F z ) <-> y = z ) <-> ( ( A F y ) = ( A F z ) <-> y = z ) ) )
7		oveq2 6658	. . . . 5 |- ( y = B -> ( A F y ) = ( A F B ) )
8	7	eqeq1d 2624	. . . 4 |- ( y = B -> ( ( A F y ) = ( A F z ) <-> ( A F B ) = ( A F z ) ) )
9		eqeq1 2626	. . . 4 |- ( y = B -> ( y = z <-> B = z ) )
10	8, 9	bibi12d 335	. . 3 |- ( y = B -> ( ( ( A F y ) = ( A F z ) <-> y = z ) <-> ( ( A F B ) = ( A F z ) <-> B = z ) ) )
11		oveq2 6658	. . . . 5 |- ( z = C -> ( A F z ) = ( A F C ) )
12	11	eqeq2d 2632	. . . 4 |- ( z = C -> ( ( A F B ) = ( A F z ) <-> ( A F B ) = ( A F C ) ) )
13		eqeq2 2633	. . . 4 |- ( z = C -> ( B = z <-> B = C ) )
14	12, 13	bibi12d 335	. . 3 |- ( z = C -> ( ( ( A F B ) = ( A F z ) <-> B = z ) <-> ( ( A F B ) = ( A F C ) <-> B = C ) ) )
15	6, 10, 14	rspc3v 3325	. 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 486	1 |- ( ( ph /\ ( A e. T /\ B e. S /\ C e. S ) ) -> ( ( A F B ) = ( A F C ) <-> B = C ) )

Syntax hints:   -> wi 4   <-> wb 196   /\ wa 384   /\ w3a 1037   = wceq 1483   e. wcel 1990   A.wral 2912  (class class class)co 6650

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-iota 5851  df-fv 5896  df-ov 6653

This theorem is referenced by:  caovcand  6836  caofcan  38522