Theorem nfcr 2966

Description: Consequence of the not-free predicate. (Contributed by Mario Carneiro, 11-Aug-2016.)

Assertion

Ref	Expression
nfcr	⊢ (Ⅎ𝑥𝐴 → Ⅎ𝑥 𝑦 ∈ 𝐴)

Distinct variable groups:   𝑥,𝑦   𝑦,𝐴

Allowed substitution hint:   𝐴(𝑥)

Proof of Theorem nfcr

Step	Hyp	Ref	Expression
1		df-nfc 2963	. 2 ⊢ (Ⅎ𝑥𝐴 ↔ ∀𝑦Ⅎ𝑥 𝑦 ∈ 𝐴)
2		sp 2178	. 2 ⊢ (∀𝑦Ⅎ𝑥 𝑦 ∈ 𝐴 → Ⅎ𝑥 𝑦 ∈ 𝐴)
3	1, 2	sylbi 219	1 ⊢ (Ⅎ𝑥𝐴 → Ⅎ𝑥 𝑦 ∈ 𝐴)

Syntax hints:   → wi 4  ∀wal 1531  Ⅎwnf 1780   ∈ wcel 2110  Ⅎwnfc 2961

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-12 2173

This theorem depends on definitions:  df-bi 209  df-ex 1777  df-nfc 2963

This theorem is referenced by:  nfcriv  2967  nfcrd  2969  abidnf  3693  csbtt  3899  csbnestgfw  4370  csbnestgf  4375  wl-dfralf  34833