HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem drex2 1155
Description: Formula-building lemma for use with the Distinctor Reduction Theorem. Part of Theorem 9.4 of [Megill] p. 448 (p. 16 of preprint).
Hypothesis
Ref Expression
drex2.1 |- (A.x x = y -> (ph <-> ps))
Assertion
Ref Expression
drex2 |- (A.x x = y -> (E.zph <-> E.zps))

Proof of Theorem drex2
StepHypRef Expression
1 hbae 1143 . 2 |- (A.x x = y -> A.zA.x x = y)
2 drex2.1 . 2 |- (A.x x = y -> (ph <-> ps))
31, 2exbid 1103 1 |- (A.x x = y -> (E.zph <-> E.zps))
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 146  A.wal 952   = wceq 954  E.wex 978
This theorem is referenced by:  dfid3 2831
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 960  ax-gen 961  ax-10 964  ax-12 966  ax-4 971  ax-5o 973  ax-10o 1138
This theorem depends on definitions:  df-bi 147  df-an 225  df-ex 979
Copyright terms: Public domain