NFE Home New Foundations Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  NFE Home  >  Th. List  >  3bitr3d Unicode version

Theorem 3bitr3d 274
Description: Deduction from transitivity of biconditional. Useful for converting conditional definitions in a formula. (Contributed by NM, 24-Apr-1996.)
Hypotheses
Ref Expression
3bitr3d.1
3bitr3d.2
3bitr3d.3
Assertion
Ref Expression
3bitr3d

Proof of Theorem 3bitr3d
StepHypRef Expression
1 3bitr3d.2 . . 3
2 3bitr3d.1 . . 3
31, 2bitr3d 246 . 2
4 3bitr3d.3 . 2
53, 4bitrd 244 1
Colors of variables: wff setvar class
Syntax hints:   wi 4   wb 176
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8
This theorem depends on definitions:  df-bi 177
This theorem is referenced by:  sbcne12g  3154  csbcomg  3159  eloprabga  5578  ereldm  5971
  Copyright terms: Public domain W3C validator