ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  nfned GIF version

Theorem nfned 2400
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 2307 . 2 (𝐴𝐵 ↔ ¬ 𝐴 = 𝐵)
2 nfned.1 . . . 4 (𝜑𝑥𝐴)
3 nfned.2 . . . 4 (𝜑𝑥𝐵)
42, 3nfeqd 2294 . . 3 (𝜑 → Ⅎ𝑥 𝐴 = 𝐵)
54nfnd 1635 . 2 (𝜑 → Ⅎ𝑥 ¬ 𝐴 = 𝐵)
61, 5nfxfrd 1451 1 (𝜑 → Ⅎ𝑥 𝐴𝐵)
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4   = wceq 1331  wnf 1436  wnfc 2266  wne 2306
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie2 1470  ax-4 1487  ax-17 1506  ax-ial 1514  ax-i5r 1515  ax-ext 2119
This theorem depends on definitions:  df-bi 116  df-tru 1334  df-fal 1337  df-nf 1437  df-cleq 2130  df-nfc 2268  df-ne 2307
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator