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

Theorem biimt 241
Description: A wff is equivalent to itself with true antecedent. (Contributed by NM, 28-Jan-1996.)
Assertion
Ref Expression
biimt  |-  ( ph  ->  ( ps  <->  ( ph  ->  ps ) ) )

Proof of Theorem biimt
StepHypRef Expression
1 ax-1 6 . 2  |-  ( ps 
->  ( ph  ->  ps ) )
2 pm2.27 40 . 2  |-  ( ph  ->  ( ( ph  ->  ps )  ->  ps )
)
31, 2impbid2 143 1  |-  ( ph  ->  ( ps  <->  ( ph  ->  ps ) ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    <-> wb 105
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108
This proof depends on definitions:  df-bi 117
This theorem is used by:  pm5.5  242  a1bi  243  abai  566  dedlem0a  981  ceqsralt  2849  reu8  3022  csbiebt  3187  r19.3rm  3616  fncnv  5447  ovmpodxf  6214  brecop  6899  tgss2  15180
  Copyright terms: Public domain W3C validator