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

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

Proof of Theorem eqbrtrid
StepHypRef Expression
1 eqbrtrid.2 . 2  |-  ( ph  ->  B R C )
2 eqbrtrid.1 . 2  |-  A  =  B
3 eqid 2140 . 2  |-  C  =  C
41, 2, 33brtr4g 3970 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:  xp1en  6725  caucvgprlemm  7500  intqfrac2  10123  m1modge3gt1  10175  bernneq2  10444  reccn2ap  11114  eirraplem  11519  nno  11639  oddprmge3  11851  sqnprm  11852  oddennn  11941  strle2g  12089  strle3g  12090  1strstrg  12096  2strstrg  12098  rngstrg  12113  srngstrd  12120  lmodstrd  12131  ipsstrd  12139  topgrpstrd  12149  psmetge0  12539  reeff1olem  12900  cosq14gt0  12961  cosq34lt1  12979  ioocosf1o  12983  pwf1oexmid  13367  trilpolemeq1  13408
  Copyright terms: Public domain W3C validator