Theorem nfned 3035

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

Step	Hyp	Ref	Expression
1		df-ne 2934	. 2 ⊢ (𝐴 ≠ 𝐵 ↔ ¬ 𝐴 = 𝐵)
2		nfned.1	. . . 4 ⊢ (𝜑 → Ⅎ𝑥𝐴)
3		nfned.2	. . . 4 ⊢ (𝜑 → Ⅎ𝑥𝐵)
4	2, 3	nfeqd 2910	. . 3 ⊢ (𝜑 → Ⅎ𝑥 𝐴 = 𝐵)
5	4	nfnd 1860	. 2 ⊢ (𝜑 → Ⅎ𝑥 ¬ 𝐴 = 𝐵)
6	1, 5	nfxfrd 1856	1 ⊢ (𝜑 → Ⅎ𝑥 𝐴 ≠ 𝐵)

Syntax hints:  ¬ wn 3   → wi 4   = wceq 1542  Ⅎwnf 1785  Ⅎwnfc 2884   ≠ wne 2933

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-ex 1782  df-nf 1786  df-cleq 2729  df-nfc 2886  df-ne 2934

This theorem is referenced by: (None)