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

Theorem exsimpr 1549
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
exsimpr  |-  ( E. x ( ph  /\  ps )  ->  E. x ps )

Proof of Theorem exsimpr
StepHypRef Expression
1 simpr 108 . 2  |-  ( (
ph  /\  ps )  ->  ps )
21eximi 1531 1  |-  ( E. x ( ph  /\  ps )  ->  E. x ps )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 102   E.wex 1421
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-5 1376  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-4 1440  ax-ial 1467
This theorem depends on definitions:  df-bi 115
This theorem is referenced by:  onm  4156  imassrn  4699  fv3  5218  relelfvdm  5226  nfvres  5227  brtpos2  5889
  Copyright terms: Public domain W3C validator