Theorem nfcd 2250

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

Syntax hints:   → wi 4  ∀wal 1312  Ⅎwnf 1419   ∈ wcel 1463  Ⅎwnfc 2242

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-5 1406  ax-gen 1408  ax-4 1470

This theorem depends on definitions:  df-bi 116  df-nf 1420  df-nfc 2244

This theorem is referenced by:  nfabd  2274  dvelimdc  2275  sbnfc2  3026