MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  caovcan Structured version   Unicode version

Theorem caovcan 6478
Description: Convert an operation cancellation law to class notation. (Contributed by NM, 20-Aug-1995.)
Hypotheses
Ref Expression
caovcan.1  |-  C  e. 
_V
caovcan.2  |-  ( ( x  e.  S  /\  y  e.  S )  ->  ( ( x F y )  =  ( x F z )  ->  y  =  z ) )
Assertion
Ref Expression
caovcan  |-  ( ( A  e.  S  /\  B  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    x, F, y, z    x, S, y, z

Proof of Theorem caovcan
StepHypRef Expression
1 oveq1 6303 . . . 4  |-  ( x  =  A  ->  (
x F y )  =  ( A F y ) )
2 oveq1 6303 . . . 4  |-  ( x  =  A  ->  (
x F C )  =  ( A F C ) )
31, 2eqeq12d 2479 . . 3  |-  ( x  =  A  ->  (
( x F y )  =  ( x F C )  <->  ( A F y )  =  ( A F C ) ) )
43imbi1d 317 . 2  |-  ( x  =  A  ->  (
( ( x F y )  =  ( x F C )  ->  y  =  C )  <->  ( ( A F y )  =  ( A F C )  ->  y  =  C ) ) )
5 oveq2 6304 . . . 4  |-  ( y  =  B  ->  ( A F y )  =  ( A F B ) )
65eqeq1d 2459 . . 3  |-  ( y  =  B  ->  (
( A F y )  =  ( A F C )  <->  ( A F B )  =  ( A F C ) ) )
7 eqeq1 2461 . . 3  |-  ( y  =  B  ->  (
y  =  C  <->  B  =  C ) )
86, 7imbi12d 320 . 2  |-  ( y  =  B  ->  (
( ( A F y )  =  ( A F C )  ->  y  =  C )  <->  ( ( A F B )  =  ( A F C )  ->  B  =  C ) ) )
9 caovcan.1 . . 3  |-  C  e. 
_V
10 oveq2 6304 . . . . . 6  |-  ( z  =  C  ->  (
x F z )  =  ( x F C ) )
1110eqeq2d 2471 . . . . 5  |-  ( z  =  C  ->  (
( x F y )  =  ( x F z )  <->  ( x F y )  =  ( x F C ) ) )
12 eqeq2 2472 . . . . 5  |-  ( z  =  C  ->  (
y  =  z  <->  y  =  C ) )
1311, 12imbi12d 320 . . . 4  |-  ( z  =  C  ->  (
( ( x F y )  =  ( x F z )  ->  y  =  z )  <->  ( ( x F y )  =  ( x F C )  ->  y  =  C ) ) )
1413imbi2d 316 . . 3  |-  ( z  =  C  ->  (
( ( x  e.  S  /\  y  e.  S )  ->  (
( x F y )  =  ( x F z )  -> 
y  =  z ) )  <->  ( ( x  e.  S  /\  y  e.  S )  ->  (
( x F y )  =  ( x F C )  -> 
y  =  C ) ) ) )
15 caovcan.2 . . 3  |-  ( ( x  e.  S  /\  y  e.  S )  ->  ( ( x F y )  =  ( x F z )  ->  y  =  z ) )
169, 14, 15vtocl 3161 . 2  |-  ( ( x  e.  S  /\  y  e.  S )  ->  ( ( x F y )  =  ( x F C )  ->  y  =  C ) )
174, 8, 16vtocl2ga 3175 1  |-  ( ( A  e.  S  /\  B  e.  S )  ->  ( ( A F B )  =  ( A F C )  ->  B  =  C ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ wa 369    = wceq 1395    e. wcel 1819   _Vcvv 3109  (class class class)co 6296
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1619  ax-4 1632  ax-5 1705  ax-6 1748  ax-7 1791  ax-10 1838  ax-11 1843  ax-12 1855  ax-13 2000  ax-ext 2435
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 975  df-tru 1398  df-ex 1614  df-nf 1618  df-sb 1741  df-clab 2443  df-cleq 2449  df-clel 2452  df-nfc 2607  df-rex 2813  df-rab 2816  df-v 3111  df-dif 3474  df-un 3476  df-in 3478  df-ss 3485  df-nul 3794  df-if 3945  df-sn 4033  df-pr 4035  df-op 4039  df-uni 4252  df-br 4457  df-iota 5557  df-fv 5602  df-ov 6299
This theorem is referenced by:  ecopovtrn  7432
  Copyright terms: Public domain W3C validator