Users' Mathboxes Mathbox for Jonathan Ben-Naim < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  bnj1239 Structured version   Unicode version

Theorem bnj1239 29114
Description: First-order logic and set theory. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.)
Assertion
Ref Expression
bnj1239  |-  ( E. x  e.  A  ( ps  /\  ch )  ->  E. x  e.  A  ps )

Proof of Theorem bnj1239
StepHypRef Expression
1 simpl 444 . 2  |-  ( ( ps  /\  ch )  ->  ps )
21reximi 2805 1  |-  ( E. x  e.  A  ( ps  /\  ch )  ->  E. x  e.  A  ps )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 359   E.wrex 2698
This theorem is referenced by:  bnj1238  29115  bnj1299  29127  bnj66  29168
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1555  ax-5 1566
This theorem depends on definitions:  df-bi 178  df-an 361  df-ex 1551  df-ral 2702  df-rex 2703
  Copyright terms: Public domain W3C validator