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

Theorem exbidh 1578
Description: Formula-building rule for existential quantifier (deduction form). (Contributed by NM, 5-Aug-1993.)
Hypotheses
Ref Expression
exbidh.1  |-  ( ph  ->  A. x ph )
exbidh.2  |-  ( ph  ->  ( ps  <->  ch )
)
Assertion
Ref Expression
exbidh  |-  ( ph  ->  ( E. x ps  <->  E. x ch ) )

Proof of Theorem exbidh
StepHypRef Expression
1 exbidh.1 . . 3  |-  ( ph  ->  A. x ph )
2 exbidh.2 . . 3  |-  ( ph  ->  ( ps  <->  ch )
)
31, 2alrimih 1430 . 2  |-  ( ph  ->  A. x ( ps  <->  ch ) )
4 exbi 1568 . 2  |-  ( A. x ( ps  <->  ch )  ->  ( E. x ps  <->  E. x ch ) )
53, 4syl 14 1  |-  ( ph  ->  ( E. x ps  <->  E. x ch ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 104   A.wal 1314   E.wex 1453
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-5 1408  ax-gen 1410  ax-ie1 1454  ax-ie2 1455  ax-4 1472  ax-ial 1499
This theorem depends on definitions:  df-bi 116
This theorem is referenced by:  exbid  1580  drex2  1695  drex1  1754  exbidv  1781  mobidh  2011
  Copyright terms: Public domain W3C validator