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

Theorem drex2 1908
Description: Formula-building lemma for use with the Distinctor Reduction Theorem. Part of Theorem 9.4 of [Megill] p. 448 (p. 16 of preprint). (Contributed by NM, 27-Feb-2005.)
Hypothesis
Ref Expression
dral1.1  |-  ( A. x  x  =  y  ->  ( ph  <->  ps )
)
Assertion
Ref Expression
drex2  |-  ( A. x  x  =  y  ->  ( E. z ph  <->  E. z ps ) )

Proof of Theorem drex2
StepHypRef Expression
1 hbae 1893 . 2  |-  ( A. x  x  =  y  ->  A. z A. x  x  =  y )
2 dral1.1 . 2  |-  ( A. x  x  =  y  ->  ( ph  <->  ps )
)
31, 2exbidh 1578 1  |-  ( A. x  x  =  y  ->  ( E. z ph  <->  E. z ps ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 176   A.wal 1527   E.wex 1528
This theorem is referenced by:  exdistrf  1911  dfid3  4310  dropab1  27650  dropab2  27651  e2ebind  28329
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1635  ax-8 1643  ax-6 1703  ax-7 1708  ax-11 1715  ax-12 1866
This theorem depends on definitions:  df-bi 177  df-an 360  df-ex 1529  df-nf 1532
  Copyright terms: Public domain W3C validator