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

Theorem drnf1 2329
Description: Formula-building lemma for use with the Distinctor Reduction Theorem. (Contributed by Mario Carneiro, 4-Oct-2016.)
Hypothesis
Ref Expression
dral1.1  |-  ( A. x  x  =  y  ->  ( ph  <->  ps )
)
Assertion
Ref Expression
drnf1  |-  ( A. x  x  =  y  ->  ( F/ x ph  <->  F/ y ps ) )

Proof of Theorem drnf1
StepHypRef Expression
1 dral1.1 . . . 4  |-  ( A. x  x  =  y  ->  ( ph  <->  ps )
)
21dral1 2325 . . . 4  |-  ( A. x  x  =  y  ->  ( A. x ph  <->  A. y ps ) )
31, 2imbi12d 334 . . 3  |-  ( A. x  x  =  y  ->  ( ( ph  ->  A. x ph )  <->  ( ps  ->  A. y ps )
) )
43dral1 2325 . 2  |-  ( A. x  x  =  y  ->  ( A. x (
ph  ->  A. x ph )  <->  A. y ( ps  ->  A. y ps ) ) )
5 nf5 2116 . 2  |-  ( F/ x ph  <->  A. x
( ph  ->  A. x ph ) )
6 nf5 2116 . 2  |-  ( F/ y ps  <->  A. y
( ps  ->  A. y ps ) )
74, 5, 63bitr4g 303 1  |-  ( A. x  x  =  y  ->  ( F/ x ph  <->  F/ y 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-12 2047  ax-13 2246
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-ex 1705  df-nf 1710
This theorem is referenced by:  nfald2  2331  drnfc1  2782  wl-nfs1t  33324
  Copyright terms: Public domain W3C validator