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

Theorem caovord 6193
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 6024 . . . 4  |-  ( z  =  C  ->  (
z F A )  =  ( C F A ) )
2 oveq1 6024 . . . 4  |-  ( z  =  C  ->  (
z F B )  =  ( C F B ) )
31, 2breq12d 4101 . . 3  |-  ( z  =  C  ->  (
( z F A ) R ( z F B )  <->  ( C F A ) R ( C F B ) ) )
43bibi2d 232 . 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 4091 . . . . . 6  |-  ( x  =  A  ->  (
x R y  <->  A R
y ) )
8 oveq2 6025 . . . . . . 7  |-  ( x  =  A  ->  (
z F x )  =  ( z F A ) )
98breq1d 4098 . . . . . 6  |-  ( x  =  A  ->  (
( z F x ) R ( z F y )  <->  ( z F A ) R ( z F y ) ) )
107, 9bibi12d 235 . . . . 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 4092 . . . . . 6  |-  ( y  =  B  ->  ( A R y  <->  A R B ) )
12 oveq2 6025 . . . . . . 7  |-  ( y  =  B  ->  (
z F y )  =  ( z F B ) )
1312breq2d 4100 . . . . . 6  |-  ( y  =  B  ->  (
( z F A ) R ( z F y )  <->  ( z F A ) R ( z F B ) ) )
1411, 13bibi12d 235 . . . . 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 462 . . . 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 230 . . 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 2859 . 2  |-  ( z  e.  S  ->  ( A R B  <->  ( z F A ) R ( z F B ) ) )
194, 18vtoclga 2870 1  |-  ( C  e.  S  ->  ( A R B  <->  ( C F A ) R ( C F B ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1397    e. wcel 2202   _Vcvv 2802   class class class wbr 4088  (class class class)co 6017
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-ext 2213
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-rex 2516  df-v 2804  df-un 3204  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-br 4089  df-iota 5286  df-fv 5334  df-ov 6020
This theorem is referenced by:  caovord2  6194  caovord3  6195
  Copyright terms: Public domain W3C validator