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

Theorem exsimpl 1670
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 1653 1  |-  ( E. x ( ph  /\  ps )  ->  E. x ph )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104   E.wex 1545
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-5 1500  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-4 1563  ax-ial 1587
This proof depends on definitions:  df-bi 117
This theorem is used by:  19.40  1684  euex  2116  moexexdc  2171  elex  2833  sbc5  3075  dmcoss  5052  fmptco  5874  brabvv  6134  brtpos2  6522  ringidval  14265
  Copyright terms: Public domain W3C validator