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

Theorem caovord 6047
Description: Convert an operation ordering law to class notation. (Contributed by NM, 19-Feb-1996.)
Hypotheses
Ref Expression
caovord.1  |-  A  e. 
_V
caovord.2  |-  B  e. 
_V
caovord.3  |-  ( z  e.  S  ->  (
x R y  <->  ( z F x ) R ( z F y ) ) )
Assertion
Ref Expression
caovord  |-  ( C  e.  S  ->  ( A R B  <->  ( C F A ) R ( C F B ) ) )
Distinct variable groups:    x, y,
z, A    x, B, y, z    x, C, y, z    x, F, y, z    x, R, y, z    x, S, y, z

Proof of Theorem caovord
StepHypRef Expression
1 oveq1 5881 . . . 4  |-  ( z  =  C  ->  (
z F A )  =  ( C F A ) )
2 oveq1 5881 . . . 4  |-  ( z  =  C  ->  (
z F B )  =  ( C F B ) )
31, 2breq12d 4052 . . 3  |-  ( z  =  C  ->  (
( z F A ) R ( z F B )  <->  ( C F A ) R ( C F B ) ) )
43bibi2d 309 . 2  |-  ( z  =  C  ->  (
( A R B  <-> 
( z F A ) R ( z F B ) )  <-> 
( A R B  <-> 
( C F A ) R ( C F B ) ) ) )
5 caovord.1 . . 3  |-  A  e. 
_V
6 caovord.2 . . 3  |-  B  e. 
_V
7 breq1 4042 . . . . . 6  |-  ( x  =  A  ->  (
x R y  <->  A R
y ) )
8 oveq2 5882 . . . . . . 7  |-  ( x  =  A  ->  (
z F x )  =  ( z F A ) )
98breq1d 4049 . . . . . 6  |-  ( x  =  A  ->  (
( z F x ) R ( z F y )  <->  ( z F A ) R ( z F y ) ) )
107, 9bibi12d 312 . . . . 5  |-  ( x  =  A  ->  (
( x R y  <-> 
( z F x ) R ( z F y ) )  <-> 
( A R y  <-> 
( z F A ) R ( z F y ) ) ) )
11 breq2 4043 . . . . . 6  |-  ( y  =  B  ->  ( A R y  <->  A R B ) )
12 oveq2 5882 . . . . . . 7  |-  ( y  =  B  ->  (
z F y )  =  ( z F B ) )
1312breq2d 4051 . . . . . 6  |-  ( y  =  B  ->  (
( z F A ) R ( z F y )  <->  ( z F A ) R ( z F B ) ) )
1411, 13bibi12d 312 . . . . 5  |-  ( y  =  B  ->  (
( A R y  <-> 
( z F A ) R ( z F y ) )  <-> 
( A R B  <-> 
( z F A ) R ( z F B ) ) ) )
1510, 14sylan9bb 680 . . . 4  |-  ( ( x  =  A  /\  y  =  B )  ->  ( ( x R y  <->  ( z F x ) R ( z F y ) )  <->  ( A R B  <->  ( z F A ) R ( z F B ) ) ) )
1615imbi2d 307 . . 3  |-  ( ( x  =  A  /\  y  =  B )  ->  ( ( z  e.  S  ->  ( x R y  <->  ( z F x ) R ( z F y ) ) )  <->  ( z  e.  S  ->  ( A R B  <->  ( z F A ) R ( z F B ) ) ) ) )
17 caovord.3 . . 3  |-  ( z  e.  S  ->  (
x R y  <->  ( z F x ) R ( z F y ) ) )
185, 6, 16, 17vtocl2 2852 . 2  |-  ( z  e.  S  ->  ( A R B  <->  ( z F A ) R ( z F B ) ) )
194, 18vtoclga 2862 1  |-  ( C  e.  S  ->  ( A R B  <->  ( C F A ) R ( C F B ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 176    /\ wa 358    = wceq 1632    e. wcel 1696   _Vcvv 2801   class class class wbr 4039  (class class class)co 5874
This theorem is referenced by:  caovord2  6048  caovord3  6049  genpcl  8648
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1536  ax-5 1547  ax-17 1606  ax-9 1644  ax-8 1661  ax-6 1715  ax-7 1720  ax-11 1727  ax-12 1878  ax-ext 2277
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1310  df-ex 1532  df-nf 1535  df-sb 1639  df-clab 2283  df-cleq 2289  df-clel 2292  df-nfc 2421  df-rex 2562  df-rab 2565  df-v 2803  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-nul 3469  df-if 3579  df-sn 3659  df-pr 3660  df-op 3662  df-uni 3844  df-br 4040  df-iota 5235  df-fv 5279  df-ov 5877
  Copyright terms: Public domain W3C validator