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

Theorem drnf1 2021
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 2017 . . . 4  |-  ( A. x  x  =  y  ->  ( A. x ph  <->  A. y ps ) )
31, 2imbi12d 320 . . 3  |-  ( A. x  x  =  y  ->  ( ( ph  ->  A. x ph )  <->  ( ps  ->  A. y ps )
) )
43dral1 2017 . 2  |-  ( A. x  x  =  y  ->  ( A. x (
ph  ->  A. x ph )  <->  A. y ( ps  ->  A. y ps ) ) )
5 df-nf 1590 . 2  |-  ( F/ x ph  <->  A. x
( ph  ->  A. x ph ) )
6 df-nf 1590 . 2  |-  ( F/ y ps  <->  A. y
( ps  ->  A. y ps ) )
74, 5, 63bitr4g 288 1  |-  ( A. x  x  =  y  ->  ( F/ x ph  <->  F/ y ps ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 184   A.wal 1367   F/wnf 1589
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1591  ax-4 1602  ax-5 1670  ax-6 1708  ax-7 1728  ax-10 1775  ax-12 1792  ax-13 1943
This theorem depends on definitions:  df-bi 185  df-an 371  df-ex 1587  df-nf 1590
This theorem is referenced by:  nfald2  2023  drnfc1  2607  wl-nfs1t  28393
  Copyright terms: Public domain W3C validator