ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  caovcan Unicode version

Theorem caovcan 6006
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 5849 . . . 4  |-  ( x  =  A  ->  (
x F y )  =  ( A F y ) )
2 oveq1 5849 . . . 4  |-  ( x  =  A  ->  (
x F C )  =  ( A F C ) )
31, 2eqeq12d 2180 . . 3  |-  ( x  =  A  ->  (
( x F y )  =  ( x F C )  <->  ( A F y )  =  ( A F C ) ) )
43imbi1d 230 . 2  |-  ( x  =  A  ->  (
( ( x F y )  =  ( x F C )  ->  y  =  C )  <->  ( ( A F y )  =  ( A F C )  ->  y  =  C ) ) )
5 oveq2 5850 . . . 4  |-  ( y  =  B  ->  ( A F y )  =  ( A F B ) )
65eqeq1d 2174 . . 3  |-  ( y  =  B  ->  (
( A F y )  =  ( A F C )  <->  ( A F B )  =  ( A F C ) ) )
7 eqeq1 2172 . . 3  |-  ( y  =  B  ->  (
y  =  C  <->  B  =  C ) )
86, 7imbi12d 233 . 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 5850 . . . . . 6  |-  ( z  =  C  ->  (
x F z )  =  ( x F C ) )
1110eqeq2d 2177 . . . . 5  |-  ( z  =  C  ->  (
( x F y )  =  ( x F z )  <->  ( x F y )  =  ( x F C ) ) )
12 eqeq2 2175 . . . . 5  |-  ( z  =  C  ->  (
y  =  z  <->  y  =  C ) )
1311, 12imbi12d 233 . . . 4  |-  ( z  =  C  ->  (
( ( x F y )  =  ( x F z )  ->  y  =  z )  <->  ( ( x F y )  =  ( x F C )  ->  y  =  C ) ) )
1413imbi2d 229 . . 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 2780 . 2  |-  ( ( x  e.  S  /\  y  e.  S )  ->  ( ( x F y )  =  ( x F C )  ->  y  =  C ) )
174, 8, 16vtocl2ga 2794 1  |-  ( ( A  e.  S  /\  B  e.  S )  ->  ( ( A F B )  =  ( A F C )  ->  B  =  C ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    = wceq 1343    e. wcel 2136   _Vcvv 2726  (class class class)co 5842
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-ext 2147
This theorem depends on definitions:  df-bi 116  df-3an 970  df-tru 1346  df-nf 1449  df-sb 1751  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-rex 2450  df-v 2728  df-un 3120  df-sn 3582  df-pr 3583  df-op 3585  df-uni 3790  df-br 3983  df-iota 5153  df-fv 5196  df-ov 5845
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator