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

Theorem nfned 2735
 Description: Bound-variable hypothesis builder for inequality. (Contributed by NM, 10-Nov-2007.) (Revised by Mario Carneiro, 7-Oct-2016.)
Hypotheses
Ref Expression
nfned.1
nfned.2
Assertion
Ref Expression
nfned

Proof of Theorem nfned
StepHypRef Expression
1 df-ne 2600 . 2
2 nfned.1 . . . 4
3 nfned.2 . . . 4
42, 3nfeqd 2571 . . 3
54nfnd 1930 . 2
61, 5nfxfrd 1667 1
 Colors of variables: wff setvar class Syntax hints:   wn 3   wi 4   wceq 1405  wnf 1637  wnfc 2550   wne 2598 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1639  ax-4 1652  ax-5 1725  ax-6 1771  ax-7 1814  ax-10 1861  ax-11 1866  ax-12 1878  ax-ext 2380 This theorem depends on definitions:  df-bi 185  df-an 369  df-ex 1634  df-nf 1638  df-cleq 2394  df-nfc 2552  df-ne 2600 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator