Theorem nfneld 3133

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 3126	. 2 ⊢ (𝐴 ∉ 𝐵 ↔ ¬ 𝐴 ∈ 𝐵)
2		nfneld.1	. . . 4 ⊢ (𝜑 → Ⅎ𝑥𝐴)
3		nfneld.2	. . . 4 ⊢ (𝜑 → Ⅎ𝑥𝐵)
4	2, 3	nfeld 2991	. . 3 ⊢ (𝜑 → Ⅎ𝑥 𝐴 ∈ 𝐵)
5	4	nfnd 1858	. 2 ⊢ (𝜑 → Ⅎ𝑥 ¬ 𝐴 ∈ 𝐵)
6	1, 5	nfxfrd 1854	1 ⊢ (𝜑 → Ⅎ𝑥 𝐴 ∉ 𝐵)

Syntax hints:  ¬ wn 3   → wi 4  Ⅎwnf 1784   ∈ wcel 2114  Ⅎwnfc 2963   ∉ wnel 3125

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-ex 1781  df-nf 1785  df-cleq 2816  df-clel 2895  df-nfc 2965  df-nel 3126

This theorem is referenced by: (None)