Users' Mathboxes Mathbox for Jonathan Ben-Naim < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  bnj132 Structured version   Unicode version

Theorem bnj132 32070
Description: First-order logic and set theory. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (Proof shortened by Andrew Salmon, 26-Jun-2011.) (New usage is discouraged.)
Hypothesis
Ref Expression
bnj132.1  |-  ( ph  <->  E. x ( ps  ->  ch ) )
Assertion
Ref Expression
bnj132  |-  ( ph  <->  ( ps  ->  E. x ch ) )
Distinct variable group:    ps, x
Allowed substitution hints:    ph( x)    ch( x)

Proof of Theorem bnj132
StepHypRef Expression
1 bnj132.1 . 2  |-  ( ph  <->  E. x ( ps  ->  ch ) )
2 19.37v 1930 . 2  |-  ( E. x ( ps  ->  ch )  <->  ( ps  ->  E. x ch ) )
31, 2bitri 249 1  |-  ( ph  <->  ( ps  ->  E. x ch ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 184   E.wex 1587
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1592  ax-4 1603  ax-5 1671  ax-6 1710  ax-7 1730  ax-12 1794
This theorem depends on definitions:  df-bi 185  df-ex 1588  df-nf 1591
This theorem is referenced by:  bnj996  32303
  Copyright terms: Public domain W3C validator