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

Theorem drnf2 2330
Description: Formula-building lemma for use with the Distinctor Reduction Theorem. (Contributed by Mario Carneiro, 4-Oct-2016.) (Proof shortened by Wolf Lammen, 5-May-2018.)
Hypothesis
Ref Expression
dral1.1  |-  ( A. x  x  =  y  ->  ( ph  <->  ps )
)
Assertion
Ref Expression
drnf2  |-  ( A. x  x  =  y  ->  ( F/ z ph  <->  F/ z ps ) )

Proof of Theorem drnf2
StepHypRef Expression
1 nfae 2316 . 2  |-  F/ z A. x  x  =  y
2 dral1.1 . 2  |-  ( A. x  x  =  y  ->  ( ph  <->  ps )
)
31, 2nfbidf 2092 1  |-  ( A. x  x  =  y  ->  ( F/ z ph  <->  F/ z ps ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 196   A.wal 1481   F/wnf 1708
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-tru 1486  df-ex 1705  df-nf 1710
This theorem is referenced by:  nfsb4t  2389  drnfc2  2783
  Copyright terms: Public domain W3C validator