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

Theorem breqtrrdi 4173
Description: A chained equality inference for a binary relation. (Contributed by NM, 24-Apr-2005.)
Hypotheses
Ref Expression
breqtrrdi.1  |-  ( ph  ->  A R B )
breqtrrdi.2  |-  C  =  B
Assertion
Ref Expression
breqtrrdi  |-  ( ph  ->  A R C )

Proof of Theorem breqtrrdi
StepHypRef Expression
1 breqtrrdi.1 . 2  |-  ( ph  ->  A R B )
2 breqtrrdi.2 . . 3  |-  C  =  B
32eqcomi 2242 . 2  |-  B  =  C
41, 3breqtrdi 4172 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 4131
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 4132
This theorem is used by:  enpr2d  7116  fiunsnnn  7190  exmidpw2en  7224  unsnfi  7231  2omapfi  7327  eninl  7444  eninr  7445  difinfinf  7448  exmidfodomrlemr  7561  exmidfodomrlemrALT  7562  dju1en  7576  djucomen  7579  djuassen  7580  xpdjuen  7581  gtndiv  9753  intqfrac2  10778  uzenom  10884  xrmaxiflemval  12042  ege2le3  12464  eirraplem  12570  bitsfzo  12748  pcprendvds  13099  pcpremul  13102  pcfaclem  13158  infpnlem2  13169  2strstr1g  13536  lmcn2  15518  dveflem  15964  tangtx  16077  ioocosf1o  16094  bposlem1  16323  bposlem2  16324  bposlem3  16325  lgsdirprm  16370  sbthom  17289  nconstwlpolemgt0  17333
  Copyright terms: Public domain W3C validator