MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  syl5breq Structured version   Unicode version

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

Proof of Theorem syl5breq
StepHypRef Expression
1 syl5breq.1 . . 3  |-  A R B
21a1i 11 . 2  |-  ( ph  ->  A R B )
3 syl5breq.2 . 2  |-  ( ph  ->  B  =  C )
42, 3breqtrd 4311 1  |-  ( ph  ->  A R C )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    = wceq 1369   class class class wbr 4287
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1591  ax-4 1602  ax-5 1670  ax-6 1708  ax-7 1728  ax-10 1775  ax-11 1780  ax-12 1792  ax-13 1943  ax-ext 2419
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 967  df-tru 1372  df-ex 1587  df-nf 1590  df-sb 1701  df-clab 2425  df-cleq 2431  df-clel 2434  df-nfc 2563  df-rab 2719  df-v 2969  df-dif 3326  df-un 3328  df-in 3330  df-ss 3337  df-nul 3633  df-if 3787  df-sn 3873  df-pr 3875  df-op 3879  df-br 4288
This theorem is referenced by:  syl5breqr  4323  phplem3  7484  xlemul1a  11243  phicl2  13835  sinq12ge0  21950  siilem1  24219  nmbdfnlbi  25421  nmcfnlbi  25424  unierri  25476  leoprf2  25499  leoprf  25500  ballotlemic  26858  ballotlem1c  26859
  Copyright terms: Public domain W3C validator