Theorem nfcd 2919

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 2250	. 2 ⊢ (𝜑 → ∀𝑦Ⅎ𝑥 𝑦 ∈ 𝐴)
4		df-nfc 2913	. 2 ⊢ (Ⅎ𝑥𝐴 ↔ ∀𝑦Ⅎ𝑥 𝑦 ∈ 𝐴)
5	3, 4	sylibr 236	1 ⊢ (𝜑 → Ⅎ𝑥𝐴)

Syntax hints:   → wi 4  ∀wal 1560  Ⅎwnf 1805   ∈ wcel 2144  Ⅎwnfc 2911

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1817  ax-4 1831  ax-5 1932  ax-6 1989  ax-7 2030  ax-12 2214

This theorem depends on definitions:  df-bi 209  df-ex 1802  df-nf 1806  df-nfc 2913

This theorem is referenced by:  nfabdw  2947  nfabd  2948  dvelimdc  2950  nfcvf  2952  sbnfc2  4395