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

Theorem exsimpl 1597
Description: Simplification of an existentially quantified conjunction. (Contributed by Rodolfo Medina, 25-Sep-2010.) (Proof shortened by Andrew Salmon, 29-Jun-2011.)
Assertion
Ref Expression
exsimpl  |-  ( E. x ( ph  /\  ps )  ->  E. x ph )

Proof of Theorem exsimpl
StepHypRef Expression
1 simpl 108 . 2  |-  ( (
ph  /\  ps )  ->  ph )
21eximi 1580 1  |-  ( E. x ( ph  /\  ps )  ->  E. x ph )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103   E.wex 1469
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 1424  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-4 1488  ax-ial 1515
This theorem depends on definitions:  df-bi 116
This theorem is referenced by:  19.40  1611  euex  2030  moexexdc  2084  elex  2700  sbc5  2936  dmcoss  4816  fmptco  5594  brabvv  5825  brtpos2  6156
  Copyright terms: Public domain W3C validator