Theorem nfned 3059

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 2956	. 2 ⊢ (𝐴 ≠ 𝐵 ↔ ¬ 𝐴 = 𝐵)
2		nfned.1	. . . 4 ⊢ (𝜑 → Ⅎ𝑥𝐴)
3		nfned.2	. . . 4 ⊢ (𝜑 → Ⅎ𝑥𝐵)
4	2, 3	nfeqd 2932	. . 3 ⊢ (𝜑 → Ⅎ𝑥 𝐴 = 𝐵)
5	4	nfnd 1890	. 2 ⊢ (𝜑 → Ⅎ𝑥 ¬ 𝐴 = 𝐵)
6	1, 5	nfxfrd 1886	1 ⊢ (𝜑 → Ⅎ𝑥 𝐴 ≠ 𝐵)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   = wceq 1569  Ⅎwnf 1815  Ⅎwnfc 2907   ≠ wne 2955

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-ex 1812  df-nf 1816  df-cleq 2752  df-nfc 2909  df-ne 2956

This theorem is used by: (None)