Theorem nfcd 2926

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

Syntax hints:   → wi 4  ∀wal 1599  Ⅎwnf 1827   ∈ wcel 2107  Ⅎwnfc 2919

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1839  ax-4 1853  ax-5 1953  ax-6 2021  ax-7 2055  ax-12 2163

This theorem depends on definitions:  df-bi 199  df-ex 1824  df-nf 1828  df-nfc 2921

This theorem is referenced by:  nfabd  2954  nfabd2OLD  2956  dvelimdc  2958  nfcvf  2960  sbnfc2  4233