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

Theorem caovord3d 6023
Description: Ordering law. (Contributed by Mario Carneiro, 30-Dec-2014.)
Hypotheses
Ref Expression
caovordg.1  |-  ( (
ph  /\  ( x  e.  S  /\  y  e.  S  /\  z  e.  S ) )  -> 
( x R y  <-> 
( z F x ) R ( z F y ) ) )
caovordd.2  |-  ( ph  ->  A  e.  S )
caovordd.3  |-  ( ph  ->  B  e.  S )
caovordd.4  |-  ( ph  ->  C  e.  S )
caovord2d.com  |-  ( (
ph  /\  ( x  e.  S  /\  y  e.  S ) )  -> 
( x F y )  =  ( y F x ) )
caovord3d.5  |-  ( ph  ->  D  e.  S )
Assertion
Ref Expression
caovord3d  |-  ( ph  ->  ( ( A F B )  =  ( C F D )  ->  ( A R C  <->  D R B ) ) )
Distinct variable groups:    x, y, z, A    x, B, y, z    x, C, y, z    x, D, y, z    ph, x, y, z   
x, F, y, z   
x, R, y, z   
x, S, y, z

Proof of Theorem caovord3d
StepHypRef Expression
1 breq1 3992 . 2  |-  ( ( A F B )  =  ( C F D )  ->  (
( A F B ) R ( C F B )  <->  ( C F D ) R ( C F B ) ) )
2 caovordg.1 . . . 4  |-  ( (
ph  /\  ( x  e.  S  /\  y  e.  S  /\  z  e.  S ) )  -> 
( x R y  <-> 
( z F x ) R ( z F y ) ) )
3 caovordd.2 . . . 4  |-  ( ph  ->  A  e.  S )
4 caovordd.4 . . . 4  |-  ( ph  ->  C  e.  S )
5 caovordd.3 . . . 4  |-  ( ph  ->  B  e.  S )
6 caovord2d.com . . . 4  |-  ( (
ph  /\  ( x  e.  S  /\  y  e.  S ) )  -> 
( x F y )  =  ( y F x ) )
72, 3, 4, 5, 6caovord2d 6022 . . 3  |-  ( ph  ->  ( A R C  <-> 
( A F B ) R ( C F B ) ) )
8 caovord3d.5 . . . 4  |-  ( ph  ->  D  e.  S )
92, 8, 5, 4caovordd 6021 . . 3  |-  ( ph  ->  ( D R B  <-> 
( C F D ) R ( C F B ) ) )
107, 9bibi12d 234 . 2  |-  ( ph  ->  ( ( A R C  <->  D R B )  <-> 
( ( A F B ) R ( C F B )  <-> 
( C F D ) R ( C F B ) ) ) )
111, 10syl5ibr 155 1  |-  ( ph  ->  ( ( A F B )  =  ( C F D )  ->  ( A R C  <->  D R B ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    <-> wb 104    /\ w3a 973    = wceq 1348    e. wcel 2141   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:  ordpipqqs  7336  ltsrprg  7709
  Copyright terms: Public domain W3C validator