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

Theorem exsimpl 1617
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 109 . 2  |-  ( (
ph  /\  ps )  ->  ph )
21eximi 1600 1  |-  ( E. x ( ph  /\  ps )  ->  E. x ph )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104   E.wex 1492
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-5 1447  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-4 1510  ax-ial 1534
This theorem depends on definitions:  df-bi 117
This theorem is referenced by:  19.40  1631  euex  2056  moexexdc  2110  elex  2748  sbc5  2986  dmcoss  4896  fmptco  5682  brabvv  5920  brtpos2  6251
  Copyright terms: Public domain W3C validator