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

Theorem bianir 1009
Description: A closed form of mpbir 221, analogous to pm2.27 42 (assertion). (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (Proof shortened by Roger Witte, 17-Aug-2020.)
Assertion
Ref Expression
bianir  |-  ( (
ph  /\  ( ps  <->  ph ) )  ->  ps )

Proof of Theorem bianir
StepHypRef Expression
1 biimpr 210 . 2  |-  ( ( ps  <->  ph )  ->  ( ph  ->  ps ) )
21impcom 446 1  |-  ( (
ph  /\  ( ps  <->  ph ) )  ->  ps )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 196    /\ wa 384
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 197  df-an 386
This theorem is referenced by:  suppimacnv  7306  lgsqrmodndvds  25078  bnj970  31017  bnj1001  31028  bj-bibibi  32571
  Copyright terms: Public domain W3C validator