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

Theorem eqbrtrrdi 4029
Description: A chained equality inference for a binary relation. (Contributed by NM, 4-Jan-2006.)
Hypotheses
Ref Expression
eqbrtrrdi.1  |-  ( ph  ->  B  =  A )
eqbrtrrdi.2  |-  B R C
Assertion
Ref Expression
eqbrtrrdi  |-  ( ph  ->  A R C )

Proof of Theorem eqbrtrrdi
StepHypRef Expression
1 eqbrtrrdi.1 . . 3  |-  ( ph  ->  B  =  A )
21eqcomd 2176 . 2  |-  ( ph  ->  A  =  B )
3 eqbrtrrdi.2 . 2  |-  B R C
42, 3eqbrtrdi 4028 1  |-  ( ph  ->  A R C )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1348   class class class wbr 3989
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-v 2732  df-un 3125  df-sn 3589  df-pr 3590  df-op 3592  df-br 3990
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator