MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  reubiia Structured version   Unicode version

Theorem reubiia 3047
Description: Formula-building rule for restricted existential quantifier (inference rule). (Contributed by NM, 14-Nov-2004.)
Hypothesis
Ref Expression
reubiia.1  |-  ( x  e.  A  ->  ( ph 
<->  ps ) )
Assertion
Ref Expression
reubiia  |-  ( E! x  e.  A  ph  <->  E! x  e.  A  ps )

Proof of Theorem reubiia
StepHypRef Expression
1 reubiia.1 . . . 4  |-  ( x  e.  A  ->  ( ph 
<->  ps ) )
21pm5.32i 637 . . 3  |-  ( ( x  e.  A  /\  ph )  <->  ( x  e.  A  /\  ps )
)
32eubii 2300 . 2  |-  ( E! x ( x  e.  A  /\  ph )  <->  E! x ( x  e.  A  /\  ps )
)
4 df-reu 2821 . 2  |-  ( E! x  e.  A  ph  <->  E! x ( x  e.  A  /\  ph )
)
5 df-reu 2821 . 2  |-  ( E! x  e.  A  ps  <->  E! x ( x  e.  A  /\  ps )
)
63, 4, 53bitr4i 277 1  |-  ( E! x  e.  A  ph  <->  E! x  e.  A  ps )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 184    /\ wa 369    e. wcel 1767   E!weu 2275   E!wreu 2816
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1601  ax-4 1612  ax-5 1680  ax-6 1719  ax-7 1739  ax-12 1803
This theorem depends on definitions:  df-bi 185  df-an 371  df-tru 1382  df-ex 1597  df-nf 1600  df-eu 2279  df-reu 2821
This theorem is referenced by:  reubii  3048  riotaxfrd  6277
  Copyright terms: Public domain W3C validator