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

Theorem 3bitr2rd 274
 Description: Deduction from transitivity of biconditional. (Contributed by NM, 4-Aug-2006.)
Hypotheses
Ref Expression
3bitr2d.1
3bitr2d.2
3bitr2d.3
Assertion
Ref Expression
3bitr2rd

Proof of Theorem 3bitr2rd
StepHypRef Expression
1 3bitr2d.1 . . 3
2 3bitr2d.2 . . 3
31, 2bitr4d 248 . 2
4 3bitr2d.3 . 2
53, 4bitr2d 246 1
 Colors of variables: wff set class Syntax hints:   wi 4   wb 177 This theorem is referenced by:  fnsuppres  5944  addsubeq4  9310  muleqadd  9656  nn0lt10b  10326  om2uzlti  11280  qnumdenbi  13126  dprdf11  15571  lvecvscan2  16174  elfilss  17898  itg2seq  19624  itg2cnlem2  19644  chpchtsum  20993  bposlem7  21064  lgsdilem  21096  lgsne0  21107  pjnorm2  23219  cdj3lem1  23927  zrhchr  24350  mulle0b  25182  axcontlem7  25874  dochfln0  32176  mapdindp  32370 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8 This theorem depends on definitions:  df-bi 178
 Copyright terms: Public domain W3C validator