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

Theorem eqbrtrdi 4169
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 4140 . 2  |-  ( ph  ->  ( A R C  <-> 
B R C ) )
41, 3mpbiri 168 1  |-  ( ph  ->  A R C )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    = wceq 1402   class class class wbr 4130
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-v 2823  df-un 3224  df-sn 3715  df-pr 3716  df-op 3718  df-br 4131
This theorem is used by:  eqbrtrrdi  4170  pm54.43  7536  recapb  9001  nn0ledivnn  10168  xltnegi  10237  leexp1a  11031  facwordi  11178  faclbnd3  11181  resqrexlemlo  11779  efap0  12444  dvds1  12620  ballotfilemrc  13274  en1top  15178  dvef  15828  rpabscxpbnd  16042  zabsle1  16118  lgseisen  16193  lgsquadlem2  16197  upgr2wlkdc  16618  trirec0  17093
  Copyright terms: Public domain W3C validator