Theorem nfneld 3072

Description: Bound-variable hypothesis builder for negated membership. (Contributed by David Abernethy, 26-Jun-2011.) (Revised by Mario Carneiro, 7-Oct-2016.)

Hypotheses

Ref	Expression
nfneld.1	⊢ (𝜑 → Ⅎ𝑥𝐴)
nfneld.2	⊢ (𝜑 → Ⅎ𝑥𝐵)

Assertion

Ref	Expression
nfneld	⊢ (𝜑 → Ⅎ𝑥 𝐴 ∉ 𝐵)

Proof of Theorem nfneld

Step	Hyp	Ref	Expression
1		df-nel 3064	. 2 ⊢ (𝐴 ∉ 𝐵 ↔ ¬ 𝐴 ∈ 𝐵)
2		nfneld.1	. . . 4 ⊢ (𝜑 → Ⅎ𝑥𝐴)
3		nfneld.2	. . . 4 ⊢ (𝜑 → Ⅎ𝑥𝐵)
4	2, 3	nfeld 2935	. . 3 ⊢ (𝜑 → Ⅎ𝑥 𝐴 ∈ 𝐵)
5	4	nfnd 1887	. 2 ⊢ (𝜑 → Ⅎ𝑥 ¬ 𝐴 ∈ 𝐵)
6	1, 5	nfxfrd 1883	1 ⊢ (𝜑 → Ⅎ𝑥 𝐴 ∉ 𝐵)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4  Ⅎwnf 1812   ∈ wcel 2142  Ⅎwnfc 2909   ∉ wnel 3063

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-ex 1809  df-nf 1813  df-cleq 2754  df-clel 2837  df-nfc 2911  df-nel 3064

This theorem is used by: (None)