Theorem nfneld 2523

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

This proof depends on syntax axioms:  ¬ wn 3   → wi 4  Ⅎwnf 1513   ∈ wcel 2209  Ⅎwnfc 2379   ∉ wnel 2515

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-4 1563  ax-17 1579  ax-ial 1587  ax-i5r 1588  ax-ext 2220

This proof depends on definitions:  df-bi 117  df-tru 1405  df-fal 1408  df-nf 1514  df-cleq 2231  df-clel 2234  df-nfc 2381  df-nel 2516

This theorem is used by: (None)