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

Theorem caovordig 6018
Description: Convert an operation ordering law to class notation. (Contributed by Mario Carneiro, 31-Dec-2014.)
Hypothesis
Ref Expression
caovordig.1  |-  ( (
ph  /\  ( x  e.  S  /\  y  e.  S  /\  z  e.  S ) )  -> 
( x R y  ->  ( z F x ) R ( z F y ) ) )
Assertion
Ref Expression
caovordig  |-  ( (
ph  /\  ( A  e.  S  /\  B  e.  S  /\  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    ph, x, y, z   
x, F, y, z   
x, R, y, z   
x, S, y, z

Proof of Theorem caovordig
StepHypRef Expression
1 caovordig.1 . . 3  |-  ( (
ph  /\  ( x  e.  S  /\  y  e.  S  /\  z  e.  S ) )  -> 
( x R y  ->  ( z F x ) R ( z F y ) ) )
21ralrimivvva 2553 . 2  |-  ( ph  ->  A. x  e.  S  A. y  e.  S  A. z  e.  S  ( x R y  ->  ( z F x ) R ( z F y ) ) )
3 breq1 3992 . . . 4  |-  ( x  =  A  ->  (
x R y  <->  A R
y ) )
4 oveq2 5861 . . . . 5  |-  ( x  =  A  ->  (
z F x )  =  ( z F A ) )
54breq1d 3999 . . . 4  |-  ( x  =  A  ->  (
( z F x ) R ( z F y )  <->  ( z F A ) R ( z F y ) ) )
63, 5imbi12d 233 . . 3  |-  ( x  =  A  ->  (
( x R y  ->  ( z F x ) R ( z F y ) )  <->  ( A R y  ->  ( z F A ) R ( z F y ) ) ) )
7 breq2 3993 . . . 4  |-  ( y  =  B  ->  ( A R y  <->  A R B ) )
8 oveq2 5861 . . . . 5  |-  ( y  =  B  ->  (
z F y )  =  ( z F B ) )
98breq2d 4001 . . . 4  |-  ( y  =  B  ->  (
( z F A ) R ( z F y )  <->  ( z F A ) R ( z F B ) ) )
107, 9imbi12d 233 . . 3  |-  ( y  =  B  ->  (
( A R y  ->  ( z F A ) R ( z F y ) )  <->  ( A R B  ->  ( z F A ) R ( z F B ) ) ) )
11 oveq1 5860 . . . . 5  |-  ( z  =  C  ->  (
z F A )  =  ( C F A ) )
12 oveq1 5860 . . . . 5  |-  ( z  =  C  ->  (
z F B )  =  ( C F B ) )
1311, 12breq12d 4002 . . . 4  |-  ( z  =  C  ->  (
( z F A ) R ( z F B )  <->  ( C F A ) R ( C F B ) ) )
1413imbi2d 229 . . 3  |-  ( z  =  C  ->  (
( A R B  ->  ( z F A ) R ( z F B ) )  <->  ( A R B  ->  ( C F A ) R ( C F B ) ) ) )
156, 10, 14rspc3v 2850 . 2  |-  ( ( A  e.  S  /\  B  e.  S  /\  C  e.  S )  ->  ( A. x  e.  S  A. y  e.  S  A. z  e.  S  ( x R y  ->  ( z F x ) R ( z F y ) )  ->  ( A R B  ->  ( C F A ) R ( C F B ) ) ) )
162, 15mpan9 279 1  |-  ( (
ph  /\  ( A  e.  S  /\  B  e.  S  /\  C  e.  S ) )  -> 
( A R B  ->  ( C F A ) R ( C F B ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    /\ w3a 973    = wceq 1348    e. wcel 2141   A.wral 2448   class class class wbr 3989  (class class class)co 5853
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 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-ext 2152
This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-nf 1454  df-sb 1756  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ral 2453  df-rex 2454  df-v 2732  df-un 3125  df-sn 3589  df-pr 3590  df-op 3592  df-uni 3797  df-br 3990  df-iota 5160  df-fv 5206  df-ov 5856
This theorem is referenced by:  caovordid  6019
  Copyright terms: Public domain W3C validator