Theorem nfcd 2917

Description: Deduce that a class 𝐴 does not have 𝑥 free in it. (Contributed by Mario Carneiro, 11-Aug-2016.)

Hypotheses

Ref	Expression
nfcd.1	⊢ Ⅎ𝑦𝜑
nfcd.2	⊢ (𝜑 → Ⅎ𝑥 𝑦 ∈ 𝐴)

Assertion

Ref	Expression
nfcd	⊢ (𝜑 → Ⅎ𝑥𝐴)

Distinct variable groups:   𝑥,𝑦   𝑦,𝐴

Allowed substitution hints:   𝜑(𝑥, 𝑦)   𝐴(𝑥)

Proof of Theorem nfcd

Step	Hyp	Ref	Expression
1		nfcd.1	. . 3 ⊢ Ⅎ𝑦𝜑
2		nfcd.2	. . 3 ⊢ (𝜑 → Ⅎ𝑥 𝑦 ∈ 𝐴)
3	1, 2	alrimi 2248	. 2 ⊢ (𝜑 → ∀𝑦Ⅎ𝑥 𝑦 ∈ 𝐴)
4		df-nfc 2911	. 2 ⊢ (Ⅎ𝑥𝐴 ↔ ∀𝑦Ⅎ𝑥 𝑦 ∈ 𝐴)
5	3, 4	sylibr 237	1 ⊢ (𝜑 → Ⅎ𝑥𝐴)

This proof depends on syntax axioms:   → wi 4  ∀wal 1567  Ⅎwnf 1812   ∈ wcel 2142  Ⅎwnfc 2909

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-12 2212

This proof depends on definitions:  df-bi 210  df-ex 1809  df-nf 1813  df-nfc 2911

This theorem is used by:  nfabdw  2945  nfabd  2946  dvelimdc  2948  nfcvf  2950  sbnfc2  4403