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

Theorem eqbrtrdi 3975
Description: A chained equality inference for a binary relation. (Contributed by NM, 12-Oct-1999.)
Hypotheses
Ref Expression
eqbrtrdi.1  |-  ( ph  ->  A  =  B )
eqbrtrdi.2  |-  B R C
Assertion
Ref Expression
eqbrtrdi  |-  ( ph  ->  A R C )

Proof of Theorem eqbrtrdi
StepHypRef Expression
1 eqbrtrdi.2 . 2  |-  B R C
2 eqbrtrdi.1 . . 3  |-  ( ph  ->  A  =  B )
32breq1d 3947 . 2  |-  ( ph  ->  ( A R C  <-> 
B R C ) )
41, 3mpbiri 167 1  |-  ( ph  ->  A R C )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1332   class class class wbr 3937
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 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122
This theorem depends on definitions:  df-bi 116  df-3an 965  df-tru 1335  df-nf 1438  df-sb 1737  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-v 2691  df-un 3080  df-sn 3538  df-pr 3539  df-op 3541  df-br 3938
This theorem is referenced by:  eqbrtrrdi  3976  pm54.43  7063  nn0ledivnn  9584  xltnegi  9648  leexp1a  10379  facwordi  10518  faclbnd3  10521  resqrexlemlo  10817  efap0  11420  dvds1  11587  en1top  12285  dvef  12896  rpabscxpbnd  13067  trirec0  13412
  Copyright terms: Public domain W3C validator