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

Theorem dral2-o 2235
Description: Formula-building lemma for use with the Distinctor Reduction Theorem. Part of Theorem 9.4 of [Megill] p. 448 (p. 16 of preprint). Version of dral2 2023 using ax-10o 2193. (Contributed by NM, 27-Feb-2005.) (Proof modification is discouraged.) (New usage is discouraged.)
Hypothesis
Ref Expression
dral2-o.1  |-  ( A. x  x  =  y  ->  ( ph  <->  ps )
)
Assertion
Ref Expression
dral2-o  |-  ( A. x  x  =  y  ->  ( A. z ph  <->  A. z ps ) )

Proof of Theorem dral2-o
StepHypRef Expression
1 hbae-o 2207 . 2  |-  ( A. x  x  =  y  ->  A. z A. x  x  =  y )
2 dral2-o.1 . 2  |-  ( A. x  x  =  y  ->  ( ph  <->  ps )
)
31, 2albidh 1597 1  |-  ( A. x  x  =  y  ->  ( A. z ph  <->  A. z ps ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 177   A.wal 1546
This theorem is referenced by:  ax11eq  2247  ax11el  2248  ax11indalem  2251  ax11inda2ALT  2252
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1552  ax-5 1563  ax-17 1623  ax-9 1662  ax-8 1683  ax-7 1745  ax-4 2189  ax-5o 2190  ax-6o 2191  ax-10o 2193  ax-12o 2196
This theorem depends on definitions:  df-bi 178  df-ex 1548
  Copyright terms: Public domain W3C validator